1 // output.cc -- manage the output file for gold
3 // Copyright 2006, 2007, 2008, 2009, 2010, 2011 Free Software Foundation, Inc.
4 // Written by Ian Lance Taylor <iant@google.com>.
6 // This file is part of gold.
8 // This program is free software; you can redistribute it and/or modify
9 // it under the terms of the GNU General Public License as published by
10 // the Free Software Foundation; either version 3 of the License, or
11 // (at your option) any later version.
13 // This program is distributed in the hope that it will be useful,
14 // but WITHOUT ANY WARRANTY; without even the implied warranty of
15 // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 // GNU General Public License for more details.
18 // You should have received a copy of the GNU General Public License
19 // along with this program; if not, write to the Free Software
20 // Foundation, Inc., 51 Franklin Street - Fifth Floor, Boston,
21 // MA 02110-1301, USA.
33 #ifdef HAVE_SYS_MMAN_H
37 #include "libiberty.h"
39 #include "parameters.h"
44 #include "descriptors.h"
47 // For systems without mmap support.
49 # define mmap gold_mmap
50 # define munmap gold_munmap
51 # define mremap gold_mremap
53 # define MAP_FAILED (reinterpret_cast<void*>(-1))
62 # define MAP_PRIVATE 0
64 # ifndef MAP_ANONYMOUS
65 # define MAP_ANONYMOUS 0
72 # define ENOSYS EINVAL
76 gold_mmap(void *, size_t, int, int, int, off_t
)
83 gold_munmap(void *, size_t)
90 gold_mremap(void *, size_t, size_t, int)
98 #if defined(HAVE_MMAP) && !defined(HAVE_MREMAP)
99 # define mremap gold_mremap
100 extern "C" void *gold_mremap(void *, size_t, size_t, int);
103 // Some BSD systems still use MAP_ANON instead of MAP_ANONYMOUS
104 #ifndef MAP_ANONYMOUS
105 # define MAP_ANONYMOUS MAP_ANON
108 #ifndef MREMAP_MAYMOVE
109 # define MREMAP_MAYMOVE 1
112 #ifndef HAVE_POSIX_FALLOCATE
113 // A dummy, non general, version of posix_fallocate. Here we just set
114 // the file size and hope that there is enough disk space. FIXME: We
115 // could allocate disk space by walking block by block and writing a
116 // zero byte into each block.
118 posix_fallocate(int o
, off_t offset
, off_t len
)
120 return ftruncate(o
, offset
+ len
);
122 #endif // !defined(HAVE_POSIX_FALLOCATE)
124 // Mingw does not have S_ISLNK.
126 # define S_ISLNK(mode) 0
132 // Output_data variables.
134 bool Output_data::allocated_sizes_are_fixed
;
136 // Output_data methods.
138 Output_data::~Output_data()
142 // Return the default alignment for the target size.
145 Output_data::default_alignment()
147 return Output_data::default_alignment_for_size(
148 parameters
->target().get_size());
151 // Return the default alignment for a size--32 or 64.
154 Output_data::default_alignment_for_size(int size
)
164 // Output_section_header methods. This currently assumes that the
165 // segment and section lists are complete at construction time.
167 Output_section_headers::Output_section_headers(
168 const Layout
* layout
,
169 const Layout::Segment_list
* segment_list
,
170 const Layout::Section_list
* section_list
,
171 const Layout::Section_list
* unattached_section_list
,
172 const Stringpool
* secnamepool
,
173 const Output_section
* shstrtab_section
)
175 segment_list_(segment_list
),
176 section_list_(section_list
),
177 unattached_section_list_(unattached_section_list
),
178 secnamepool_(secnamepool
),
179 shstrtab_section_(shstrtab_section
)
183 // Compute the current data size.
186 Output_section_headers::do_size() const
188 // Count all the sections. Start with 1 for the null section.
190 if (!parameters
->options().relocatable())
192 for (Layout::Segment_list::const_iterator p
=
193 this->segment_list_
->begin();
194 p
!= this->segment_list_
->end();
196 if ((*p
)->type() == elfcpp::PT_LOAD
)
197 count
+= (*p
)->output_section_count();
201 for (Layout::Section_list::const_iterator p
=
202 this->section_list_
->begin();
203 p
!= this->section_list_
->end();
205 if (((*p
)->flags() & elfcpp::SHF_ALLOC
) != 0)
208 count
+= this->unattached_section_list_
->size();
210 const int size
= parameters
->target().get_size();
213 shdr_size
= elfcpp::Elf_sizes
<32>::shdr_size
;
215 shdr_size
= elfcpp::Elf_sizes
<64>::shdr_size
;
219 return count
* shdr_size
;
222 // Write out the section headers.
225 Output_section_headers::do_write(Output_file
* of
)
227 switch (parameters
->size_and_endianness())
229 #ifdef HAVE_TARGET_32_LITTLE
230 case Parameters::TARGET_32_LITTLE
:
231 this->do_sized_write
<32, false>(of
);
234 #ifdef HAVE_TARGET_32_BIG
235 case Parameters::TARGET_32_BIG
:
236 this->do_sized_write
<32, true>(of
);
239 #ifdef HAVE_TARGET_64_LITTLE
240 case Parameters::TARGET_64_LITTLE
:
241 this->do_sized_write
<64, false>(of
);
244 #ifdef HAVE_TARGET_64_BIG
245 case Parameters::TARGET_64_BIG
:
246 this->do_sized_write
<64, true>(of
);
254 template<int size
, bool big_endian
>
256 Output_section_headers::do_sized_write(Output_file
* of
)
258 off_t all_shdrs_size
= this->data_size();
259 unsigned char* view
= of
->get_output_view(this->offset(), all_shdrs_size
);
261 const int shdr_size
= elfcpp::Elf_sizes
<size
>::shdr_size
;
262 unsigned char* v
= view
;
265 typename
elfcpp::Shdr_write
<size
, big_endian
> oshdr(v
);
266 oshdr
.put_sh_name(0);
267 oshdr
.put_sh_type(elfcpp::SHT_NULL
);
268 oshdr
.put_sh_flags(0);
269 oshdr
.put_sh_addr(0);
270 oshdr
.put_sh_offset(0);
272 size_t section_count
= (this->data_size()
273 / elfcpp::Elf_sizes
<size
>::shdr_size
);
274 if (section_count
< elfcpp::SHN_LORESERVE
)
275 oshdr
.put_sh_size(0);
277 oshdr
.put_sh_size(section_count
);
279 unsigned int shstrndx
= this->shstrtab_section_
->out_shndx();
280 if (shstrndx
< elfcpp::SHN_LORESERVE
)
281 oshdr
.put_sh_link(0);
283 oshdr
.put_sh_link(shstrndx
);
285 size_t segment_count
= this->segment_list_
->size();
286 oshdr
.put_sh_info(segment_count
>= elfcpp::PN_XNUM
? segment_count
: 0);
288 oshdr
.put_sh_addralign(0);
289 oshdr
.put_sh_entsize(0);
294 unsigned int shndx
= 1;
295 if (!parameters
->options().relocatable())
297 for (Layout::Segment_list::const_iterator p
=
298 this->segment_list_
->begin();
299 p
!= this->segment_list_
->end();
301 v
= (*p
)->write_section_headers
<size
, big_endian
>(this->layout_
,
308 for (Layout::Section_list::const_iterator p
=
309 this->section_list_
->begin();
310 p
!= this->section_list_
->end();
313 // We do unallocated sections below, except that group
314 // sections have to come first.
315 if (((*p
)->flags() & elfcpp::SHF_ALLOC
) == 0
316 && (*p
)->type() != elfcpp::SHT_GROUP
)
318 gold_assert(shndx
== (*p
)->out_shndx());
319 elfcpp::Shdr_write
<size
, big_endian
> oshdr(v
);
320 (*p
)->write_header(this->layout_
, this->secnamepool_
, &oshdr
);
326 for (Layout::Section_list::const_iterator p
=
327 this->unattached_section_list_
->begin();
328 p
!= this->unattached_section_list_
->end();
331 // For a relocatable link, we did unallocated group sections
332 // above, since they have to come first.
333 if ((*p
)->type() == elfcpp::SHT_GROUP
334 && parameters
->options().relocatable())
336 gold_assert(shndx
== (*p
)->out_shndx());
337 elfcpp::Shdr_write
<size
, big_endian
> oshdr(v
);
338 (*p
)->write_header(this->layout_
, this->secnamepool_
, &oshdr
);
343 of
->write_output_view(this->offset(), all_shdrs_size
, view
);
346 // Output_segment_header methods.
348 Output_segment_headers::Output_segment_headers(
349 const Layout::Segment_list
& segment_list
)
350 : segment_list_(segment_list
)
352 this->set_current_data_size_for_child(this->do_size());
356 Output_segment_headers::do_write(Output_file
* of
)
358 switch (parameters
->size_and_endianness())
360 #ifdef HAVE_TARGET_32_LITTLE
361 case Parameters::TARGET_32_LITTLE
:
362 this->do_sized_write
<32, false>(of
);
365 #ifdef HAVE_TARGET_32_BIG
366 case Parameters::TARGET_32_BIG
:
367 this->do_sized_write
<32, true>(of
);
370 #ifdef HAVE_TARGET_64_LITTLE
371 case Parameters::TARGET_64_LITTLE
:
372 this->do_sized_write
<64, false>(of
);
375 #ifdef HAVE_TARGET_64_BIG
376 case Parameters::TARGET_64_BIG
:
377 this->do_sized_write
<64, true>(of
);
385 template<int size
, bool big_endian
>
387 Output_segment_headers::do_sized_write(Output_file
* of
)
389 const int phdr_size
= elfcpp::Elf_sizes
<size
>::phdr_size
;
390 off_t all_phdrs_size
= this->segment_list_
.size() * phdr_size
;
391 gold_assert(all_phdrs_size
== this->data_size());
392 unsigned char* view
= of
->get_output_view(this->offset(),
394 unsigned char* v
= view
;
395 for (Layout::Segment_list::const_iterator p
= this->segment_list_
.begin();
396 p
!= this->segment_list_
.end();
399 elfcpp::Phdr_write
<size
, big_endian
> ophdr(v
);
400 (*p
)->write_header(&ophdr
);
404 gold_assert(v
- view
== all_phdrs_size
);
406 of
->write_output_view(this->offset(), all_phdrs_size
, view
);
410 Output_segment_headers::do_size() const
412 const int size
= parameters
->target().get_size();
415 phdr_size
= elfcpp::Elf_sizes
<32>::phdr_size
;
417 phdr_size
= elfcpp::Elf_sizes
<64>::phdr_size
;
421 return this->segment_list_
.size() * phdr_size
;
424 // Output_file_header methods.
426 Output_file_header::Output_file_header(const Target
* target
,
427 const Symbol_table
* symtab
,
428 const Output_segment_headers
* osh
,
432 segment_header_(osh
),
433 section_header_(NULL
),
437 this->set_data_size(this->do_size());
440 // Set the section table information for a file header.
443 Output_file_header::set_section_info(const Output_section_headers
* shdrs
,
444 const Output_section
* shstrtab
)
446 this->section_header_
= shdrs
;
447 this->shstrtab_
= shstrtab
;
450 // Write out the file header.
453 Output_file_header::do_write(Output_file
* of
)
455 gold_assert(this->offset() == 0);
457 switch (parameters
->size_and_endianness())
459 #ifdef HAVE_TARGET_32_LITTLE
460 case Parameters::TARGET_32_LITTLE
:
461 this->do_sized_write
<32, false>(of
);
464 #ifdef HAVE_TARGET_32_BIG
465 case Parameters::TARGET_32_BIG
:
466 this->do_sized_write
<32, true>(of
);
469 #ifdef HAVE_TARGET_64_LITTLE
470 case Parameters::TARGET_64_LITTLE
:
471 this->do_sized_write
<64, false>(of
);
474 #ifdef HAVE_TARGET_64_BIG
475 case Parameters::TARGET_64_BIG
:
476 this->do_sized_write
<64, true>(of
);
484 // Write out the file header with appropriate size and endianess.
486 template<int size
, bool big_endian
>
488 Output_file_header::do_sized_write(Output_file
* of
)
490 gold_assert(this->offset() == 0);
492 int ehdr_size
= elfcpp::Elf_sizes
<size
>::ehdr_size
;
493 unsigned char* view
= of
->get_output_view(0, ehdr_size
);
494 elfcpp::Ehdr_write
<size
, big_endian
> oehdr(view
);
496 unsigned char e_ident
[elfcpp::EI_NIDENT
];
497 memset(e_ident
, 0, elfcpp::EI_NIDENT
);
498 e_ident
[elfcpp::EI_MAG0
] = elfcpp::ELFMAG0
;
499 e_ident
[elfcpp::EI_MAG1
] = elfcpp::ELFMAG1
;
500 e_ident
[elfcpp::EI_MAG2
] = elfcpp::ELFMAG2
;
501 e_ident
[elfcpp::EI_MAG3
] = elfcpp::ELFMAG3
;
503 e_ident
[elfcpp::EI_CLASS
] = elfcpp::ELFCLASS32
;
505 e_ident
[elfcpp::EI_CLASS
] = elfcpp::ELFCLASS64
;
508 e_ident
[elfcpp::EI_DATA
] = (big_endian
509 ? elfcpp::ELFDATA2MSB
510 : elfcpp::ELFDATA2LSB
);
511 e_ident
[elfcpp::EI_VERSION
] = elfcpp::EV_CURRENT
;
512 oehdr
.put_e_ident(e_ident
);
515 if (parameters
->options().relocatable())
516 e_type
= elfcpp::ET_REL
;
517 else if (parameters
->options().output_is_position_independent())
518 e_type
= elfcpp::ET_DYN
;
520 e_type
= elfcpp::ET_EXEC
;
521 oehdr
.put_e_type(e_type
);
523 oehdr
.put_e_machine(this->target_
->machine_code());
524 oehdr
.put_e_version(elfcpp::EV_CURRENT
);
526 oehdr
.put_e_entry(this->entry
<size
>());
528 if (this->segment_header_
== NULL
)
529 oehdr
.put_e_phoff(0);
531 oehdr
.put_e_phoff(this->segment_header_
->offset());
533 oehdr
.put_e_shoff(this->section_header_
->offset());
534 oehdr
.put_e_flags(this->target_
->processor_specific_flags());
535 oehdr
.put_e_ehsize(elfcpp::Elf_sizes
<size
>::ehdr_size
);
537 if (this->segment_header_
== NULL
)
539 oehdr
.put_e_phentsize(0);
540 oehdr
.put_e_phnum(0);
544 oehdr
.put_e_phentsize(elfcpp::Elf_sizes
<size
>::phdr_size
);
545 size_t phnum
= (this->segment_header_
->data_size()
546 / elfcpp::Elf_sizes
<size
>::phdr_size
);
547 if (phnum
> elfcpp::PN_XNUM
)
548 phnum
= elfcpp::PN_XNUM
;
549 oehdr
.put_e_phnum(phnum
);
552 oehdr
.put_e_shentsize(elfcpp::Elf_sizes
<size
>::shdr_size
);
553 size_t section_count
= (this->section_header_
->data_size()
554 / elfcpp::Elf_sizes
<size
>::shdr_size
);
556 if (section_count
< elfcpp::SHN_LORESERVE
)
557 oehdr
.put_e_shnum(this->section_header_
->data_size()
558 / elfcpp::Elf_sizes
<size
>::shdr_size
);
560 oehdr
.put_e_shnum(0);
562 unsigned int shstrndx
= this->shstrtab_
->out_shndx();
563 if (shstrndx
< elfcpp::SHN_LORESERVE
)
564 oehdr
.put_e_shstrndx(this->shstrtab_
->out_shndx());
566 oehdr
.put_e_shstrndx(elfcpp::SHN_XINDEX
);
568 // Let the target adjust the ELF header, e.g., to set EI_OSABI in
569 // the e_ident field.
570 parameters
->target().adjust_elf_header(view
, ehdr_size
);
572 of
->write_output_view(0, ehdr_size
, view
);
575 // Return the value to use for the entry address. THIS->ENTRY_ is the
576 // symbol specified on the command line, if any.
579 typename
elfcpp::Elf_types
<size
>::Elf_Addr
580 Output_file_header::entry()
582 const bool should_issue_warning
= (this->entry_
!= NULL
583 && !parameters
->options().relocatable()
584 && !parameters
->options().shared());
586 // FIXME: Need to support target specific entry symbol.
587 const char* entry
= this->entry_
;
591 Symbol
* sym
= this->symtab_
->lookup(entry
);
593 typename Sized_symbol
<size
>::Value_type v
;
596 Sized_symbol
<size
>* ssym
;
597 ssym
= this->symtab_
->get_sized_symbol
<size
>(sym
);
598 if (!ssym
->is_defined() && should_issue_warning
)
599 gold_warning("entry symbol '%s' exists but is not defined", entry
);
604 // We couldn't find the entry symbol. See if we can parse it as
605 // a number. This supports, e.g., -e 0x1000.
607 v
= strtoull(entry
, &endptr
, 0);
610 if (should_issue_warning
)
611 gold_warning("cannot find entry symbol '%s'", entry
);
619 // Compute the current data size.
622 Output_file_header::do_size() const
624 const int size
= parameters
->target().get_size();
626 return elfcpp::Elf_sizes
<32>::ehdr_size
;
628 return elfcpp::Elf_sizes
<64>::ehdr_size
;
633 // Output_data_const methods.
636 Output_data_const::do_write(Output_file
* of
)
638 of
->write(this->offset(), this->data_
.data(), this->data_
.size());
641 // Output_data_const_buffer methods.
644 Output_data_const_buffer::do_write(Output_file
* of
)
646 of
->write(this->offset(), this->p_
, this->data_size());
649 // Output_section_data methods.
651 // Record the output section, and set the entry size and such.
654 Output_section_data::set_output_section(Output_section
* os
)
656 gold_assert(this->output_section_
== NULL
);
657 this->output_section_
= os
;
658 this->do_adjust_output_section(os
);
661 // Return the section index of the output section.
664 Output_section_data::do_out_shndx() const
666 gold_assert(this->output_section_
!= NULL
);
667 return this->output_section_
->out_shndx();
670 // Set the alignment, which means we may need to update the alignment
671 // of the output section.
674 Output_section_data::set_addralign(uint64_t addralign
)
676 this->addralign_
= addralign
;
677 if (this->output_section_
!= NULL
678 && this->output_section_
->addralign() < addralign
)
679 this->output_section_
->set_addralign(addralign
);
682 // Output_data_strtab methods.
684 // Set the final data size.
687 Output_data_strtab::set_final_data_size()
689 this->strtab_
->set_string_offsets();
690 this->set_data_size(this->strtab_
->get_strtab_size());
693 // Write out a string table.
696 Output_data_strtab::do_write(Output_file
* of
)
698 this->strtab_
->write(of
, this->offset());
701 // Output_reloc methods.
703 // A reloc against a global symbol.
705 template<bool dynamic
, int size
, bool big_endian
>
706 Output_reloc
<elfcpp::SHT_REL
, dynamic
, size
, big_endian
>::Output_reloc(
713 : address_(address
), local_sym_index_(GSYM_CODE
), type_(type
),
714 is_relative_(is_relative
), is_symbolless_(is_symbolless
),
715 is_section_symbol_(false), shndx_(INVALID_CODE
)
717 // this->type_ is a bitfield; make sure TYPE fits.
718 gold_assert(this->type_
== type
);
719 this->u1_
.gsym
= gsym
;
722 this->set_needs_dynsym_index();
725 template<bool dynamic
, int size
, bool big_endian
>
726 Output_reloc
<elfcpp::SHT_REL
, dynamic
, size
, big_endian
>::Output_reloc(
729 Sized_relobj
<size
, big_endian
>* relobj
,
734 : address_(address
), local_sym_index_(GSYM_CODE
), type_(type
),
735 is_relative_(is_relative
), is_symbolless_(is_symbolless
),
736 is_section_symbol_(false), shndx_(shndx
)
738 gold_assert(shndx
!= INVALID_CODE
);
739 // this->type_ is a bitfield; make sure TYPE fits.
740 gold_assert(this->type_
== type
);
741 this->u1_
.gsym
= gsym
;
742 this->u2_
.relobj
= relobj
;
744 this->set_needs_dynsym_index();
747 // A reloc against a local symbol.
749 template<bool dynamic
, int size
, bool big_endian
>
750 Output_reloc
<elfcpp::SHT_REL
, dynamic
, size
, big_endian
>::Output_reloc(
751 Sized_relobj
<size
, big_endian
>* relobj
,
752 unsigned int local_sym_index
,
758 bool is_section_symbol
)
759 : address_(address
), local_sym_index_(local_sym_index
), type_(type
),
760 is_relative_(is_relative
), is_symbolless_(is_symbolless
),
761 is_section_symbol_(is_section_symbol
), shndx_(INVALID_CODE
)
763 gold_assert(local_sym_index
!= GSYM_CODE
764 && local_sym_index
!= INVALID_CODE
);
765 // this->type_ is a bitfield; make sure TYPE fits.
766 gold_assert(this->type_
== type
);
767 this->u1_
.relobj
= relobj
;
770 this->set_needs_dynsym_index();
773 template<bool dynamic
, int size
, bool big_endian
>
774 Output_reloc
<elfcpp::SHT_REL
, dynamic
, size
, big_endian
>::Output_reloc(
775 Sized_relobj
<size
, big_endian
>* relobj
,
776 unsigned int local_sym_index
,
782 bool is_section_symbol
)
783 : address_(address
), local_sym_index_(local_sym_index
), type_(type
),
784 is_relative_(is_relative
), is_symbolless_(is_symbolless
),
785 is_section_symbol_(is_section_symbol
), shndx_(shndx
)
787 gold_assert(local_sym_index
!= GSYM_CODE
788 && local_sym_index
!= INVALID_CODE
);
789 gold_assert(shndx
!= INVALID_CODE
);
790 // this->type_ is a bitfield; make sure TYPE fits.
791 gold_assert(this->type_
== type
);
792 this->u1_
.relobj
= relobj
;
793 this->u2_
.relobj
= relobj
;
795 this->set_needs_dynsym_index();
798 // A reloc against the STT_SECTION symbol of an output section.
800 template<bool dynamic
, int size
, bool big_endian
>
801 Output_reloc
<elfcpp::SHT_REL
, dynamic
, size
, big_endian
>::Output_reloc(
806 : address_(address
), local_sym_index_(SECTION_CODE
), type_(type
),
807 is_relative_(false), is_symbolless_(false),
808 is_section_symbol_(true), shndx_(INVALID_CODE
)
810 // this->type_ is a bitfield; make sure TYPE fits.
811 gold_assert(this->type_
== type
);
815 this->set_needs_dynsym_index();
817 os
->set_needs_symtab_index();
820 template<bool dynamic
, int size
, bool big_endian
>
821 Output_reloc
<elfcpp::SHT_REL
, dynamic
, size
, big_endian
>::Output_reloc(
824 Sized_relobj
<size
, big_endian
>* relobj
,
827 : address_(address
), local_sym_index_(SECTION_CODE
), type_(type
),
828 is_relative_(false), is_symbolless_(false),
829 is_section_symbol_(true), shndx_(shndx
)
831 gold_assert(shndx
!= INVALID_CODE
);
832 // this->type_ is a bitfield; make sure TYPE fits.
833 gold_assert(this->type_
== type
);
835 this->u2_
.relobj
= relobj
;
837 this->set_needs_dynsym_index();
839 os
->set_needs_symtab_index();
842 // An absolute relocation.
844 template<bool dynamic
, int size
, bool big_endian
>
845 Output_reloc
<elfcpp::SHT_REL
, dynamic
, size
, big_endian
>::Output_reloc(
849 : address_(address
), local_sym_index_(0), type_(type
),
850 is_relative_(false), is_symbolless_(false),
851 is_section_symbol_(false), shndx_(INVALID_CODE
)
853 // this->type_ is a bitfield; make sure TYPE fits.
854 gold_assert(this->type_
== type
);
855 this->u1_
.relobj
= NULL
;
859 template<bool dynamic
, int size
, bool big_endian
>
860 Output_reloc
<elfcpp::SHT_REL
, dynamic
, size
, big_endian
>::Output_reloc(
862 Sized_relobj
<size
, big_endian
>* relobj
,
865 : address_(address
), local_sym_index_(0), type_(type
),
866 is_relative_(false), is_symbolless_(false),
867 is_section_symbol_(false), shndx_(shndx
)
869 gold_assert(shndx
!= INVALID_CODE
);
870 // this->type_ is a bitfield; make sure TYPE fits.
871 gold_assert(this->type_
== type
);
872 this->u1_
.relobj
= NULL
;
873 this->u2_
.relobj
= relobj
;
876 // A target specific relocation.
878 template<bool dynamic
, int size
, bool big_endian
>
879 Output_reloc
<elfcpp::SHT_REL
, dynamic
, size
, big_endian
>::Output_reloc(
884 : address_(address
), local_sym_index_(TARGET_CODE
), type_(type
),
885 is_relative_(false), is_symbolless_(false),
886 is_section_symbol_(false), shndx_(INVALID_CODE
)
888 // this->type_ is a bitfield; make sure TYPE fits.
889 gold_assert(this->type_
== type
);
894 template<bool dynamic
, int size
, bool big_endian
>
895 Output_reloc
<elfcpp::SHT_REL
, dynamic
, size
, big_endian
>::Output_reloc(
898 Sized_relobj
<size
, big_endian
>* relobj
,
901 : address_(address
), local_sym_index_(TARGET_CODE
), type_(type
),
902 is_relative_(false), is_symbolless_(false),
903 is_section_symbol_(false), shndx_(shndx
)
905 gold_assert(shndx
!= INVALID_CODE
);
906 // this->type_ is a bitfield; make sure TYPE fits.
907 gold_assert(this->type_
== type
);
909 this->u2_
.relobj
= relobj
;
912 // Record that we need a dynamic symbol index for this relocation.
914 template<bool dynamic
, int size
, bool big_endian
>
916 Output_reloc
<elfcpp::SHT_REL
, dynamic
, size
, big_endian
>::
917 set_needs_dynsym_index()
919 if (this->is_symbolless_
)
921 switch (this->local_sym_index_
)
927 this->u1_
.gsym
->set_needs_dynsym_entry();
931 this->u1_
.os
->set_needs_dynsym_index();
935 // The target must take care of this if necessary.
943 const unsigned int lsi
= this->local_sym_index_
;
944 Sized_relobj_file
<size
, big_endian
>* relobj
=
945 this->u1_
.relobj
->sized_relobj();
946 gold_assert(relobj
!= NULL
);
947 if (!this->is_section_symbol_
)
948 relobj
->set_needs_output_dynsym_entry(lsi
);
950 relobj
->output_section(lsi
)->set_needs_dynsym_index();
956 // Get the symbol index of a relocation.
958 template<bool dynamic
, int size
, bool big_endian
>
960 Output_reloc
<elfcpp::SHT_REL
, dynamic
, size
, big_endian
>::get_symbol_index()
964 if (this->is_symbolless_
)
966 switch (this->local_sym_index_
)
972 if (this->u1_
.gsym
== NULL
)
975 index
= this->u1_
.gsym
->dynsym_index();
977 index
= this->u1_
.gsym
->symtab_index();
982 index
= this->u1_
.os
->dynsym_index();
984 index
= this->u1_
.os
->symtab_index();
988 index
= parameters
->target().reloc_symbol_index(this->u1_
.arg
,
993 // Relocations without symbols use a symbol index of 0.
999 const unsigned int lsi
= this->local_sym_index_
;
1000 Sized_relobj_file
<size
, big_endian
>* relobj
=
1001 this->u1_
.relobj
->sized_relobj();
1002 gold_assert(relobj
!= NULL
);
1003 if (!this->is_section_symbol_
)
1006 index
= relobj
->dynsym_index(lsi
);
1008 index
= relobj
->symtab_index(lsi
);
1012 Output_section
* os
= relobj
->output_section(lsi
);
1013 gold_assert(os
!= NULL
);
1015 index
= os
->dynsym_index();
1017 index
= os
->symtab_index();
1022 gold_assert(index
!= -1U);
1026 // For a local section symbol, get the address of the offset ADDEND
1027 // within the input section.
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
>::
1032 local_section_offset(Addend addend
) const
1034 gold_assert(this->local_sym_index_
!= GSYM_CODE
1035 && this->local_sym_index_
!= SECTION_CODE
1036 && this->local_sym_index_
!= TARGET_CODE
1037 && this->local_sym_index_
!= INVALID_CODE
1038 && this->local_sym_index_
!= 0
1039 && this->is_section_symbol_
);
1040 const unsigned int lsi
= this->local_sym_index_
;
1041 Output_section
* os
= this->u1_
.relobj
->output_section(lsi
);
1042 gold_assert(os
!= NULL
);
1043 Address offset
= this->u1_
.relobj
->get_output_section_offset(lsi
);
1044 if (offset
!= invalid_address
)
1045 return offset
+ addend
;
1046 // This is a merge section.
1047 Sized_relobj_file
<size
, big_endian
>* relobj
=
1048 this->u1_
.relobj
->sized_relobj();
1049 gold_assert(relobj
!= NULL
);
1050 offset
= os
->output_address(relobj
, lsi
, addend
);
1051 gold_assert(offset
!= invalid_address
);
1055 // Get the output address of a relocation.
1057 template<bool dynamic
, int size
, bool big_endian
>
1058 typename
elfcpp::Elf_types
<size
>::Elf_Addr
1059 Output_reloc
<elfcpp::SHT_REL
, dynamic
, size
, big_endian
>::get_address() const
1061 Address address
= this->address_
;
1062 if (this->shndx_
!= INVALID_CODE
)
1064 Output_section
* os
= this->u2_
.relobj
->output_section(this->shndx_
);
1065 gold_assert(os
!= NULL
);
1066 Address off
= this->u2_
.relobj
->get_output_section_offset(this->shndx_
);
1067 if (off
!= invalid_address
)
1068 address
+= os
->address() + off
;
1071 Sized_relobj_file
<size
, big_endian
>* relobj
=
1072 this->u2_
.relobj
->sized_relobj();
1073 gold_assert(relobj
!= NULL
);
1074 address
= os
->output_address(relobj
, this->shndx_
, address
);
1075 gold_assert(address
!= invalid_address
);
1078 else if (this->u2_
.od
!= NULL
)
1079 address
+= this->u2_
.od
->address();
1083 // Write out the offset and info fields of a Rel or Rela relocation
1086 template<bool dynamic
, int size
, bool big_endian
>
1087 template<typename Write_rel
>
1089 Output_reloc
<elfcpp::SHT_REL
, dynamic
, size
, big_endian
>::write_rel(
1090 Write_rel
* wr
) const
1092 wr
->put_r_offset(this->get_address());
1093 unsigned int sym_index
= this->get_symbol_index();
1094 wr
->put_r_info(elfcpp::elf_r_info
<size
>(sym_index
, this->type_
));
1097 // Write out a Rel relocation.
1099 template<bool dynamic
, int size
, bool big_endian
>
1101 Output_reloc
<elfcpp::SHT_REL
, dynamic
, size
, big_endian
>::write(
1102 unsigned char* pov
) const
1104 elfcpp::Rel_write
<size
, big_endian
> orel(pov
);
1105 this->write_rel(&orel
);
1108 // Get the value of the symbol referred to by a Rel relocation.
1110 template<bool dynamic
, int size
, bool big_endian
>
1111 typename
elfcpp::Elf_types
<size
>::Elf_Addr
1112 Output_reloc
<elfcpp::SHT_REL
, dynamic
, size
, big_endian
>::symbol_value(
1113 Addend addend
) const
1115 if (this->local_sym_index_
== GSYM_CODE
)
1117 const Sized_symbol
<size
>* sym
;
1118 sym
= static_cast<const Sized_symbol
<size
>*>(this->u1_
.gsym
);
1119 return sym
->value() + addend
;
1121 gold_assert(this->local_sym_index_
!= SECTION_CODE
1122 && this->local_sym_index_
!= TARGET_CODE
1123 && this->local_sym_index_
!= INVALID_CODE
1124 && this->local_sym_index_
!= 0
1125 && !this->is_section_symbol_
);
1126 const unsigned int lsi
= this->local_sym_index_
;
1127 Sized_relobj_file
<size
, big_endian
>* relobj
=
1128 this->u1_
.relobj
->sized_relobj();
1129 gold_assert(relobj
!= NULL
);
1130 const Symbol_value
<size
>* symval
= relobj
->local_symbol(lsi
);
1131 return symval
->value(relobj
, addend
);
1134 // Reloc comparison. This function sorts the dynamic relocs for the
1135 // benefit of the dynamic linker. First we sort all relative relocs
1136 // to the front. Among relative relocs, we sort by output address.
1137 // Among non-relative relocs, we sort by symbol index, then by output
1140 template<bool dynamic
, int size
, bool big_endian
>
1142 Output_reloc
<elfcpp::SHT_REL
, dynamic
, size
, big_endian
>::
1143 compare(const Output_reloc
<elfcpp::SHT_REL
, dynamic
, size
, big_endian
>& r2
)
1146 if (this->is_relative_
)
1148 if (!r2
.is_relative_
)
1150 // Otherwise sort by reloc address below.
1152 else if (r2
.is_relative_
)
1156 unsigned int sym1
= this->get_symbol_index();
1157 unsigned int sym2
= r2
.get_symbol_index();
1160 else if (sym1
> sym2
)
1162 // Otherwise sort by reloc address.
1165 section_offset_type addr1
= this->get_address();
1166 section_offset_type addr2
= r2
.get_address();
1169 else if (addr1
> addr2
)
1172 // Final tie breaker, in order to generate the same output on any
1173 // host: reloc type.
1174 unsigned int type1
= this->type_
;
1175 unsigned int type2
= r2
.type_
;
1178 else if (type1
> type2
)
1181 // These relocs appear to be exactly the same.
1185 // Write out a Rela relocation.
1187 template<bool dynamic
, int size
, bool big_endian
>
1189 Output_reloc
<elfcpp::SHT_RELA
, dynamic
, size
, big_endian
>::write(
1190 unsigned char* pov
) const
1192 elfcpp::Rela_write
<size
, big_endian
> orel(pov
);
1193 this->rel_
.write_rel(&orel
);
1194 Addend addend
= this->addend_
;
1195 if (this->rel_
.is_target_specific())
1196 addend
= parameters
->target().reloc_addend(this->rel_
.target_arg(),
1197 this->rel_
.type(), addend
);
1198 else if (this->rel_
.is_symbolless())
1199 addend
= this->rel_
.symbol_value(addend
);
1200 else if (this->rel_
.is_local_section_symbol())
1201 addend
= this->rel_
.local_section_offset(addend
);
1202 orel
.put_r_addend(addend
);
1205 // Output_data_reloc_base methods.
1207 // Adjust the output section.
1209 template<int sh_type
, bool dynamic
, int size
, bool big_endian
>
1211 Output_data_reloc_base
<sh_type
, dynamic
, size
, big_endian
>
1212 ::do_adjust_output_section(Output_section
* os
)
1214 if (sh_type
== elfcpp::SHT_REL
)
1215 os
->set_entsize(elfcpp::Elf_sizes
<size
>::rel_size
);
1216 else if (sh_type
== elfcpp::SHT_RELA
)
1217 os
->set_entsize(elfcpp::Elf_sizes
<size
>::rela_size
);
1221 // A STT_GNU_IFUNC symbol may require a IRELATIVE reloc when doing a
1222 // static link. The backends will generate a dynamic reloc section
1223 // to hold this. In that case we don't want to link to the dynsym
1224 // section, because there isn't one.
1226 os
->set_should_link_to_symtab();
1227 else if (parameters
->doing_static_link())
1230 os
->set_should_link_to_dynsym();
1233 // Write out relocation data.
1235 template<int sh_type
, bool dynamic
, int size
, bool big_endian
>
1237 Output_data_reloc_base
<sh_type
, dynamic
, size
, big_endian
>::do_write(
1240 const off_t off
= this->offset();
1241 const off_t oview_size
= this->data_size();
1242 unsigned char* const oview
= of
->get_output_view(off
, oview_size
);
1244 if (this->sort_relocs())
1246 gold_assert(dynamic
);
1247 std::sort(this->relocs_
.begin(), this->relocs_
.end(),
1248 Sort_relocs_comparison());
1251 unsigned char* pov
= oview
;
1252 for (typename
Relocs::const_iterator p
= this->relocs_
.begin();
1253 p
!= this->relocs_
.end();
1260 gold_assert(pov
- oview
== oview_size
);
1262 of
->write_output_view(off
, oview_size
, oview
);
1264 // We no longer need the relocation entries.
1265 this->relocs_
.clear();
1268 // Class Output_relocatable_relocs.
1270 template<int sh_type
, int size
, bool big_endian
>
1272 Output_relocatable_relocs
<sh_type
, size
, big_endian
>::set_final_data_size()
1274 this->set_data_size(this->rr_
->output_reloc_count()
1275 * Reloc_types
<sh_type
, size
, big_endian
>::reloc_size
);
1278 // class Output_data_group.
1280 template<int size
, bool big_endian
>
1281 Output_data_group
<size
, big_endian
>::Output_data_group(
1282 Sized_relobj_file
<size
, big_endian
>* relobj
,
1283 section_size_type entry_count
,
1284 elfcpp::Elf_Word flags
,
1285 std::vector
<unsigned int>* input_shndxes
)
1286 : Output_section_data(entry_count
* 4, 4, false),
1290 this->input_shndxes_
.swap(*input_shndxes
);
1293 // Write out the section group, which means translating the section
1294 // indexes to apply to the output file.
1296 template<int size
, bool big_endian
>
1298 Output_data_group
<size
, big_endian
>::do_write(Output_file
* of
)
1300 const off_t off
= this->offset();
1301 const section_size_type oview_size
=
1302 convert_to_section_size_type(this->data_size());
1303 unsigned char* const oview
= of
->get_output_view(off
, oview_size
);
1305 elfcpp::Elf_Word
* contents
= reinterpret_cast<elfcpp::Elf_Word
*>(oview
);
1306 elfcpp::Swap
<32, big_endian
>::writeval(contents
, this->flags_
);
1309 for (std::vector
<unsigned int>::const_iterator p
=
1310 this->input_shndxes_
.begin();
1311 p
!= this->input_shndxes_
.end();
1314 Output_section
* os
= this->relobj_
->output_section(*p
);
1316 unsigned int output_shndx
;
1318 output_shndx
= os
->out_shndx();
1321 this->relobj_
->error(_("section group retained but "
1322 "group element discarded"));
1326 elfcpp::Swap
<32, big_endian
>::writeval(contents
, output_shndx
);
1329 size_t wrote
= reinterpret_cast<unsigned char*>(contents
) - oview
;
1330 gold_assert(wrote
== oview_size
);
1332 of
->write_output_view(off
, oview_size
, oview
);
1334 // We no longer need this information.
1335 this->input_shndxes_
.clear();
1338 // Output_data_got::Got_entry methods.
1340 // Write out the entry.
1342 template<int size
, bool big_endian
>
1344 Output_data_got
<size
, big_endian
>::Got_entry::write(unsigned char* pov
) const
1348 switch (this->local_sym_index_
)
1352 // If the symbol is resolved locally, we need to write out the
1353 // link-time value, which will be relocated dynamically by a
1354 // RELATIVE relocation.
1355 Symbol
* gsym
= this->u_
.gsym
;
1356 if (this->use_plt_offset_
&& gsym
->has_plt_offset())
1357 val
= (parameters
->target().plt_section_for_global(gsym
)->address()
1358 + gsym
->plt_offset());
1361 Sized_symbol
<size
>* sgsym
;
1362 // This cast is a bit ugly. We don't want to put a
1363 // virtual method in Symbol, because we want Symbol to be
1364 // as small as possible.
1365 sgsym
= static_cast<Sized_symbol
<size
>*>(gsym
);
1366 val
= sgsym
->value();
1372 val
= this->u_
.constant
;
1376 // If we're doing an incremental update, don't touch this GOT entry.
1377 if (parameters
->incremental_update())
1379 val
= this->u_
.constant
;
1384 const Sized_relobj_file
<size
, big_endian
>* object
= this->u_
.object
;
1385 const unsigned int lsi
= this->local_sym_index_
;
1386 const Symbol_value
<size
>* symval
= object
->local_symbol(lsi
);
1387 if (!this->use_plt_offset_
)
1388 val
= symval
->value(this->u_
.object
, 0);
1391 const Output_data
* plt
=
1392 parameters
->target().plt_section_for_local(object
, lsi
);
1393 val
= plt
->address() + object
->local_plt_offset(lsi
);
1399 elfcpp::Swap
<size
, big_endian
>::writeval(pov
, val
);
1402 // Output_data_got methods.
1404 // Add an entry for a global symbol to the GOT. This returns true if
1405 // this is a new GOT entry, false if the symbol already had a GOT
1408 template<int size
, bool big_endian
>
1410 Output_data_got
<size
, big_endian
>::add_global(
1412 unsigned int got_type
)
1414 if (gsym
->has_got_offset(got_type
))
1417 unsigned int got_offset
= this->add_got_entry(Got_entry(gsym
, false));
1418 gsym
->set_got_offset(got_type
, got_offset
);
1422 // Like add_global, but use the PLT offset.
1424 template<int size
, bool big_endian
>
1426 Output_data_got
<size
, big_endian
>::add_global_plt(Symbol
* gsym
,
1427 unsigned int got_type
)
1429 if (gsym
->has_got_offset(got_type
))
1432 unsigned int got_offset
= this->add_got_entry(Got_entry(gsym
, true));
1433 gsym
->set_got_offset(got_type
, got_offset
);
1437 // Add an entry for a global symbol to the GOT, and add a dynamic
1438 // relocation of type R_TYPE for the GOT entry.
1440 template<int size
, bool big_endian
>
1442 Output_data_got
<size
, big_endian
>::add_global_with_rel(
1444 unsigned int got_type
,
1446 unsigned int r_type
)
1448 if (gsym
->has_got_offset(got_type
))
1451 unsigned int got_offset
= this->add_got_entry(Got_entry());
1452 gsym
->set_got_offset(got_type
, got_offset
);
1453 rel_dyn
->add_global(gsym
, r_type
, this, got_offset
);
1456 template<int size
, bool big_endian
>
1458 Output_data_got
<size
, big_endian
>::add_global_with_rela(
1460 unsigned int got_type
,
1462 unsigned int r_type
)
1464 if (gsym
->has_got_offset(got_type
))
1467 unsigned int got_offset
= this->add_got_entry(Got_entry());
1468 gsym
->set_got_offset(got_type
, got_offset
);
1469 rela_dyn
->add_global(gsym
, r_type
, this, got_offset
, 0);
1472 // Add a pair of entries for a global symbol to the GOT, and add
1473 // dynamic relocations of type R_TYPE_1 and R_TYPE_2, respectively.
1474 // If R_TYPE_2 == 0, add the second entry with no relocation.
1475 template<int size
, bool big_endian
>
1477 Output_data_got
<size
, big_endian
>::add_global_pair_with_rel(
1479 unsigned int got_type
,
1481 unsigned int r_type_1
,
1482 unsigned int r_type_2
)
1484 if (gsym
->has_got_offset(got_type
))
1487 unsigned int got_offset
= this->add_got_entry_pair(Got_entry(), Got_entry());
1488 gsym
->set_got_offset(got_type
, got_offset
);
1489 rel_dyn
->add_global(gsym
, r_type_1
, this, got_offset
);
1492 rel_dyn
->add_global(gsym
, r_type_2
, this, got_offset
+ size
/ 8);
1495 template<int size
, bool big_endian
>
1497 Output_data_got
<size
, big_endian
>::add_global_pair_with_rela(
1499 unsigned int got_type
,
1501 unsigned int r_type_1
,
1502 unsigned int r_type_2
)
1504 if (gsym
->has_got_offset(got_type
))
1507 unsigned int got_offset
= this->add_got_entry_pair(Got_entry(), Got_entry());
1508 gsym
->set_got_offset(got_type
, got_offset
);
1509 rela_dyn
->add_global(gsym
, r_type_1
, this, got_offset
, 0);
1512 rela_dyn
->add_global(gsym
, r_type_2
, this, got_offset
+ size
/ 8, 0);
1515 // Add an entry for a local symbol to the GOT. This returns true if
1516 // this is a new GOT entry, false if the symbol already has a GOT
1519 template<int size
, bool big_endian
>
1521 Output_data_got
<size
, big_endian
>::add_local(
1522 Sized_relobj_file
<size
, big_endian
>* object
,
1523 unsigned int symndx
,
1524 unsigned int got_type
)
1526 if (object
->local_has_got_offset(symndx
, got_type
))
1529 unsigned int got_offset
= this->add_got_entry(Got_entry(object
, symndx
,
1531 object
->set_local_got_offset(symndx
, got_type
, got_offset
);
1535 // Like add_local, but use the PLT offset.
1537 template<int size
, bool big_endian
>
1539 Output_data_got
<size
, big_endian
>::add_local_plt(
1540 Sized_relobj_file
<size
, big_endian
>* object
,
1541 unsigned int symndx
,
1542 unsigned int got_type
)
1544 if (object
->local_has_got_offset(symndx
, got_type
))
1547 unsigned int got_offset
= this->add_got_entry(Got_entry(object
, symndx
,
1549 object
->set_local_got_offset(symndx
, got_type
, got_offset
);
1553 // Add an entry for a local symbol to the GOT, and add a dynamic
1554 // relocation of type R_TYPE for the GOT entry.
1556 template<int size
, bool big_endian
>
1558 Output_data_got
<size
, big_endian
>::add_local_with_rel(
1559 Sized_relobj_file
<size
, big_endian
>* object
,
1560 unsigned int symndx
,
1561 unsigned int got_type
,
1563 unsigned int r_type
)
1565 if (object
->local_has_got_offset(symndx
, got_type
))
1568 unsigned int got_offset
= this->add_got_entry(Got_entry());
1569 object
->set_local_got_offset(symndx
, got_type
, got_offset
);
1570 rel_dyn
->add_local(object
, symndx
, r_type
, this, got_offset
);
1573 template<int size
, bool big_endian
>
1575 Output_data_got
<size
, big_endian
>::add_local_with_rela(
1576 Sized_relobj_file
<size
, big_endian
>* object
,
1577 unsigned int symndx
,
1578 unsigned int got_type
,
1580 unsigned int r_type
)
1582 if (object
->local_has_got_offset(symndx
, got_type
))
1585 unsigned int got_offset
= this->add_got_entry(Got_entry());
1586 object
->set_local_got_offset(symndx
, got_type
, got_offset
);
1587 rela_dyn
->add_local(object
, symndx
, r_type
, this, got_offset
, 0);
1590 // Add a pair of entries for a local symbol to the GOT, and add
1591 // dynamic relocations of type R_TYPE_1 and R_TYPE_2, respectively.
1592 // If R_TYPE_2 == 0, add the second entry with no relocation.
1593 template<int size
, bool big_endian
>
1595 Output_data_got
<size
, big_endian
>::add_local_pair_with_rel(
1596 Sized_relobj_file
<size
, big_endian
>* object
,
1597 unsigned int symndx
,
1599 unsigned int got_type
,
1601 unsigned int r_type_1
,
1602 unsigned int r_type_2
)
1604 if (object
->local_has_got_offset(symndx
, got_type
))
1607 unsigned int got_offset
=
1608 this->add_got_entry_pair(Got_entry(),
1609 Got_entry(object
, symndx
, false));
1610 object
->set_local_got_offset(symndx
, got_type
, got_offset
);
1611 Output_section
* os
= object
->output_section(shndx
);
1612 rel_dyn
->add_output_section(os
, r_type_1
, this, got_offset
);
1615 rel_dyn
->add_output_section(os
, r_type_2
, this, got_offset
+ size
/ 8);
1618 template<int size
, bool big_endian
>
1620 Output_data_got
<size
, big_endian
>::add_local_pair_with_rela(
1621 Sized_relobj_file
<size
, big_endian
>* object
,
1622 unsigned int symndx
,
1624 unsigned int got_type
,
1626 unsigned int r_type_1
,
1627 unsigned int r_type_2
)
1629 if (object
->local_has_got_offset(symndx
, got_type
))
1632 unsigned int got_offset
=
1633 this->add_got_entry_pair(Got_entry(),
1634 Got_entry(object
, symndx
, false));
1635 object
->set_local_got_offset(symndx
, got_type
, got_offset
);
1636 Output_section
* os
= object
->output_section(shndx
);
1637 rela_dyn
->add_output_section(os
, r_type_1
, this, got_offset
, 0);
1640 rela_dyn
->add_output_section(os
, r_type_2
, this, got_offset
+ size
/ 8, 0);
1643 // Reserve a slot in the GOT for a local symbol or the second slot of a pair.
1645 template<int size
, bool big_endian
>
1647 Output_data_got
<size
, big_endian
>::reserve_local(
1649 Sized_relobj
<size
, big_endian
>* object
,
1650 unsigned int sym_index
,
1651 unsigned int got_type
)
1653 this->reserve_slot(i
);
1654 object
->set_local_got_offset(sym_index
, got_type
, this->got_offset(i
));
1657 // Reserve a slot in the GOT for a global symbol.
1659 template<int size
, bool big_endian
>
1661 Output_data_got
<size
, big_endian
>::reserve_global(
1664 unsigned int got_type
)
1666 this->reserve_slot(i
);
1667 gsym
->set_got_offset(got_type
, this->got_offset(i
));
1670 // Write out the GOT.
1672 template<int size
, bool big_endian
>
1674 Output_data_got
<size
, big_endian
>::do_write(Output_file
* of
)
1676 const int add
= size
/ 8;
1678 const off_t off
= this->offset();
1679 const off_t oview_size
= this->data_size();
1680 unsigned char* const oview
= of
->get_output_view(off
, oview_size
);
1682 unsigned char* pov
= oview
;
1683 for (typename
Got_entries::const_iterator p
= this->entries_
.begin();
1684 p
!= this->entries_
.end();
1691 gold_assert(pov
- oview
== oview_size
);
1693 of
->write_output_view(off
, oview_size
, oview
);
1695 // We no longer need the GOT entries.
1696 this->entries_
.clear();
1699 // Create a new GOT entry and return its offset.
1701 template<int size
, bool big_endian
>
1703 Output_data_got
<size
, big_endian
>::add_got_entry(Got_entry got_entry
)
1705 if (!this->is_data_size_valid())
1707 this->entries_
.push_back(got_entry
);
1708 this->set_got_size();
1709 return this->last_got_offset();
1713 // For an incremental update, find an available slot.
1714 off_t got_offset
= this->free_list_
.allocate(size
/ 8, size
/ 8, 0);
1715 if (got_offset
== -1)
1716 gold_fatal(_("out of patch space (GOT);"
1717 " relink with --incremental-full"));
1718 unsigned int got_index
= got_offset
/ (size
/ 8);
1719 gold_assert(got_index
< this->entries_
.size());
1720 this->entries_
[got_index
] = got_entry
;
1721 return static_cast<unsigned int>(got_offset
);
1725 // Create a pair of new GOT entries and return the offset of the first.
1727 template<int size
, bool big_endian
>
1729 Output_data_got
<size
, big_endian
>::add_got_entry_pair(Got_entry got_entry_1
,
1730 Got_entry got_entry_2
)
1732 if (!this->is_data_size_valid())
1734 unsigned int got_offset
;
1735 this->entries_
.push_back(got_entry_1
);
1736 got_offset
= this->last_got_offset();
1737 this->entries_
.push_back(got_entry_2
);
1738 this->set_got_size();
1743 // For an incremental update, find an available pair of slots.
1744 off_t got_offset
= this->free_list_
.allocate(2 * size
/ 8, size
/ 8, 0);
1745 if (got_offset
== -1)
1746 gold_fatal(_("out of patch space (GOT);"
1747 " relink with --incremental-full"));
1748 unsigned int got_index
= got_offset
/ (size
/ 8);
1749 gold_assert(got_index
< this->entries_
.size());
1750 this->entries_
[got_index
] = got_entry_1
;
1751 this->entries_
[got_index
+ 1] = got_entry_2
;
1752 return static_cast<unsigned int>(got_offset
);
1756 // Output_data_dynamic::Dynamic_entry methods.
1758 // Write out the entry.
1760 template<int size
, bool big_endian
>
1762 Output_data_dynamic::Dynamic_entry::write(
1764 const Stringpool
* pool
) const
1766 typename
elfcpp::Elf_types
<size
>::Elf_WXword val
;
1767 switch (this->offset_
)
1769 case DYNAMIC_NUMBER
:
1773 case DYNAMIC_SECTION_SIZE
:
1774 val
= this->u_
.od
->data_size();
1775 if (this->od2
!= NULL
)
1776 val
+= this->od2
->data_size();
1779 case DYNAMIC_SYMBOL
:
1781 const Sized_symbol
<size
>* s
=
1782 static_cast<const Sized_symbol
<size
>*>(this->u_
.sym
);
1787 case DYNAMIC_STRING
:
1788 val
= pool
->get_offset(this->u_
.str
);
1792 val
= this->u_
.od
->address() + this->offset_
;
1796 elfcpp::Dyn_write
<size
, big_endian
> dw(pov
);
1797 dw
.put_d_tag(this->tag_
);
1801 // Output_data_dynamic methods.
1803 // Adjust the output section to set the entry size.
1806 Output_data_dynamic::do_adjust_output_section(Output_section
* os
)
1808 if (parameters
->target().get_size() == 32)
1809 os
->set_entsize(elfcpp::Elf_sizes
<32>::dyn_size
);
1810 else if (parameters
->target().get_size() == 64)
1811 os
->set_entsize(elfcpp::Elf_sizes
<64>::dyn_size
);
1816 // Set the final data size.
1819 Output_data_dynamic::set_final_data_size()
1821 // Add the terminating entry if it hasn't been added.
1822 // Because of relaxation, we can run this multiple times.
1823 if (this->entries_
.empty() || this->entries_
.back().tag() != elfcpp::DT_NULL
)
1825 int extra
= parameters
->options().spare_dynamic_tags();
1826 for (int i
= 0; i
< extra
; ++i
)
1827 this->add_constant(elfcpp::DT_NULL
, 0);
1828 this->add_constant(elfcpp::DT_NULL
, 0);
1832 if (parameters
->target().get_size() == 32)
1833 dyn_size
= elfcpp::Elf_sizes
<32>::dyn_size
;
1834 else if (parameters
->target().get_size() == 64)
1835 dyn_size
= elfcpp::Elf_sizes
<64>::dyn_size
;
1838 this->set_data_size(this->entries_
.size() * dyn_size
);
1841 // Write out the dynamic entries.
1844 Output_data_dynamic::do_write(Output_file
* of
)
1846 switch (parameters
->size_and_endianness())
1848 #ifdef HAVE_TARGET_32_LITTLE
1849 case Parameters::TARGET_32_LITTLE
:
1850 this->sized_write
<32, false>(of
);
1853 #ifdef HAVE_TARGET_32_BIG
1854 case Parameters::TARGET_32_BIG
:
1855 this->sized_write
<32, true>(of
);
1858 #ifdef HAVE_TARGET_64_LITTLE
1859 case Parameters::TARGET_64_LITTLE
:
1860 this->sized_write
<64, false>(of
);
1863 #ifdef HAVE_TARGET_64_BIG
1864 case Parameters::TARGET_64_BIG
:
1865 this->sized_write
<64, true>(of
);
1873 template<int size
, bool big_endian
>
1875 Output_data_dynamic::sized_write(Output_file
* of
)
1877 const int dyn_size
= elfcpp::Elf_sizes
<size
>::dyn_size
;
1879 const off_t offset
= this->offset();
1880 const off_t oview_size
= this->data_size();
1881 unsigned char* const oview
= of
->get_output_view(offset
, oview_size
);
1883 unsigned char* pov
= oview
;
1884 for (typename
Dynamic_entries::const_iterator p
= this->entries_
.begin();
1885 p
!= this->entries_
.end();
1888 p
->write
<size
, big_endian
>(pov
, this->pool_
);
1892 gold_assert(pov
- oview
== oview_size
);
1894 of
->write_output_view(offset
, oview_size
, oview
);
1896 // We no longer need the dynamic entries.
1897 this->entries_
.clear();
1900 // Class Output_symtab_xindex.
1903 Output_symtab_xindex::do_write(Output_file
* of
)
1905 const off_t offset
= this->offset();
1906 const off_t oview_size
= this->data_size();
1907 unsigned char* const oview
= of
->get_output_view(offset
, oview_size
);
1909 memset(oview
, 0, oview_size
);
1911 if (parameters
->target().is_big_endian())
1912 this->endian_do_write
<true>(oview
);
1914 this->endian_do_write
<false>(oview
);
1916 of
->write_output_view(offset
, oview_size
, oview
);
1918 // We no longer need the data.
1919 this->entries_
.clear();
1922 template<bool big_endian
>
1924 Output_symtab_xindex::endian_do_write(unsigned char* const oview
)
1926 for (Xindex_entries::const_iterator p
= this->entries_
.begin();
1927 p
!= this->entries_
.end();
1930 unsigned int symndx
= p
->first
;
1931 gold_assert(symndx
* 4 < this->data_size());
1932 elfcpp::Swap
<32, big_endian
>::writeval(oview
+ symndx
* 4, p
->second
);
1936 // Output_section::Input_section methods.
1938 // Return the current data size. For an input section we store the size here.
1939 // For an Output_section_data, we have to ask it for the size.
1942 Output_section::Input_section::current_data_size() const
1944 if (this->is_input_section())
1945 return this->u1_
.data_size
;
1948 this->u2_
.posd
->pre_finalize_data_size();
1949 return this->u2_
.posd
->current_data_size();
1953 // Return the data size. For an input section we store the size here.
1954 // For an Output_section_data, we have to ask it for the size.
1957 Output_section::Input_section::data_size() const
1959 if (this->is_input_section())
1960 return this->u1_
.data_size
;
1962 return this->u2_
.posd
->data_size();
1965 // Return the object for an input section.
1968 Output_section::Input_section::relobj() const
1970 if (this->is_input_section())
1971 return this->u2_
.object
;
1972 else if (this->is_merge_section())
1974 gold_assert(this->u2_
.pomb
->first_relobj() != NULL
);
1975 return this->u2_
.pomb
->first_relobj();
1977 else if (this->is_relaxed_input_section())
1978 return this->u2_
.poris
->relobj();
1983 // Return the input section index for an input section.
1986 Output_section::Input_section::shndx() const
1988 if (this->is_input_section())
1989 return this->shndx_
;
1990 else if (this->is_merge_section())
1992 gold_assert(this->u2_
.pomb
->first_relobj() != NULL
);
1993 return this->u2_
.pomb
->first_shndx();
1995 else if (this->is_relaxed_input_section())
1996 return this->u2_
.poris
->shndx();
2001 // Set the address and file offset.
2004 Output_section::Input_section::set_address_and_file_offset(
2007 off_t section_file_offset
)
2009 if (this->is_input_section())
2010 this->u2_
.object
->set_section_offset(this->shndx_
,
2011 file_offset
- section_file_offset
);
2013 this->u2_
.posd
->set_address_and_file_offset(address
, file_offset
);
2016 // Reset the address and file offset.
2019 Output_section::Input_section::reset_address_and_file_offset()
2021 if (!this->is_input_section())
2022 this->u2_
.posd
->reset_address_and_file_offset();
2025 // Finalize the data size.
2028 Output_section::Input_section::finalize_data_size()
2030 if (!this->is_input_section())
2031 this->u2_
.posd
->finalize_data_size();
2034 // Try to turn an input offset into an output offset. We want to
2035 // return the output offset relative to the start of this
2036 // Input_section in the output section.
2039 Output_section::Input_section::output_offset(
2040 const Relobj
* object
,
2042 section_offset_type offset
,
2043 section_offset_type
* poutput
) const
2045 if (!this->is_input_section())
2046 return this->u2_
.posd
->output_offset(object
, shndx
, offset
, poutput
);
2049 if (this->shndx_
!= shndx
|| this->u2_
.object
!= object
)
2056 // Return whether this is the merge section for the input section
2060 Output_section::Input_section::is_merge_section_for(const Relobj
* object
,
2061 unsigned int shndx
) const
2063 if (this->is_input_section())
2065 return this->u2_
.posd
->is_merge_section_for(object
, shndx
);
2068 // Write out the data. We don't have to do anything for an input
2069 // section--they are handled via Object::relocate--but this is where
2070 // we write out the data for an Output_section_data.
2073 Output_section::Input_section::write(Output_file
* of
)
2075 if (!this->is_input_section())
2076 this->u2_
.posd
->write(of
);
2079 // Write the data to a buffer. As for write(), we don't have to do
2080 // anything for an input section.
2083 Output_section::Input_section::write_to_buffer(unsigned char* buffer
)
2085 if (!this->is_input_section())
2086 this->u2_
.posd
->write_to_buffer(buffer
);
2089 // Print to a map file.
2092 Output_section::Input_section::print_to_mapfile(Mapfile
* mapfile
) const
2094 switch (this->shndx_
)
2096 case OUTPUT_SECTION_CODE
:
2097 case MERGE_DATA_SECTION_CODE
:
2098 case MERGE_STRING_SECTION_CODE
:
2099 this->u2_
.posd
->print_to_mapfile(mapfile
);
2102 case RELAXED_INPUT_SECTION_CODE
:
2104 Output_relaxed_input_section
* relaxed_section
=
2105 this->relaxed_input_section();
2106 mapfile
->print_input_section(relaxed_section
->relobj(),
2107 relaxed_section
->shndx());
2111 mapfile
->print_input_section(this->u2_
.object
, this->shndx_
);
2116 // Output_section methods.
2118 // Construct an Output_section. NAME will point into a Stringpool.
2120 Output_section::Output_section(const char* name
, elfcpp::Elf_Word type
,
2121 elfcpp::Elf_Xword flags
)
2126 link_section_(NULL
),
2128 info_section_(NULL
),
2133 order_(ORDER_INVALID
),
2138 first_input_offset_(0),
2140 postprocessing_buffer_(NULL
),
2141 needs_symtab_index_(false),
2142 needs_dynsym_index_(false),
2143 should_link_to_symtab_(false),
2144 should_link_to_dynsym_(false),
2145 after_input_sections_(false),
2146 requires_postprocessing_(false),
2147 found_in_sections_clause_(false),
2148 has_load_address_(false),
2149 info_uses_section_index_(false),
2150 input_section_order_specified_(false),
2151 may_sort_attached_input_sections_(false),
2152 must_sort_attached_input_sections_(false),
2153 attached_input_sections_are_sorted_(false),
2155 is_small_section_(false),
2156 is_large_section_(false),
2157 generate_code_fills_at_write_(false),
2158 is_entsize_zero_(false),
2159 section_offsets_need_adjustment_(false),
2161 always_keeps_input_sections_(false),
2162 has_fixed_layout_(false),
2165 lookup_maps_(new Output_section_lookup_maps
),
2168 // An unallocated section has no address. Forcing this means that
2169 // we don't need special treatment for symbols defined in debug
2171 if ((flags
& elfcpp::SHF_ALLOC
) == 0)
2172 this->set_address(0);
2175 Output_section::~Output_section()
2177 delete this->checkpoint_
;
2180 // Set the entry size.
2183 Output_section::set_entsize(uint64_t v
)
2185 if (this->is_entsize_zero_
)
2187 else if (this->entsize_
== 0)
2189 else if (this->entsize_
!= v
)
2192 this->is_entsize_zero_
= 1;
2196 // Add the input section SHNDX, with header SHDR, named SECNAME, in
2197 // OBJECT, to the Output_section. RELOC_SHNDX is the index of a
2198 // relocation section which applies to this section, or 0 if none, or
2199 // -1U if more than one. Return the offset of the input section
2200 // within the output section. Return -1 if the input section will
2201 // receive special handling. In the normal case we don't always keep
2202 // track of input sections for an Output_section. Instead, each
2203 // Object keeps track of the Output_section for each of its input
2204 // sections. However, if HAVE_SECTIONS_SCRIPT is true, we do keep
2205 // track of input sections here; this is used when SECTIONS appears in
2208 template<int size
, bool big_endian
>
2210 Output_section::add_input_section(Layout
* layout
,
2211 Sized_relobj_file
<size
, big_endian
>* object
,
2213 const char* secname
,
2214 const elfcpp::Shdr
<size
, big_endian
>& shdr
,
2215 unsigned int reloc_shndx
,
2216 bool have_sections_script
)
2218 elfcpp::Elf_Xword addralign
= shdr
.get_sh_addralign();
2219 if ((addralign
& (addralign
- 1)) != 0)
2221 object
->error(_("invalid alignment %lu for section \"%s\""),
2222 static_cast<unsigned long>(addralign
), secname
);
2226 if (addralign
> this->addralign_
)
2227 this->addralign_
= addralign
;
2229 typename
elfcpp::Elf_types
<size
>::Elf_WXword sh_flags
= shdr
.get_sh_flags();
2230 uint64_t entsize
= shdr
.get_sh_entsize();
2232 // .debug_str is a mergeable string section, but is not always so
2233 // marked by compilers. Mark manually here so we can optimize.
2234 if (strcmp(secname
, ".debug_str") == 0)
2236 sh_flags
|= (elfcpp::SHF_MERGE
| elfcpp::SHF_STRINGS
);
2240 this->update_flags_for_input_section(sh_flags
);
2241 this->set_entsize(entsize
);
2243 // If this is a SHF_MERGE section, we pass all the input sections to
2244 // a Output_data_merge. We don't try to handle relocations for such
2245 // a section. We don't try to handle empty merge sections--they
2246 // mess up the mappings, and are useless anyhow.
2247 // FIXME: Need to handle merge sections during incremental update.
2248 if ((sh_flags
& elfcpp::SHF_MERGE
) != 0
2250 && shdr
.get_sh_size() > 0
2251 && !parameters
->incremental())
2253 // Keep information about merged input sections for rebuilding fast
2254 // lookup maps if we have sections-script or we do relaxation.
2255 bool keeps_input_sections
= (this->always_keeps_input_sections_
2256 || have_sections_script
2257 || parameters
->target().may_relax());
2259 if (this->add_merge_input_section(object
, shndx
, sh_flags
, entsize
,
2260 addralign
, keeps_input_sections
))
2262 // Tell the relocation routines that they need to call the
2263 // output_offset method to determine the final address.
2268 section_size_type input_section_size
= shdr
.get_sh_size();
2269 section_size_type uncompressed_size
;
2270 if (object
->section_is_compressed(shndx
, &uncompressed_size
))
2271 input_section_size
= uncompressed_size
;
2273 off_t offset_in_section
;
2274 off_t aligned_offset_in_section
;
2275 if (this->has_fixed_layout())
2277 // For incremental updates, find a chunk of unused space in the section.
2278 offset_in_section
= this->free_list_
.allocate(input_section_size
,
2280 if (offset_in_section
== -1)
2281 gold_fatal(_("out of patch space; relink with --incremental-full"));
2282 aligned_offset_in_section
= offset_in_section
;
2286 offset_in_section
= this->current_data_size_for_child();
2287 aligned_offset_in_section
= align_address(offset_in_section
,
2289 this->set_current_data_size_for_child(aligned_offset_in_section
2290 + input_section_size
);
2293 // Determine if we want to delay code-fill generation until the output
2294 // section is written. When the target is relaxing, we want to delay fill
2295 // generating to avoid adjusting them during relaxation. Also, if we are
2296 // sorting input sections we must delay fill generation.
2297 if (!this->generate_code_fills_at_write_
2298 && !have_sections_script
2299 && (sh_flags
& elfcpp::SHF_EXECINSTR
) != 0
2300 && parameters
->target().has_code_fill()
2301 && (parameters
->target().may_relax()
2302 || parameters
->options().section_ordering_file()))
2304 gold_assert(this->fills_
.empty());
2305 this->generate_code_fills_at_write_
= true;
2308 if (aligned_offset_in_section
> offset_in_section
2309 && !this->generate_code_fills_at_write_
2310 && !have_sections_script
2311 && (sh_flags
& elfcpp::SHF_EXECINSTR
) != 0
2312 && parameters
->target().has_code_fill())
2314 // We need to add some fill data. Using fill_list_ when
2315 // possible is an optimization, since we will often have fill
2316 // sections without input sections.
2317 off_t fill_len
= aligned_offset_in_section
- offset_in_section
;
2318 if (this->input_sections_
.empty())
2319 this->fills_
.push_back(Fill(offset_in_section
, fill_len
));
2322 std::string
fill_data(parameters
->target().code_fill(fill_len
));
2323 Output_data_const
* odc
= new Output_data_const(fill_data
, 1);
2324 this->input_sections_
.push_back(Input_section(odc
));
2328 // We need to keep track of this section if we are already keeping
2329 // track of sections, or if we are relaxing. Also, if this is a
2330 // section which requires sorting, or which may require sorting in
2331 // the future, we keep track of the sections. If the
2332 // --section-ordering-file option is used to specify the order of
2333 // sections, we need to keep track of sections.
2334 if (this->always_keeps_input_sections_
2335 || have_sections_script
2336 || !this->input_sections_
.empty()
2337 || this->may_sort_attached_input_sections()
2338 || this->must_sort_attached_input_sections()
2339 || parameters
->options().user_set_Map()
2340 || parameters
->target().may_relax()
2341 || parameters
->options().section_ordering_file())
2343 Input_section
isecn(object
, shndx
, input_section_size
, addralign
);
2344 if (parameters
->options().section_ordering_file())
2346 unsigned int section_order_index
=
2347 layout
->find_section_order_index(std::string(secname
));
2348 if (section_order_index
!= 0)
2350 isecn
.set_section_order_index(section_order_index
);
2351 this->set_input_section_order_specified();
2354 if (this->has_fixed_layout())
2356 // For incremental updates, finalize the address and offset now.
2357 uint64_t addr
= this->address();
2358 isecn
.set_address_and_file_offset(addr
+ aligned_offset_in_section
,
2359 aligned_offset_in_section
,
2362 this->input_sections_
.push_back(isecn
);
2365 return aligned_offset_in_section
;
2368 // Add arbitrary data to an output section.
2371 Output_section::add_output_section_data(Output_section_data
* posd
)
2373 Input_section
inp(posd
);
2374 this->add_output_section_data(&inp
);
2376 if (posd
->is_data_size_valid())
2378 off_t offset_in_section
;
2379 if (this->has_fixed_layout())
2381 // For incremental updates, find a chunk of unused space.
2382 offset_in_section
= this->free_list_
.allocate(posd
->data_size(),
2383 posd
->addralign(), 0);
2384 if (offset_in_section
== -1)
2385 gold_fatal(_("out of patch space; relink with --incremental-full"));
2386 // Finalize the address and offset now.
2387 uint64_t addr
= this->address();
2388 off_t offset
= this->offset();
2389 posd
->set_address_and_file_offset(addr
+ offset_in_section
,
2390 offset
+ offset_in_section
);
2394 offset_in_section
= this->current_data_size_for_child();
2395 off_t aligned_offset_in_section
= align_address(offset_in_section
,
2397 this->set_current_data_size_for_child(aligned_offset_in_section
2398 + posd
->data_size());
2401 else if (this->has_fixed_layout())
2403 // For incremental updates, arrange for the data to have a fixed layout.
2404 // This will mean that additions to the data must be allocated from
2405 // free space within the containing output section.
2406 uint64_t addr
= this->address();
2407 posd
->set_address(addr
);
2408 posd
->set_file_offset(0);
2409 // FIXME: This should eventually be unreachable.
2410 // gold_unreachable();
2414 // Add a relaxed input section.
2417 Output_section::add_relaxed_input_section(Layout
* layout
,
2418 Output_relaxed_input_section
* poris
,
2419 const std::string
& name
)
2421 Input_section
inp(poris
);
2423 // If the --section-ordering-file option is used to specify the order of
2424 // sections, we need to keep track of sections.
2425 if (parameters
->options().section_ordering_file())
2427 unsigned int section_order_index
=
2428 layout
->find_section_order_index(name
);
2429 if (section_order_index
!= 0)
2431 inp
.set_section_order_index(section_order_index
);
2432 this->set_input_section_order_specified();
2436 this->add_output_section_data(&inp
);
2437 if (this->lookup_maps_
->is_valid())
2438 this->lookup_maps_
->add_relaxed_input_section(poris
->relobj(),
2439 poris
->shndx(), poris
);
2441 // For a relaxed section, we use the current data size. Linker scripts
2442 // get all the input sections, including relaxed one from an output
2443 // section and add them back to them same output section to compute the
2444 // output section size. If we do not account for sizes of relaxed input
2445 // sections, an output section would be incorrectly sized.
2446 off_t offset_in_section
= this->current_data_size_for_child();
2447 off_t aligned_offset_in_section
= align_address(offset_in_section
,
2448 poris
->addralign());
2449 this->set_current_data_size_for_child(aligned_offset_in_section
2450 + poris
->current_data_size());
2453 // Add arbitrary data to an output section by Input_section.
2456 Output_section::add_output_section_data(Input_section
* inp
)
2458 if (this->input_sections_
.empty())
2459 this->first_input_offset_
= this->current_data_size_for_child();
2461 this->input_sections_
.push_back(*inp
);
2463 uint64_t addralign
= inp
->addralign();
2464 if (addralign
> this->addralign_
)
2465 this->addralign_
= addralign
;
2467 inp
->set_output_section(this);
2470 // Add a merge section to an output section.
2473 Output_section::add_output_merge_section(Output_section_data
* posd
,
2474 bool is_string
, uint64_t entsize
)
2476 Input_section
inp(posd
, is_string
, entsize
);
2477 this->add_output_section_data(&inp
);
2480 // Add an input section to a SHF_MERGE section.
2483 Output_section::add_merge_input_section(Relobj
* object
, unsigned int shndx
,
2484 uint64_t flags
, uint64_t entsize
,
2486 bool keeps_input_sections
)
2488 bool is_string
= (flags
& elfcpp::SHF_STRINGS
) != 0;
2490 // We only merge strings if the alignment is not more than the
2491 // character size. This could be handled, but it's unusual.
2492 if (is_string
&& addralign
> entsize
)
2495 // We cannot restore merged input section states.
2496 gold_assert(this->checkpoint_
== NULL
);
2498 // Look up merge sections by required properties.
2499 // Currently, we only invalidate the lookup maps in script processing
2500 // and relaxation. We should not have done either when we reach here.
2501 // So we assume that the lookup maps are valid to simply code.
2502 gold_assert(this->lookup_maps_
->is_valid());
2503 Merge_section_properties
msp(is_string
, entsize
, addralign
);
2504 Output_merge_base
* pomb
= this->lookup_maps_
->find_merge_section(msp
);
2505 bool is_new
= false;
2508 gold_assert(pomb
->is_string() == is_string
2509 && pomb
->entsize() == entsize
2510 && pomb
->addralign() == addralign
);
2514 // Create a new Output_merge_data or Output_merge_string_data.
2516 pomb
= new Output_merge_data(entsize
, addralign
);
2522 pomb
= new Output_merge_string
<char>(addralign
);
2525 pomb
= new Output_merge_string
<uint16_t>(addralign
);
2528 pomb
= new Output_merge_string
<uint32_t>(addralign
);
2534 // If we need to do script processing or relaxation, we need to keep
2535 // the original input sections to rebuild the fast lookup maps.
2536 if (keeps_input_sections
)
2537 pomb
->set_keeps_input_sections();
2541 if (pomb
->add_input_section(object
, shndx
))
2543 // Add new merge section to this output section and link merge
2544 // section properties to new merge section in map.
2547 this->add_output_merge_section(pomb
, is_string
, entsize
);
2548 this->lookup_maps_
->add_merge_section(msp
, pomb
);
2551 // Add input section to new merge section and link input section to new
2552 // merge section in map.
2553 this->lookup_maps_
->add_merge_input_section(object
, shndx
, pomb
);
2558 // If add_input_section failed, delete new merge section to avoid
2559 // exporting empty merge sections in Output_section::get_input_section.
2566 // Build a relaxation map to speed up relaxation of existing input sections.
2567 // Look up to the first LIMIT elements in INPUT_SECTIONS.
2570 Output_section::build_relaxation_map(
2571 const Input_section_list
& input_sections
,
2573 Relaxation_map
* relaxation_map
) const
2575 for (size_t i
= 0; i
< limit
; ++i
)
2577 const Input_section
& is(input_sections
[i
]);
2578 if (is
.is_input_section() || is
.is_relaxed_input_section())
2580 Section_id
sid(is
.relobj(), is
.shndx());
2581 (*relaxation_map
)[sid
] = i
;
2586 // Convert regular input sections in INPUT_SECTIONS into relaxed input
2587 // sections in RELAXED_SECTIONS. MAP is a prebuilt map from section id
2588 // indices of INPUT_SECTIONS.
2591 Output_section::convert_input_sections_in_list_to_relaxed_sections(
2592 const std::vector
<Output_relaxed_input_section
*>& relaxed_sections
,
2593 const Relaxation_map
& map
,
2594 Input_section_list
* input_sections
)
2596 for (size_t i
= 0; i
< relaxed_sections
.size(); ++i
)
2598 Output_relaxed_input_section
* poris
= relaxed_sections
[i
];
2599 Section_id
sid(poris
->relobj(), poris
->shndx());
2600 Relaxation_map::const_iterator p
= map
.find(sid
);
2601 gold_assert(p
!= map
.end());
2602 gold_assert((*input_sections
)[p
->second
].is_input_section());
2604 // Remember section order index of original input section
2605 // if it is set. Copy it to the relaxed input section.
2607 (*input_sections
)[p
->second
].section_order_index();
2608 (*input_sections
)[p
->second
] = Input_section(poris
);
2609 (*input_sections
)[p
->second
].set_section_order_index(soi
);
2613 // Convert regular input sections into relaxed input sections. RELAXED_SECTIONS
2614 // is a vector of pointers to Output_relaxed_input_section or its derived
2615 // classes. The relaxed sections must correspond to existing input sections.
2618 Output_section::convert_input_sections_to_relaxed_sections(
2619 const std::vector
<Output_relaxed_input_section
*>& relaxed_sections
)
2621 gold_assert(parameters
->target().may_relax());
2623 // We want to make sure that restore_states does not undo the effect of
2624 // this. If there is no checkpoint active, just search the current
2625 // input section list and replace the sections there. If there is
2626 // a checkpoint, also replace the sections there.
2628 // By default, we look at the whole list.
2629 size_t limit
= this->input_sections_
.size();
2631 if (this->checkpoint_
!= NULL
)
2633 // Replace input sections with relaxed input section in the saved
2634 // copy of the input section list.
2635 if (this->checkpoint_
->input_sections_saved())
2638 this->build_relaxation_map(
2639 *(this->checkpoint_
->input_sections()),
2640 this->checkpoint_
->input_sections()->size(),
2642 this->convert_input_sections_in_list_to_relaxed_sections(
2645 this->checkpoint_
->input_sections());
2649 // We have not copied the input section list yet. Instead, just
2650 // look at the portion that would be saved.
2651 limit
= this->checkpoint_
->input_sections_size();
2655 // Convert input sections in input_section_list.
2657 this->build_relaxation_map(this->input_sections_
, limit
, &map
);
2658 this->convert_input_sections_in_list_to_relaxed_sections(
2661 &this->input_sections_
);
2663 // Update fast look-up map.
2664 if (this->lookup_maps_
->is_valid())
2665 for (size_t i
= 0; i
< relaxed_sections
.size(); ++i
)
2667 Output_relaxed_input_section
* poris
= relaxed_sections
[i
];
2668 this->lookup_maps_
->add_relaxed_input_section(poris
->relobj(),
2669 poris
->shndx(), poris
);
2673 // Update the output section flags based on input section flags.
2676 Output_section::update_flags_for_input_section(elfcpp::Elf_Xword flags
)
2678 // If we created the section with SHF_ALLOC clear, we set the
2679 // address. If we are now setting the SHF_ALLOC flag, we need to
2681 if ((this->flags_
& elfcpp::SHF_ALLOC
) == 0
2682 && (flags
& elfcpp::SHF_ALLOC
) != 0)
2683 this->mark_address_invalid();
2685 this->flags_
|= (flags
2686 & (elfcpp::SHF_WRITE
2688 | elfcpp::SHF_EXECINSTR
));
2690 if ((flags
& elfcpp::SHF_MERGE
) == 0)
2691 this->flags_
&=~ elfcpp::SHF_MERGE
;
2694 if (this->current_data_size_for_child() == 0)
2695 this->flags_
|= elfcpp::SHF_MERGE
;
2698 if ((flags
& elfcpp::SHF_STRINGS
) == 0)
2699 this->flags_
&=~ elfcpp::SHF_STRINGS
;
2702 if (this->current_data_size_for_child() == 0)
2703 this->flags_
|= elfcpp::SHF_STRINGS
;
2707 // Find the merge section into which an input section with index SHNDX in
2708 // OBJECT has been added. Return NULL if none found.
2710 Output_section_data
*
2711 Output_section::find_merge_section(const Relobj
* object
,
2712 unsigned int shndx
) const
2714 if (!this->lookup_maps_
->is_valid())
2715 this->build_lookup_maps();
2716 return this->lookup_maps_
->find_merge_section(object
, shndx
);
2719 // Build the lookup maps for merge and relaxed sections. This is needs
2720 // to be declared as a const methods so that it is callable with a const
2721 // Output_section pointer. The method only updates states of the maps.
2724 Output_section::build_lookup_maps() const
2726 this->lookup_maps_
->clear();
2727 for (Input_section_list::const_iterator p
= this->input_sections_
.begin();
2728 p
!= this->input_sections_
.end();
2731 if (p
->is_merge_section())
2733 Output_merge_base
* pomb
= p
->output_merge_base();
2734 Merge_section_properties
msp(pomb
->is_string(), pomb
->entsize(),
2736 this->lookup_maps_
->add_merge_section(msp
, pomb
);
2737 for (Output_merge_base::Input_sections::const_iterator is
=
2738 pomb
->input_sections_begin();
2739 is
!= pomb
->input_sections_end();
2742 const Const_section_id
& csid
= *is
;
2743 this->lookup_maps_
->add_merge_input_section(csid
.first
,
2748 else if (p
->is_relaxed_input_section())
2750 Output_relaxed_input_section
* poris
= p
->relaxed_input_section();
2751 this->lookup_maps_
->add_relaxed_input_section(poris
->relobj(),
2752 poris
->shndx(), poris
);
2757 // Find an relaxed input section corresponding to an input section
2758 // in OBJECT with index SHNDX.
2760 const Output_relaxed_input_section
*
2761 Output_section::find_relaxed_input_section(const Relobj
* object
,
2762 unsigned int shndx
) const
2764 if (!this->lookup_maps_
->is_valid())
2765 this->build_lookup_maps();
2766 return this->lookup_maps_
->find_relaxed_input_section(object
, shndx
);
2769 // Given an address OFFSET relative to the start of input section
2770 // SHNDX in OBJECT, return whether this address is being included in
2771 // the final link. This should only be called if SHNDX in OBJECT has
2772 // a special mapping.
2775 Output_section::is_input_address_mapped(const Relobj
* object
,
2779 // Look at the Output_section_data_maps first.
2780 const Output_section_data
* posd
= this->find_merge_section(object
, shndx
);
2782 posd
= this->find_relaxed_input_section(object
, shndx
);
2786 section_offset_type output_offset
;
2787 bool found
= posd
->output_offset(object
, shndx
, offset
, &output_offset
);
2789 return output_offset
!= -1;
2792 // Fall back to the slow look-up.
2793 for (Input_section_list::const_iterator p
= this->input_sections_
.begin();
2794 p
!= this->input_sections_
.end();
2797 section_offset_type output_offset
;
2798 if (p
->output_offset(object
, shndx
, offset
, &output_offset
))
2799 return output_offset
!= -1;
2802 // By default we assume that the address is mapped. This should
2803 // only be called after we have passed all sections to Layout. At
2804 // that point we should know what we are discarding.
2808 // Given an address OFFSET relative to the start of input section
2809 // SHNDX in object OBJECT, return the output offset relative to the
2810 // start of the input section in the output section. This should only
2811 // be called if SHNDX in OBJECT has a special mapping.
2814 Output_section::output_offset(const Relobj
* object
, unsigned int shndx
,
2815 section_offset_type offset
) const
2817 // This can only be called meaningfully when we know the data size
2819 gold_assert(this->is_data_size_valid());
2821 // Look at the Output_section_data_maps first.
2822 const Output_section_data
* posd
= this->find_merge_section(object
, shndx
);
2824 posd
= this->find_relaxed_input_section(object
, shndx
);
2827 section_offset_type output_offset
;
2828 bool found
= posd
->output_offset(object
, shndx
, offset
, &output_offset
);
2830 return output_offset
;
2833 // Fall back to the slow look-up.
2834 for (Input_section_list::const_iterator p
= this->input_sections_
.begin();
2835 p
!= this->input_sections_
.end();
2838 section_offset_type output_offset
;
2839 if (p
->output_offset(object
, shndx
, offset
, &output_offset
))
2840 return output_offset
;
2845 // Return the output virtual address of OFFSET relative to the start
2846 // of input section SHNDX in object OBJECT.
2849 Output_section::output_address(const Relobj
* object
, unsigned int shndx
,
2852 uint64_t addr
= this->address() + this->first_input_offset_
;
2854 // Look at the Output_section_data_maps first.
2855 const Output_section_data
* posd
= this->find_merge_section(object
, shndx
);
2857 posd
= this->find_relaxed_input_section(object
, shndx
);
2858 if (posd
!= NULL
&& posd
->is_address_valid())
2860 section_offset_type output_offset
;
2861 bool found
= posd
->output_offset(object
, shndx
, offset
, &output_offset
);
2863 return posd
->address() + output_offset
;
2866 // Fall back to the slow look-up.
2867 for (Input_section_list::const_iterator p
= this->input_sections_
.begin();
2868 p
!= this->input_sections_
.end();
2871 addr
= align_address(addr
, p
->addralign());
2872 section_offset_type output_offset
;
2873 if (p
->output_offset(object
, shndx
, offset
, &output_offset
))
2875 if (output_offset
== -1)
2877 return addr
+ output_offset
;
2879 addr
+= p
->data_size();
2882 // If we get here, it means that we don't know the mapping for this
2883 // input section. This might happen in principle if
2884 // add_input_section were called before add_output_section_data.
2885 // But it should never actually happen.
2890 // Find the output address of the start of the merged section for
2891 // input section SHNDX in object OBJECT.
2894 Output_section::find_starting_output_address(const Relobj
* object
,
2896 uint64_t* paddr
) const
2898 // FIXME: This becomes a bottle-neck if we have many relaxed sections.
2899 // Looking up the merge section map does not always work as we sometimes
2900 // find a merge section without its address set.
2901 uint64_t addr
= this->address() + this->first_input_offset_
;
2902 for (Input_section_list::const_iterator p
= this->input_sections_
.begin();
2903 p
!= this->input_sections_
.end();
2906 addr
= align_address(addr
, p
->addralign());
2908 // It would be nice if we could use the existing output_offset
2909 // method to get the output offset of input offset 0.
2910 // Unfortunately we don't know for sure that input offset 0 is
2912 if (p
->is_merge_section_for(object
, shndx
))
2918 addr
+= p
->data_size();
2921 // We couldn't find a merge output section for this input section.
2925 // Update the data size of an Output_section.
2928 Output_section::update_data_size()
2930 if (this->input_sections_
.empty())
2933 if (this->must_sort_attached_input_sections()
2934 || this->input_section_order_specified())
2935 this->sort_attached_input_sections();
2937 off_t off
= this->first_input_offset_
;
2938 for (Input_section_list::iterator p
= this->input_sections_
.begin();
2939 p
!= this->input_sections_
.end();
2942 off
= align_address(off
, p
->addralign());
2943 off
+= p
->current_data_size();
2946 this->set_current_data_size_for_child(off
);
2949 // Set the data size of an Output_section. This is where we handle
2950 // setting the addresses of any Output_section_data objects.
2953 Output_section::set_final_data_size()
2955 if (this->input_sections_
.empty())
2957 this->set_data_size(this->current_data_size_for_child());
2961 if (this->must_sort_attached_input_sections()
2962 || this->input_section_order_specified())
2963 this->sort_attached_input_sections();
2965 uint64_t address
= this->address();
2966 off_t startoff
= this->offset();
2967 off_t off
= startoff
+ this->first_input_offset_
;
2968 for (Input_section_list::iterator p
= this->input_sections_
.begin();
2969 p
!= this->input_sections_
.end();
2972 off
= align_address(off
, p
->addralign());
2973 p
->set_address_and_file_offset(address
+ (off
- startoff
), off
,
2975 off
+= p
->data_size();
2978 this->set_data_size(off
- startoff
);
2981 // Reset the address and file offset.
2984 Output_section::do_reset_address_and_file_offset()
2986 // An unallocated section has no address. Forcing this means that
2987 // we don't need special treatment for symbols defined in debug
2988 // sections. We do the same in the constructor. This does not
2989 // apply to NOLOAD sections though.
2990 if (((this->flags_
& elfcpp::SHF_ALLOC
) == 0) && !this->is_noload_
)
2991 this->set_address(0);
2993 for (Input_section_list::iterator p
= this->input_sections_
.begin();
2994 p
!= this->input_sections_
.end();
2996 p
->reset_address_and_file_offset();
2999 // Return true if address and file offset have the values after reset.
3002 Output_section::do_address_and_file_offset_have_reset_values() const
3004 if (this->is_offset_valid())
3007 // An unallocated section has address 0 after its construction or a reset.
3008 if ((this->flags_
& elfcpp::SHF_ALLOC
) == 0)
3009 return this->is_address_valid() && this->address() == 0;
3011 return !this->is_address_valid();
3014 // Set the TLS offset. Called only for SHT_TLS sections.
3017 Output_section::do_set_tls_offset(uint64_t tls_base
)
3019 this->tls_offset_
= this->address() - tls_base
;
3022 // In a few cases we need to sort the input sections attached to an
3023 // output section. This is used to implement the type of constructor
3024 // priority ordering implemented by the GNU linker, in which the
3025 // priority becomes part of the section name and the sections are
3026 // sorted by name. We only do this for an output section if we see an
3027 // attached input section matching ".ctor.*", ".dtor.*",
3028 // ".init_array.*" or ".fini_array.*".
3030 class Output_section::Input_section_sort_entry
3033 Input_section_sort_entry()
3034 : input_section_(), index_(-1U), section_has_name_(false),
3038 Input_section_sort_entry(const Input_section
& input_section
,
3040 bool must_sort_attached_input_sections
)
3041 : input_section_(input_section
), index_(index
),
3042 section_has_name_(input_section
.is_input_section()
3043 || input_section
.is_relaxed_input_section())
3045 if (this->section_has_name_
3046 && must_sort_attached_input_sections
)
3048 // This is only called single-threaded from Layout::finalize,
3049 // so it is OK to lock. Unfortunately we have no way to pass
3051 const Task
* dummy_task
= reinterpret_cast<const Task
*>(-1);
3052 Object
* obj
= (input_section
.is_input_section()
3053 ? input_section
.relobj()
3054 : input_section
.relaxed_input_section()->relobj());
3055 Task_lock_obj
<Object
> tl(dummy_task
, obj
);
3057 // This is a slow operation, which should be cached in
3058 // Layout::layout if this becomes a speed problem.
3059 this->section_name_
= obj
->section_name(input_section
.shndx());
3063 // Return the Input_section.
3064 const Input_section
&
3065 input_section() const
3067 gold_assert(this->index_
!= -1U);
3068 return this->input_section_
;
3071 // The index of this entry in the original list. This is used to
3072 // make the sort stable.
3076 gold_assert(this->index_
!= -1U);
3077 return this->index_
;
3080 // Whether there is a section name.
3082 section_has_name() const
3083 { return this->section_has_name_
; }
3085 // The section name.
3087 section_name() const
3089 gold_assert(this->section_has_name_
);
3090 return this->section_name_
;
3093 // Return true if the section name has a priority. This is assumed
3094 // to be true if it has a dot after the initial dot.
3096 has_priority() const
3098 gold_assert(this->section_has_name_
);
3099 return this->section_name_
.find('.', 1) != std::string::npos
;
3102 // Return true if this an input file whose base name matches
3103 // FILE_NAME. The base name must have an extension of ".o", and
3104 // must be exactly FILE_NAME.o or FILE_NAME, one character, ".o".
3105 // This is to match crtbegin.o as well as crtbeginS.o without
3106 // getting confused by other possibilities. Overall matching the
3107 // file name this way is a dreadful hack, but the GNU linker does it
3108 // in order to better support gcc, and we need to be compatible.
3110 match_file_name(const char* match_file_name
) const
3112 const std::string
& file_name(this->input_section_
.relobj()->name());
3113 const char* base_name
= lbasename(file_name
.c_str());
3114 size_t match_len
= strlen(match_file_name
);
3115 if (strncmp(base_name
, match_file_name
, match_len
) != 0)
3117 size_t base_len
= strlen(base_name
);
3118 if (base_len
!= match_len
+ 2 && base_len
!= match_len
+ 3)
3120 return memcmp(base_name
+ base_len
- 2, ".o", 2) == 0;
3123 // Returns 1 if THIS should appear before S in section order, -1 if S
3124 // appears before THIS and 0 if they are not comparable.
3126 compare_section_ordering(const Input_section_sort_entry
& s
) const
3128 unsigned int this_secn_index
= this->input_section_
.section_order_index();
3129 unsigned int s_secn_index
= s
.input_section().section_order_index();
3130 if (this_secn_index
> 0 && s_secn_index
> 0)
3132 if (this_secn_index
< s_secn_index
)
3134 else if (this_secn_index
> s_secn_index
)
3141 // The Input_section we are sorting.
3142 Input_section input_section_
;
3143 // The index of this Input_section in the original list.
3144 unsigned int index_
;
3145 // Whether this Input_section has a section name--it won't if this
3146 // is some random Output_section_data.
3147 bool section_has_name_
;
3148 // The section name if there is one.
3149 std::string section_name_
;
3152 // Return true if S1 should come before S2 in the output section.
3155 Output_section::Input_section_sort_compare::operator()(
3156 const Output_section::Input_section_sort_entry
& s1
,
3157 const Output_section::Input_section_sort_entry
& s2
) const
3159 // crtbegin.o must come first.
3160 bool s1_begin
= s1
.match_file_name("crtbegin");
3161 bool s2_begin
= s2
.match_file_name("crtbegin");
3162 if (s1_begin
|| s2_begin
)
3168 return s1
.index() < s2
.index();
3171 // crtend.o must come last.
3172 bool s1_end
= s1
.match_file_name("crtend");
3173 bool s2_end
= s2
.match_file_name("crtend");
3174 if (s1_end
|| s2_end
)
3180 return s1
.index() < s2
.index();
3183 // We sort all the sections with no names to the end.
3184 if (!s1
.section_has_name() || !s2
.section_has_name())
3186 if (s1
.section_has_name())
3188 if (s2
.section_has_name())
3190 return s1
.index() < s2
.index();
3193 // A section with a priority follows a section without a priority.
3194 bool s1_has_priority
= s1
.has_priority();
3195 bool s2_has_priority
= s2
.has_priority();
3196 if (s1_has_priority
&& !s2_has_priority
)
3198 if (!s1_has_priority
&& s2_has_priority
)
3201 // Check if a section order exists for these sections through a section
3202 // ordering file. If sequence_num is 0, an order does not exist.
3203 int sequence_num
= s1
.compare_section_ordering(s2
);
3204 if (sequence_num
!= 0)
3205 return sequence_num
== 1;
3207 // Otherwise we sort by name.
3208 int compare
= s1
.section_name().compare(s2
.section_name());
3212 // Otherwise we keep the input order.
3213 return s1
.index() < s2
.index();
3216 // Return true if S1 should come before S2 in an .init_array or .fini_array
3220 Output_section::Input_section_sort_init_fini_compare::operator()(
3221 const Output_section::Input_section_sort_entry
& s1
,
3222 const Output_section::Input_section_sort_entry
& s2
) const
3224 // We sort all the sections with no names to the end.
3225 if (!s1
.section_has_name() || !s2
.section_has_name())
3227 if (s1
.section_has_name())
3229 if (s2
.section_has_name())
3231 return s1
.index() < s2
.index();
3234 // A section without a priority follows a section with a priority.
3235 // This is the reverse of .ctors and .dtors sections.
3236 bool s1_has_priority
= s1
.has_priority();
3237 bool s2_has_priority
= s2
.has_priority();
3238 if (s1_has_priority
&& !s2_has_priority
)
3240 if (!s1_has_priority
&& s2_has_priority
)
3243 // Check if a section order exists for these sections through a section
3244 // ordering file. If sequence_num is 0, an order does not exist.
3245 int sequence_num
= s1
.compare_section_ordering(s2
);
3246 if (sequence_num
!= 0)
3247 return sequence_num
== 1;
3249 // Otherwise we sort by name.
3250 int compare
= s1
.section_name().compare(s2
.section_name());
3254 // Otherwise we keep the input order.
3255 return s1
.index() < s2
.index();
3258 // Return true if S1 should come before S2. Sections that do not match
3259 // any pattern in the section ordering file are placed ahead of the sections
3260 // that match some pattern.
3263 Output_section::Input_section_sort_section_order_index_compare::operator()(
3264 const Output_section::Input_section_sort_entry
& s1
,
3265 const Output_section::Input_section_sort_entry
& s2
) const
3267 unsigned int s1_secn_index
= s1
.input_section().section_order_index();
3268 unsigned int s2_secn_index
= s2
.input_section().section_order_index();
3270 // Keep input order if section ordering cannot determine order.
3271 if (s1_secn_index
== s2_secn_index
)
3272 return s1
.index() < s2
.index();
3274 return s1_secn_index
< s2_secn_index
;
3277 // Sort the input sections attached to an output section.
3280 Output_section::sort_attached_input_sections()
3282 if (this->attached_input_sections_are_sorted_
)
3285 if (this->checkpoint_
!= NULL
3286 && !this->checkpoint_
->input_sections_saved())
3287 this->checkpoint_
->save_input_sections();
3289 // The only thing we know about an input section is the object and
3290 // the section index. We need the section name. Recomputing this
3291 // is slow but this is an unusual case. If this becomes a speed
3292 // problem we can cache the names as required in Layout::layout.
3294 // We start by building a larger vector holding a copy of each
3295 // Input_section, plus its current index in the list and its name.
3296 std::vector
<Input_section_sort_entry
> sort_list
;
3299 for (Input_section_list::iterator p
= this->input_sections_
.begin();
3300 p
!= this->input_sections_
.end();
3302 sort_list
.push_back(Input_section_sort_entry(*p
, i
,
3303 this->must_sort_attached_input_sections()));
3305 // Sort the input sections.
3306 if (this->must_sort_attached_input_sections())
3308 if (this->type() == elfcpp::SHT_PREINIT_ARRAY
3309 || this->type() == elfcpp::SHT_INIT_ARRAY
3310 || this->type() == elfcpp::SHT_FINI_ARRAY
)
3311 std::sort(sort_list
.begin(), sort_list
.end(),
3312 Input_section_sort_init_fini_compare());
3314 std::sort(sort_list
.begin(), sort_list
.end(),
3315 Input_section_sort_compare());
3319 gold_assert(parameters
->options().section_ordering_file());
3320 std::sort(sort_list
.begin(), sort_list
.end(),
3321 Input_section_sort_section_order_index_compare());
3324 // Copy the sorted input sections back to our list.
3325 this->input_sections_
.clear();
3326 for (std::vector
<Input_section_sort_entry
>::iterator p
= sort_list
.begin();
3327 p
!= sort_list
.end();
3329 this->input_sections_
.push_back(p
->input_section());
3332 // Remember that we sorted the input sections, since we might get
3334 this->attached_input_sections_are_sorted_
= true;
3337 // Write the section header to *OSHDR.
3339 template<int size
, bool big_endian
>
3341 Output_section::write_header(const Layout
* layout
,
3342 const Stringpool
* secnamepool
,
3343 elfcpp::Shdr_write
<size
, big_endian
>* oshdr
) const
3345 oshdr
->put_sh_name(secnamepool
->get_offset(this->name_
));
3346 oshdr
->put_sh_type(this->type_
);
3348 elfcpp::Elf_Xword flags
= this->flags_
;
3349 if (this->info_section_
!= NULL
&& this->info_uses_section_index_
)
3350 flags
|= elfcpp::SHF_INFO_LINK
;
3351 oshdr
->put_sh_flags(flags
);
3353 oshdr
->put_sh_addr(this->address());
3354 oshdr
->put_sh_offset(this->offset());
3355 oshdr
->put_sh_size(this->data_size());
3356 if (this->link_section_
!= NULL
)
3357 oshdr
->put_sh_link(this->link_section_
->out_shndx());
3358 else if (this->should_link_to_symtab_
)
3359 oshdr
->put_sh_link(layout
->symtab_section()->out_shndx());
3360 else if (this->should_link_to_dynsym_
)
3361 oshdr
->put_sh_link(layout
->dynsym_section()->out_shndx());
3363 oshdr
->put_sh_link(this->link_
);
3365 elfcpp::Elf_Word info
;
3366 if (this->info_section_
!= NULL
)
3368 if (this->info_uses_section_index_
)
3369 info
= this->info_section_
->out_shndx();
3371 info
= this->info_section_
->symtab_index();
3373 else if (this->info_symndx_
!= NULL
)
3374 info
= this->info_symndx_
->symtab_index();
3377 oshdr
->put_sh_info(info
);
3379 oshdr
->put_sh_addralign(this->addralign_
);
3380 oshdr
->put_sh_entsize(this->entsize_
);
3383 // Write out the data. For input sections the data is written out by
3384 // Object::relocate, but we have to handle Output_section_data objects
3388 Output_section::do_write(Output_file
* of
)
3390 gold_assert(!this->requires_postprocessing());
3392 // If the target performs relaxation, we delay filler generation until now.
3393 gold_assert(!this->generate_code_fills_at_write_
|| this->fills_
.empty());
3395 off_t output_section_file_offset
= this->offset();
3396 for (Fill_list::iterator p
= this->fills_
.begin();
3397 p
!= this->fills_
.end();
3400 std::string
fill_data(parameters
->target().code_fill(p
->length()));
3401 of
->write(output_section_file_offset
+ p
->section_offset(),
3402 fill_data
.data(), fill_data
.size());
3405 off_t off
= this->offset() + this->first_input_offset_
;
3406 for (Input_section_list::iterator p
= this->input_sections_
.begin();
3407 p
!= this->input_sections_
.end();
3410 off_t aligned_off
= align_address(off
, p
->addralign());
3411 if (this->generate_code_fills_at_write_
&& (off
!= aligned_off
))
3413 size_t fill_len
= aligned_off
- off
;
3414 std::string
fill_data(parameters
->target().code_fill(fill_len
));
3415 of
->write(off
, fill_data
.data(), fill_data
.size());
3419 off
= aligned_off
+ p
->data_size();
3423 // If a section requires postprocessing, create the buffer to use.
3426 Output_section::create_postprocessing_buffer()
3428 gold_assert(this->requires_postprocessing());
3430 if (this->postprocessing_buffer_
!= NULL
)
3433 if (!this->input_sections_
.empty())
3435 off_t off
= this->first_input_offset_
;
3436 for (Input_section_list::iterator p
= this->input_sections_
.begin();
3437 p
!= this->input_sections_
.end();
3440 off
= align_address(off
, p
->addralign());
3441 p
->finalize_data_size();
3442 off
+= p
->data_size();
3444 this->set_current_data_size_for_child(off
);
3447 off_t buffer_size
= this->current_data_size_for_child();
3448 this->postprocessing_buffer_
= new unsigned char[buffer_size
];
3451 // Write all the data of an Output_section into the postprocessing
3452 // buffer. This is used for sections which require postprocessing,
3453 // such as compression. Input sections are handled by
3454 // Object::Relocate.
3457 Output_section::write_to_postprocessing_buffer()
3459 gold_assert(this->requires_postprocessing());
3461 // If the target performs relaxation, we delay filler generation until now.
3462 gold_assert(!this->generate_code_fills_at_write_
|| this->fills_
.empty());
3464 unsigned char* buffer
= this->postprocessing_buffer();
3465 for (Fill_list::iterator p
= this->fills_
.begin();
3466 p
!= this->fills_
.end();
3469 std::string
fill_data(parameters
->target().code_fill(p
->length()));
3470 memcpy(buffer
+ p
->section_offset(), fill_data
.data(),
3474 off_t off
= this->first_input_offset_
;
3475 for (Input_section_list::iterator p
= this->input_sections_
.begin();
3476 p
!= this->input_sections_
.end();
3479 off_t aligned_off
= align_address(off
, p
->addralign());
3480 if (this->generate_code_fills_at_write_
&& (off
!= aligned_off
))
3482 size_t fill_len
= aligned_off
- off
;
3483 std::string
fill_data(parameters
->target().code_fill(fill_len
));
3484 memcpy(buffer
+ off
, fill_data
.data(), fill_data
.size());
3487 p
->write_to_buffer(buffer
+ aligned_off
);
3488 off
= aligned_off
+ p
->data_size();
3492 // Get the input sections for linker script processing. We leave
3493 // behind the Output_section_data entries. Note that this may be
3494 // slightly incorrect for merge sections. We will leave them behind,
3495 // but it is possible that the script says that they should follow
3496 // some other input sections, as in:
3497 // .rodata { *(.rodata) *(.rodata.cst*) }
3498 // For that matter, we don't handle this correctly:
3499 // .rodata { foo.o(.rodata.cst*) *(.rodata.cst*) }
3500 // With luck this will never matter.
3503 Output_section::get_input_sections(
3505 const std::string
& fill
,
3506 std::list
<Input_section
>* input_sections
)
3508 if (this->checkpoint_
!= NULL
3509 && !this->checkpoint_
->input_sections_saved())
3510 this->checkpoint_
->save_input_sections();
3512 // Invalidate fast look-up maps.
3513 this->lookup_maps_
->invalidate();
3515 uint64_t orig_address
= address
;
3517 address
= align_address(address
, this->addralign());
3519 Input_section_list remaining
;
3520 for (Input_section_list::iterator p
= this->input_sections_
.begin();
3521 p
!= this->input_sections_
.end();
3524 if (p
->is_input_section()
3525 || p
->is_relaxed_input_section()
3526 || p
->is_merge_section())
3527 input_sections
->push_back(*p
);
3530 uint64_t aligned_address
= align_address(address
, p
->addralign());
3531 if (aligned_address
!= address
&& !fill
.empty())
3533 section_size_type length
=
3534 convert_to_section_size_type(aligned_address
- address
);
3535 std::string this_fill
;
3536 this_fill
.reserve(length
);
3537 while (this_fill
.length() + fill
.length() <= length
)
3539 if (this_fill
.length() < length
)
3540 this_fill
.append(fill
, 0, length
- this_fill
.length());
3542 Output_section_data
* posd
= new Output_data_const(this_fill
, 0);
3543 remaining
.push_back(Input_section(posd
));
3545 address
= aligned_address
;
3547 remaining
.push_back(*p
);
3549 p
->finalize_data_size();
3550 address
+= p
->data_size();
3554 this->input_sections_
.swap(remaining
);
3555 this->first_input_offset_
= 0;
3557 uint64_t data_size
= address
- orig_address
;
3558 this->set_current_data_size_for_child(data_size
);
3562 // Add a script input section. SIS is an Output_section::Input_section,
3563 // which can be either a plain input section or a special input section like
3564 // a relaxed input section. For a special input section, its size must be
3568 Output_section::add_script_input_section(const Input_section
& sis
)
3570 uint64_t data_size
= sis
.data_size();
3571 uint64_t addralign
= sis
.addralign();
3572 if (addralign
> this->addralign_
)
3573 this->addralign_
= addralign
;
3575 off_t offset_in_section
= this->current_data_size_for_child();
3576 off_t aligned_offset_in_section
= align_address(offset_in_section
,
3579 this->set_current_data_size_for_child(aligned_offset_in_section
3582 this->input_sections_
.push_back(sis
);
3584 // Update fast lookup maps if necessary.
3585 if (this->lookup_maps_
->is_valid())
3587 if (sis
.is_merge_section())
3589 Output_merge_base
* pomb
= sis
.output_merge_base();
3590 Merge_section_properties
msp(pomb
->is_string(), pomb
->entsize(),
3592 this->lookup_maps_
->add_merge_section(msp
, pomb
);
3593 for (Output_merge_base::Input_sections::const_iterator p
=
3594 pomb
->input_sections_begin();
3595 p
!= pomb
->input_sections_end();
3597 this->lookup_maps_
->add_merge_input_section(p
->first
, p
->second
,
3600 else if (sis
.is_relaxed_input_section())
3602 Output_relaxed_input_section
* poris
= sis
.relaxed_input_section();
3603 this->lookup_maps_
->add_relaxed_input_section(poris
->relobj(),
3604 poris
->shndx(), poris
);
3609 // Save states for relaxation.
3612 Output_section::save_states()
3614 gold_assert(this->checkpoint_
== NULL
);
3615 Checkpoint_output_section
* checkpoint
=
3616 new Checkpoint_output_section(this->addralign_
, this->flags_
,
3617 this->input_sections_
,
3618 this->first_input_offset_
,
3619 this->attached_input_sections_are_sorted_
);
3620 this->checkpoint_
= checkpoint
;
3621 gold_assert(this->fills_
.empty());
3625 Output_section::discard_states()
3627 gold_assert(this->checkpoint_
!= NULL
);
3628 delete this->checkpoint_
;
3629 this->checkpoint_
= NULL
;
3630 gold_assert(this->fills_
.empty());
3632 // Simply invalidate the fast lookup maps since we do not keep
3634 this->lookup_maps_
->invalidate();
3638 Output_section::restore_states()
3640 gold_assert(this->checkpoint_
!= NULL
);
3641 Checkpoint_output_section
* checkpoint
= this->checkpoint_
;
3643 this->addralign_
= checkpoint
->addralign();
3644 this->flags_
= checkpoint
->flags();
3645 this->first_input_offset_
= checkpoint
->first_input_offset();
3647 if (!checkpoint
->input_sections_saved())
3649 // If we have not copied the input sections, just resize it.
3650 size_t old_size
= checkpoint
->input_sections_size();
3651 gold_assert(this->input_sections_
.size() >= old_size
);
3652 this->input_sections_
.resize(old_size
);
3656 // We need to copy the whole list. This is not efficient for
3657 // extremely large output with hundreads of thousands of input
3658 // objects. We may need to re-think how we should pass sections
3660 this->input_sections_
= *checkpoint
->input_sections();
3663 this->attached_input_sections_are_sorted_
=
3664 checkpoint
->attached_input_sections_are_sorted();
3666 // Simply invalidate the fast lookup maps since we do not keep
3668 this->lookup_maps_
->invalidate();
3671 // Update the section offsets of input sections in this. This is required if
3672 // relaxation causes some input sections to change sizes.
3675 Output_section::adjust_section_offsets()
3677 if (!this->section_offsets_need_adjustment_
)
3681 for (Input_section_list::iterator p
= this->input_sections_
.begin();
3682 p
!= this->input_sections_
.end();
3685 off
= align_address(off
, p
->addralign());
3686 if (p
->is_input_section())
3687 p
->relobj()->set_section_offset(p
->shndx(), off
);
3688 off
+= p
->data_size();
3691 this->section_offsets_need_adjustment_
= false;
3694 // Print to the map file.
3697 Output_section::do_print_to_mapfile(Mapfile
* mapfile
) const
3699 mapfile
->print_output_section(this);
3701 for (Input_section_list::const_iterator p
= this->input_sections_
.begin();
3702 p
!= this->input_sections_
.end();
3704 p
->print_to_mapfile(mapfile
);
3707 // Print stats for merge sections to stderr.
3710 Output_section::print_merge_stats()
3712 Input_section_list::iterator p
;
3713 for (p
= this->input_sections_
.begin();
3714 p
!= this->input_sections_
.end();
3716 p
->print_merge_stats(this->name_
);
3719 // Set a fixed layout for the section. Used for incremental update links.
3722 Output_section::set_fixed_layout(uint64_t sh_addr
, off_t sh_offset
,
3723 off_t sh_size
, uint64_t sh_addralign
)
3725 this->addralign_
= sh_addralign
;
3726 this->set_current_data_size(sh_size
);
3727 if ((this->flags_
& elfcpp::SHF_ALLOC
) != 0)
3728 this->set_address(sh_addr
);
3729 this->set_file_offset(sh_offset
);
3730 this->finalize_data_size();
3731 this->free_list_
.init(sh_size
, false);
3732 this->has_fixed_layout_
= true;
3735 // Reserve space within the fixed layout for the section. Used for
3736 // incremental update links.
3738 Output_section::reserve(uint64_t sh_offset
, uint64_t sh_size
)
3740 this->free_list_
.remove(sh_offset
, sh_offset
+ sh_size
);
3743 // Output segment methods.
3745 Output_segment::Output_segment(elfcpp::Elf_Word type
, elfcpp::Elf_Word flags
)
3755 is_max_align_known_(false),
3756 are_addresses_set_(false),
3757 is_large_data_segment_(false)
3759 // The ELF ABI specifies that a PT_TLS segment always has PF_R as
3761 if (type
== elfcpp::PT_TLS
)
3762 this->flags_
= elfcpp::PF_R
;
3765 // Add an Output_section to a PT_LOAD Output_segment.
3768 Output_segment::add_output_section_to_load(Layout
* layout
,
3770 elfcpp::Elf_Word seg_flags
)
3772 gold_assert(this->type() == elfcpp::PT_LOAD
);
3773 gold_assert((os
->flags() & elfcpp::SHF_ALLOC
) != 0);
3774 gold_assert(!this->is_max_align_known_
);
3775 gold_assert(os
->is_large_data_section() == this->is_large_data_segment());
3777 this->update_flags_for_output_section(seg_flags
);
3779 // We don't want to change the ordering if we have a linker script
3780 // with a SECTIONS clause.
3781 Output_section_order order
= os
->order();
3782 if (layout
->script_options()->saw_sections_clause())
3783 order
= static_cast<Output_section_order
>(0);
3785 gold_assert(order
!= ORDER_INVALID
);
3787 this->output_lists_
[order
].push_back(os
);
3790 // Add an Output_section to a non-PT_LOAD Output_segment.
3793 Output_segment::add_output_section_to_nonload(Output_section
* os
,
3794 elfcpp::Elf_Word seg_flags
)
3796 gold_assert(this->type() != elfcpp::PT_LOAD
);
3797 gold_assert((os
->flags() & elfcpp::SHF_ALLOC
) != 0);
3798 gold_assert(!this->is_max_align_known_
);
3800 this->update_flags_for_output_section(seg_flags
);
3802 this->output_lists_
[0].push_back(os
);
3805 // Remove an Output_section from this segment. It is an error if it
3809 Output_segment::remove_output_section(Output_section
* os
)
3811 for (int i
= 0; i
< static_cast<int>(ORDER_MAX
); ++i
)
3813 Output_data_list
* pdl
= &this->output_lists_
[i
];
3814 for (Output_data_list::iterator p
= pdl
->begin(); p
!= pdl
->end(); ++p
)
3826 // Add an Output_data (which need not be an Output_section) to the
3827 // start of a segment.
3830 Output_segment::add_initial_output_data(Output_data
* od
)
3832 gold_assert(!this->is_max_align_known_
);
3833 Output_data_list::iterator p
= this->output_lists_
[0].begin();
3834 this->output_lists_
[0].insert(p
, od
);
3837 // Return true if this segment has any sections which hold actual
3838 // data, rather than being a BSS section.
3841 Output_segment::has_any_data_sections() const
3843 for (int i
= 0; i
< static_cast<int>(ORDER_MAX
); ++i
)
3845 const Output_data_list
* pdl
= &this->output_lists_
[i
];
3846 for (Output_data_list::const_iterator p
= pdl
->begin();
3850 if (!(*p
)->is_section())
3852 if ((*p
)->output_section()->type() != elfcpp::SHT_NOBITS
)
3859 // Return whether the first data section (not counting TLS sections)
3860 // is a relro section.
3863 Output_segment::is_first_section_relro() const
3865 for (int i
= 0; i
< static_cast<int>(ORDER_MAX
); ++i
)
3867 if (i
== static_cast<int>(ORDER_TLS_DATA
)
3868 || i
== static_cast<int>(ORDER_TLS_BSS
))
3870 const Output_data_list
* pdl
= &this->output_lists_
[i
];
3873 Output_data
* p
= pdl
->front();
3874 return p
->is_section() && p
->output_section()->is_relro();
3880 // Return the maximum alignment of the Output_data in Output_segment.
3883 Output_segment::maximum_alignment()
3885 if (!this->is_max_align_known_
)
3887 for (int i
= 0; i
< static_cast<int>(ORDER_MAX
); ++i
)
3889 const Output_data_list
* pdl
= &this->output_lists_
[i
];
3890 uint64_t addralign
= Output_segment::maximum_alignment_list(pdl
);
3891 if (addralign
> this->max_align_
)
3892 this->max_align_
= addralign
;
3894 this->is_max_align_known_
= true;
3897 return this->max_align_
;
3900 // Return the maximum alignment of a list of Output_data.
3903 Output_segment::maximum_alignment_list(const Output_data_list
* pdl
)
3906 for (Output_data_list::const_iterator p
= pdl
->begin();
3910 uint64_t addralign
= (*p
)->addralign();
3911 if (addralign
> ret
)
3917 // Return whether this segment has any dynamic relocs.
3920 Output_segment::has_dynamic_reloc() const
3922 for (int i
= 0; i
< static_cast<int>(ORDER_MAX
); ++i
)
3923 if (this->has_dynamic_reloc_list(&this->output_lists_
[i
]))
3928 // Return whether this Output_data_list has any dynamic relocs.
3931 Output_segment::has_dynamic_reloc_list(const Output_data_list
* pdl
) const
3933 for (Output_data_list::const_iterator p
= pdl
->begin();
3936 if ((*p
)->has_dynamic_reloc())
3941 // Set the section addresses for an Output_segment. If RESET is true,
3942 // reset the addresses first. ADDR is the address and *POFF is the
3943 // file offset. Set the section indexes starting with *PSHNDX.
3944 // INCREASE_RELRO is the size of the portion of the first non-relro
3945 // section that should be included in the PT_GNU_RELRO segment.
3946 // If this segment has relro sections, and has been aligned for
3947 // that purpose, set *HAS_RELRO to TRUE. Return the address of
3948 // the immediately following segment. Update *HAS_RELRO, *POFF,
3952 Output_segment::set_section_addresses(Layout
* layout
, bool reset
,
3954 unsigned int* increase_relro
,
3957 unsigned int* pshndx
)
3959 gold_assert(this->type_
== elfcpp::PT_LOAD
);
3961 uint64_t last_relro_pad
= 0;
3962 off_t orig_off
= *poff
;
3964 bool in_tls
= false;
3966 // If we have relro sections, we need to pad forward now so that the
3967 // relro sections plus INCREASE_RELRO end on a common page boundary.
3968 if (parameters
->options().relro()
3969 && this->is_first_section_relro()
3970 && (!this->are_addresses_set_
|| reset
))
3972 uint64_t relro_size
= 0;
3974 uint64_t max_align
= 0;
3975 for (int i
= 0; i
<= static_cast<int>(ORDER_RELRO_LAST
); ++i
)
3977 Output_data_list
* pdl
= &this->output_lists_
[i
];
3978 Output_data_list::iterator p
;
3979 for (p
= pdl
->begin(); p
!= pdl
->end(); ++p
)
3981 if (!(*p
)->is_section())
3983 uint64_t align
= (*p
)->addralign();
3984 if (align
> max_align
)
3986 if ((*p
)->is_section_flag_set(elfcpp::SHF_TLS
))
3990 // Align the first non-TLS section to the alignment
3991 // of the TLS segment.
3995 relro_size
= align_address(relro_size
, align
);
3996 // Ignore the size of the .tbss section.
3997 if ((*p
)->is_section_flag_set(elfcpp::SHF_TLS
)
3998 && (*p
)->is_section_type(elfcpp::SHT_NOBITS
))
4000 if ((*p
)->is_address_valid())
4001 relro_size
+= (*p
)->data_size();
4004 // FIXME: This could be faster.
4005 (*p
)->set_address_and_file_offset(addr
+ relro_size
,
4007 relro_size
+= (*p
)->data_size();
4008 (*p
)->reset_address_and_file_offset();
4011 if (p
!= pdl
->end())
4014 relro_size
+= *increase_relro
;
4015 // Pad the total relro size to a multiple of the maximum
4016 // section alignment seen.
4017 uint64_t aligned_size
= align_address(relro_size
, max_align
);
4018 // Note the amount of padding added after the last relro section.
4019 last_relro_pad
= aligned_size
- relro_size
;
4022 uint64_t page_align
= parameters
->target().common_pagesize();
4024 // Align to offset N such that (N + RELRO_SIZE) % PAGE_ALIGN == 0.
4025 uint64_t desired_align
= page_align
- (aligned_size
% page_align
);
4026 if (desired_align
< *poff
% page_align
)
4027 *poff
+= page_align
- *poff
% page_align
;
4028 *poff
+= desired_align
- *poff
% page_align
;
4029 addr
+= *poff
- orig_off
;
4033 if (!reset
&& this->are_addresses_set_
)
4035 gold_assert(this->paddr_
== addr
);
4036 addr
= this->vaddr_
;
4040 this->vaddr_
= addr
;
4041 this->paddr_
= addr
;
4042 this->are_addresses_set_
= true;
4047 this->offset_
= orig_off
;
4051 for (int i
= 0; i
< static_cast<int>(ORDER_MAX
); ++i
)
4053 if (i
== static_cast<int>(ORDER_RELRO_LAST
))
4055 *poff
+= last_relro_pad
;
4056 addr
+= last_relro_pad
;
4057 if (this->output_lists_
[i
].empty())
4059 // If there is nothing in the ORDER_RELRO_LAST list,
4060 // the padding will occur at the end of the relro
4061 // segment, and we need to add it to *INCREASE_RELRO.
4062 *increase_relro
+= last_relro_pad
;
4065 addr
= this->set_section_list_addresses(layout
, reset
,
4066 &this->output_lists_
[i
],
4067 addr
, poff
, pshndx
, &in_tls
);
4068 if (i
< static_cast<int>(ORDER_SMALL_BSS
))
4070 this->filesz_
= *poff
- orig_off
;
4077 // If the last section was a TLS section, align upward to the
4078 // alignment of the TLS segment, so that the overall size of the TLS
4079 // segment is aligned.
4082 uint64_t segment_align
= layout
->tls_segment()->maximum_alignment();
4083 *poff
= align_address(*poff
, segment_align
);
4086 this->memsz_
= *poff
- orig_off
;
4088 // Ignore the file offset adjustments made by the BSS Output_data
4095 // Set the addresses and file offsets in a list of Output_data
4099 Output_segment::set_section_list_addresses(Layout
* layout
, bool reset
,
4100 Output_data_list
* pdl
,
4101 uint64_t addr
, off_t
* poff
,
4102 unsigned int* pshndx
,
4105 off_t startoff
= *poff
;
4106 // For incremental updates, we may allocate non-fixed sections from
4107 // free space in the file. This keeps track of the high-water mark.
4108 off_t maxoff
= startoff
;
4110 off_t off
= startoff
;
4111 for (Output_data_list::iterator p
= pdl
->begin();
4116 (*p
)->reset_address_and_file_offset();
4118 // When doing an incremental update or when using a linker script,
4119 // the section will most likely already have an address.
4120 if (!(*p
)->is_address_valid())
4122 uint64_t align
= (*p
)->addralign();
4124 if ((*p
)->is_section_flag_set(elfcpp::SHF_TLS
))
4126 // Give the first TLS section the alignment of the
4127 // entire TLS segment. Otherwise the TLS segment as a
4128 // whole may be misaligned.
4131 Output_segment
* tls_segment
= layout
->tls_segment();
4132 gold_assert(tls_segment
!= NULL
);
4133 uint64_t segment_align
= tls_segment
->maximum_alignment();
4134 gold_assert(segment_align
>= align
);
4135 align
= segment_align
;
4142 // If this is the first section after the TLS segment,
4143 // align it to at least the alignment of the TLS
4144 // segment, so that the size of the overall TLS segment
4148 uint64_t segment_align
=
4149 layout
->tls_segment()->maximum_alignment();
4150 if (segment_align
> align
)
4151 align
= segment_align
;
4157 // FIXME: Need to handle TLS and .bss with incremental update.
4158 if (!parameters
->incremental_update()
4159 || (*p
)->is_section_flag_set(elfcpp::SHF_TLS
)
4160 || (*p
)->is_section_type(elfcpp::SHT_NOBITS
))
4162 off
= align_address(off
, align
);
4163 (*p
)->set_address_and_file_offset(addr
+ (off
- startoff
), off
);
4167 // Incremental update: allocate file space from free list.
4168 (*p
)->pre_finalize_data_size();
4169 off_t current_size
= (*p
)->current_data_size();
4170 off
= layout
->allocate(current_size
, align
, startoff
);
4173 gold_assert((*p
)->output_section() != NULL
);
4174 gold_fatal(_("out of patch space for section %s; "
4175 "relink with --incremental-full"),
4176 (*p
)->output_section()->name());
4178 (*p
)->set_address_and_file_offset(addr
+ (off
- startoff
), off
);
4179 if ((*p
)->data_size() > current_size
)
4181 gold_assert((*p
)->output_section() != NULL
);
4182 gold_fatal(_("%s: section changed size; "
4183 "relink with --incremental-full"),
4184 (*p
)->output_section()->name());
4188 else if (parameters
->incremental_update())
4190 // For incremental updates, use the fixed offset for the
4191 // high-water mark computation.
4192 off
= (*p
)->offset();
4196 // The script may have inserted a skip forward, but it
4197 // better not have moved backward.
4198 if ((*p
)->address() >= addr
+ (off
- startoff
))
4199 off
+= (*p
)->address() - (addr
+ (off
- startoff
));
4202 if (!layout
->script_options()->saw_sections_clause())
4206 Output_section
* os
= (*p
)->output_section();
4208 // Cast to unsigned long long to avoid format warnings.
4209 unsigned long long previous_dot
=
4210 static_cast<unsigned long long>(addr
+ (off
- startoff
));
4211 unsigned long long dot
=
4212 static_cast<unsigned long long>((*p
)->address());
4215 gold_error(_("dot moves backward in linker script "
4216 "from 0x%llx to 0x%llx"), previous_dot
, dot
);
4218 gold_error(_("address of section '%s' moves backward "
4219 "from 0x%llx to 0x%llx"),
4220 os
->name(), previous_dot
, dot
);
4223 (*p
)->set_file_offset(off
);
4224 (*p
)->finalize_data_size();
4227 gold_debug(DEBUG_INCREMENTAL
,
4228 "set_section_list_addresses: %08lx %08lx %s",
4229 static_cast<long>(off
),
4230 static_cast<long>((*p
)->data_size()),
4231 ((*p
)->output_section() != NULL
4232 ? (*p
)->output_section()->name() : "(special)"));
4234 // We want to ignore the size of a SHF_TLS or SHT_NOBITS
4235 // section. Such a section does not affect the size of a
4237 if (!(*p
)->is_section_flag_set(elfcpp::SHF_TLS
)
4238 || !(*p
)->is_section_type(elfcpp::SHT_NOBITS
))
4239 off
+= (*p
)->data_size();
4244 if ((*p
)->is_section())
4246 (*p
)->set_out_shndx(*pshndx
);
4252 return addr
+ (maxoff
- startoff
);
4255 // For a non-PT_LOAD segment, set the offset from the sections, if
4256 // any. Add INCREASE to the file size and the memory size.
4259 Output_segment::set_offset(unsigned int increase
)
4261 gold_assert(this->type_
!= elfcpp::PT_LOAD
);
4263 gold_assert(!this->are_addresses_set_
);
4265 // A non-load section only uses output_lists_[0].
4267 Output_data_list
* pdl
= &this->output_lists_
[0];
4271 gold_assert(increase
== 0);
4274 this->are_addresses_set_
= true;
4276 this->min_p_align_
= 0;
4282 // Find the first and last section by address.
4283 const Output_data
* first
= NULL
;
4284 const Output_data
* last_data
= NULL
;
4285 const Output_data
* last_bss
= NULL
;
4286 for (Output_data_list::const_iterator p
= pdl
->begin();
4291 || (*p
)->address() < first
->address()
4292 || ((*p
)->address() == first
->address()
4293 && (*p
)->data_size() < first
->data_size()))
4295 const Output_data
** plast
;
4296 if ((*p
)->is_section()
4297 && (*p
)->output_section()->type() == elfcpp::SHT_NOBITS
)
4302 || (*p
)->address() > (*plast
)->address()
4303 || ((*p
)->address() == (*plast
)->address()
4304 && (*p
)->data_size() > (*plast
)->data_size()))
4308 this->vaddr_
= first
->address();
4309 this->paddr_
= (first
->has_load_address()
4310 ? first
->load_address()
4312 this->are_addresses_set_
= true;
4313 this->offset_
= first
->offset();
4315 if (last_data
== NULL
)
4318 this->filesz_
= (last_data
->address()
4319 + last_data
->data_size()
4322 const Output_data
* last
= last_bss
!= NULL
? last_bss
: last_data
;
4323 this->memsz_
= (last
->address()
4327 this->filesz_
+= increase
;
4328 this->memsz_
+= increase
;
4330 // If this is a RELRO segment, verify that the segment ends at a
4332 if (this->type_
== elfcpp::PT_GNU_RELRO
)
4334 uint64_t page_align
= parameters
->target().common_pagesize();
4335 uint64_t segment_end
= this->vaddr_
+ this->memsz_
;
4336 if (parameters
->incremental_update())
4338 // The INCREASE_RELRO calculation is bypassed for an incremental
4339 // update, so we need to adjust the segment size manually here.
4340 segment_end
= align_address(segment_end
, page_align
);
4341 this->memsz_
= segment_end
- this->vaddr_
;
4344 gold_assert(segment_end
== align_address(segment_end
, page_align
));
4347 // If this is a TLS segment, align the memory size. The code in
4348 // set_section_list ensures that the section after the TLS segment
4349 // is aligned to give us room.
4350 if (this->type_
== elfcpp::PT_TLS
)
4352 uint64_t segment_align
= this->maximum_alignment();
4353 gold_assert(this->vaddr_
== align_address(this->vaddr_
, segment_align
));
4354 this->memsz_
= align_address(this->memsz_
, segment_align
);
4358 // Set the TLS offsets of the sections in the PT_TLS segment.
4361 Output_segment::set_tls_offsets()
4363 gold_assert(this->type_
== elfcpp::PT_TLS
);
4365 for (Output_data_list::iterator p
= this->output_lists_
[0].begin();
4366 p
!= this->output_lists_
[0].end();
4368 (*p
)->set_tls_offset(this->vaddr_
);
4371 // Return the load address of the first section.
4374 Output_segment::first_section_load_address() const
4376 for (int i
= 0; i
< static_cast<int>(ORDER_MAX
); ++i
)
4378 const Output_data_list
* pdl
= &this->output_lists_
[i
];
4379 for (Output_data_list::const_iterator p
= pdl
->begin();
4383 if ((*p
)->is_section())
4384 return ((*p
)->has_load_address()
4385 ? (*p
)->load_address()
4392 // Return the number of Output_sections in an Output_segment.
4395 Output_segment::output_section_count() const
4397 unsigned int ret
= 0;
4398 for (int i
= 0; i
< static_cast<int>(ORDER_MAX
); ++i
)
4399 ret
+= this->output_section_count_list(&this->output_lists_
[i
]);
4403 // Return the number of Output_sections in an Output_data_list.
4406 Output_segment::output_section_count_list(const Output_data_list
* pdl
) const
4408 unsigned int count
= 0;
4409 for (Output_data_list::const_iterator p
= pdl
->begin();
4413 if ((*p
)->is_section())
4419 // Return the section attached to the list segment with the lowest
4420 // load address. This is used when handling a PHDRS clause in a
4424 Output_segment::section_with_lowest_load_address() const
4426 Output_section
* found
= NULL
;
4427 uint64_t found_lma
= 0;
4428 for (int i
= 0; i
< static_cast<int>(ORDER_MAX
); ++i
)
4429 this->lowest_load_address_in_list(&this->output_lists_
[i
], &found
,
4434 // Look through a list for a section with a lower load address.
4437 Output_segment::lowest_load_address_in_list(const Output_data_list
* pdl
,
4438 Output_section
** found
,
4439 uint64_t* found_lma
) const
4441 for (Output_data_list::const_iterator p
= pdl
->begin();
4445 if (!(*p
)->is_section())
4447 Output_section
* os
= static_cast<Output_section
*>(*p
);
4448 uint64_t lma
= (os
->has_load_address()
4449 ? os
->load_address()
4451 if (*found
== NULL
|| lma
< *found_lma
)
4459 // Write the segment data into *OPHDR.
4461 template<int size
, bool big_endian
>
4463 Output_segment::write_header(elfcpp::Phdr_write
<size
, big_endian
>* ophdr
)
4465 ophdr
->put_p_type(this->type_
);
4466 ophdr
->put_p_offset(this->offset_
);
4467 ophdr
->put_p_vaddr(this->vaddr_
);
4468 ophdr
->put_p_paddr(this->paddr_
);
4469 ophdr
->put_p_filesz(this->filesz_
);
4470 ophdr
->put_p_memsz(this->memsz_
);
4471 ophdr
->put_p_flags(this->flags_
);
4472 ophdr
->put_p_align(std::max(this->min_p_align_
, this->maximum_alignment()));
4475 // Write the section headers into V.
4477 template<int size
, bool big_endian
>
4479 Output_segment::write_section_headers(const Layout
* layout
,
4480 const Stringpool
* secnamepool
,
4482 unsigned int* pshndx
) const
4484 // Every section that is attached to a segment must be attached to a
4485 // PT_LOAD segment, so we only write out section headers for PT_LOAD
4487 if (this->type_
!= elfcpp::PT_LOAD
)
4490 for (int i
= 0; i
< static_cast<int>(ORDER_MAX
); ++i
)
4492 const Output_data_list
* pdl
= &this->output_lists_
[i
];
4493 v
= this->write_section_headers_list
<size
, big_endian
>(layout
,
4502 template<int size
, bool big_endian
>
4504 Output_segment::write_section_headers_list(const Layout
* layout
,
4505 const Stringpool
* secnamepool
,
4506 const Output_data_list
* pdl
,
4508 unsigned int* pshndx
) const
4510 const int shdr_size
= elfcpp::Elf_sizes
<size
>::shdr_size
;
4511 for (Output_data_list::const_iterator p
= pdl
->begin();
4515 if ((*p
)->is_section())
4517 const Output_section
* ps
= static_cast<const Output_section
*>(*p
);
4518 gold_assert(*pshndx
== ps
->out_shndx());
4519 elfcpp::Shdr_write
<size
, big_endian
> oshdr(v
);
4520 ps
->write_header(layout
, secnamepool
, &oshdr
);
4528 // Print the output sections to the map file.
4531 Output_segment::print_sections_to_mapfile(Mapfile
* mapfile
) const
4533 if (this->type() != elfcpp::PT_LOAD
)
4535 for (int i
= 0; i
< static_cast<int>(ORDER_MAX
); ++i
)
4536 this->print_section_list_to_mapfile(mapfile
, &this->output_lists_
[i
]);
4539 // Print an output section list to the map file.
4542 Output_segment::print_section_list_to_mapfile(Mapfile
* mapfile
,
4543 const Output_data_list
* pdl
) const
4545 for (Output_data_list::const_iterator p
= pdl
->begin();
4548 (*p
)->print_to_mapfile(mapfile
);
4551 // Output_file methods.
4553 Output_file::Output_file(const char* name
)
4558 map_is_anonymous_(false),
4559 map_is_allocated_(false),
4560 is_temporary_(false)
4564 // Try to open an existing file. Returns false if the file doesn't
4565 // exist, has a size of 0 or can't be mmapped.
4568 Output_file::open_for_modification()
4570 // The name "-" means "stdout".
4571 if (strcmp(this->name_
, "-") == 0)
4574 // Don't bother opening files with a size of zero.
4576 if (::stat(this->name_
, &s
) != 0 || s
.st_size
== 0)
4579 int o
= open_descriptor(-1, this->name_
, O_RDWR
, 0);
4581 gold_fatal(_("%s: open: %s"), this->name_
, strerror(errno
));
4583 this->file_size_
= s
.st_size
;
4585 // If the file can't be mmapped, copying the content to an anonymous
4586 // map will probably negate the performance benefits of incremental
4587 // linking. This could be helped by using views and loading only
4588 // the necessary parts, but this is not supported as of now.
4589 if (!this->map_no_anonymous())
4591 release_descriptor(o
, true);
4593 this->file_size_
= 0;
4600 // Open the output file.
4603 Output_file::open(off_t file_size
)
4605 this->file_size_
= file_size
;
4607 // Unlink the file first; otherwise the open() may fail if the file
4608 // is busy (e.g. it's an executable that's currently being executed).
4610 // However, the linker may be part of a system where a zero-length
4611 // file is created for it to write to, with tight permissions (gcc
4612 // 2.95 did something like this). Unlinking the file would work
4613 // around those permission controls, so we only unlink if the file
4614 // has a non-zero size. We also unlink only regular files to avoid
4615 // trouble with directories/etc.
4617 // If we fail, continue; this command is merely a best-effort attempt
4618 // to improve the odds for open().
4620 // We let the name "-" mean "stdout"
4621 if (!this->is_temporary_
)
4623 if (strcmp(this->name_
, "-") == 0)
4624 this->o_
= STDOUT_FILENO
;
4628 if (::stat(this->name_
, &s
) == 0
4629 && (S_ISREG (s
.st_mode
) || S_ISLNK (s
.st_mode
)))
4632 ::unlink(this->name_
);
4633 else if (!parameters
->options().relocatable())
4635 // If we don't unlink the existing file, add execute
4636 // permission where read permissions already exist
4637 // and where the umask permits.
4638 int mask
= ::umask(0);
4640 s
.st_mode
|= (s
.st_mode
& 0444) >> 2;
4641 ::chmod(this->name_
, s
.st_mode
& ~mask
);
4645 int mode
= parameters
->options().relocatable() ? 0666 : 0777;
4646 int o
= open_descriptor(-1, this->name_
, O_RDWR
| O_CREAT
| O_TRUNC
,
4649 gold_fatal(_("%s: open: %s"), this->name_
, strerror(errno
));
4657 // Resize the output file.
4660 Output_file::resize(off_t file_size
)
4662 // If the mmap is mapping an anonymous memory buffer, this is easy:
4663 // just mremap to the new size. If it's mapping to a file, we want
4664 // to unmap to flush to the file, then remap after growing the file.
4665 if (this->map_is_anonymous_
)
4668 if (!this->map_is_allocated_
)
4670 base
= ::mremap(this->base_
, this->file_size_
, file_size
,
4672 if (base
== MAP_FAILED
)
4673 gold_fatal(_("%s: mremap: %s"), this->name_
, strerror(errno
));
4677 base
= realloc(this->base_
, file_size
);
4680 if (file_size
> this->file_size_
)
4681 memset(static_cast<char*>(base
) + this->file_size_
, 0,
4682 file_size
- this->file_size_
);
4684 this->base_
= static_cast<unsigned char*>(base
);
4685 this->file_size_
= file_size
;
4690 this->file_size_
= file_size
;
4691 if (!this->map_no_anonymous())
4692 gold_fatal(_("%s: mmap: %s"), this->name_
, strerror(errno
));
4696 // Map an anonymous block of memory which will later be written to the
4697 // file. Return whether the map succeeded.
4700 Output_file::map_anonymous()
4702 void* base
= ::mmap(NULL
, this->file_size_
, PROT_READ
| PROT_WRITE
,
4703 MAP_PRIVATE
| MAP_ANONYMOUS
, -1, 0);
4704 if (base
== MAP_FAILED
)
4706 base
= malloc(this->file_size_
);
4709 memset(base
, 0, this->file_size_
);
4710 this->map_is_allocated_
= true;
4712 this->base_
= static_cast<unsigned char*>(base
);
4713 this->map_is_anonymous_
= true;
4717 // Map the file into memory. Return whether the mapping succeeded.
4720 Output_file::map_no_anonymous()
4722 const int o
= this->o_
;
4724 // If the output file is not a regular file, don't try to mmap it;
4725 // instead, we'll mmap a block of memory (an anonymous buffer), and
4726 // then later write the buffer to the file.
4728 struct stat statbuf
;
4729 if (o
== STDOUT_FILENO
|| o
== STDERR_FILENO
4730 || ::fstat(o
, &statbuf
) != 0
4731 || !S_ISREG(statbuf
.st_mode
)
4732 || this->is_temporary_
)
4735 // Ensure that we have disk space available for the file. If we
4736 // don't do this, it is possible that we will call munmap, close,
4737 // and exit with dirty buffers still in the cache with no assigned
4738 // disk blocks. If the disk is out of space at that point, the
4739 // output file will wind up incomplete, but we will have already
4740 // exited. The alternative to fallocate would be to use fdatasync,
4741 // but that would be a more significant performance hit.
4742 if (::posix_fallocate(o
, 0, this->file_size_
) < 0)
4743 gold_fatal(_("%s: %s"), this->name_
, strerror(errno
));
4745 // Map the file into memory.
4746 base
= ::mmap(NULL
, this->file_size_
, PROT_READ
| PROT_WRITE
,
4749 // The mmap call might fail because of file system issues: the file
4750 // system might not support mmap at all, or it might not support
4751 // mmap with PROT_WRITE.
4752 if (base
== MAP_FAILED
)
4755 this->map_is_anonymous_
= false;
4756 this->base_
= static_cast<unsigned char*>(base
);
4760 // Map the file into memory.
4765 if (this->map_no_anonymous())
4768 // The mmap call might fail because of file system issues: the file
4769 // system might not support mmap at all, or it might not support
4770 // mmap with PROT_WRITE. I'm not sure which errno values we will
4771 // see in all cases, so if the mmap fails for any reason and we
4772 // don't care about file contents, try for an anonymous map.
4773 if (this->map_anonymous())
4776 gold_fatal(_("%s: mmap: failed to allocate %lu bytes for output file: %s"),
4777 this->name_
, static_cast<unsigned long>(this->file_size_
),
4781 // Unmap the file from memory.
4784 Output_file::unmap()
4786 if (this->map_is_anonymous_
)
4788 // We've already written out the data, so there is no reason to
4789 // waste time unmapping or freeing the memory.
4793 if (::munmap(this->base_
, this->file_size_
) < 0)
4794 gold_error(_("%s: munmap: %s"), this->name_
, strerror(errno
));
4799 // Close the output file.
4802 Output_file::close()
4804 // If the map isn't file-backed, we need to write it now.
4805 if (this->map_is_anonymous_
&& !this->is_temporary_
)
4807 size_t bytes_to_write
= this->file_size_
;
4809 while (bytes_to_write
> 0)
4811 ssize_t bytes_written
= ::write(this->o_
, this->base_
+ offset
,
4813 if (bytes_written
== 0)
4814 gold_error(_("%s: write: unexpected 0 return-value"), this->name_
);
4815 else if (bytes_written
< 0)
4816 gold_error(_("%s: write: %s"), this->name_
, strerror(errno
));
4819 bytes_to_write
-= bytes_written
;
4820 offset
+= bytes_written
;
4826 // We don't close stdout or stderr
4827 if (this->o_
!= STDOUT_FILENO
4828 && this->o_
!= STDERR_FILENO
4829 && !this->is_temporary_
)
4830 if (::close(this->o_
) < 0)
4831 gold_error(_("%s: close: %s"), this->name_
, strerror(errno
));
4835 // Instantiate the templates we need. We could use the configure
4836 // script to restrict this to only the ones for implemented targets.
4838 #ifdef HAVE_TARGET_32_LITTLE
4841 Output_section::add_input_section
<32, false>(
4843 Sized_relobj_file
<32, false>* object
,
4845 const char* secname
,
4846 const elfcpp::Shdr
<32, false>& shdr
,
4847 unsigned int reloc_shndx
,
4848 bool have_sections_script
);
4851 #ifdef HAVE_TARGET_32_BIG
4854 Output_section::add_input_section
<32, true>(
4856 Sized_relobj_file
<32, true>* object
,
4858 const char* secname
,
4859 const elfcpp::Shdr
<32, true>& shdr
,
4860 unsigned int reloc_shndx
,
4861 bool have_sections_script
);
4864 #ifdef HAVE_TARGET_64_LITTLE
4867 Output_section::add_input_section
<64, false>(
4869 Sized_relobj_file
<64, false>* object
,
4871 const char* secname
,
4872 const elfcpp::Shdr
<64, false>& shdr
,
4873 unsigned int reloc_shndx
,
4874 bool have_sections_script
);
4877 #ifdef HAVE_TARGET_64_BIG
4880 Output_section::add_input_section
<64, true>(
4882 Sized_relobj_file
<64, true>* object
,
4884 const char* secname
,
4885 const elfcpp::Shdr
<64, true>& shdr
,
4886 unsigned int reloc_shndx
,
4887 bool have_sections_script
);
4890 #ifdef HAVE_TARGET_32_LITTLE
4892 class Output_reloc
<elfcpp::SHT_REL
, false, 32, false>;
4895 #ifdef HAVE_TARGET_32_BIG
4897 class Output_reloc
<elfcpp::SHT_REL
, false, 32, true>;
4900 #ifdef HAVE_TARGET_64_LITTLE
4902 class Output_reloc
<elfcpp::SHT_REL
, false, 64, false>;
4905 #ifdef HAVE_TARGET_64_BIG
4907 class Output_reloc
<elfcpp::SHT_REL
, false, 64, true>;
4910 #ifdef HAVE_TARGET_32_LITTLE
4912 class Output_reloc
<elfcpp::SHT_REL
, true, 32, false>;
4915 #ifdef HAVE_TARGET_32_BIG
4917 class Output_reloc
<elfcpp::SHT_REL
, true, 32, true>;
4920 #ifdef HAVE_TARGET_64_LITTLE
4922 class Output_reloc
<elfcpp::SHT_REL
, true, 64, false>;
4925 #ifdef HAVE_TARGET_64_BIG
4927 class Output_reloc
<elfcpp::SHT_REL
, true, 64, true>;
4930 #ifdef HAVE_TARGET_32_LITTLE
4932 class Output_reloc
<elfcpp::SHT_RELA
, false, 32, false>;
4935 #ifdef HAVE_TARGET_32_BIG
4937 class Output_reloc
<elfcpp::SHT_RELA
, false, 32, true>;
4940 #ifdef HAVE_TARGET_64_LITTLE
4942 class Output_reloc
<elfcpp::SHT_RELA
, false, 64, false>;
4945 #ifdef HAVE_TARGET_64_BIG
4947 class Output_reloc
<elfcpp::SHT_RELA
, false, 64, true>;
4950 #ifdef HAVE_TARGET_32_LITTLE
4952 class Output_reloc
<elfcpp::SHT_RELA
, true, 32, false>;
4955 #ifdef HAVE_TARGET_32_BIG
4957 class Output_reloc
<elfcpp::SHT_RELA
, true, 32, true>;
4960 #ifdef HAVE_TARGET_64_LITTLE
4962 class Output_reloc
<elfcpp::SHT_RELA
, true, 64, false>;
4965 #ifdef HAVE_TARGET_64_BIG
4967 class Output_reloc
<elfcpp::SHT_RELA
, true, 64, true>;
4970 #ifdef HAVE_TARGET_32_LITTLE
4972 class Output_data_reloc
<elfcpp::SHT_REL
, false, 32, false>;
4975 #ifdef HAVE_TARGET_32_BIG
4977 class Output_data_reloc
<elfcpp::SHT_REL
, false, 32, true>;
4980 #ifdef HAVE_TARGET_64_LITTLE
4982 class Output_data_reloc
<elfcpp::SHT_REL
, false, 64, false>;
4985 #ifdef HAVE_TARGET_64_BIG
4987 class Output_data_reloc
<elfcpp::SHT_REL
, false, 64, true>;
4990 #ifdef HAVE_TARGET_32_LITTLE
4992 class Output_data_reloc
<elfcpp::SHT_REL
, true, 32, false>;
4995 #ifdef HAVE_TARGET_32_BIG
4997 class Output_data_reloc
<elfcpp::SHT_REL
, true, 32, true>;
5000 #ifdef HAVE_TARGET_64_LITTLE
5002 class Output_data_reloc
<elfcpp::SHT_REL
, true, 64, false>;
5005 #ifdef HAVE_TARGET_64_BIG
5007 class Output_data_reloc
<elfcpp::SHT_REL
, true, 64, true>;
5010 #ifdef HAVE_TARGET_32_LITTLE
5012 class Output_data_reloc
<elfcpp::SHT_RELA
, false, 32, false>;
5015 #ifdef HAVE_TARGET_32_BIG
5017 class Output_data_reloc
<elfcpp::SHT_RELA
, false, 32, true>;
5020 #ifdef HAVE_TARGET_64_LITTLE
5022 class Output_data_reloc
<elfcpp::SHT_RELA
, false, 64, false>;
5025 #ifdef HAVE_TARGET_64_BIG
5027 class Output_data_reloc
<elfcpp::SHT_RELA
, false, 64, true>;
5030 #ifdef HAVE_TARGET_32_LITTLE
5032 class Output_data_reloc
<elfcpp::SHT_RELA
, true, 32, false>;
5035 #ifdef HAVE_TARGET_32_BIG
5037 class Output_data_reloc
<elfcpp::SHT_RELA
, true, 32, true>;
5040 #ifdef HAVE_TARGET_64_LITTLE
5042 class Output_data_reloc
<elfcpp::SHT_RELA
, true, 64, false>;
5045 #ifdef HAVE_TARGET_64_BIG
5047 class Output_data_reloc
<elfcpp::SHT_RELA
, true, 64, true>;
5050 #ifdef HAVE_TARGET_32_LITTLE
5052 class Output_relocatable_relocs
<elfcpp::SHT_REL
, 32, false>;
5055 #ifdef HAVE_TARGET_32_BIG
5057 class Output_relocatable_relocs
<elfcpp::SHT_REL
, 32, true>;
5060 #ifdef HAVE_TARGET_64_LITTLE
5062 class Output_relocatable_relocs
<elfcpp::SHT_REL
, 64, false>;
5065 #ifdef HAVE_TARGET_64_BIG
5067 class Output_relocatable_relocs
<elfcpp::SHT_REL
, 64, true>;
5070 #ifdef HAVE_TARGET_32_LITTLE
5072 class Output_relocatable_relocs
<elfcpp::SHT_RELA
, 32, false>;
5075 #ifdef HAVE_TARGET_32_BIG
5077 class Output_relocatable_relocs
<elfcpp::SHT_RELA
, 32, true>;
5080 #ifdef HAVE_TARGET_64_LITTLE
5082 class Output_relocatable_relocs
<elfcpp::SHT_RELA
, 64, false>;
5085 #ifdef HAVE_TARGET_64_BIG
5087 class Output_relocatable_relocs
<elfcpp::SHT_RELA
, 64, true>;
5090 #ifdef HAVE_TARGET_32_LITTLE
5092 class Output_data_group
<32, false>;
5095 #ifdef HAVE_TARGET_32_BIG
5097 class Output_data_group
<32, true>;
5100 #ifdef HAVE_TARGET_64_LITTLE
5102 class Output_data_group
<64, false>;
5105 #ifdef HAVE_TARGET_64_BIG
5107 class Output_data_group
<64, true>;
5110 #ifdef HAVE_TARGET_32_LITTLE
5112 class Output_data_got
<32, false>;
5115 #ifdef HAVE_TARGET_32_BIG
5117 class Output_data_got
<32, true>;
5120 #ifdef HAVE_TARGET_64_LITTLE
5122 class Output_data_got
<64, false>;
5125 #ifdef HAVE_TARGET_64_BIG
5127 class Output_data_got
<64, true>;
5130 } // End namespace gold.