1 // dynobj.cc -- dynamic object support for gold
3 // Copyright 2006, 2007, 2008 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.
29 #include "parameters.h"
39 // Sets up the default soname_ to use, in the (rare) cases we never
40 // see a DT_SONAME entry.
42 Dynobj::Dynobj(const std::string
& name
, Input_file
* input_file
, off_t offset
)
43 : Object(name
, input_file
, true, offset
),
45 unknown_needed_(UNKNOWN_NEEDED_UNSET
)
47 // This will be overridden by a DT_SONAME entry, hopefully. But if
48 // we never see a DT_SONAME entry, our rule is to use the dynamic
49 // object's filename. The only exception is when the dynamic object
50 // is part of an archive (so the filename is the archive's
51 // filename). In that case, we use just the dynobj's name-in-archive.
52 this->soname_
= this->input_file()->found_name();
53 if (this->offset() != 0)
55 std::string::size_type open_paren
= this->name().find('(');
56 std::string::size_type close_paren
= this->name().find(')');
57 if (open_paren
!= std::string::npos
&& close_paren
!= std::string::npos
)
59 // It's an archive, and name() is of the form 'foo.a(bar.so)'.
60 this->soname_
= this->name().substr(open_paren
+ 1,
61 close_paren
- (open_paren
+ 1));
66 // Class Sized_dynobj.
68 template<int size
, bool big_endian
>
69 Sized_dynobj
<size
, big_endian
>::Sized_dynobj(
70 const std::string
& name
,
71 Input_file
* input_file
,
73 const elfcpp::Ehdr
<size
, big_endian
>& ehdr
)
74 : Dynobj(name
, input_file
, offset
),
75 elf_file_(this, ehdr
),
82 template<int size
, bool big_endian
>
84 Sized_dynobj
<size
, big_endian
>::setup(
85 const elfcpp::Ehdr
<size
, big_endian
>& ehdr
)
87 this->set_target(ehdr
.get_e_machine(), size
, big_endian
,
88 ehdr
.get_e_ident()[elfcpp::EI_OSABI
],
89 ehdr
.get_e_ident()[elfcpp::EI_ABIVERSION
]);
91 const unsigned int shnum
= this->elf_file_
.shnum();
92 this->set_shnum(shnum
);
95 // Find the SHT_DYNSYM section and the various version sections, and
96 // the dynamic section, given the section headers.
98 template<int size
, bool big_endian
>
100 Sized_dynobj
<size
, big_endian
>::find_dynsym_sections(
101 const unsigned char* pshdrs
,
102 unsigned int* pversym_shndx
,
103 unsigned int* pverdef_shndx
,
104 unsigned int* pverneed_shndx
,
105 unsigned int* pdynamic_shndx
)
107 *pversym_shndx
= -1U;
108 *pverdef_shndx
= -1U;
109 *pverneed_shndx
= -1U;
110 *pdynamic_shndx
= -1U;
112 unsigned int xindex_shndx
= 0;
113 unsigned int xindex_link
= 0;
114 const unsigned int shnum
= this->shnum();
115 const unsigned char* p
= pshdrs
;
116 for (unsigned int i
= 0; i
< shnum
; ++i
, p
+= This::shdr_size
)
118 typename
This::Shdr
shdr(p
);
121 switch (shdr
.get_sh_type())
123 case elfcpp::SHT_DYNSYM
:
124 this->dynsym_shndx_
= i
;
125 if (xindex_shndx
> 0 && xindex_link
== i
)
127 Xindex
* xindex
= new Xindex(this->elf_file_
.large_shndx_offset());
128 xindex
->read_symtab_xindex
<size
, big_endian
>(this, xindex_shndx
,
130 this->set_xindex(xindex
);
134 case elfcpp::SHT_GNU_versym
:
137 case elfcpp::SHT_GNU_verdef
:
140 case elfcpp::SHT_GNU_verneed
:
143 case elfcpp::SHT_DYNAMIC
:
146 case elfcpp::SHT_SYMTAB_SHNDX
:
148 xindex_link
= this->adjust_shndx(shdr
.get_sh_link());
149 if (xindex_link
== this->dynsym_shndx_
)
151 Xindex
* xindex
= new Xindex(this->elf_file_
.large_shndx_offset());
152 xindex
->read_symtab_xindex
<size
, big_endian
>(this, xindex_shndx
,
154 this->set_xindex(xindex
);
167 this->error(_("unexpected duplicate type %u section: %u, %u"),
168 shdr
.get_sh_type(), *pi
, i
);
174 // Read the contents of section SHNDX. PSHDRS points to the section
175 // headers. TYPE is the expected section type. LINK is the expected
176 // section link. Store the data in *VIEW and *VIEW_SIZE. The
177 // section's sh_info field is stored in *VIEW_INFO.
179 template<int size
, bool big_endian
>
181 Sized_dynobj
<size
, big_endian
>::read_dynsym_section(
182 const unsigned char* pshdrs
,
187 section_size_type
* view_size
,
188 unsigned int* view_info
)
198 typename
This::Shdr
shdr(pshdrs
+ shndx
* This::shdr_size
);
200 gold_assert(shdr
.get_sh_type() == type
);
202 if (this->adjust_shndx(shdr
.get_sh_link()) != link
)
203 this->error(_("unexpected link in section %u header: %u != %u"),
204 shndx
, this->adjust_shndx(shdr
.get_sh_link()), link
);
206 *view
= this->get_lasting_view(shdr
.get_sh_offset(), shdr
.get_sh_size(),
208 *view_size
= convert_to_section_size_type(shdr
.get_sh_size());
209 *view_info
= shdr
.get_sh_info();
212 // Read the dynamic tags. Set the soname field if this shared object
213 // has a DT_SONAME tag. Record the DT_NEEDED tags. PSHDRS points to
214 // the section headers. DYNAMIC_SHNDX is the section index of the
215 // SHT_DYNAMIC section. STRTAB_SHNDX, STRTAB, and STRTAB_SIZE are the
216 // section index and contents of a string table which may be the one
217 // associated with the SHT_DYNAMIC section.
219 template<int size
, bool big_endian
>
221 Sized_dynobj
<size
, big_endian
>::read_dynamic(const unsigned char* pshdrs
,
222 unsigned int dynamic_shndx
,
223 unsigned int strtab_shndx
,
224 const unsigned char* strtabu
,
227 typename
This::Shdr
dynamicshdr(pshdrs
+ dynamic_shndx
* This::shdr_size
);
228 gold_assert(dynamicshdr
.get_sh_type() == elfcpp::SHT_DYNAMIC
);
230 const off_t dynamic_size
= dynamicshdr
.get_sh_size();
231 const unsigned char* pdynamic
= this->get_view(dynamicshdr
.get_sh_offset(),
232 dynamic_size
, true, false);
234 const unsigned int link
= this->adjust_shndx(dynamicshdr
.get_sh_link());
235 if (link
!= strtab_shndx
)
237 if (link
>= this->shnum())
239 this->error(_("DYNAMIC section %u link out of range: %u"),
240 dynamic_shndx
, link
);
244 typename
This::Shdr
strtabshdr(pshdrs
+ link
* This::shdr_size
);
245 if (strtabshdr
.get_sh_type() != elfcpp::SHT_STRTAB
)
247 this->error(_("DYNAMIC section %u link %u is not a strtab"),
248 dynamic_shndx
, link
);
252 strtab_size
= strtabshdr
.get_sh_size();
253 strtabu
= this->get_view(strtabshdr
.get_sh_offset(), strtab_size
, false,
257 const char* const strtab
= reinterpret_cast<const char*>(strtabu
);
259 for (const unsigned char* p
= pdynamic
;
260 p
< pdynamic
+ dynamic_size
;
263 typename
This::Dyn
dyn(p
);
265 switch (dyn
.get_d_tag())
267 case elfcpp::DT_NULL
:
268 // We should always see DT_NULL at the end of the dynamic
272 case elfcpp::DT_SONAME
:
274 off_t val
= dyn
.get_d_val();
275 if (val
>= strtab_size
)
276 this->error(_("DT_SONAME value out of range: %lld >= %lld"),
277 static_cast<long long>(val
),
278 static_cast<long long>(strtab_size
));
280 this->set_soname_string(strtab
+ val
);
284 case elfcpp::DT_NEEDED
:
286 off_t val
= dyn
.get_d_val();
287 if (val
>= strtab_size
)
288 this->error(_("DT_NEEDED value out of range: %lld >= %lld"),
289 static_cast<long long>(val
),
290 static_cast<long long>(strtab_size
));
292 this->add_needed(strtab
+ val
);
301 this->error(_("missing DT_NULL in dynamic segment"));
304 // Read the symbols and sections from a dynamic object. We read the
305 // dynamic symbols, not the normal symbols.
307 template<int size
, bool big_endian
>
309 Sized_dynobj
<size
, big_endian
>::do_read_symbols(Read_symbols_data
* sd
)
311 this->read_section_data(&this->elf_file_
, sd
);
313 const unsigned char* const pshdrs
= sd
->section_headers
->data();
315 unsigned int versym_shndx
;
316 unsigned int verdef_shndx
;
317 unsigned int verneed_shndx
;
318 unsigned int dynamic_shndx
;
319 this->find_dynsym_sections(pshdrs
, &versym_shndx
, &verdef_shndx
,
320 &verneed_shndx
, &dynamic_shndx
);
322 unsigned int strtab_shndx
= -1U;
325 sd
->symbols_size
= 0;
326 sd
->external_symbols_offset
= 0;
327 sd
->symbol_names
= NULL
;
328 sd
->symbol_names_size
= 0;
330 if (this->dynsym_shndx_
!= -1U)
332 // Get the dynamic symbols.
333 typename
This::Shdr
dynsymshdr(pshdrs
334 + this->dynsym_shndx_
* This::shdr_size
);
335 gold_assert(dynsymshdr
.get_sh_type() == elfcpp::SHT_DYNSYM
);
337 sd
->symbols
= this->get_lasting_view(dynsymshdr
.get_sh_offset(),
338 dynsymshdr
.get_sh_size(), true,
341 convert_to_section_size_type(dynsymshdr
.get_sh_size());
343 // Get the symbol names.
344 strtab_shndx
= this->adjust_shndx(dynsymshdr
.get_sh_link());
345 if (strtab_shndx
>= this->shnum())
347 this->error(_("invalid dynamic symbol table name index: %u"),
351 typename
This::Shdr
strtabshdr(pshdrs
+ strtab_shndx
* This::shdr_size
);
352 if (strtabshdr
.get_sh_type() != elfcpp::SHT_STRTAB
)
354 this->error(_("dynamic symbol table name section "
355 "has wrong type: %u"),
356 static_cast<unsigned int>(strtabshdr
.get_sh_type()));
360 sd
->symbol_names
= this->get_lasting_view(strtabshdr
.get_sh_offset(),
361 strtabshdr
.get_sh_size(),
363 sd
->symbol_names_size
=
364 convert_to_section_size_type(strtabshdr
.get_sh_size());
366 // Get the version information.
369 this->read_dynsym_section(pshdrs
, versym_shndx
, elfcpp::SHT_GNU_versym
,
371 &sd
->versym
, &sd
->versym_size
, &dummy
);
373 // We require that the version definition and need section link
374 // to the same string table as the dynamic symbol table. This
375 // is not a technical requirement, but it always happens in
376 // practice. We could change this if necessary.
378 this->read_dynsym_section(pshdrs
, verdef_shndx
, elfcpp::SHT_GNU_verdef
,
379 strtab_shndx
, &sd
->verdef
, &sd
->verdef_size
,
382 this->read_dynsym_section(pshdrs
, verneed_shndx
, elfcpp::SHT_GNU_verneed
,
383 strtab_shndx
, &sd
->verneed
, &sd
->verneed_size
,
387 // Read the SHT_DYNAMIC section to find whether this shared object
388 // has a DT_SONAME tag and to record any DT_NEEDED tags. This
389 // doesn't really have anything to do with reading the symbols, but
390 // this is a convenient place to do it.
391 if (dynamic_shndx
!= -1U)
392 this->read_dynamic(pshdrs
, dynamic_shndx
, strtab_shndx
,
393 (sd
->symbol_names
== NULL
395 : sd
->symbol_names
->data()),
396 sd
->symbol_names_size
);
399 // Return the Xindex structure to use for object with lots of
402 template<int size
, bool big_endian
>
404 Sized_dynobj
<size
, big_endian
>::do_initialize_xindex()
406 gold_assert(this->dynsym_shndx_
!= -1U);
407 Xindex
* xindex
= new Xindex(this->elf_file_
.large_shndx_offset());
408 xindex
->initialize_symtab_xindex
<size
, big_endian
>(this, this->dynsym_shndx_
);
412 // Lay out the input sections for a dynamic object. We don't want to
413 // include sections from a dynamic object, so all that we actually do
414 // here is check for .gnu.warning sections.
416 template<int size
, bool big_endian
>
418 Sized_dynobj
<size
, big_endian
>::do_layout(Symbol_table
* symtab
,
420 Read_symbols_data
* sd
)
422 const unsigned int shnum
= this->shnum();
426 // Get the section headers.
427 const unsigned char* pshdrs
= sd
->section_headers
->data();
429 // Get the section names.
430 const unsigned char* pnamesu
= sd
->section_names
->data();
431 const char* pnames
= reinterpret_cast<const char*>(pnamesu
);
433 // Skip the first, dummy, section.
434 pshdrs
+= This::shdr_size
;
435 for (unsigned int i
= 1; i
< shnum
; ++i
, pshdrs
+= This::shdr_size
)
437 typename
This::Shdr
shdr(pshdrs
);
439 if (shdr
.get_sh_name() >= sd
->section_names_size
)
441 this->error(_("bad section name offset for section %u: %lu"),
442 i
, static_cast<unsigned long>(shdr
.get_sh_name()));
446 const char* name
= pnames
+ shdr
.get_sh_name();
448 this->handle_gnu_warning_section(name
, i
, symtab
);
451 delete sd
->section_headers
;
452 sd
->section_headers
= NULL
;
453 delete sd
->section_names
;
454 sd
->section_names
= NULL
;
457 // Add an entry to the vector mapping version numbers to version
460 template<int size
, bool big_endian
>
462 Sized_dynobj
<size
, big_endian
>::set_version_map(
463 Version_map
* version_map
,
465 const char* name
) const
467 if (ndx
>= version_map
->size())
468 version_map
->resize(ndx
+ 1);
469 if ((*version_map
)[ndx
] != NULL
)
470 this->error(_("duplicate definition for version %u"), ndx
);
471 (*version_map
)[ndx
] = name
;
474 // Add mappings for the version definitions to VERSION_MAP.
476 template<int size
, bool big_endian
>
478 Sized_dynobj
<size
, big_endian
>::make_verdef_map(
479 Read_symbols_data
* sd
,
480 Version_map
* version_map
) const
482 if (sd
->verdef
== NULL
)
485 const char* names
= reinterpret_cast<const char*>(sd
->symbol_names
->data());
486 section_size_type names_size
= sd
->symbol_names_size
;
488 const unsigned char* pverdef
= sd
->verdef
->data();
489 section_size_type verdef_size
= sd
->verdef_size
;
490 const unsigned int count
= sd
->verdef_info
;
492 const unsigned char* p
= pverdef
;
493 for (unsigned int i
= 0; i
< count
; ++i
)
495 elfcpp::Verdef
<size
, big_endian
> verdef(p
);
497 if (verdef
.get_vd_version() != elfcpp::VER_DEF_CURRENT
)
499 this->error(_("unexpected verdef version %u"),
500 verdef
.get_vd_version());
504 const section_size_type vd_ndx
= verdef
.get_vd_ndx();
506 // The GNU linker clears the VERSYM_HIDDEN bit. I'm not
509 // The first Verdaux holds the name of this version. Subsequent
510 // ones are versions that this one depends upon, which we don't
512 const section_size_type vd_cnt
= verdef
.get_vd_cnt();
515 this->error(_("verdef vd_cnt field too small: %u"),
516 static_cast<unsigned int>(vd_cnt
));
520 const section_size_type vd_aux
= verdef
.get_vd_aux();
521 if ((p
- pverdef
) + vd_aux
>= verdef_size
)
523 this->error(_("verdef vd_aux field out of range: %u"),
524 static_cast<unsigned int>(vd_aux
));
528 const unsigned char* pvda
= p
+ vd_aux
;
529 elfcpp::Verdaux
<size
, big_endian
> verdaux(pvda
);
531 const section_size_type vda_name
= verdaux
.get_vda_name();
532 if (vda_name
>= names_size
)
534 this->error(_("verdaux vda_name field out of range: %u"),
535 static_cast<unsigned int>(vda_name
));
539 this->set_version_map(version_map
, vd_ndx
, names
+ vda_name
);
541 const section_size_type vd_next
= verdef
.get_vd_next();
542 if ((p
- pverdef
) + vd_next
>= verdef_size
)
544 this->error(_("verdef vd_next field out of range: %u"),
545 static_cast<unsigned int>(vd_next
));
553 // Add mappings for the required versions to VERSION_MAP.
555 template<int size
, bool big_endian
>
557 Sized_dynobj
<size
, big_endian
>::make_verneed_map(
558 Read_symbols_data
* sd
,
559 Version_map
* version_map
) const
561 if (sd
->verneed
== NULL
)
564 const char* names
= reinterpret_cast<const char*>(sd
->symbol_names
->data());
565 section_size_type names_size
= sd
->symbol_names_size
;
567 const unsigned char* pverneed
= sd
->verneed
->data();
568 const section_size_type verneed_size
= sd
->verneed_size
;
569 const unsigned int count
= sd
->verneed_info
;
571 const unsigned char* p
= pverneed
;
572 for (unsigned int i
= 0; i
< count
; ++i
)
574 elfcpp::Verneed
<size
, big_endian
> verneed(p
);
576 if (verneed
.get_vn_version() != elfcpp::VER_NEED_CURRENT
)
578 this->error(_("unexpected verneed version %u"),
579 verneed
.get_vn_version());
583 const section_size_type vn_aux
= verneed
.get_vn_aux();
585 if ((p
- pverneed
) + vn_aux
>= verneed_size
)
587 this->error(_("verneed vn_aux field out of range: %u"),
588 static_cast<unsigned int>(vn_aux
));
592 const unsigned int vn_cnt
= verneed
.get_vn_cnt();
593 const unsigned char* pvna
= p
+ vn_aux
;
594 for (unsigned int j
= 0; j
< vn_cnt
; ++j
)
596 elfcpp::Vernaux
<size
, big_endian
> vernaux(pvna
);
598 const unsigned int vna_name
= vernaux
.get_vna_name();
599 if (vna_name
>= names_size
)
601 this->error(_("vernaux vna_name field out of range: %u"),
602 static_cast<unsigned int>(vna_name
));
606 this->set_version_map(version_map
, vernaux
.get_vna_other(),
609 const section_size_type vna_next
= vernaux
.get_vna_next();
610 if ((pvna
- pverneed
) + vna_next
>= verneed_size
)
612 this->error(_("verneed vna_next field out of range: %u"),
613 static_cast<unsigned int>(vna_next
));
620 const section_size_type vn_next
= verneed
.get_vn_next();
621 if ((p
- pverneed
) + vn_next
>= verneed_size
)
623 this->error(_("verneed vn_next field out of range: %u"),
624 static_cast<unsigned int>(vn_next
));
632 // Create a vector mapping version numbers to version strings.
634 template<int size
, bool big_endian
>
636 Sized_dynobj
<size
, big_endian
>::make_version_map(
637 Read_symbols_data
* sd
,
638 Version_map
* version_map
) const
640 if (sd
->verdef
== NULL
&& sd
->verneed
== NULL
)
643 // A guess at the maximum version number we will see. If this is
644 // wrong we will be less efficient but still correct.
645 version_map
->reserve(sd
->verdef_info
+ sd
->verneed_info
* 10);
647 this->make_verdef_map(sd
, version_map
);
648 this->make_verneed_map(sd
, version_map
);
651 // Add the dynamic symbols to the symbol table.
653 template<int size
, bool big_endian
>
655 Sized_dynobj
<size
, big_endian
>::do_add_symbols(Symbol_table
* symtab
,
656 Read_symbols_data
* sd
)
658 if (sd
->symbols
== NULL
)
660 gold_assert(sd
->symbol_names
== NULL
);
661 gold_assert(sd
->versym
== NULL
&& sd
->verdef
== NULL
662 && sd
->verneed
== NULL
);
666 const int sym_size
= This::sym_size
;
667 const size_t symcount
= sd
->symbols_size
/ sym_size
;
668 gold_assert(sd
->external_symbols_offset
== 0);
669 if (symcount
* sym_size
!= sd
->symbols_size
)
671 this->error(_("size of dynamic symbols is not multiple of symbol size"));
675 Version_map version_map
;
676 this->make_version_map(sd
, &version_map
);
678 const char* sym_names
=
679 reinterpret_cast<const char*>(sd
->symbol_names
->data());
680 symtab
->add_from_dynobj(this, sd
->symbols
->data(), symcount
,
681 sym_names
, sd
->symbol_names_size
,
684 : sd
->versym
->data()),
690 delete sd
->symbol_names
;
691 sd
->symbol_names
= NULL
;
692 if (sd
->versym
!= NULL
)
697 if (sd
->verdef
!= NULL
)
702 if (sd
->verneed
!= NULL
)
708 // This is normally the last time we will read any data from this
710 this->clear_view_cache_marks();
713 // Given a vector of hash codes, compute the number of hash buckets to
717 Dynobj::compute_bucket_count(const std::vector
<uint32_t>& hashcodes
,
718 bool for_gnu_hash_table
)
720 // FIXME: Implement optional hash table optimization.
722 // Array used to determine the number of hash table buckets to use
723 // based on the number of symbols there are. If there are fewer
724 // than 3 symbols we use 1 bucket, fewer than 17 symbols we use 3
725 // buckets, fewer than 37 we use 17 buckets, and so forth. We never
726 // use more than 262147 buckets. This is straight from the old GNU
728 static const unsigned int buckets
[] =
730 1, 3, 17, 37, 67, 97, 131, 197, 263, 521, 1031, 2053, 4099, 8209,
731 16411, 32771, 65537, 131101, 262147
733 const int buckets_count
= sizeof buckets
/ sizeof buckets
[0];
735 unsigned int symcount
= hashcodes
.size();
736 unsigned int ret
= 1;
737 const double full_fraction
738 = 1.0 - parameters
->options().hash_bucket_empty_fraction();
739 for (int i
= 0; i
< buckets_count
; ++i
)
741 if (symcount
< buckets
[i
] * full_fraction
)
746 if (for_gnu_hash_table
&& ret
< 2)
752 // The standard ELF hash function. This hash function must not
753 // change, as the dynamic linker uses it also.
756 Dynobj::elf_hash(const char* name
)
758 const unsigned char* nameu
= reinterpret_cast<const unsigned char*>(name
);
761 while ((c
= *nameu
++) != '\0')
764 uint32_t g
= h
& 0xf0000000;
768 // The ELF ABI says h &= ~g, but using xor is equivalent in
769 // this case (since g was set from h) and may save one
777 // Create a standard ELF hash table, setting *PPHASH and *PHASHLEN.
778 // DYNSYMS is a vector with all the global dynamic symbols.
779 // LOCAL_DYNSYM_COUNT is the number of local symbols in the dynamic
783 Dynobj::create_elf_hash_table(const std::vector
<Symbol
*>& dynsyms
,
784 unsigned int local_dynsym_count
,
785 unsigned char** pphash
,
786 unsigned int* phashlen
)
788 unsigned int dynsym_count
= dynsyms
.size();
790 // Get the hash values for all the symbols.
791 std::vector
<uint32_t> dynsym_hashvals(dynsym_count
);
792 for (unsigned int i
= 0; i
< dynsym_count
; ++i
)
793 dynsym_hashvals
[i
] = Dynobj::elf_hash(dynsyms
[i
]->name());
795 const unsigned int bucketcount
=
796 Dynobj::compute_bucket_count(dynsym_hashvals
, false);
798 std::vector
<uint32_t> bucket(bucketcount
);
799 std::vector
<uint32_t> chain(local_dynsym_count
+ dynsym_count
);
801 for (unsigned int i
= 0; i
< dynsym_count
; ++i
)
803 unsigned int dynsym_index
= dynsyms
[i
]->dynsym_index();
804 unsigned int bucketpos
= dynsym_hashvals
[i
] % bucketcount
;
805 chain
[dynsym_index
] = bucket
[bucketpos
];
806 bucket
[bucketpos
] = dynsym_index
;
809 unsigned int hashlen
= ((2
814 unsigned char* phash
= new unsigned char[hashlen
];
816 if (parameters
->target().is_big_endian())
818 #if defined(HAVE_TARGET_32_BIG) || defined(HAVE_TARGET_64_BIG)
819 Dynobj::sized_create_elf_hash_table
<true>(bucket
, chain
, phash
,
827 #if defined(HAVE_TARGET_32_LITTLE) || defined(HAVE_TARGET_64_LITTLE)
828 Dynobj::sized_create_elf_hash_table
<false>(bucket
, chain
, phash
,
839 // Fill in an ELF hash table.
841 template<bool big_endian
>
843 Dynobj::sized_create_elf_hash_table(const std::vector
<uint32_t>& bucket
,
844 const std::vector
<uint32_t>& chain
,
845 unsigned char* phash
,
846 unsigned int hashlen
)
848 unsigned char* p
= phash
;
850 const unsigned int bucketcount
= bucket
.size();
851 const unsigned int chaincount
= chain
.size();
853 elfcpp::Swap
<32, big_endian
>::writeval(p
, bucketcount
);
855 elfcpp::Swap
<32, big_endian
>::writeval(p
, chaincount
);
858 for (unsigned int i
= 0; i
< bucketcount
; ++i
)
860 elfcpp::Swap
<32, big_endian
>::writeval(p
, bucket
[i
]);
864 for (unsigned int i
= 0; i
< chaincount
; ++i
)
866 elfcpp::Swap
<32, big_endian
>::writeval(p
, chain
[i
]);
870 gold_assert(static_cast<unsigned int>(p
- phash
) == hashlen
);
873 // The hash function used for the GNU hash table. This hash function
874 // must not change, as the dynamic linker uses it also.
877 Dynobj::gnu_hash(const char* name
)
879 const unsigned char* nameu
= reinterpret_cast<const unsigned char*>(name
);
882 while ((c
= *nameu
++) != '\0')
883 h
= (h
<< 5) + h
+ c
;
887 // Create a GNU hash table, setting *PPHASH and *PHASHLEN. GNU hash
888 // tables are an extension to ELF which are recognized by the GNU
889 // dynamic linker. They are referenced using dynamic tag DT_GNU_HASH.
890 // TARGET is the target. DYNSYMS is a vector with all the global
891 // symbols which will be going into the dynamic symbol table.
892 // LOCAL_DYNSYM_COUNT is the number of local symbols in the dynamic
896 Dynobj::create_gnu_hash_table(const std::vector
<Symbol
*>& dynsyms
,
897 unsigned int local_dynsym_count
,
898 unsigned char** pphash
,
899 unsigned int* phashlen
)
901 const unsigned int count
= dynsyms
.size();
903 // Sort the dynamic symbols into two vectors. Symbols which we do
904 // not want to put into the hash table we store into
905 // UNHASHED_DYNSYMS. Symbols which we do want to store we put into
906 // HASHED_DYNSYMS. DYNSYM_HASHVALS is parallel to HASHED_DYNSYMS,
907 // and records the hash codes.
909 std::vector
<Symbol
*> unhashed_dynsyms
;
910 unhashed_dynsyms
.reserve(count
);
912 std::vector
<Symbol
*> hashed_dynsyms
;
913 hashed_dynsyms
.reserve(count
);
915 std::vector
<uint32_t> dynsym_hashvals
;
916 dynsym_hashvals
.reserve(count
);
918 for (unsigned int i
= 0; i
< count
; ++i
)
920 Symbol
* sym
= dynsyms
[i
];
922 // FIXME: Should put on unhashed_dynsyms if the symbol is
924 if (sym
->is_undefined())
925 unhashed_dynsyms
.push_back(sym
);
928 hashed_dynsyms
.push_back(sym
);
929 dynsym_hashvals
.push_back(Dynobj::gnu_hash(sym
->name()));
933 // Put the unhashed symbols at the start of the global portion of
934 // the dynamic symbol table.
935 const unsigned int unhashed_count
= unhashed_dynsyms
.size();
936 unsigned int unhashed_dynsym_index
= local_dynsym_count
;
937 for (unsigned int i
= 0; i
< unhashed_count
; ++i
)
939 unhashed_dynsyms
[i
]->set_dynsym_index(unhashed_dynsym_index
);
940 ++unhashed_dynsym_index
;
943 // For the actual data generation we call out to a templatized
945 int size
= parameters
->target().get_size();
946 bool big_endian
= parameters
->target().is_big_endian();
951 #ifdef HAVE_TARGET_32_BIG
952 Dynobj::sized_create_gnu_hash_table
<32, true>(hashed_dynsyms
,
954 unhashed_dynsym_index
,
963 #ifdef HAVE_TARGET_32_LITTLE
964 Dynobj::sized_create_gnu_hash_table
<32, false>(hashed_dynsyms
,
966 unhashed_dynsym_index
,
978 #ifdef HAVE_TARGET_64_BIG
979 Dynobj::sized_create_gnu_hash_table
<64, true>(hashed_dynsyms
,
981 unhashed_dynsym_index
,
990 #ifdef HAVE_TARGET_64_LITTLE
991 Dynobj::sized_create_gnu_hash_table
<64, false>(hashed_dynsyms
,
993 unhashed_dynsym_index
,
1005 // Create the actual data for a GNU hash table. This is just a copy
1006 // of the code from the old GNU linker.
1008 template<int size
, bool big_endian
>
1010 Dynobj::sized_create_gnu_hash_table(
1011 const std::vector
<Symbol
*>& hashed_dynsyms
,
1012 const std::vector
<uint32_t>& dynsym_hashvals
,
1013 unsigned int unhashed_dynsym_count
,
1014 unsigned char** pphash
,
1015 unsigned int* phashlen
)
1017 if (hashed_dynsyms
.empty())
1019 // Special case for the empty hash table.
1020 unsigned int hashlen
= 5 * 4 + size
/ 8;
1021 unsigned char* phash
= new unsigned char[hashlen
];
1022 // One empty bucket.
1023 elfcpp::Swap
<32, big_endian
>::writeval(phash
, 1);
1024 // Symbol index above unhashed symbols.
1025 elfcpp::Swap
<32, big_endian
>::writeval(phash
+ 4, unhashed_dynsym_count
);
1026 // One word for bitmask.
1027 elfcpp::Swap
<32, big_endian
>::writeval(phash
+ 8, 1);
1028 // Only bloom filter.
1029 elfcpp::Swap
<32, big_endian
>::writeval(phash
+ 12, 0);
1031 elfcpp::Swap
<size
, big_endian
>::writeval(phash
+ 16, 0);
1032 // No hashes in only bucket.
1033 elfcpp::Swap
<32, big_endian
>::writeval(phash
+ 16 + size
/ 8, 0);
1035 *phashlen
= hashlen
;
1041 const unsigned int bucketcount
=
1042 Dynobj::compute_bucket_count(dynsym_hashvals
, true);
1044 const unsigned int nsyms
= hashed_dynsyms
.size();
1046 uint32_t maskbitslog2
= 1;
1047 uint32_t x
= nsyms
>> 1;
1053 if (maskbitslog2
< 3)
1055 else if (((1U << (maskbitslog2
- 2)) & nsyms
) != 0)
1065 if (maskbitslog2
== 5)
1069 uint32_t mask
= (1U << shift1
) - 1U;
1070 uint32_t shift2
= maskbitslog2
;
1071 uint32_t maskbits
= 1U << maskbitslog2
;
1072 uint32_t maskwords
= 1U << (maskbitslog2
- shift1
);
1074 typedef typename
elfcpp::Elf_types
<size
>::Elf_WXword Word
;
1075 std::vector
<Word
> bitmask(maskwords
);
1076 std::vector
<uint32_t> counts(bucketcount
);
1077 std::vector
<uint32_t> indx(bucketcount
);
1078 uint32_t symindx
= unhashed_dynsym_count
;
1080 // Count the number of times each hash bucket is used.
1081 for (unsigned int i
= 0; i
< nsyms
; ++i
)
1082 ++counts
[dynsym_hashvals
[i
] % bucketcount
];
1084 unsigned int cnt
= symindx
;
1085 for (unsigned int i
= 0; i
< bucketcount
; ++i
)
1091 unsigned int hashlen
= (4 + bucketcount
+ nsyms
) * 4;
1092 hashlen
+= maskbits
/ 8;
1093 unsigned char* phash
= new unsigned char[hashlen
];
1095 elfcpp::Swap
<32, big_endian
>::writeval(phash
, bucketcount
);
1096 elfcpp::Swap
<32, big_endian
>::writeval(phash
+ 4, symindx
);
1097 elfcpp::Swap
<32, big_endian
>::writeval(phash
+ 8, maskwords
);
1098 elfcpp::Swap
<32, big_endian
>::writeval(phash
+ 12, shift2
);
1100 unsigned char* p
= phash
+ 16 + maskbits
/ 8;
1101 for (unsigned int i
= 0; i
< bucketcount
; ++i
)
1104 elfcpp::Swap
<32, big_endian
>::writeval(p
, 0);
1106 elfcpp::Swap
<32, big_endian
>::writeval(p
, indx
[i
]);
1110 for (unsigned int i
= 0; i
< nsyms
; ++i
)
1112 Symbol
* sym
= hashed_dynsyms
[i
];
1113 uint32_t hashval
= dynsym_hashvals
[i
];
1115 unsigned int bucket
= hashval
% bucketcount
;
1116 unsigned int val
= ((hashval
>> shift1
)
1117 & ((maskbits
>> shift1
) - 1));
1118 bitmask
[val
] |= (static_cast<Word
>(1U)) << (hashval
& mask
);
1119 bitmask
[val
] |= (static_cast<Word
>(1U)) << ((hashval
>> shift2
) & mask
);
1120 val
= hashval
& ~ 1U;
1121 if (counts
[bucket
] == 1)
1123 // Last element terminates the chain.
1126 elfcpp::Swap
<32, big_endian
>::writeval(p
+ (indx
[bucket
] - symindx
) * 4,
1130 sym
->set_dynsym_index(indx
[bucket
]);
1135 for (unsigned int i
= 0; i
< maskwords
; ++i
)
1137 elfcpp::Swap
<size
, big_endian
>::writeval(p
, bitmask
[i
]);
1141 *phashlen
= hashlen
;
1147 // Write this definition to a buffer for the output section.
1149 template<int size
, bool big_endian
>
1151 Verdef::write(const Stringpool
* dynpool
, bool is_last
, unsigned char* pb
) const
1153 const int verdef_size
= elfcpp::Elf_sizes
<size
>::verdef_size
;
1154 const int verdaux_size
= elfcpp::Elf_sizes
<size
>::verdaux_size
;
1156 elfcpp::Verdef_write
<size
, big_endian
> vd(pb
);
1157 vd
.set_vd_version(elfcpp::VER_DEF_CURRENT
);
1158 vd
.set_vd_flags((this->is_base_
? elfcpp::VER_FLG_BASE
: 0)
1159 | (this->is_weak_
? elfcpp::VER_FLG_WEAK
: 0));
1160 vd
.set_vd_ndx(this->index());
1161 vd
.set_vd_cnt(1 + this->deps_
.size());
1162 vd
.set_vd_hash(Dynobj::elf_hash(this->name()));
1163 vd
.set_vd_aux(verdef_size
);
1164 vd
.set_vd_next(is_last
1166 : verdef_size
+ (1 + this->deps_
.size()) * verdaux_size
);
1169 elfcpp::Verdaux_write
<size
, big_endian
> vda(pb
);
1170 vda
.set_vda_name(dynpool
->get_offset(this->name()));
1171 vda
.set_vda_next(this->deps_
.empty() ? 0 : verdaux_size
);
1174 Deps::const_iterator p
;
1176 for (p
= this->deps_
.begin(), i
= 0;
1177 p
!= this->deps_
.end();
1180 elfcpp::Verdaux_write
<size
, big_endian
> vda(pb
);
1181 vda
.set_vda_name(dynpool
->get_offset(*p
));
1182 vda
.set_vda_next(i
+ 1 >= this->deps_
.size() ? 0 : verdaux_size
);
1193 for (Need_versions::iterator p
= this->need_versions_
.begin();
1194 p
!= this->need_versions_
.end();
1199 // Add a new version to this file reference.
1202 Verneed::add_name(const char* name
)
1204 Verneed_version
* vv
= new Verneed_version(name
);
1205 this->need_versions_
.push_back(vv
);
1209 // Set the version indexes starting at INDEX.
1212 Verneed::finalize(unsigned int index
)
1214 for (Need_versions::iterator p
= this->need_versions_
.begin();
1215 p
!= this->need_versions_
.end();
1218 (*p
)->set_index(index
);
1224 // Write this list of referenced versions to a buffer for the output
1227 template<int size
, bool big_endian
>
1229 Verneed::write(const Stringpool
* dynpool
, bool is_last
,
1230 unsigned char* pb
) const
1232 const int verneed_size
= elfcpp::Elf_sizes
<size
>::verneed_size
;
1233 const int vernaux_size
= elfcpp::Elf_sizes
<size
>::vernaux_size
;
1235 elfcpp::Verneed_write
<size
, big_endian
> vn(pb
);
1236 vn
.set_vn_version(elfcpp::VER_NEED_CURRENT
);
1237 vn
.set_vn_cnt(this->need_versions_
.size());
1238 vn
.set_vn_file(dynpool
->get_offset(this->filename()));
1239 vn
.set_vn_aux(verneed_size
);
1240 vn
.set_vn_next(is_last
1242 : verneed_size
+ this->need_versions_
.size() * vernaux_size
);
1245 Need_versions::const_iterator p
;
1247 for (p
= this->need_versions_
.begin(), i
= 0;
1248 p
!= this->need_versions_
.end();
1251 elfcpp::Vernaux_write
<size
, big_endian
> vna(pb
);
1252 vna
.set_vna_hash(Dynobj::elf_hash((*p
)->version()));
1253 // FIXME: We need to sometimes set VER_FLG_WEAK here.
1254 vna
.set_vna_flags(0);
1255 vna
.set_vna_other((*p
)->index());
1256 vna
.set_vna_name(dynpool
->get_offset((*p
)->version()));
1257 vna
.set_vna_next(i
+ 1 >= this->need_versions_
.size()
1266 // Versions methods.
1268 Versions::Versions(const Version_script_info
& version_script
,
1269 Stringpool
* dynpool
)
1270 : defs_(), needs_(), version_table_(),
1271 is_finalized_(false), version_script_(version_script
)
1273 // We always need a base version, so define that first. Nothing
1274 // explicitly declares itself as part of base, so it doesn't need to
1275 // be in version_table_.
1276 // FIXME: Should use soname here when creating a shared object. Is
1277 // this fixme still valid? It looks like it's doing the right thing
1279 if (parameters
->options().shared())
1281 const char* name
= dynpool
->add(parameters
->options().output_file_name(),
1283 Verdef
* vdbase
= new Verdef(name
, std::vector
<std::string
>(),
1285 this->defs_
.push_back(vdbase
);
1288 if (!this->version_script_
.empty())
1290 // Parse the version script, and insert each declared version into
1291 // defs_ and version_table_.
1292 std::vector
<std::string
> versions
= this->version_script_
.get_versions();
1293 for (size_t k
= 0; k
< versions
.size(); ++k
)
1295 Stringpool::Key version_key
;
1296 const char* version
= dynpool
->add(versions
[k
].c_str(),
1297 true, &version_key
);
1298 Verdef
* const vd
= new Verdef(
1300 this->version_script_
.get_dependencies(version
),
1301 false, false, false);
1302 this->defs_
.push_back(vd
);
1303 Key
key(version_key
, 0);
1304 this->version_table_
.insert(std::make_pair(key
, vd
));
1309 Versions::~Versions()
1311 for (Defs::iterator p
= this->defs_
.begin();
1312 p
!= this->defs_
.end();
1316 for (Needs::iterator p
= this->needs_
.begin();
1317 p
!= this->needs_
.end();
1322 // Return the dynamic object which a symbol refers to.
1325 Versions::get_dynobj_for_sym(const Symbol_table
* symtab
,
1326 const Symbol
* sym
) const
1328 if (sym
->is_copied_from_dynobj())
1329 return symtab
->get_copy_source(sym
);
1332 Object
* object
= sym
->object();
1333 gold_assert(object
->is_dynamic());
1334 return static_cast<Dynobj
*>(object
);
1338 // Record version information for a symbol going into the dynamic
1342 Versions::record_version(const Symbol_table
* symtab
,
1343 Stringpool
* dynpool
, const Symbol
* sym
)
1345 gold_assert(!this->is_finalized_
);
1346 gold_assert(sym
->version() != NULL
);
1348 Stringpool::Key version_key
;
1349 const char* version
= dynpool
->add(sym
->version(), false, &version_key
);
1351 if (!sym
->is_from_dynobj() && !sym
->is_copied_from_dynobj())
1353 if (parameters
->options().shared())
1354 this->add_def(sym
, version
, version_key
);
1358 // This is a version reference.
1359 Dynobj
* dynobj
= this->get_dynobj_for_sym(symtab
, sym
);
1360 this->add_need(dynpool
, dynobj
->soname(), version
, version_key
);
1364 // We've found a symbol SYM defined in version VERSION.
1367 Versions::add_def(const Symbol
* sym
, const char* version
,
1368 Stringpool::Key version_key
)
1370 Key
k(version_key
, 0);
1371 Version_base
* const vbnull
= NULL
;
1372 std::pair
<Version_table::iterator
, bool> ins
=
1373 this->version_table_
.insert(std::make_pair(k
, vbnull
));
1377 // We already have an entry for this version.
1378 Version_base
* vb
= ins
.first
->second
;
1380 // We have now seen a symbol in this version, so it is not
1382 gold_assert(vb
!= NULL
);
1387 // If we are creating a shared object, it is an error to
1388 // find a definition of a symbol with a version which is not
1389 // in the version script.
1390 if (parameters
->options().shared())
1392 gold_error(_("symbol %s has undefined version %s"),
1393 sym
->demangled_name().c_str(), version
);
1397 // When creating a regular executable, automatically define
1399 Verdef
* vd
= new Verdef(version
, std::vector
<std::string
>(),
1400 false, false, false);
1401 this->defs_
.push_back(vd
);
1402 ins
.first
->second
= vd
;
1406 // Add a reference to version NAME in file FILENAME.
1409 Versions::add_need(Stringpool
* dynpool
, const char* filename
, const char* name
,
1410 Stringpool::Key name_key
)
1412 Stringpool::Key filename_key
;
1413 filename
= dynpool
->add(filename
, true, &filename_key
);
1415 Key
k(name_key
, filename_key
);
1416 Version_base
* const vbnull
= NULL
;
1417 std::pair
<Version_table::iterator
, bool> ins
=
1418 this->version_table_
.insert(std::make_pair(k
, vbnull
));
1422 // We already have an entry for this filename/version.
1426 // See whether we already have this filename. We don't expect many
1427 // version references, so we just do a linear search. This could be
1428 // replaced by a hash table.
1430 for (Needs::iterator p
= this->needs_
.begin();
1431 p
!= this->needs_
.end();
1434 if ((*p
)->filename() == filename
)
1443 // We have a new filename.
1444 vn
= new Verneed(filename
);
1445 this->needs_
.push_back(vn
);
1448 ins
.first
->second
= vn
->add_name(name
);
1451 // Set the version indexes. Create a new dynamic version symbol for
1452 // each new version definition.
1455 Versions::finalize(Symbol_table
* symtab
, unsigned int dynsym_index
,
1456 std::vector
<Symbol
*>* syms
)
1458 gold_assert(!this->is_finalized_
);
1460 unsigned int vi
= 1;
1462 for (Defs::iterator p
= this->defs_
.begin();
1463 p
!= this->defs_
.end();
1466 (*p
)->set_index(vi
);
1469 // Create a version symbol if necessary.
1470 if (!(*p
)->is_symbol_created())
1472 Symbol
* vsym
= symtab
->define_as_constant((*p
)->name(),
1476 elfcpp::STV_DEFAULT
, 0,
1478 vsym
->set_needs_dynsym_entry();
1479 vsym
->set_dynsym_index(dynsym_index
);
1481 syms
->push_back(vsym
);
1482 // The name is already in the dynamic pool.
1486 // Index 1 is used for global symbols.
1489 gold_assert(this->defs_
.empty());
1493 for (Needs::iterator p
= this->needs_
.begin();
1494 p
!= this->needs_
.end();
1496 vi
= (*p
)->finalize(vi
);
1498 this->is_finalized_
= true;
1500 return dynsym_index
;
1503 // Return the version index to use for a symbol. This does two hash
1504 // table lookups: one in DYNPOOL and one in this->version_table_.
1505 // Another approach alternative would be store a pointer in SYM, which
1506 // would increase the size of the symbol table. Or perhaps we could
1507 // use a hash table from dynamic symbol pointer values to Version_base
1511 Versions::version_index(const Symbol_table
* symtab
, const Stringpool
* dynpool
,
1512 const Symbol
* sym
) const
1514 Stringpool::Key version_key
;
1515 const char* version
= dynpool
->find(sym
->version(), &version_key
);
1516 gold_assert(version
!= NULL
);
1519 if (!sym
->is_from_dynobj() && !sym
->is_copied_from_dynobj())
1521 if (!parameters
->options().shared())
1522 return elfcpp::VER_NDX_GLOBAL
;
1523 k
= Key(version_key
, 0);
1527 Dynobj
* dynobj
= this->get_dynobj_for_sym(symtab
, sym
);
1529 Stringpool::Key filename_key
;
1530 const char* filename
= dynpool
->find(dynobj
->soname(), &filename_key
);
1531 gold_assert(filename
!= NULL
);
1533 k
= Key(version_key
, filename_key
);
1536 Version_table::const_iterator p
= this->version_table_
.find(k
);
1537 gold_assert(p
!= this->version_table_
.end());
1539 return p
->second
->index();
1542 // Return an allocated buffer holding the contents of the symbol
1545 template<int size
, bool big_endian
>
1547 Versions::symbol_section_contents(const Symbol_table
* symtab
,
1548 const Stringpool
* dynpool
,
1549 unsigned int local_symcount
,
1550 const std::vector
<Symbol
*>& syms
,
1552 unsigned int* psize
) const
1554 gold_assert(this->is_finalized_
);
1556 unsigned int sz
= (local_symcount
+ syms
.size()) * 2;
1557 unsigned char* pbuf
= new unsigned char[sz
];
1559 for (unsigned int i
= 0; i
< local_symcount
; ++i
)
1560 elfcpp::Swap
<16, big_endian
>::writeval(pbuf
+ i
* 2,
1561 elfcpp::VER_NDX_LOCAL
);
1563 for (std::vector
<Symbol
*>::const_iterator p
= syms
.begin();
1567 unsigned int version_index
;
1568 const char* version
= (*p
)->version();
1569 if (version
== NULL
)
1570 version_index
= elfcpp::VER_NDX_GLOBAL
;
1572 version_index
= this->version_index(symtab
, dynpool
, *p
);
1573 // If the symbol was defined as foo@V1 instead of foo@@V1, add
1575 if ((*p
)->version() != NULL
&& !(*p
)->is_default())
1576 version_index
|= elfcpp::VERSYM_HIDDEN
;
1577 elfcpp::Swap
<16, big_endian
>::writeval(pbuf
+ (*p
)->dynsym_index() * 2,
1585 // Return an allocated buffer holding the contents of the version
1586 // definition section.
1588 template<int size
, bool big_endian
>
1590 Versions::def_section_contents(const Stringpool
* dynpool
,
1591 unsigned char** pp
, unsigned int* psize
,
1592 unsigned int* pentries
) const
1594 gold_assert(this->is_finalized_
);
1595 gold_assert(!this->defs_
.empty());
1597 const int verdef_size
= elfcpp::Elf_sizes
<size
>::verdef_size
;
1598 const int verdaux_size
= elfcpp::Elf_sizes
<size
>::verdaux_size
;
1600 unsigned int sz
= 0;
1601 for (Defs::const_iterator p
= this->defs_
.begin();
1602 p
!= this->defs_
.end();
1605 sz
+= verdef_size
+ verdaux_size
;
1606 sz
+= (*p
)->count_dependencies() * verdaux_size
;
1609 unsigned char* pbuf
= new unsigned char[sz
];
1611 unsigned char* pb
= pbuf
;
1612 Defs::const_iterator p
;
1614 for (p
= this->defs_
.begin(), i
= 0;
1615 p
!= this->defs_
.end();
1617 pb
= (*p
)->write
<size
, big_endian
>(dynpool
,
1618 i
+ 1 >= this->defs_
.size(),
1621 gold_assert(static_cast<unsigned int>(pb
- pbuf
) == sz
);
1625 *pentries
= this->defs_
.size();
1628 // Return an allocated buffer holding the contents of the version
1629 // reference section.
1631 template<int size
, bool big_endian
>
1633 Versions::need_section_contents(const Stringpool
* dynpool
,
1634 unsigned char** pp
, unsigned int *psize
,
1635 unsigned int *pentries
) const
1637 gold_assert(this->is_finalized_
);
1638 gold_assert(!this->needs_
.empty());
1640 const int verneed_size
= elfcpp::Elf_sizes
<size
>::verneed_size
;
1641 const int vernaux_size
= elfcpp::Elf_sizes
<size
>::vernaux_size
;
1643 unsigned int sz
= 0;
1644 for (Needs::const_iterator p
= this->needs_
.begin();
1645 p
!= this->needs_
.end();
1649 sz
+= (*p
)->count_versions() * vernaux_size
;
1652 unsigned char* pbuf
= new unsigned char[sz
];
1654 unsigned char* pb
= pbuf
;
1655 Needs::const_iterator p
;
1657 for (p
= this->needs_
.begin(), i
= 0;
1658 p
!= this->needs_
.end();
1660 pb
= (*p
)->write
<size
, big_endian
>(dynpool
,
1661 i
+ 1 >= this->needs_
.size(),
1664 gold_assert(static_cast<unsigned int>(pb
- pbuf
) == sz
);
1668 *pentries
= this->needs_
.size();
1671 // Instantiate the templates we need. We could use the configure
1672 // script to restrict this to only the ones for implemented targets.
1674 #ifdef HAVE_TARGET_32_LITTLE
1676 class Sized_dynobj
<32, false>;
1679 #ifdef HAVE_TARGET_32_BIG
1681 class Sized_dynobj
<32, true>;
1684 #ifdef HAVE_TARGET_64_LITTLE
1686 class Sized_dynobj
<64, false>;
1689 #ifdef HAVE_TARGET_64_BIG
1691 class Sized_dynobj
<64, true>;
1694 #ifdef HAVE_TARGET_32_LITTLE
1697 Versions::symbol_section_contents
<32, false>(
1698 const Symbol_table
*,
1701 const std::vector
<Symbol
*>&,
1703 unsigned int*) const;
1706 #ifdef HAVE_TARGET_32_BIG
1709 Versions::symbol_section_contents
<32, true>(
1710 const Symbol_table
*,
1713 const std::vector
<Symbol
*>&,
1715 unsigned int*) const;
1718 #ifdef HAVE_TARGET_64_LITTLE
1721 Versions::symbol_section_contents
<64, false>(
1722 const Symbol_table
*,
1725 const std::vector
<Symbol
*>&,
1727 unsigned int*) const;
1730 #ifdef HAVE_TARGET_64_BIG
1733 Versions::symbol_section_contents
<64, true>(
1734 const Symbol_table
*,
1737 const std::vector
<Symbol
*>&,
1739 unsigned int*) const;
1742 #ifdef HAVE_TARGET_32_LITTLE
1745 Versions::def_section_contents
<32, false>(
1749 unsigned int*) const;
1752 #ifdef HAVE_TARGET_32_BIG
1755 Versions::def_section_contents
<32, true>(
1759 unsigned int*) const;
1762 #ifdef HAVE_TARGET_64_LITTLE
1765 Versions::def_section_contents
<64, false>(
1769 unsigned int*) const;
1772 #ifdef HAVE_TARGET_64_BIG
1775 Versions::def_section_contents
<64, true>(
1779 unsigned int*) const;
1782 #ifdef HAVE_TARGET_32_LITTLE
1785 Versions::need_section_contents
<32, false>(
1789 unsigned int*) const;
1792 #ifdef HAVE_TARGET_32_BIG
1795 Versions::need_section_contents
<32, true>(
1799 unsigned int*) const;
1802 #ifdef HAVE_TARGET_64_LITTLE
1805 Versions::need_section_contents
<64, false>(
1809 unsigned int*) const;
1812 #ifdef HAVE_TARGET_64_BIG
1815 Versions::need_section_contents
<64, true>(
1819 unsigned int*) const;
1822 } // End namespace gold.