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
& aname
, Input_file
* ainput_file
, off_t aoffset
)
43 : Object(aname
, ainput_file
, true, aoffset
),
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
& aname
,
71 Input_file
* ainput_file
,
73 const elfcpp::Ehdr
<size
, big_endian
>& ehdr
)
74 : Dynobj(aname
, ainput_file
, aoffset
),
75 elf_file_(this, ehdr
),
84 template<int size
, bool big_endian
>
86 Sized_dynobj
<size
, big_endian
>::setup()
88 const unsigned int sec_shnum
= this->elf_file_
.shnum();
89 this->set_shnum(sec_shnum
);
92 // Find the SHT_DYNSYM section and the various version sections, and
93 // the dynamic section, given the section headers.
95 template<int size
, bool big_endian
>
97 Sized_dynobj
<size
, big_endian
>::find_dynsym_sections(
98 const unsigned char* pshdrs
,
99 unsigned int* pversym_shndx
,
100 unsigned int* pverdef_shndx
,
101 unsigned int* pverneed_shndx
,
102 unsigned int* pdynamic_shndx
)
104 *pversym_shndx
= -1U;
105 *pverdef_shndx
= -1U;
106 *pverneed_shndx
= -1U;
107 *pdynamic_shndx
= -1U;
109 unsigned int xindex_shndx
= 0;
110 unsigned int xindex_link
= 0;
111 const unsigned int sec_shnum
= this->shnum();
112 const unsigned char* p
= pshdrs
;
113 for (unsigned int i
= 0; i
< sec_shnum
; ++i
, p
+= This::shdr_size
)
115 typename
This::Shdr
shdr(p
);
118 switch (shdr
.get_sh_type())
120 case elfcpp::SHT_DYNSYM
:
121 this->dynsym_shndx_
= i
;
122 if (xindex_shndx
> 0 && xindex_link
== i
)
124 Xindex
* xindex
= new Xindex(this->elf_file_
.large_shndx_offset());
125 xindex
->read_symtab_xindex
<size
, big_endian
>(this, xindex_shndx
,
127 this->set_xindex(xindex
);
131 case elfcpp::SHT_GNU_versym
:
134 case elfcpp::SHT_GNU_verdef
:
137 case elfcpp::SHT_GNU_verneed
:
140 case elfcpp::SHT_DYNAMIC
:
143 case elfcpp::SHT_SYMTAB_SHNDX
:
145 xindex_link
= this->adjust_shndx(shdr
.get_sh_link());
146 if (xindex_link
== this->dynsym_shndx_
)
148 Xindex
* xindex
= new Xindex(this->elf_file_
.large_shndx_offset());
149 xindex
->read_symtab_xindex
<size
, big_endian
>(this, xindex_shndx
,
151 this->set_xindex(xindex
);
164 this->error(_("unexpected duplicate type %u section: %u, %u"),
165 shdr
.get_sh_type(), *pi
, i
);
171 // Read the contents of section SHNDX. PSHDRS points to the section
172 // headers. TYPE is the expected section type. LINK is the expected
173 // section link. Store the data in *VIEW and *VIEW_SIZE. The
174 // section's sh_info field is stored in *VIEW_INFO.
176 template<int size
, bool big_endian
>
178 Sized_dynobj
<size
, big_endian
>::read_dynsym_section(
179 const unsigned char* pshdrs
,
184 section_size_type
* view_size
,
185 unsigned int* view_info
)
195 typename
This::Shdr
shdr(pshdrs
+ shndx
* This::shdr_size
);
197 gold_assert(shdr
.get_sh_type() == type
);
199 if (this->adjust_shndx(shdr
.get_sh_link()) != link
)
200 this->error(_("unexpected link in section %u header: %u != %u"),
201 shndx
, this->adjust_shndx(shdr
.get_sh_link()), link
);
203 *aview
= this->get_lasting_view(shdr
.get_sh_offset(), shdr
.get_sh_size(),
205 *view_size
= convert_to_section_size_type(shdr
.get_sh_size());
206 *view_info
= shdr
.get_sh_info();
209 // Read the dynamic tags. Set the soname field if this shared object
210 // has a DT_SONAME tag. Record the DT_NEEDED tags. PSHDRS points to
211 // the section headers. DYNAMIC_SHNDX is the section index of the
212 // SHT_DYNAMIC section. STRTAB_SHNDX, STRTAB, and STRTAB_SIZE are the
213 // section index and contents of a string table which may be the one
214 // associated with the SHT_DYNAMIC section.
216 template<int size
, bool big_endian
>
218 Sized_dynobj
<size
, big_endian
>::read_dynamic(const unsigned char* pshdrs
,
219 unsigned int dynamic_shndx
,
220 unsigned int strtab_shndx
,
221 const unsigned char* strtabu
,
224 typename
This::Shdr
dynamicshdr(pshdrs
+ dynamic_shndx
* This::shdr_size
);
225 gold_assert(dynamicshdr
.get_sh_type() == elfcpp::SHT_DYNAMIC
);
227 const off_t dynamic_size
= dynamicshdr
.get_sh_size();
228 const unsigned char* pdynamic
= this->get_view(dynamicshdr
.get_sh_offset(),
229 dynamic_size
, true, false);
231 const unsigned int link
= this->adjust_shndx(dynamicshdr
.get_sh_link());
232 if (link
!= strtab_shndx
)
234 if (link
>= this->shnum())
236 this->error(_("DYNAMIC section %u link out of range: %u"),
237 dynamic_shndx
, link
);
241 typename
This::Shdr
strtabshdr(pshdrs
+ link
* This::shdr_size
);
242 if (strtabshdr
.get_sh_type() != elfcpp::SHT_STRTAB
)
244 this->error(_("DYNAMIC section %u link %u is not a strtab"),
245 dynamic_shndx
, link
);
249 strtab_size
= strtabshdr
.get_sh_size();
250 strtabu
= this->get_view(strtabshdr
.get_sh_offset(), strtab_size
, false,
254 const char* const strtab
= reinterpret_cast<const char*>(strtabu
);
256 for (const unsigned char* p
= pdynamic
;
257 p
< pdynamic
+ dynamic_size
;
260 typename
This::Dyn
dyn(p
);
262 switch (dyn
.get_d_tag())
264 case elfcpp::DT_NULL
:
265 // We should always see DT_NULL at the end of the dynamic
269 case elfcpp::DT_SONAME
:
271 off_t val
= dyn
.get_d_val();
272 if (val
>= strtab_size
)
273 this->error(_("DT_SONAME value out of range: %lld >= %lld"),
274 static_cast<long long>(val
),
275 static_cast<long long>(strtab_size
));
277 this->set_soname_string(strtab
+ val
);
281 case elfcpp::DT_NEEDED
:
283 off_t val
= dyn
.get_d_val();
284 if (val
>= strtab_size
)
285 this->error(_("DT_NEEDED value out of range: %lld >= %lld"),
286 static_cast<long long>(val
),
287 static_cast<long long>(strtab_size
));
289 this->add_needed(strtab
+ val
);
298 this->error(_("missing DT_NULL in dynamic segment"));
301 // Read the symbols and sections from a dynamic object. We read the
302 // dynamic symbols, not the normal symbols.
304 template<int size
, bool big_endian
>
306 Sized_dynobj
<size
, big_endian
>::do_read_symbols(Read_symbols_data
* sd
)
308 this->read_section_data(&this->elf_file_
, sd
);
310 const unsigned char* const pshdrs
= sd
->section_headers
->data();
312 unsigned int versym_shndx
;
313 unsigned int verdef_shndx
;
314 unsigned int verneed_shndx
;
315 unsigned int dynamic_shndx
;
316 this->find_dynsym_sections(pshdrs
, &versym_shndx
, &verdef_shndx
,
317 &verneed_shndx
, &dynamic_shndx
);
319 unsigned int strtab_shndx
= -1U;
322 sd
->symbols_size
= 0;
323 sd
->external_symbols_offset
= 0;
324 sd
->symbol_names
= NULL
;
325 sd
->symbol_names_size
= 0;
332 sd
->verneed_size
= 0;
333 sd
->verneed_info
= 0;
335 if (this->dynsym_shndx_
!= -1U)
337 // Get the dynamic symbols.
338 typename
This::Shdr
dynsymshdr(pshdrs
339 + this->dynsym_shndx_
* This::shdr_size
);
340 gold_assert(dynsymshdr
.get_sh_type() == elfcpp::SHT_DYNSYM
);
342 sd
->symbols
= this->get_lasting_view(dynsymshdr
.get_sh_offset(),
343 dynsymshdr
.get_sh_size(), true,
346 convert_to_section_size_type(dynsymshdr
.get_sh_size());
348 // Get the symbol names.
349 strtab_shndx
= this->adjust_shndx(dynsymshdr
.get_sh_link());
350 if (strtab_shndx
>= this->shnum())
352 this->error(_("invalid dynamic symbol table name index: %u"),
356 typename
This::Shdr
strtabshdr(pshdrs
+ strtab_shndx
* This::shdr_size
);
357 if (strtabshdr
.get_sh_type() != elfcpp::SHT_STRTAB
)
359 this->error(_("dynamic symbol table name section "
360 "has wrong type: %u"),
361 static_cast<unsigned int>(strtabshdr
.get_sh_type()));
365 sd
->symbol_names
= this->get_lasting_view(strtabshdr
.get_sh_offset(),
366 strtabshdr
.get_sh_size(),
368 sd
->symbol_names_size
=
369 convert_to_section_size_type(strtabshdr
.get_sh_size());
371 // Get the version information.
374 this->read_dynsym_section(pshdrs
, versym_shndx
, elfcpp::SHT_GNU_versym
,
376 &sd
->versym
, &sd
->versym_size
, &dummy
);
378 // We require that the version definition and need section link
379 // to the same string table as the dynamic symbol table. This
380 // is not a technical requirement, but it always happens in
381 // practice. We could change this if necessary.
383 this->read_dynsym_section(pshdrs
, verdef_shndx
, elfcpp::SHT_GNU_verdef
,
384 strtab_shndx
, &sd
->verdef
, &sd
->verdef_size
,
387 this->read_dynsym_section(pshdrs
, verneed_shndx
, elfcpp::SHT_GNU_verneed
,
388 strtab_shndx
, &sd
->verneed
, &sd
->verneed_size
,
392 // Read the SHT_DYNAMIC section to find whether this shared object
393 // has a DT_SONAME tag and to record any DT_NEEDED tags. This
394 // doesn't really have anything to do with reading the symbols, but
395 // this is a convenient place to do it.
396 if (dynamic_shndx
!= -1U)
397 this->read_dynamic(pshdrs
, dynamic_shndx
, strtab_shndx
,
398 (sd
->symbol_names
== NULL
400 : sd
->symbol_names
->data()),
401 sd
->symbol_names_size
);
404 // Return the Xindex structure to use for object with lots of
407 template<int size
, bool big_endian
>
409 Sized_dynobj
<size
, big_endian
>::do_initialize_xindex()
411 gold_assert(this->dynsym_shndx_
!= -1U);
412 Xindex
* xindex
= new Xindex(this->elf_file_
.large_shndx_offset());
413 xindex
->initialize_symtab_xindex
<size
, big_endian
>(this, this->dynsym_shndx_
);
417 // Lay out the input sections for a dynamic object. We don't want to
418 // include sections from a dynamic object, so all that we actually do
419 // here is check for .gnu.warning and .note.GNU-split-stack sections.
421 template<int size
, bool big_endian
>
423 Sized_dynobj
<size
, big_endian
>::do_layout(Symbol_table
* symtab
,
425 Read_symbols_data
* sd
)
427 const unsigned int sec_shnum
= this->shnum();
431 // Get the section headers.
432 const unsigned char* pshdrs
= sd
->section_headers
->data();
434 // Get the section names.
435 const unsigned char* pnamesu
= sd
->section_names
->data();
436 const char* pnames
= reinterpret_cast<const char*>(pnamesu
);
438 // Skip the first, dummy, section.
439 pshdrs
+= This::shdr_size
;
440 for (unsigned int i
= 1; i
< sec_shnum
; ++i
, pshdrs
+= This::shdr_size
)
442 typename
This::Shdr
shdr(pshdrs
);
444 if (shdr
.get_sh_name() >= sd
->section_names_size
)
446 this->error(_("bad section name offset for section %u: %lu"),
447 i
, static_cast<unsigned long>(shdr
.get_sh_name()));
451 const char* aname
= pnames
+ shdr
.get_sh_name();
453 this->handle_gnu_warning_section(aname
, i
, symtab
);
454 this->handle_split_stack_section(aname
);
457 delete sd
->section_headers
;
458 sd
->section_headers
= NULL
;
459 delete sd
->section_names
;
460 sd
->section_names
= NULL
;
463 // Add an entry to the vector mapping version numbers to version
466 template<int size
, bool big_endian
>
468 Sized_dynobj
<size
, big_endian
>::set_version_map(
469 Version_map
* version_map
,
471 const char* aname
) const
473 if (ndx
>= version_map
->size())
474 version_map
->resize(ndx
+ 1);
475 if ((*version_map
)[ndx
] != NULL
)
476 this->error(_("duplicate definition for version %u"), ndx
);
477 (*version_map
)[ndx
] = aname
;
480 // Add mappings for the version definitions to VERSION_MAP.
482 template<int size
, bool big_endian
>
484 Sized_dynobj
<size
, big_endian
>::make_verdef_map(
485 Read_symbols_data
* sd
,
486 Version_map
* version_map
) const
488 if (sd
->verdef
== NULL
)
491 const char* names
= reinterpret_cast<const char*>(sd
->symbol_names
->data());
492 section_size_type names_size
= sd
->symbol_names_size
;
494 const unsigned char* pverdef
= sd
->verdef
->data();
495 section_size_type verdef_size
= sd
->verdef_size
;
496 const unsigned int count
= sd
->verdef_info
;
498 const unsigned char* p
= pverdef
;
499 for (unsigned int i
= 0; i
< count
; ++i
)
501 elfcpp::Verdef
<size
, big_endian
> verdef(p
);
503 if (verdef
.get_vd_version() != elfcpp::VER_DEF_CURRENT
)
505 this->error(_("unexpected verdef version %u"),
506 verdef
.get_vd_version());
510 const section_size_type vd_ndx
= verdef
.get_vd_ndx();
512 // The GNU linker clears the VERSYM_HIDDEN bit. I'm not
515 // The first Verdaux holds the name of this version. Subsequent
516 // ones are versions that this one depends upon, which we don't
518 const section_size_type vd_cnt
= verdef
.get_vd_cnt();
521 this->error(_("verdef vd_cnt field too small: %u"),
522 static_cast<unsigned int>(vd_cnt
));
526 const section_size_type vd_aux
= verdef
.get_vd_aux();
527 if ((p
- pverdef
) + vd_aux
>= verdef_size
)
529 this->error(_("verdef vd_aux field out of range: %u"),
530 static_cast<unsigned int>(vd_aux
));
534 const unsigned char* pvda
= p
+ vd_aux
;
535 elfcpp::Verdaux
<size
, big_endian
> verdaux(pvda
);
537 const section_size_type vda_name
= verdaux
.get_vda_name();
538 if (vda_name
>= names_size
)
540 this->error(_("verdaux vda_name field out of range: %u"),
541 static_cast<unsigned int>(vda_name
));
545 this->set_version_map(version_map
, vd_ndx
, names
+ vda_name
);
547 const section_size_type vd_next
= verdef
.get_vd_next();
548 if ((p
- pverdef
) + vd_next
>= verdef_size
)
550 this->error(_("verdef vd_next field out of range: %u"),
551 static_cast<unsigned int>(vd_next
));
559 // Add mappings for the required versions to VERSION_MAP.
561 template<int size
, bool big_endian
>
563 Sized_dynobj
<size
, big_endian
>::make_verneed_map(
564 Read_symbols_data
* sd
,
565 Version_map
* version_map
) const
567 if (sd
->verneed
== NULL
)
570 const char* names
= reinterpret_cast<const char*>(sd
->symbol_names
->data());
571 section_size_type names_size
= sd
->symbol_names_size
;
573 const unsigned char* pverneed
= sd
->verneed
->data();
574 const section_size_type verneed_size
= sd
->verneed_size
;
575 const unsigned int count
= sd
->verneed_info
;
577 const unsigned char* p
= pverneed
;
578 for (unsigned int i
= 0; i
< count
; ++i
)
580 elfcpp::Verneed
<size
, big_endian
> verneed(p
);
582 if (verneed
.get_vn_version() != elfcpp::VER_NEED_CURRENT
)
584 this->error(_("unexpected verneed version %u"),
585 verneed
.get_vn_version());
589 const section_size_type vn_aux
= verneed
.get_vn_aux();
591 if ((p
- pverneed
) + vn_aux
>= verneed_size
)
593 this->error(_("verneed vn_aux field out of range: %u"),
594 static_cast<unsigned int>(vn_aux
));
598 const unsigned int vn_cnt
= verneed
.get_vn_cnt();
599 const unsigned char* pvna
= p
+ vn_aux
;
600 for (unsigned int j
= 0; j
< vn_cnt
; ++j
)
602 elfcpp::Vernaux
<size
, big_endian
> vernaux(pvna
);
604 const unsigned int vna_name
= vernaux
.get_vna_name();
605 if (vna_name
>= names_size
)
607 this->error(_("vernaux vna_name field out of range: %u"),
608 static_cast<unsigned int>(vna_name
));
612 this->set_version_map(version_map
, vernaux
.get_vna_other(),
615 const section_size_type vna_next
= vernaux
.get_vna_next();
616 if ((pvna
- pverneed
) + vna_next
>= verneed_size
)
618 this->error(_("verneed vna_next field out of range: %u"),
619 static_cast<unsigned int>(vna_next
));
626 const section_size_type vn_next
= verneed
.get_vn_next();
627 if ((p
- pverneed
) + vn_next
>= verneed_size
)
629 this->error(_("verneed vn_next field out of range: %u"),
630 static_cast<unsigned int>(vn_next
));
638 // Create a vector mapping version numbers to version strings.
640 template<int size
, bool big_endian
>
642 Sized_dynobj
<size
, big_endian
>::make_version_map(
643 Read_symbols_data
* sd
,
644 Version_map
* version_map
) const
646 if (sd
->verdef
== NULL
&& sd
->verneed
== NULL
)
649 // A guess at the maximum version number we will see. If this is
650 // wrong we will be less efficient but still correct.
651 version_map
->reserve(sd
->verdef_info
+ sd
->verneed_info
* 10);
653 this->make_verdef_map(sd
, version_map
);
654 this->make_verneed_map(sd
, version_map
);
657 // Add the dynamic symbols to the symbol table.
659 template<int size
, bool big_endian
>
661 Sized_dynobj
<size
, big_endian
>::do_add_symbols(Symbol_table
* symtab
,
662 Read_symbols_data
* sd
,
665 if (sd
->symbols
== NULL
)
667 gold_assert(sd
->symbol_names
== NULL
);
668 gold_assert(sd
->versym
== NULL
&& sd
->verdef
== NULL
669 && sd
->verneed
== NULL
);
673 const int symsize
= This::sym_size
;
674 const size_t symcount
= sd
->symbols_size
/ symsize
;
675 gold_assert(sd
->external_symbols_offset
== 0);
676 if (symcount
* symsize
!= sd
->symbols_size
)
678 this->error(_("size of dynamic symbols is not multiple of symbol size"));
682 Version_map version_map
;
683 this->make_version_map(sd
, &version_map
);
685 // If printing symbol counts, we want to track symbols.
687 if (parameters
->options().user_set_print_symbol_counts())
689 this->symbols_
= new Symbols();
690 this->symbols_
->resize(symcount
);
693 const char* sym_names
=
694 reinterpret_cast<const char*>(sd
->symbol_names
->data());
695 symtab
->add_from_dynobj(this, sd
->symbols
->data(), symcount
,
696 sym_names
, sd
->symbol_names_size
,
699 : sd
->versym
->data()),
703 &this->defined_count_
);
707 delete sd
->symbol_names
;
708 sd
->symbol_names
= NULL
;
709 if (sd
->versym
!= NULL
)
714 if (sd
->verdef
!= NULL
)
719 if (sd
->verneed
!= NULL
)
725 // This is normally the last time we will read any data from this
727 this->clear_view_cache_marks();
730 // Get symbol counts.
732 template<int size
, bool big_endian
>
734 Sized_dynobj
<size
, big_endian
>::do_get_global_symbol_counts(
739 *defined
= this->defined_count_
;
741 for (typename
Symbols::const_iterator p
= this->symbols_
->begin();
742 p
!= this->symbols_
->end();
745 && (*p
)->source() == Symbol::FROM_OBJECT
746 && (*p
)->object() == this
747 && (*p
)->is_defined()
748 && (*p
)->dynsym_index() != -1U)
753 // Given a vector of hash codes, compute the number of hash buckets to
757 Dynobj::compute_bucket_count(const std::vector
<uint32_t>& hashcodes
,
758 bool for_gnu_hash_table
)
760 // FIXME: Implement optional hash table optimization.
762 // Array used to determine the number of hash table buckets to use
763 // based on the number of symbols there are. If there are fewer
764 // than 3 symbols we use 1 bucket, fewer than 17 symbols we use 3
765 // buckets, fewer than 37 we use 17 buckets, and so forth. We never
766 // use more than 262147 buckets. This is straight from the old GNU
768 static const unsigned int buckets
[] =
770 1, 3, 17, 37, 67, 97, 131, 197, 263, 521, 1031, 2053, 4099, 8209,
771 16411, 32771, 65537, 131101, 262147
773 const int buckets_count
= sizeof buckets
/ sizeof buckets
[0];
775 unsigned int symcount
= hashcodes
.size();
776 unsigned int ret
= 1;
777 const double full_fraction
778 = 1.0 - parameters
->options().hash_bucket_empty_fraction();
779 for (int i
= 0; i
< buckets_count
; ++i
)
781 if (symcount
< buckets
[i
] * full_fraction
)
786 if (for_gnu_hash_table
&& ret
< 2)
792 // The standard ELF hash function. This hash function must not
793 // change, as the dynamic linker uses it also.
796 Dynobj::elf_hash(const char* name
)
798 const unsigned char* nameu
= reinterpret_cast<const unsigned char*>(name
);
801 while ((c
= *nameu
++) != '\0')
804 uint32_t g
= h
& 0xf0000000;
808 // The ELF ABI says h &= ~g, but using xor is equivalent in
809 // this case (since g was set from h) and may save one
817 // Create a standard ELF hash table, setting *PPHASH and *PHASHLEN.
818 // DYNSYMS is a vector with all the global dynamic symbols.
819 // LOCAL_DYNSYM_COUNT is the number of local symbols in the dynamic
823 Dynobj::create_elf_hash_table(const std::vector
<Symbol
*>& dynsyms
,
824 unsigned int local_dynsym_count
,
825 unsigned char** pphash
,
826 unsigned int* phashlen
)
828 unsigned int dynsym_count
= dynsyms
.size();
830 // Get the hash values for all the symbols.
831 std::vector
<uint32_t> dynsym_hashvals(dynsym_count
);
832 for (unsigned int i
= 0; i
< dynsym_count
; ++i
)
833 dynsym_hashvals
[i
] = Dynobj::elf_hash(dynsyms
[i
]->name());
835 const unsigned int bucketcount
=
836 Dynobj::compute_bucket_count(dynsym_hashvals
, false);
838 std::vector
<uint32_t> bucket(bucketcount
);
839 std::vector
<uint32_t> chain(local_dynsym_count
+ dynsym_count
);
841 for (unsigned int i
= 0; i
< dynsym_count
; ++i
)
843 unsigned int dynsym_index
= dynsyms
[i
]->dynsym_index();
844 unsigned int bucketpos
= dynsym_hashvals
[i
] % bucketcount
;
845 chain
[dynsym_index
] = bucket
[bucketpos
];
846 bucket
[bucketpos
] = dynsym_index
;
849 unsigned int hashlen
= ((2
854 unsigned char* phash
= new unsigned char[hashlen
];
856 if (parameters
->target().is_big_endian())
858 #if defined(HAVE_TARGET_32_BIG) || defined(HAVE_TARGET_64_BIG)
859 Dynobj::sized_create_elf_hash_table
<true>(bucket
, chain
, phash
,
867 #if defined(HAVE_TARGET_32_LITTLE) || defined(HAVE_TARGET_64_LITTLE)
868 Dynobj::sized_create_elf_hash_table
<false>(bucket
, chain
, phash
,
879 // Fill in an ELF hash table.
881 template<bool big_endian
>
883 Dynobj::sized_create_elf_hash_table(const std::vector
<uint32_t>& bucket
,
884 const std::vector
<uint32_t>& chain
,
885 unsigned char* phash
,
886 unsigned int hashlen
)
888 unsigned char* p
= phash
;
890 const unsigned int bucketcount
= bucket
.size();
891 const unsigned int chaincount
= chain
.size();
893 elfcpp::Swap
<32, big_endian
>::writeval(p
, bucketcount
);
895 elfcpp::Swap
<32, big_endian
>::writeval(p
, chaincount
);
898 for (unsigned int i
= 0; i
< bucketcount
; ++i
)
900 elfcpp::Swap
<32, big_endian
>::writeval(p
, bucket
[i
]);
904 for (unsigned int i
= 0; i
< chaincount
; ++i
)
906 elfcpp::Swap
<32, big_endian
>::writeval(p
, chain
[i
]);
910 gold_assert(static_cast<unsigned int>(p
- phash
) == hashlen
);
913 // The hash function used for the GNU hash table. This hash function
914 // must not change, as the dynamic linker uses it also.
917 Dynobj::gnu_hash(const char* name
)
919 const unsigned char* nameu
= reinterpret_cast<const unsigned char*>(name
);
922 while ((c
= *nameu
++) != '\0')
923 h
= (h
<< 5) + h
+ c
;
927 // Create a GNU hash table, setting *PPHASH and *PHASHLEN. GNU hash
928 // tables are an extension to ELF which are recognized by the GNU
929 // dynamic linker. They are referenced using dynamic tag DT_GNU_HASH.
930 // TARGET is the target. DYNSYMS is a vector with all the global
931 // symbols which will be going into the dynamic symbol table.
932 // LOCAL_DYNSYM_COUNT is the number of local symbols in the dynamic
936 Dynobj::create_gnu_hash_table(const std::vector
<Symbol
*>& dynsyms
,
937 unsigned int local_dynsym_count
,
938 unsigned char** pphash
,
939 unsigned int* phashlen
)
941 const unsigned int count
= dynsyms
.size();
943 // Sort the dynamic symbols into two vectors. Symbols which we do
944 // not want to put into the hash table we store into
945 // UNHASHED_DYNSYMS. Symbols which we do want to store we put into
946 // HASHED_DYNSYMS. DYNSYM_HASHVALS is parallel to HASHED_DYNSYMS,
947 // and records the hash codes.
949 std::vector
<Symbol
*> unhashed_dynsyms
;
950 unhashed_dynsyms
.reserve(count
);
952 std::vector
<Symbol
*> hashed_dynsyms
;
953 hashed_dynsyms
.reserve(count
);
955 std::vector
<uint32_t> dynsym_hashvals
;
956 dynsym_hashvals
.reserve(count
);
958 for (unsigned int i
= 0; i
< count
; ++i
)
960 Symbol
* sym
= dynsyms
[i
];
962 // FIXME: Should put on unhashed_dynsyms if the symbol is
964 if (sym
->is_undefined())
965 unhashed_dynsyms
.push_back(sym
);
968 hashed_dynsyms
.push_back(sym
);
969 dynsym_hashvals
.push_back(Dynobj::gnu_hash(sym
->name()));
973 // Put the unhashed symbols at the start of the global portion of
974 // the dynamic symbol table.
975 const unsigned int unhashed_count
= unhashed_dynsyms
.size();
976 unsigned int unhashed_dynsym_index
= local_dynsym_count
;
977 for (unsigned int i
= 0; i
< unhashed_count
; ++i
)
979 unhashed_dynsyms
[i
]->set_dynsym_index(unhashed_dynsym_index
);
980 ++unhashed_dynsym_index
;
983 // For the actual data generation we call out to a templatized
985 int size
= parameters
->target().get_size();
986 bool big_endian
= parameters
->target().is_big_endian();
991 #ifdef HAVE_TARGET_32_BIG
992 Dynobj::sized_create_gnu_hash_table
<32, true>(hashed_dynsyms
,
994 unhashed_dynsym_index
,
1003 #ifdef HAVE_TARGET_32_LITTLE
1004 Dynobj::sized_create_gnu_hash_table
<32, false>(hashed_dynsyms
,
1006 unhashed_dynsym_index
,
1014 else if (size
== 64)
1018 #ifdef HAVE_TARGET_64_BIG
1019 Dynobj::sized_create_gnu_hash_table
<64, true>(hashed_dynsyms
,
1021 unhashed_dynsym_index
,
1030 #ifdef HAVE_TARGET_64_LITTLE
1031 Dynobj::sized_create_gnu_hash_table
<64, false>(hashed_dynsyms
,
1033 unhashed_dynsym_index
,
1045 // Create the actual data for a GNU hash table. This is just a copy
1046 // of the code from the old GNU linker.
1048 template<int size
, bool big_endian
>
1050 Dynobj::sized_create_gnu_hash_table(
1051 const std::vector
<Symbol
*>& hashed_dynsyms
,
1052 const std::vector
<uint32_t>& dynsym_hashvals
,
1053 unsigned int unhashed_dynsym_count
,
1054 unsigned char** pphash
,
1055 unsigned int* phashlen
)
1057 if (hashed_dynsyms
.empty())
1059 // Special case for the empty hash table.
1060 unsigned int hashlen
= 5 * 4 + size
/ 8;
1061 unsigned char* phash
= new unsigned char[hashlen
];
1062 // One empty bucket.
1063 elfcpp::Swap
<32, big_endian
>::writeval(phash
, 1);
1064 // Symbol index above unhashed symbols.
1065 elfcpp::Swap
<32, big_endian
>::writeval(phash
+ 4, unhashed_dynsym_count
);
1066 // One word for bitmask.
1067 elfcpp::Swap
<32, big_endian
>::writeval(phash
+ 8, 1);
1068 // Only bloom filter.
1069 elfcpp::Swap
<32, big_endian
>::writeval(phash
+ 12, 0);
1071 elfcpp::Swap
<size
, big_endian
>::writeval(phash
+ 16, 0);
1072 // No hashes in only bucket.
1073 elfcpp::Swap
<32, big_endian
>::writeval(phash
+ 16 + size
/ 8, 0);
1075 *phashlen
= hashlen
;
1081 const unsigned int bucketcount
=
1082 Dynobj::compute_bucket_count(dynsym_hashvals
, true);
1084 const unsigned int nsyms
= hashed_dynsyms
.size();
1086 uint32_t maskbitslog2
= 1;
1087 uint32_t x
= nsyms
>> 1;
1093 if (maskbitslog2
< 3)
1095 else if (((1U << (maskbitslog2
- 2)) & nsyms
) != 0)
1105 if (maskbitslog2
== 5)
1109 uint32_t mask
= (1U << shift1
) - 1U;
1110 uint32_t shift2
= maskbitslog2
;
1111 uint32_t maskbits
= 1U << maskbitslog2
;
1112 uint32_t maskwords
= 1U << (maskbitslog2
- shift1
);
1114 typedef typename
elfcpp::Elf_types
<size
>::Elf_WXword Word
;
1115 std::vector
<Word
> bitmask(maskwords
);
1116 std::vector
<uint32_t> counts(bucketcount
);
1117 std::vector
<uint32_t> indx(bucketcount
);
1118 uint32_t symindx
= unhashed_dynsym_count
;
1120 // Count the number of times each hash bucket is used.
1121 for (unsigned int i
= 0; i
< nsyms
; ++i
)
1122 ++counts
[dynsym_hashvals
[i
] % bucketcount
];
1124 unsigned int cnt
= symindx
;
1125 for (unsigned int i
= 0; i
< bucketcount
; ++i
)
1131 unsigned int hashlen
= (4 + bucketcount
+ nsyms
) * 4;
1132 hashlen
+= maskbits
/ 8;
1133 unsigned char* phash
= new unsigned char[hashlen
];
1135 elfcpp::Swap
<32, big_endian
>::writeval(phash
, bucketcount
);
1136 elfcpp::Swap
<32, big_endian
>::writeval(phash
+ 4, symindx
);
1137 elfcpp::Swap
<32, big_endian
>::writeval(phash
+ 8, maskwords
);
1138 elfcpp::Swap
<32, big_endian
>::writeval(phash
+ 12, shift2
);
1140 unsigned char* p
= phash
+ 16 + maskbits
/ 8;
1141 for (unsigned int i
= 0; i
< bucketcount
; ++i
)
1144 elfcpp::Swap
<32, big_endian
>::writeval(p
, 0);
1146 elfcpp::Swap
<32, big_endian
>::writeval(p
, indx
[i
]);
1150 for (unsigned int i
= 0; i
< nsyms
; ++i
)
1152 Symbol
* sym
= hashed_dynsyms
[i
];
1153 uint32_t hashval
= dynsym_hashvals
[i
];
1155 unsigned int bucket
= hashval
% bucketcount
;
1156 unsigned int val
= ((hashval
>> shift1
)
1157 & ((maskbits
>> shift1
) - 1));
1158 bitmask
[val
] |= (static_cast<Word
>(1U)) << (hashval
& mask
);
1159 bitmask
[val
] |= (static_cast<Word
>(1U)) << ((hashval
>> shift2
) & mask
);
1160 val
= hashval
& ~ 1U;
1161 if (counts
[bucket
] == 1)
1163 // Last element terminates the chain.
1166 elfcpp::Swap
<32, big_endian
>::writeval(p
+ (indx
[bucket
] - symindx
) * 4,
1170 sym
->set_dynsym_index(indx
[bucket
]);
1175 for (unsigned int i
= 0; i
< maskwords
; ++i
)
1177 elfcpp::Swap
<size
, big_endian
>::writeval(p
, bitmask
[i
]);
1181 *phashlen
= hashlen
;
1187 // Write this definition to a buffer for the output section.
1189 template<int size
, bool big_endian
>
1191 Verdef::write(const Stringpool
* dynpool
, bool is_last
, unsigned char* pb
) const
1193 const int verdef_size
= elfcpp::Elf_sizes
<size
>::verdef_size
;
1194 const int verdaux_size
= elfcpp::Elf_sizes
<size
>::verdaux_size
;
1196 elfcpp::Verdef_write
<size
, big_endian
> vd(pb
);
1197 vd
.set_vd_version(elfcpp::VER_DEF_CURRENT
);
1198 vd
.set_vd_flags((this->is_base_
? elfcpp::VER_FLG_BASE
: 0)
1199 | (this->is_weak_
? elfcpp::VER_FLG_WEAK
: 0));
1200 vd
.set_vd_ndx(this->index());
1201 vd
.set_vd_cnt(1 + this->deps_
.size());
1202 vd
.set_vd_hash(Dynobj::elf_hash(this->name()));
1203 vd
.set_vd_aux(verdef_size
);
1204 vd
.set_vd_next(is_last
1206 : verdef_size
+ (1 + this->deps_
.size()) * verdaux_size
);
1209 elfcpp::Verdaux_write
<size
, big_endian
> vda(pb
);
1210 vda
.set_vda_name(dynpool
->get_offset(this->name()));
1211 vda
.set_vda_next(this->deps_
.empty() ? 0 : verdaux_size
);
1214 Deps::const_iterator p
;
1216 for (p
= this->deps_
.begin(), i
= 0;
1217 p
!= this->deps_
.end();
1220 elfcpp::Verdaux_write
<size
, big_endian
> avda(pb
);
1221 avda
.set_vda_name(dynpool
->get_offset(*p
));
1222 avda
.set_vda_next(i
+ 1 >= this->deps_
.size() ? 0 : verdaux_size
);
1233 for (Need_versions::iterator p
= this->need_versions_
.begin();
1234 p
!= this->need_versions_
.end();
1239 // Add a new version to this file reference.
1242 Verneed::add_name(const char* name
)
1244 Verneed_version
* vv
= new Verneed_version(name
);
1245 this->need_versions_
.push_back(vv
);
1249 // Set the version indexes starting at INDEX.
1252 Verneed::finalize(unsigned int index
)
1254 for (Need_versions::iterator p
= this->need_versions_
.begin();
1255 p
!= this->need_versions_
.end();
1258 (*p
)->set_index(index
);
1264 // Write this list of referenced versions to a buffer for the output
1267 template<int size
, bool big_endian
>
1269 Verneed::write(const Stringpool
* dynpool
, bool is_last
,
1270 unsigned char* pb
) const
1272 const int verneed_size
= elfcpp::Elf_sizes
<size
>::verneed_size
;
1273 const int vernaux_size
= elfcpp::Elf_sizes
<size
>::vernaux_size
;
1275 elfcpp::Verneed_write
<size
, big_endian
> vn(pb
);
1276 vn
.set_vn_version(elfcpp::VER_NEED_CURRENT
);
1277 vn
.set_vn_cnt(this->need_versions_
.size());
1278 vn
.set_vn_file(dynpool
->get_offset(this->filename()));
1279 vn
.set_vn_aux(verneed_size
);
1280 vn
.set_vn_next(is_last
1282 : verneed_size
+ this->need_versions_
.size() * vernaux_size
);
1285 Need_versions::const_iterator p
;
1287 for (p
= this->need_versions_
.begin(), i
= 0;
1288 p
!= this->need_versions_
.end();
1291 elfcpp::Vernaux_write
<size
, big_endian
> vna(pb
);
1292 vna
.set_vna_hash(Dynobj::elf_hash((*p
)->version()));
1293 // FIXME: We need to sometimes set VER_FLG_WEAK here.
1294 vna
.set_vna_flags(0);
1295 vna
.set_vna_other((*p
)->index());
1296 vna
.set_vna_name(dynpool
->get_offset((*p
)->version()));
1297 vna
.set_vna_next(i
+ 1 >= this->need_versions_
.size()
1306 // Versions methods.
1308 Versions::Versions(const Version_script_info
& vscript
,
1309 Stringpool
* dynpool
)
1310 : defs_(), needs_(), version_table_(),
1311 is_finalized_(false), version_script_(vscript
),
1312 needs_base_version_(parameters
->options().shared())
1314 if (!this->version_script_
.empty())
1316 // Parse the version script, and insert each declared version into
1317 // defs_ and version_table_.
1318 std::vector
<std::string
> versions
= this->version_script_
.get_versions();
1320 if (this->needs_base_version_
&& !versions
.empty())
1321 this->define_base_version(dynpool
);
1323 for (size_t k
= 0; k
< versions
.size(); ++k
)
1325 Stringpool::Key version_key
;
1326 const char* version
= dynpool
->add(versions
[k
].c_str(),
1327 true, &version_key
);
1328 Verdef
* const vd
= new Verdef(
1330 this->version_script_
.get_dependencies(version
),
1331 false, false, false);
1332 this->defs_
.push_back(vd
);
1333 Key
key(version_key
, 0);
1334 this->version_table_
.insert(std::make_pair(key
, vd
));
1339 Versions::~Versions()
1341 for (Defs::iterator p
= this->defs_
.begin();
1342 p
!= this->defs_
.end();
1346 for (Needs::iterator p
= this->needs_
.begin();
1347 p
!= this->needs_
.end();
1352 // Define the base version of a shared library. The base version definition
1353 // must be the first entry in defs_. We insert it lazily so that defs_ is
1354 // empty if no symbol versioning is used. Then layout can just drop the
1355 // version sections.
1358 Versions::define_base_version(Stringpool
* dynpool
)
1360 // If we do any versioning at all, we always need a base version, so
1361 // define that first. Nothing explicitly declares itself as part of base,
1362 // so it doesn't need to be in version_table_.
1363 gold_assert(this->defs_
.empty());
1364 const char* name
= parameters
->options().soname();
1366 name
= parameters
->options().output_file_name();
1367 name
= dynpool
->add(name
, false, NULL
);
1368 Verdef
* vdbase
= new Verdef(name
, std::vector
<std::string
>(),
1370 this->defs_
.push_back(vdbase
);
1371 this->needs_base_version_
= false;
1374 // Return the dynamic object which a symbol refers to.
1377 Versions::get_dynobj_for_sym(const Symbol_table
* symtab
,
1378 const Symbol
* sym
) const
1380 if (sym
->is_copied_from_dynobj())
1381 return symtab
->get_copy_source(sym
);
1384 Object
* object
= sym
->object();
1385 gold_assert(object
->is_dynamic());
1386 return static_cast<Dynobj
*>(object
);
1390 // Record version information for a symbol going into the dynamic
1394 Versions::record_version(const Symbol_table
* symtab
,
1395 Stringpool
* dynpool
, const Symbol
* sym
)
1397 gold_assert(!this->is_finalized_
);
1398 gold_assert(sym
->version() != NULL
);
1400 Stringpool::Key version_key
;
1401 const char* version
= dynpool
->add(sym
->version(), false, &version_key
);
1403 if (!sym
->is_from_dynobj() && !sym
->is_copied_from_dynobj())
1405 if (parameters
->options().shared())
1406 this->add_def(sym
, version
, version_key
);
1410 // This is a version reference.
1411 Dynobj
* dynobj
= this->get_dynobj_for_sym(symtab
, sym
);
1412 this->add_need(dynpool
, dynobj
->soname(), version
, version_key
);
1416 // We've found a symbol SYM defined in version VERSION.
1419 Versions::add_def(const Symbol
* sym
, const char* version
,
1420 Stringpool::Key version_key
)
1422 Key
k(version_key
, 0);
1423 Version_base
* const vbnull
= NULL
;
1424 std::pair
<Version_table::iterator
, bool> ins
=
1425 this->version_table_
.insert(std::make_pair(k
, vbnull
));
1429 // We already have an entry for this version.
1430 Version_base
* vb
= ins
.first
->second
;
1432 // We have now seen a symbol in this version, so it is not
1434 gold_assert(vb
!= NULL
);
1439 // If we are creating a shared object, it is an error to
1440 // find a definition of a symbol with a version which is not
1441 // in the version script.
1442 if (parameters
->options().shared())
1443 gold_error(_("symbol %s has undefined version %s"),
1444 sym
->demangled_name().c_str(), version
);
1446 // We only insert a base version for shared library.
1447 gold_assert(!this->needs_base_version_
);
1449 // When creating a regular executable, automatically define
1451 Verdef
* vd
= new Verdef(version
, std::vector
<std::string
>(),
1452 false, false, false);
1453 this->defs_
.push_back(vd
);
1454 ins
.first
->second
= vd
;
1458 // Add a reference to version NAME in file FILENAME.
1461 Versions::add_need(Stringpool
* dynpool
, const char* filename
, const char* name
,
1462 Stringpool::Key name_key
)
1464 Stringpool::Key filename_key
;
1465 filename
= dynpool
->add(filename
, true, &filename_key
);
1467 Key
k(name_key
, filename_key
);
1468 Version_base
* const vbnull
= NULL
;
1469 std::pair
<Version_table::iterator
, bool> ins
=
1470 this->version_table_
.insert(std::make_pair(k
, vbnull
));
1474 // We already have an entry for this filename/version.
1478 // See whether we already have this filename. We don't expect many
1479 // version references, so we just do a linear search. This could be
1480 // replaced by a hash table.
1482 for (Needs::iterator p
= this->needs_
.begin();
1483 p
!= this->needs_
.end();
1486 if ((*p
)->filename() == filename
)
1495 // Create base version definition lazily for shared library.
1496 if (this->needs_base_version_
)
1497 this->define_base_version(dynpool
);
1499 // We have a new filename.
1500 vn
= new Verneed(filename
);
1501 this->needs_
.push_back(vn
);
1504 ins
.first
->second
= vn
->add_name(name
);
1507 // Set the version indexes. Create a new dynamic version symbol for
1508 // each new version definition.
1511 Versions::finalize(Symbol_table
* symtab
, unsigned int dynsym_index
,
1512 std::vector
<Symbol
*>* syms
)
1514 gold_assert(!this->is_finalized_
);
1516 unsigned int vi
= 1;
1518 for (Defs::iterator p
= this->defs_
.begin();
1519 p
!= this->defs_
.end();
1522 (*p
)->set_index(vi
);
1525 // Create a version symbol if necessary.
1526 if (!(*p
)->is_symbol_created())
1528 Symbol
* vsym
= symtab
->define_as_constant((*p
)->name(),
1532 elfcpp::STV_DEFAULT
, 0,
1534 vsym
->set_needs_dynsym_entry();
1535 vsym
->set_dynsym_index(dynsym_index
);
1537 syms
->push_back(vsym
);
1538 // The name is already in the dynamic pool.
1542 // Index 1 is used for global symbols.
1545 gold_assert(this->defs_
.empty());
1549 for (Needs::iterator p
= this->needs_
.begin();
1550 p
!= this->needs_
.end();
1552 vi
= (*p
)->finalize(vi
);
1554 this->is_finalized_
= true;
1556 return dynsym_index
;
1559 // Return the version index to use for a symbol. This does two hash
1560 // table lookups: one in DYNPOOL and one in this->version_table_.
1561 // Another approach alternative would be store a pointer in SYM, which
1562 // would increase the size of the symbol table. Or perhaps we could
1563 // use a hash table from dynamic symbol pointer values to Version_base
1567 Versions::version_index(const Symbol_table
* symtab
, const Stringpool
* dynpool
,
1568 const Symbol
* sym
) const
1570 Stringpool::Key version_key
;
1571 const char* version
= dynpool
->find(sym
->version(), &version_key
);
1572 gold_assert(version
!= NULL
);
1575 if (!sym
->is_from_dynobj() && !sym
->is_copied_from_dynobj())
1577 if (!parameters
->options().shared())
1578 return elfcpp::VER_NDX_GLOBAL
;
1579 k
= Key(version_key
, 0);
1583 Dynobj
* dynobj
= this->get_dynobj_for_sym(symtab
, sym
);
1585 Stringpool::Key filename_key
;
1586 const char* filename
= dynpool
->find(dynobj
->soname(), &filename_key
);
1587 gold_assert(filename
!= NULL
);
1589 k
= Key(version_key
, filename_key
);
1592 Version_table::const_iterator p
= this->version_table_
.find(k
);
1593 gold_assert(p
!= this->version_table_
.end());
1595 return p
->second
->index();
1598 // Return an allocated buffer holding the contents of the symbol
1601 template<int size
, bool big_endian
>
1603 Versions::symbol_section_contents(const Symbol_table
* symtab
,
1604 const Stringpool
* dynpool
,
1605 unsigned int local_symcount
,
1606 const std::vector
<Symbol
*>& syms
,
1608 unsigned int* psize
) const
1610 gold_assert(this->is_finalized_
);
1612 unsigned int sz
= (local_symcount
+ syms
.size()) * 2;
1613 unsigned char* pbuf
= new unsigned char[sz
];
1615 for (unsigned int i
= 0; i
< local_symcount
; ++i
)
1616 elfcpp::Swap
<16, big_endian
>::writeval(pbuf
+ i
* 2,
1617 elfcpp::VER_NDX_LOCAL
);
1619 for (std::vector
<Symbol
*>::const_iterator p
= syms
.begin();
1623 unsigned int vindex
;
1624 const char* version
= (*p
)->version();
1625 if (version
== NULL
)
1626 vindex
= elfcpp::VER_NDX_GLOBAL
;
1628 vindex
= this->version_index(symtab
, dynpool
, *p
);
1629 // If the symbol was defined as foo@V1 instead of foo@@V1, add
1631 if ((*p
)->version() != NULL
&& !(*p
)->is_default())
1632 vindex
|= elfcpp::VERSYM_HIDDEN
;
1633 elfcpp::Swap
<16, big_endian
>::writeval(pbuf
+ (*p
)->dynsym_index() * 2,
1641 // Return an allocated buffer holding the contents of the version
1642 // definition section.
1644 template<int size
, bool big_endian
>
1646 Versions::def_section_contents(const Stringpool
* dynpool
,
1647 unsigned char** pp
, unsigned int* psize
,
1648 unsigned int* pentries
) const
1650 gold_assert(this->is_finalized_
);
1651 gold_assert(!this->defs_
.empty());
1653 const int verdef_size
= elfcpp::Elf_sizes
<size
>::verdef_size
;
1654 const int verdaux_size
= elfcpp::Elf_sizes
<size
>::verdaux_size
;
1656 unsigned int sz
= 0;
1657 for (Defs::const_iterator p
= this->defs_
.begin();
1658 p
!= this->defs_
.end();
1661 sz
+= verdef_size
+ verdaux_size
;
1662 sz
+= (*p
)->count_dependencies() * verdaux_size
;
1665 unsigned char* pbuf
= new unsigned char[sz
];
1667 unsigned char* pb
= pbuf
;
1668 Defs::const_iterator p
;
1670 for (p
= this->defs_
.begin(), i
= 0;
1671 p
!= this->defs_
.end();
1673 pb
= (*p
)->write
<size
, big_endian
>(dynpool
,
1674 i
+ 1 >= this->defs_
.size(),
1677 gold_assert(static_cast<unsigned int>(pb
- pbuf
) == sz
);
1681 *pentries
= this->defs_
.size();
1684 // Return an allocated buffer holding the contents of the version
1685 // reference section.
1687 template<int size
, bool big_endian
>
1689 Versions::need_section_contents(const Stringpool
* dynpool
,
1690 unsigned char** pp
, unsigned int *psize
,
1691 unsigned int *pentries
) const
1693 gold_assert(this->is_finalized_
);
1694 gold_assert(!this->needs_
.empty());
1696 const int verneed_size
= elfcpp::Elf_sizes
<size
>::verneed_size
;
1697 const int vernaux_size
= elfcpp::Elf_sizes
<size
>::vernaux_size
;
1699 unsigned int sz
= 0;
1700 for (Needs::const_iterator p
= this->needs_
.begin();
1701 p
!= this->needs_
.end();
1705 sz
+= (*p
)->count_versions() * vernaux_size
;
1708 unsigned char* pbuf
= new unsigned char[sz
];
1710 unsigned char* pb
= pbuf
;
1711 Needs::const_iterator p
;
1713 for (p
= this->needs_
.begin(), i
= 0;
1714 p
!= this->needs_
.end();
1716 pb
= (*p
)->write
<size
, big_endian
>(dynpool
,
1717 i
+ 1 >= this->needs_
.size(),
1720 gold_assert(static_cast<unsigned int>(pb
- pbuf
) == sz
);
1724 *pentries
= this->needs_
.size();
1727 // Instantiate the templates we need. We could use the configure
1728 // script to restrict this to only the ones for implemented targets.
1730 #ifdef HAVE_TARGET_32_LITTLE
1732 class Sized_dynobj
<32, false>;
1735 #ifdef HAVE_TARGET_32_BIG
1737 class Sized_dynobj
<32, true>;
1740 #ifdef HAVE_TARGET_64_LITTLE
1742 class Sized_dynobj
<64, false>;
1745 #ifdef HAVE_TARGET_64_BIG
1747 class Sized_dynobj
<64, true>;
1750 #ifdef HAVE_TARGET_32_LITTLE
1753 Versions::symbol_section_contents
<32, false>(
1754 const Symbol_table
*,
1757 const std::vector
<Symbol
*>&,
1759 unsigned int*) const;
1762 #ifdef HAVE_TARGET_32_BIG
1765 Versions::symbol_section_contents
<32, true>(
1766 const Symbol_table
*,
1769 const std::vector
<Symbol
*>&,
1771 unsigned int*) const;
1774 #ifdef HAVE_TARGET_64_LITTLE
1777 Versions::symbol_section_contents
<64, false>(
1778 const Symbol_table
*,
1781 const std::vector
<Symbol
*>&,
1783 unsigned int*) const;
1786 #ifdef HAVE_TARGET_64_BIG
1789 Versions::symbol_section_contents
<64, true>(
1790 const Symbol_table
*,
1793 const std::vector
<Symbol
*>&,
1795 unsigned int*) const;
1798 #ifdef HAVE_TARGET_32_LITTLE
1801 Versions::def_section_contents
<32, false>(
1805 unsigned int*) const;
1808 #ifdef HAVE_TARGET_32_BIG
1811 Versions::def_section_contents
<32, true>(
1815 unsigned int*) const;
1818 #ifdef HAVE_TARGET_64_LITTLE
1821 Versions::def_section_contents
<64, false>(
1825 unsigned int*) const;
1828 #ifdef HAVE_TARGET_64_BIG
1831 Versions::def_section_contents
<64, true>(
1835 unsigned int*) const;
1838 #ifdef HAVE_TARGET_32_LITTLE
1841 Versions::need_section_contents
<32, false>(
1845 unsigned int*) const;
1848 #ifdef HAVE_TARGET_32_BIG
1851 Versions::need_section_contents
<32, true>(
1855 unsigned int*) const;
1858 #ifdef HAVE_TARGET_64_LITTLE
1861 Versions::need_section_contents
<64, false>(
1865 unsigned int*) const;
1868 #ifdef HAVE_TARGET_64_BIG
1871 Versions::need_section_contents
<64, true>(
1875 unsigned int*) const;
1878 } // End namespace gold.