//===- OutputSections.cpp -------------------------------------------------===// // // The LLVM Linker // // This file is distributed under the University of Illinois Open Source // License. See LICENSE.TXT for details. // //===----------------------------------------------------------------------===// #include "OutputSections.h" #include "Config.h" #include "SymbolTable.h" #include "Target.h" #include "llvm/Support/Dwarf.h" #include "llvm/Support/MathExtras.h" #include using namespace llvm; using namespace llvm::dwarf; using namespace llvm::object; using namespace llvm::support::endian; using namespace llvm::ELF; using namespace lld; using namespace lld::elf2; template OutputSectionBase::OutputSectionBase(StringRef Name, uint32_t Type, uintX_t Flags) : Name(Name) { memset(&Header, 0, sizeof(Elf_Shdr)); Header.sh_type = Type; Header.sh_flags = Flags; } template GotPltSection::GotPltSection() : OutputSectionBase(".got.plt", SHT_PROGBITS, SHF_ALLOC | SHF_WRITE) { this->Header.sh_addralign = sizeof(uintX_t); } template void GotPltSection::addEntry(SymbolBody *Sym) { Sym->GotPltIndex = Target->GotPltHeaderEntriesNum + Entries.size(); Entries.push_back(Sym); } template bool GotPltSection::empty() const { return Entries.empty(); } template void GotPltSection::finalize() { this->Header.sh_size = (Target->GotPltHeaderEntriesNum + Entries.size()) * sizeof(uintX_t); } template void GotPltSection::writeTo(uint8_t *Buf) { Target->writeGotPltHeader(Buf); Buf += Target->GotPltHeaderEntriesNum * sizeof(uintX_t); for (const SymbolBody *B : Entries) { Target->writeGotPlt(Buf, B->getPltVA()); Buf += sizeof(uintX_t); } } template GotSection::GotSection() : OutputSectionBase(".got", SHT_PROGBITS, SHF_ALLOC | SHF_WRITE) { if (Config->EMachine == EM_MIPS) this->Header.sh_flags |= SHF_MIPS_GPREL; this->Header.sh_addralign = sizeof(uintX_t); } template void GotSection::addEntry(SymbolBody *Sym) { Sym->GotIndex = Entries.size(); Entries.push_back(Sym); } template void GotSection::addMipsLocalEntry() { ++MipsLocalEntries; } template bool GotSection::addDynTlsEntry(SymbolBody *Sym) { if (Sym->hasGlobalDynIndex()) return false; Sym->GlobalDynIndex = Target->GotHeaderEntriesNum + Entries.size(); // Global Dynamic TLS entries take two GOT slots. Entries.push_back(Sym); Entries.push_back(nullptr); return true; } // Reserves TLS entries for a TLS module ID and a TLS block offset. // In total it takes two GOT slots. template bool GotSection::addTlsIndex() { if (TlsIndexOff != uint32_t(-1)) return false; TlsIndexOff = Entries.size() * sizeof(uintX_t); Entries.push_back(nullptr); Entries.push_back(nullptr); return true; } template typename GotSection::uintX_t GotSection::getMipsLocalFullAddr(const SymbolBody &B) { return getMipsLocalEntryAddr(B.getVA()); } template typename GotSection::uintX_t GotSection::getMipsLocalPageAddr(uintX_t EntryValue) { // Initialize the entry by the %hi(EntryValue) expression // but without right-shifting. return getMipsLocalEntryAddr((EntryValue + 0x8000) & ~0xffff); } template typename GotSection::uintX_t GotSection::getMipsLocalEntryAddr(uintX_t EntryValue) { size_t NewIndex = Target->GotHeaderEntriesNum + MipsLocalGotPos.size(); auto P = MipsLocalGotPos.insert(std::make_pair(EntryValue, NewIndex)); assert(!P.second || MipsLocalGotPos.size() <= MipsLocalEntries); return this->getVA() + P.first->second * sizeof(uintX_t); } template typename GotSection::uintX_t GotSection::getGlobalDynAddr(const SymbolBody &B) const { return this->getVA() + B.GlobalDynIndex * sizeof(uintX_t); } template const SymbolBody *GotSection::getMipsFirstGlobalEntry() const { return Entries.empty() ? nullptr : Entries.front(); } template unsigned GotSection::getMipsLocalEntriesNum() const { return Target->GotHeaderEntriesNum + MipsLocalEntries; } template void GotSection::finalize() { this->Header.sh_size = (Target->GotHeaderEntriesNum + MipsLocalEntries + Entries.size()) * sizeof(uintX_t); } template void GotSection::writeTo(uint8_t *Buf) { Target->writeGotHeader(Buf); for (std::pair &L : MipsLocalGotPos) { uint8_t *Entry = Buf + L.second * sizeof(uintX_t); write(Entry, L.first); } Buf += Target->GotHeaderEntriesNum * sizeof(uintX_t); Buf += MipsLocalEntries * sizeof(uintX_t); for (const SymbolBody *B : Entries) { uint8_t *Entry = Buf; Buf += sizeof(uintX_t); if (!B) continue; // MIPS has special rules to fill up GOT entries. // See "Global Offset Table" in Chapter 5 in the following document // for detailed description: // ftp://www.linux-mips.org/pub/linux/mips/doc/ABI/mipsabi.pdf // As the first approach, we can just store addresses for all symbols. if (Config->EMachine != EM_MIPS && canBePreempted(B, false)) continue; // The dynamic linker will take care of it. uintX_t VA = B->getVA(); write(Entry, VA); } } template PltSection::PltSection() : OutputSectionBase(".plt", SHT_PROGBITS, SHF_ALLOC | SHF_EXECINSTR) { this->Header.sh_addralign = 16; } template void PltSection::writeTo(uint8_t *Buf) { size_t Off = 0; if (Target->UseLazyBinding) { // At beginning of PLT, we have code to call the dynamic linker // to resolve dynsyms at runtime. Write such code. Target->writePltZero(Buf); Off += Target->PltZeroSize; } for (auto &I : Entries) { const SymbolBody *B = I.first; unsigned RelOff = I.second; uint64_t Got = Target->UseLazyBinding ? B->getGotPltVA() : B->getGotVA(); uint64_t Plt = this->getVA() + Off; Target->writePlt(Buf + Off, Got, Plt, B->PltIndex, RelOff); Off += Target->PltEntrySize; } } template void PltSection::addEntry(SymbolBody *Sym) { Sym->PltIndex = Entries.size(); unsigned RelOff = Target->UseLazyBinding ? Out::RelaPlt->getRelocOffset() : Out::RelaDyn->getRelocOffset(); Entries.push_back(std::make_pair(Sym, RelOff)); } template void PltSection::finalize() { this->Header.sh_size = Target->PltZeroSize + Entries.size() * Target->PltEntrySize; } template RelocationSection::RelocationSection(StringRef Name, bool IsRela) : OutputSectionBase(Name, IsRela ? SHT_RELA : SHT_REL, SHF_ALLOC), IsRela(IsRela) { this->Header.sh_entsize = IsRela ? sizeof(Elf_Rela) : sizeof(Elf_Rel); this->Header.sh_addralign = sizeof(uintX_t); } template void RelocationSection::addReloc(const DynamicReloc &Reloc) { SymbolBody *Sym = Reloc.Sym; if (!Reloc.UseSymVA && Sym) Sym->MustBeInDynSym = true; Relocs.push_back(Reloc); } template static typename ELFFile::uintX_t getOffset(const DynamicReloc &Rel) { typedef typename ELFFile::uintX_t uintX_t; SymbolBody *Sym = Rel.Sym; switch (Rel.OKind) { case DynamicReloc::Off_GTlsIndex: return Out::Got->getGlobalDynAddr(*Sym); case DynamicReloc::Off_GTlsOffset: return Out::Got->getGlobalDynAddr(*Sym) + sizeof(uintX_t); case DynamicReloc::Off_LTlsIndex: return Out::Got->getTlsIndexVA(); case DynamicReloc::Off_Sec: return Rel.OffsetSec->getOffset(Rel.OffsetInSec) + Rel.OffsetSec->OutSec->getVA(); case DynamicReloc::Off_Bss: return cast>(Sym)->OffsetInBss + Out::Bss->getVA(); case DynamicReloc::Off_Got: return Sym->getGotVA(); case DynamicReloc::Off_GotPlt: return Sym->getGotPltVA(); } llvm_unreachable("Invalid offset kind"); } template void RelocationSection::writeTo(uint8_t *Buf) { for (const DynamicReloc &Rel : Relocs) { auto *P = reinterpret_cast(Buf); Buf += IsRela ? sizeof(Elf_Rela) : sizeof(Elf_Rel); SymbolBody *Sym = Rel.Sym; if (IsRela) { uintX_t VA = 0; if (Rel.UseSymVA) VA = Sym->getVA(); else if (Rel.TargetSec) VA = Rel.TargetSec->getOffset(Rel.OffsetInTargetSec) + Rel.TargetSec->OutSec->getVA(); reinterpret_cast(P)->r_addend = Rel.Addend + VA; } P->r_offset = getOffset(Rel); uint32_t SymIdx = (!Rel.UseSymVA && Sym) ? Sym->DynsymIndex : 0; P->setSymbolAndType(SymIdx, Rel.Type, Config->Mips64EL); } } template unsigned RelocationSection::getRelocOffset() { return this->Header.sh_entsize * Relocs.size(); } template void RelocationSection::finalize() { this->Header.sh_link = Static ? Out::SymTab->SectionIndex : Out::DynSymTab->SectionIndex; this->Header.sh_size = Relocs.size() * this->Header.sh_entsize; } template InterpSection::InterpSection() : OutputSectionBase(".interp", SHT_PROGBITS, SHF_ALLOC) { this->Header.sh_size = Config->DynamicLinker.size() + 1; this->Header.sh_addralign = 1; } template void OutputSectionBase::writeHeaderTo(Elf_Shdr *SHdr) { *SHdr = Header; } template void InterpSection::writeTo(uint8_t *Buf) { memcpy(Buf, Config->DynamicLinker.data(), Config->DynamicLinker.size()); } template HashTableSection::HashTableSection() : OutputSectionBase(".hash", SHT_HASH, SHF_ALLOC) { this->Header.sh_entsize = sizeof(Elf_Word); this->Header.sh_addralign = sizeof(Elf_Word); } static uint32_t hashSysv(StringRef Name) { uint32_t H = 0; for (char C : Name) { H = (H << 4) + C; uint32_t G = H & 0xf0000000; if (G) H ^= G >> 24; H &= ~G; } return H; } template void HashTableSection::finalize() { this->Header.sh_link = Out::DynSymTab->SectionIndex; unsigned NumEntries = 2; // nbucket and nchain. NumEntries += Out::DynSymTab->getNumSymbols(); // The chain entries. // Create as many buckets as there are symbols. // FIXME: This is simplistic. We can try to optimize it, but implementing // support for SHT_GNU_HASH is probably even more profitable. NumEntries += Out::DynSymTab->getNumSymbols(); this->Header.sh_size = NumEntries * sizeof(Elf_Word); } template void HashTableSection::writeTo(uint8_t *Buf) { unsigned NumSymbols = Out::DynSymTab->getNumSymbols(); auto *P = reinterpret_cast(Buf); *P++ = NumSymbols; // nbucket *P++ = NumSymbols; // nchain Elf_Word *Buckets = P; Elf_Word *Chains = P + NumSymbols; for (const std::pair &P : Out::DynSymTab->getSymbols()) { SymbolBody *Body = P.first; StringRef Name = Body->getName(); unsigned I = Body->DynsymIndex; uint32_t Hash = hashSysv(Name) % NumSymbols; Chains[I] = Buckets[Hash]; Buckets[Hash] = I; } } static uint32_t hashGnu(StringRef Name) { uint32_t H = 5381; for (uint8_t C : Name) H = (H << 5) + H + C; return H; } template GnuHashTableSection::GnuHashTableSection() : OutputSectionBase(".gnu.hash", SHT_GNU_HASH, SHF_ALLOC) { this->Header.sh_entsize = ELFT::Is64Bits ? 0 : 4; this->Header.sh_addralign = sizeof(uintX_t); } template unsigned GnuHashTableSection::calcNBuckets(unsigned NumHashed) { if (!NumHashed) return 0; // These values are prime numbers which are not greater than 2^(N-1) + 1. // In result, for any particular NumHashed we return a prime number // which is not greater than NumHashed. static const unsigned Primes[] = { 1, 1, 3, 3, 7, 13, 31, 61, 127, 251, 509, 1021, 2039, 4093, 8191, 16381, 32749, 65521, 131071}; return Primes[std::min(Log2_32_Ceil(NumHashed), array_lengthof(Primes) - 1)]; } // Bloom filter estimation: at least 8 bits for each hashed symbol. // GNU Hash table requirement: it should be a power of 2, // the minimum value is 1, even for an empty table. // Expected results for a 32-bit target: // calcMaskWords(0..4) = 1 // calcMaskWords(5..8) = 2 // calcMaskWords(9..16) = 4 // For a 64-bit target: // calcMaskWords(0..8) = 1 // calcMaskWords(9..16) = 2 // calcMaskWords(17..32) = 4 template unsigned GnuHashTableSection::calcMaskWords(unsigned NumHashed) { if (!NumHashed) return 1; return NextPowerOf2((NumHashed - 1) / sizeof(Elf_Off)); } template void GnuHashTableSection::finalize() { unsigned NumHashed = HashedSymbols.size(); NBuckets = calcNBuckets(NumHashed); MaskWords = calcMaskWords(NumHashed); // Second hash shift estimation: just predefined values. Shift2 = ELFT::Is64Bits ? 6 : 5; this->Header.sh_link = Out::DynSymTab->SectionIndex; this->Header.sh_size = sizeof(Elf_Word) * 4 // Header + sizeof(Elf_Off) * MaskWords // Bloom Filter + sizeof(Elf_Word) * NBuckets // Hash Buckets + sizeof(Elf_Word) * NumHashed; // Hash Values } template void GnuHashTableSection::writeTo(uint8_t *Buf) { writeHeader(Buf); if (HashedSymbols.empty()) return; writeBloomFilter(Buf); writeHashTable(Buf); } template void GnuHashTableSection::writeHeader(uint8_t *&Buf) { auto *P = reinterpret_cast(Buf); *P++ = NBuckets; *P++ = Out::DynSymTab->getNumSymbols() - HashedSymbols.size(); *P++ = MaskWords; *P++ = Shift2; Buf = reinterpret_cast(P); } template void GnuHashTableSection::writeBloomFilter(uint8_t *&Buf) { unsigned C = sizeof(Elf_Off) * 8; auto *Masks = reinterpret_cast(Buf); for (const HashedSymbolData &Item : HashedSymbols) { size_t Pos = (Item.Hash / C) & (MaskWords - 1); uintX_t V = (uintX_t(1) << (Item.Hash % C)) | (uintX_t(1) << ((Item.Hash >> Shift2) % C)); Masks[Pos] |= V; } Buf += sizeof(Elf_Off) * MaskWords; } template void GnuHashTableSection::writeHashTable(uint8_t *Buf) { Elf_Word *Buckets = reinterpret_cast(Buf); Elf_Word *Values = Buckets + NBuckets; int PrevBucket = -1; int I = 0; for (const HashedSymbolData &Item : HashedSymbols) { int Bucket = Item.Hash % NBuckets; assert(PrevBucket <= Bucket); if (Bucket != PrevBucket) { Buckets[Bucket] = Item.Body->DynsymIndex; PrevBucket = Bucket; if (I > 0) Values[I - 1] |= 1; } Values[I] = Item.Hash & ~1; ++I; } if (I > 0) Values[I - 1] |= 1; } static bool includeInGnuHashTable(SymbolBody *B) { // Assume that includeInDynsym() is already checked. return !B->isUndefined(); } template void GnuHashTableSection::addSymbols( std::vector> &Symbols) { std::vector> NotHashed; NotHashed.reserve(Symbols.size()); HashedSymbols.reserve(Symbols.size()); for (const std::pair &P : Symbols) { SymbolBody *B = P.first; if (includeInGnuHashTable(B)) HashedSymbols.push_back( HashedSymbolData{B, P.second, hashGnu(B->getName())}); else NotHashed.push_back(P); } if (HashedSymbols.empty()) return; unsigned NBuckets = calcNBuckets(HashedSymbols.size()); std::stable_sort(HashedSymbols.begin(), HashedSymbols.end(), [&](const HashedSymbolData &L, const HashedSymbolData &R) { return L.Hash % NBuckets < R.Hash % NBuckets; }); Symbols = std::move(NotHashed); for (const HashedSymbolData &Item : HashedSymbols) Symbols.push_back(std::make_pair(Item.Body, Item.STName)); } template DynamicSection::DynamicSection(SymbolTable &SymTab) : OutputSectionBase(".dynamic", SHT_DYNAMIC, SHF_ALLOC | SHF_WRITE), SymTab(SymTab) { Elf_Shdr &Header = this->Header; Header.sh_addralign = sizeof(uintX_t); Header.sh_entsize = ELFT::Is64Bits ? 16 : 8; // .dynamic section is not writable on MIPS. // See "Special Section" in Chapter 4 in the following document: // ftp://www.linux-mips.org/pub/linux/mips/doc/ABI/mipsabi.pdf if (Config->EMachine == EM_MIPS) Header.sh_flags = SHF_ALLOC; } template void DynamicSection::finalize() { if (this->Header.sh_size) return; // Already finalized. Elf_Shdr &Header = this->Header; Header.sh_link = Out::DynStrTab->SectionIndex; auto Add = [=](Entry E) { Entries.push_back(E); }; // Add strings. We know that these are the last strings to be added to // DynStrTab and doing this here allows this function to set DT_STRSZ. if (!Config->RPath.empty()) Add({Config->EnableNewDtags ? DT_RUNPATH : DT_RPATH, Out::DynStrTab->addString(Config->RPath)}); for (const std::unique_ptr> &F : SymTab.getSharedFiles()) if (F->isNeeded()) Add({DT_NEEDED, Out::DynStrTab->addString(F->getSoName())}); if (!Config->SoName.empty()) Add({DT_SONAME, Out::DynStrTab->addString(Config->SoName)}); Out::DynStrTab->finalize(); if (Out::RelaDyn->hasRelocs()) { bool IsRela = Out::RelaDyn->isRela(); Add({IsRela ? DT_RELA : DT_REL, Out::RelaDyn}); Add({IsRela ? DT_RELASZ : DT_RELSZ, Out::RelaDyn->getSize()}); Add({IsRela ? DT_RELAENT : DT_RELENT, uintX_t(IsRela ? sizeof(Elf_Rela) : sizeof(Elf_Rel))}); } if (Out::RelaPlt && Out::RelaPlt->hasRelocs()) { Add({DT_JMPREL, Out::RelaPlt}); Add({DT_PLTRELSZ, Out::RelaPlt->getSize()}); Add({Config->EMachine == EM_MIPS ? DT_MIPS_PLTGOT : DT_PLTGOT, Out::GotPlt}); Add({DT_PLTREL, uint64_t(Out::RelaPlt->isRela() ? DT_RELA : DT_REL)}); } Add({DT_SYMTAB, Out::DynSymTab}); Add({DT_SYMENT, sizeof(Elf_Sym)}); Add({DT_STRTAB, Out::DynStrTab}); Add({DT_STRSZ, Out::DynStrTab->getSize()}); if (Out::GnuHashTab) Add({DT_GNU_HASH, Out::GnuHashTab}); if (Out::HashTab) Add({DT_HASH, Out::HashTab}); if (PreInitArraySec) { Add({DT_PREINIT_ARRAY, PreInitArraySec}); Add({DT_PREINIT_ARRAYSZ, PreInitArraySec->getSize()}); } if (InitArraySec) { Add({DT_INIT_ARRAY, InitArraySec}); Add({DT_INIT_ARRAYSZ, (uintX_t)InitArraySec->getSize()}); } if (FiniArraySec) { Add({DT_FINI_ARRAY, FiniArraySec}); Add({DT_FINI_ARRAYSZ, (uintX_t)FiniArraySec->getSize()}); } if (SymbolBody *B = SymTab.find(Config->Init)) Add({DT_INIT, B}); if (SymbolBody *B = SymTab.find(Config->Fini)) Add({DT_FINI, B}); uint32_t DtFlags = 0; uint32_t DtFlags1 = 0; if (Config->Bsymbolic) DtFlags |= DF_SYMBOLIC; if (Config->ZNodelete) DtFlags1 |= DF_1_NODELETE; if (Config->ZNow) { DtFlags |= DF_BIND_NOW; DtFlags1 |= DF_1_NOW; } if (Config->ZOrigin) { DtFlags |= DF_ORIGIN; DtFlags1 |= DF_1_ORIGIN; } if (DtFlags) Add({DT_FLAGS, DtFlags}); if (DtFlags1) Add({DT_FLAGS_1, DtFlags1}); if (!Config->Entry.empty()) Add({DT_DEBUG, (uint64_t)0}); if (Config->EMachine == EM_MIPS) { Add({DT_MIPS_RLD_VERSION, 1}); Add({DT_MIPS_FLAGS, RHF_NOTPOT}); Add({DT_MIPS_BASE_ADDRESS, (uintX_t)Target->getVAStart()}); Add({DT_MIPS_SYMTABNO, Out::DynSymTab->getNumSymbols()}); Add({DT_MIPS_LOCAL_GOTNO, Out::Got->getMipsLocalEntriesNum()}); if (const SymbolBody *B = Out::Got->getMipsFirstGlobalEntry()) Add({DT_MIPS_GOTSYM, B->DynsymIndex}); else Add({DT_MIPS_GOTSYM, Out::DynSymTab->getNumSymbols()}); Add({DT_PLTGOT, Out::Got}); if (Out::MipsRldMap) Add({DT_MIPS_RLD_MAP, Out::MipsRldMap}); } // +1 for DT_NULL Header.sh_size = (Entries.size() + 1) * Header.sh_entsize; } template void DynamicSection::writeTo(uint8_t *Buf) { auto *P = reinterpret_cast(Buf); for (const Entry &E : Entries) { P->d_tag = E.Tag; switch (E.Kind) { case Entry::SecAddr: P->d_un.d_ptr = E.OutSec->getVA(); break; case Entry::SymAddr: P->d_un.d_ptr = E.Sym->template getVA(); break; case Entry::PlainInt: P->d_un.d_val = E.Val; break; } ++P; } } template EhFrameHeader::EhFrameHeader() : OutputSectionBase(".eh_frame_hdr", llvm::ELF::SHT_PROGBITS, SHF_ALLOC) { // It's a 4 bytes of header + pointer to the contents of the .eh_frame section // + the number of FDE pointers in the table. this->Header.sh_size = 12; } // We have to get PC values of FDEs. They depend on relocations // which are target specific, so we run this code after performing // all relocations. We read the values from ouput buffer according to the // encoding given for FDEs. Return value is an offset to the initial PC value // for the FDE. template typename EhFrameHeader::uintX_t EhFrameHeader::getFdePc(uintX_t EhVA, const FdeData &F) { const endianness E = ELFT::TargetEndianness; assert((F.Enc & 0xF0) != DW_EH_PE_datarel); uintX_t FdeOff = EhVA + F.Off + 8; switch (F.Enc & 0xF) { case DW_EH_PE_udata2: case DW_EH_PE_sdata2: return FdeOff + read16(F.PCRel); case DW_EH_PE_udata4: case DW_EH_PE_sdata4: return FdeOff + read32(F.PCRel); case DW_EH_PE_udata8: case DW_EH_PE_sdata8: return FdeOff + read64(F.PCRel); case DW_EH_PE_absptr: if (sizeof(uintX_t) == 8) return FdeOff + read64(F.PCRel); return FdeOff + read32(F.PCRel); } fatal("unknown FDE size encoding"); } template void EhFrameHeader::writeTo(uint8_t *Buf) { const endianness E = ELFT::TargetEndianness; const uint8_t Header[] = {1, DW_EH_PE_pcrel | DW_EH_PE_sdata4, DW_EH_PE_udata4, DW_EH_PE_datarel | DW_EH_PE_sdata4}; memcpy(Buf, Header, sizeof(Header)); uintX_t EhVA = Sec->getVA(); uintX_t VA = this->getVA(); uintX_t EhOff = EhVA - VA - 4; write32(Buf + 4, EhOff); write32(Buf + 8, this->FdeList.size()); Buf += 12; // InitialPC -> Offset in .eh_frame, sorted by InitialPC. std::map PcToOffset; for (const FdeData &F : FdeList) PcToOffset[getFdePc(EhVA, F)] = F.Off; for (auto &I : PcToOffset) { // The first four bytes are an offset to the initial PC value for the FDE. write32(Buf, I.first - VA); // The last four bytes are an offset to the FDE data itself. write32(Buf + 4, EhVA + I.second - VA); Buf += 8; } } template void EhFrameHeader::assignEhFrame(EHOutputSection *Sec) { assert((!this->Sec || this->Sec == Sec) && "multiple .eh_frame sections not supported for .eh_frame_hdr"); Live = Config->EhFrameHdr; this->Sec = Sec; } template void EhFrameHeader::addFde(uint8_t Enc, size_t Off, uint8_t *PCRel) { if (Live && (Enc & 0xF0) == DW_EH_PE_datarel) fatal("DW_EH_PE_datarel encoding unsupported for FDEs by .eh_frame_hdr"); FdeList.push_back(FdeData{Enc, Off, PCRel}); } template void EhFrameHeader::reserveFde() { // Each FDE entry is 8 bytes long: // The first four bytes are an offset to the initial PC value for the FDE. The // last four byte are an offset to the FDE data itself. this->Header.sh_size += 8; } template OutputSection::OutputSection(StringRef Name, uint32_t Type, uintX_t Flags) : OutputSectionBase(Name, Type, Flags) {} template void OutputSection::addSection(InputSectionBase *C) { auto *S = cast>(C); Sections.push_back(S); S->OutSec = this; uint32_t Align = S->getAlign(); this->updateAlign(Align); uintX_t Off = this->Header.sh_size; Off = alignTo(Off, Align); S->OutSecOff = Off; Off += S->getSize(); this->Header.sh_size = Off; } // If an input string is in the form of "foo.N" where N is a number, // return N. Otherwise, returns 65536, which is one greater than the // lowest priority. static int getPriority(StringRef S) { size_t Pos = S.rfind('.'); if (Pos == StringRef::npos) return 65536; int V; if (S.substr(Pos + 1).getAsInteger(10, V)) return 65536; return V; } // This function is called after we sort input sections // to update their offsets. template void OutputSection::reassignOffsets() { uintX_t Off = 0; for (InputSection *S : Sections) { Off = alignTo(Off, S->getAlign()); S->OutSecOff = Off; Off += S->getSize(); } this->Header.sh_size = Off; } // Sorts input sections by section name suffixes, so that .foo.N comes // before .foo.M if N < M. Used to sort .{init,fini}_array.N sections. // We want to keep the original order if the priorities are the same // because the compiler keeps the original initialization order in a // translation unit and we need to respect that. // For more detail, read the section of the GCC's manual about init_priority. template void OutputSection::sortInitFini() { // Sort sections by priority. typedef std::pair *> Pair; auto Comp = [](const Pair &A, const Pair &B) { return A.first < B.first; }; std::vector V; for (InputSection *S : Sections) V.push_back({getPriority(S->getSectionName()), S}); std::stable_sort(V.begin(), V.end(), Comp); Sections.clear(); for (Pair &P : V) Sections.push_back(P.second); reassignOffsets(); } // Returns true if S matches /Filename.?\.o$/. static bool isCrtBeginEnd(StringRef S, StringRef Filename) { if (!S.endswith(".o")) return false; S = S.drop_back(2); if (S.endswith(Filename)) return true; return !S.empty() && S.drop_back().endswith(Filename); } static bool isCrtbegin(StringRef S) { return isCrtBeginEnd(S, "crtbegin"); } static bool isCrtend(StringRef S) { return isCrtBeginEnd(S, "crtend"); } // .ctors and .dtors are sorted by this priority from highest to lowest. // // 1. The section was contained in crtbegin (crtbegin contains // some sentinel value in its .ctors and .dtors so that the runtime // can find the beginning of the sections.) // // 2. The section has an optional priority value in the form of ".ctors.N" // or ".dtors.N" where N is a number. Unlike .{init,fini}_array, // they are compared as string rather than number. // // 3. The section is just ".ctors" or ".dtors". // // 4. The section was contained in crtend, which contains an end marker. // // In an ideal world, we don't need this function because .init_array and // .ctors are duplicate features (and .init_array is newer.) However, there // are too many real-world use cases of .ctors, so we had no choice to // support that with this rather ad-hoc semantics. template static bool compCtors(const InputSection *A, const InputSection *B) { bool BeginA = isCrtbegin(A->getFile()->getName()); bool BeginB = isCrtbegin(B->getFile()->getName()); if (BeginA != BeginB) return BeginA; bool EndA = isCrtend(A->getFile()->getName()); bool EndB = isCrtend(B->getFile()->getName()); if (EndA != EndB) return EndB; StringRef X = A->getSectionName(); StringRef Y = B->getSectionName(); assert(X.startswith(".ctors") || X.startswith(".dtors")); assert(Y.startswith(".ctors") || Y.startswith(".dtors")); X = X.substr(6); Y = Y.substr(6); if (X.empty() && Y.empty()) return false; return X < Y; } // Sorts input sections by the special rules for .ctors and .dtors. // Unfortunately, the rules are different from the one for .{init,fini}_array. // Read the comment above. template void OutputSection::sortCtorsDtors() { std::stable_sort(Sections.begin(), Sections.end(), compCtors); reassignOffsets(); } // Returns a VA which a relocatin RI refers to. Used only for local symbols. // For non-local symbols, use SymbolBody::getVA instead. template typename ELFFile::uintX_t elf2::getLocalRelTarget(const ObjectFile &File, const Elf_Rel_Impl &RI, typename ELFFile::uintX_t Addend) { typedef typename ELFFile::Elf_Sym Elf_Sym; typedef typename ELFFile::uintX_t uintX_t; // PPC64 has a special relocation representing the TOC base pointer // that does not have a corresponding symbol. if (Config->EMachine == EM_PPC64 && RI.getType(false) == R_PPC64_TOC) return getPPC64TocBase() + Addend; const Elf_Sym *Sym = File.getObj().getRelocationSymbol(&RI, File.getSymbolTable()); if (!Sym) fatal("Unsupported relocation without symbol"); InputSectionBase *Section = File.getSection(*Sym); if (Sym->getType() == STT_TLS) return (Section->OutSec->getVA() + Section->getOffset(*Sym) + Addend) - Out::TlsPhdr->p_vaddr; // According to the ELF spec reference to a local symbol from outside // the group are not allowed. Unfortunately .eh_frame breaks that rule // and must be treated specially. For now we just replace the symbol with // 0. if (Section == &InputSection::Discarded || !Section->isLive()) return Addend; uintX_t Offset = Sym->st_value; if (Sym->getType() == STT_SECTION) { Offset += Addend; Addend = 0; } return Section->OutSec->getVA() + Section->getOffset(Offset) + Addend; } // Returns true if a symbol can be replaced at load-time by a symbol // with the same name defined in other ELF executable or DSO. bool elf2::canBePreempted(const SymbolBody *Body, bool NeedsGot) { if (!Body) return false; // Body is a local symbol. if (Body->isShared()) return true; if (Body->isUndefined()) { if (!Body->isWeak()) return true; // This is an horrible corner case. Ideally we would like to say that any // undefined symbol can be preempted so that the dynamic linker has a // chance of finding it at runtime. // // The problem is that the code sequence used to test for weak undef // functions looks like // if (func) func() // If the code is -fPIC the first reference is a load from the got and // everything works. // If the code is not -fPIC there is no reasonable way to solve it: // * A relocation writing to the text segment will fail (it is ro). // * A copy relocation doesn't work for functions. // * The trick of using a plt entry as the address would fail here since // the plt entry would have a non zero address. // Since we cannot do anything better, we just resolve the symbol to 0 and // don't produce a dynamic relocation. // // As an extra hack, assume that if we are producing a shared library the // user knows what he or she is doing and can handle a dynamic relocation. return Config->Shared || NeedsGot; } if (!Config->Shared) return false; if (Body->getVisibility() != STV_DEFAULT) return false; if (Config->Bsymbolic || (Config->BsymbolicFunctions && Body->isFunc())) return false; return true; } template void OutputSection::writeTo(uint8_t *Buf) { for (InputSection *C : Sections) C->writeTo(Buf); } template EHOutputSection::EHOutputSection(StringRef Name, uint32_t Type, uintX_t Flags) : OutputSectionBase(Name, Type, Flags) { Out::EhFrameHdr->assignEhFrame(this); } template EHRegion::EHRegion(EHInputSection *S, unsigned Index) : S(S), Index(Index) {} template StringRef EHRegion::data() const { ArrayRef SecData = S->getSectionData(); ArrayRef> Offsets = S->Offsets; size_t Start = Offsets[Index].first; size_t End = Index == Offsets.size() - 1 ? SecData.size() : Offsets[Index + 1].first; return StringRef((const char *)SecData.data() + Start, End - Start); } template Cie::Cie(EHInputSection *S, unsigned Index) : EHRegion(S, Index) {} // Read a byte and advance D by one byte. static uint8_t readByte(ArrayRef &D) { if (D.empty()) fatal("corrupted or unsupported CIE information"); uint8_t B = D.front(); D = D.slice(1); return B; } static void skipLeb128(ArrayRef &D) { while (!D.empty()) { uint8_t Val = D.front(); D = D.slice(1); if ((Val & 0x80) == 0) return; } fatal("corrupted or unsupported CIE information"); } template static size_t getAugPSize(unsigned Enc) { switch (Enc & 0x0f) { case DW_EH_PE_absptr: case DW_EH_PE_signed: return ELFT::Is64Bits ? 8 : 4; case DW_EH_PE_udata2: case DW_EH_PE_sdata2: return 2; case DW_EH_PE_udata4: case DW_EH_PE_sdata4: return 4; case DW_EH_PE_udata8: case DW_EH_PE_sdata8: return 8; } fatal("unknown FDE encoding"); } template static void skipAugP(ArrayRef &D) { uint8_t Enc = readByte(D); if ((Enc & 0xf0) == DW_EH_PE_aligned) fatal("DW_EH_PE_aligned encoding is not supported"); size_t Size = getAugPSize(Enc); if (Size >= D.size()) fatal("corrupted CIE"); D = D.slice(Size); } template uint8_t EHOutputSection::getFdeEncoding(ArrayRef D) { if (D.size() < 8) fatal("CIE too small"); D = D.slice(8); uint8_t Version = readByte(D); if (Version != 1 && Version != 3) fatal("FDE version 1 or 3 expected, but got " + Twine((unsigned)Version)); auto AugEnd = std::find(D.begin() + 1, D.end(), '\0'); if (AugEnd == D.end()) fatal("corrupted CIE"); StringRef Aug((char *)D.begin(), AugEnd - D.begin()); D = D.slice(Aug.size() + 1); // Code alignment factor should always be 1 for .eh_frame. if (readByte(D) != 1) fatal("CIE code alignment must be 1"); // Skip data alignment factor. skipLeb128(D); // Skip the return address register. In CIE version 1 this is a single // byte. In CIE version 3 this is an unsigned LEB128. if (Version == 1) readByte(D); else skipLeb128(D); // We only care about an 'R' value, but other records may precede an 'R' // record. Records are not in TLV (type-length-value) format, so we need // to teach the linker how to skip records for each type. for (char C : Aug) { if (C == 'R') return readByte(D); if (C == 'z') { skipLeb128(D); continue; } if (C == 'P') { skipAugP(D); continue; } if (C == 'L') continue; fatal("unknown .eh_frame augmentation string: " + Aug); } return DW_EH_PE_absptr; } template static typename ELFFile::uintX_t readEntryLength(ArrayRef D) { const endianness E = ELFT::TargetEndianness; if (D.size() < 4) fatal("CIE/FDE too small"); // First 4 bytes of CIE/FDE is the size of the record. // If it is 0xFFFFFFFF, the next 8 bytes contain the size instead. uint64_t V = read32(D.data()); if (V < UINT32_MAX) { uint64_t Len = V + 4; if (Len > D.size()) fatal("CIE/FIE ends past the end of the section"); return Len; } if (D.size() < 12) fatal("CIE/FDE too small"); V = read64(D.data() + 4); uint64_t Len = V + 12; if (Len < V || D.size() < Len) fatal("CIE/FIE ends past the end of the section"); return Len; } template template void EHOutputSection::addSectionAux( EHInputSection *S, iterator_range *> Rels) { const endianness E = ELFT::TargetEndianness; S->OutSec = this; this->updateAlign(S->getAlign()); Sections.push_back(S); ArrayRef SecData = S->getSectionData(); ArrayRef D = SecData; uintX_t Offset = 0; auto RelI = Rels.begin(); auto RelE = Rels.end(); DenseMap OffsetToIndex; while (!D.empty()) { unsigned Index = S->Offsets.size(); S->Offsets.push_back(std::make_pair(Offset, -1)); uintX_t Length = readEntryLength(D); // If CIE/FDE data length is zero then Length is 4, this // shall be considered a terminator and processing shall end. if (Length == 4) break; StringRef Entry((const char *)D.data(), Length); while (RelI != RelE && RelI->r_offset < Offset) ++RelI; uintX_t NextOffset = Offset + Length; bool HasReloc = RelI != RelE && RelI->r_offset < NextOffset; uint32_t ID = read32(D.data() + 4); if (ID == 0) { // CIE Cie C(S, Index); if (Config->EhFrameHdr) C.FdeEncoding = getFdeEncoding(D); SymbolBody *Personality = nullptr; if (HasReloc) { uint32_t SymIndex = RelI->getSymbol(Config->Mips64EL); Personality = S->getFile()->getSymbolBody(SymIndex)->repl(); } std::pair CieInfo(Entry, Personality); auto P = CieMap.insert(std::make_pair(CieInfo, Cies.size())); if (P.second) { Cies.push_back(C); this->Header.sh_size += alignTo(Length, sizeof(uintX_t)); } OffsetToIndex[Offset] = P.first->second; } else { if (!HasReloc) fatal("FDE doesn't reference another section"); InputSectionBase *Target = S->getRelocTarget(*RelI); if (Target != &InputSection::Discarded && Target->isLive()) { uint32_t CieOffset = Offset + 4 - ID; auto I = OffsetToIndex.find(CieOffset); if (I == OffsetToIndex.end()) fatal("Invalid CIE reference"); Cies[I->second].Fdes.push_back(EHRegion(S, Index)); Out::EhFrameHdr->reserveFde(); this->Header.sh_size += alignTo(Length, sizeof(uintX_t)); } } Offset = NextOffset; D = D.slice(Length); } } template void EHOutputSection::addSection(InputSectionBase *C) { auto *S = cast>(C); const Elf_Shdr *RelSec = S->RelocSection; if (!RelSec) { addSectionAux(S, make_range(nullptr, nullptr)); return; } ELFFile &Obj = S->getFile()->getObj(); if (RelSec->sh_type == SHT_RELA) addSectionAux(S, Obj.relas(RelSec)); else addSectionAux(S, Obj.rels(RelSec)); } template static typename ELFFile::uintX_t writeAlignedCieOrFde(StringRef Data, uint8_t *Buf) { typedef typename ELFFile::uintX_t uintX_t; const endianness E = ELFT::TargetEndianness; uint64_t Len = alignTo(Data.size(), sizeof(uintX_t)); write32(Buf, Len - 4); memcpy(Buf + 4, Data.data() + 4, Data.size() - 4); return Len; } template void EHOutputSection::writeTo(uint8_t *Buf) { const endianness E = ELFT::TargetEndianness; size_t Offset = 0; for (const Cie &C : Cies) { size_t CieOffset = Offset; uintX_t CIELen = writeAlignedCieOrFde(C.data(), Buf + Offset); C.S->Offsets[C.Index].second = Offset; Offset += CIELen; for (const EHRegion &F : C.Fdes) { uintX_t Len = writeAlignedCieOrFde(F.data(), Buf + Offset); write32(Buf + Offset + 4, Offset + 4 - CieOffset); // Pointer F.S->Offsets[F.Index].second = Offset; Out::EhFrameHdr->addFde(C.FdeEncoding, Offset, Buf + Offset + 8); Offset += Len; } } for (EHInputSection *S : Sections) { const Elf_Shdr *RelSec = S->RelocSection; if (!RelSec) continue; ELFFile &EObj = S->getFile()->getObj(); if (RelSec->sh_type == SHT_RELA) S->relocate(Buf, nullptr, EObj.relas(RelSec)); else S->relocate(Buf, nullptr, EObj.rels(RelSec)); } } template MergeOutputSection::MergeOutputSection(StringRef Name, uint32_t Type, uintX_t Flags) : OutputSectionBase(Name, Type, Flags) {} template void MergeOutputSection::writeTo(uint8_t *Buf) { if (shouldTailMerge()) { StringRef Data = Builder.data(); memcpy(Buf, Data.data(), Data.size()); return; } for (const std::pair &P : Builder.getMap()) { StringRef Data = P.first; memcpy(Buf + P.second, Data.data(), Data.size()); } } static size_t findNull(StringRef S, size_t EntSize) { // Optimize the common case. if (EntSize == 1) return S.find(0); for (unsigned I = 0, N = S.size(); I != N; I += EntSize) { const char *B = S.begin() + I; if (std::all_of(B, B + EntSize, [](char C) { return C == 0; })) return I; } return StringRef::npos; } template void MergeOutputSection::addSection(InputSectionBase *C) { auto *S = cast>(C); S->OutSec = this; this->updateAlign(S->getAlign()); ArrayRef D = S->getSectionData(); StringRef Data((const char *)D.data(), D.size()); uintX_t EntSize = S->getSectionHdr()->sh_entsize; // If this is of type string, the contents are null-terminated strings. if (this->Header.sh_flags & SHF_STRINGS) { uintX_t Offset = 0; while (!Data.empty()) { size_t End = findNull(Data, EntSize); if (End == StringRef::npos) fatal("String is not null terminated"); StringRef Entry = Data.substr(0, End + EntSize); uintX_t OutputOffset = Builder.add(Entry); if (shouldTailMerge()) OutputOffset = -1; S->Offsets.push_back(std::make_pair(Offset, OutputOffset)); uintX_t Size = End + EntSize; Data = Data.substr(Size); Offset += Size; } return; } // If this is not of type string, every entry has the same size. for (unsigned I = 0, N = Data.size(); I != N; I += EntSize) { StringRef Entry = Data.substr(I, EntSize); size_t OutputOffset = Builder.add(Entry); S->Offsets.push_back(std::make_pair(I, OutputOffset)); } } template unsigned MergeOutputSection::getOffset(StringRef Val) { return Builder.getOffset(Val); } template bool MergeOutputSection::shouldTailMerge() const { return Config->Optimize >= 2 && this->Header.sh_flags & SHF_STRINGS; } template void MergeOutputSection::finalize() { if (shouldTailMerge()) Builder.finalize(); this->Header.sh_size = Builder.getSize(); } template StringTableSection::StringTableSection(StringRef Name, bool Dynamic) : OutputSectionBase(Name, SHT_STRTAB, Dynamic ? (uintX_t)SHF_ALLOC : 0), Dynamic(Dynamic) { this->Header.sh_addralign = 1; } // Adds a string to the string table. If HashIt is true we hash and check for // duplicates. It is optional because the name of global symbols are already // uniqued and hashing them again has a big cost for a small value: uniquing // them with some other string that happens to be the same. template unsigned StringTableSection::addString(StringRef S, bool HashIt) { if (HashIt) { auto R = StringMap.insert(std::make_pair(S, Size)); if (!R.second) return R.first->second; } unsigned Ret = Size; Size += S.size() + 1; Strings.push_back(S); return Ret; } template void StringTableSection::writeTo(uint8_t *Buf) { // ELF string tables start with NUL byte, so advance the pointer by one. ++Buf; for (StringRef S : Strings) { memcpy(Buf, S.data(), S.size()); Buf += S.size() + 1; } } template SymbolTableSection::SymbolTableSection( SymbolTable &Table, StringTableSection &StrTabSec) : OutputSectionBase(StrTabSec.isDynamic() ? ".dynsym" : ".symtab", StrTabSec.isDynamic() ? SHT_DYNSYM : SHT_SYMTAB, StrTabSec.isDynamic() ? (uintX_t)SHF_ALLOC : 0), StrTabSec(StrTabSec), Table(Table) { this->Header.sh_entsize = sizeof(Elf_Sym); this->Header.sh_addralign = sizeof(uintX_t); } // Orders symbols according to their positions in the GOT, // in compliance with MIPS ABI rules. // See "Global Offset Table" in Chapter 5 in the following document // for detailed description: // ftp://www.linux-mips.org/pub/linux/mips/doc/ABI/mipsabi.pdf static bool sortMipsSymbols(const std::pair &L, const std::pair &R) { if (!L.first->isInGot() || !R.first->isInGot()) return R.first->isInGot(); return L.first->GotIndex < R.first->GotIndex; } template void SymbolTableSection::finalize() { if (this->Header.sh_size) return; // Already finalized. this->Header.sh_size = getNumSymbols() * sizeof(Elf_Sym); this->Header.sh_link = StrTabSec.SectionIndex; this->Header.sh_info = NumLocals + 1; if (!StrTabSec.isDynamic()) { std::stable_sort(Symbols.begin(), Symbols.end(), [](const std::pair &L, const std::pair &R) { return getSymbolBinding(L.first) == STB_LOCAL && getSymbolBinding(R.first) != STB_LOCAL; }); return; } if (Out::GnuHashTab) // NB: It also sorts Symbols to meet the GNU hash table requirements. Out::GnuHashTab->addSymbols(Symbols); else if (Config->EMachine == EM_MIPS) std::stable_sort(Symbols.begin(), Symbols.end(), sortMipsSymbols); size_t I = 0; for (const std::pair &P : Symbols) P.first->DynsymIndex = ++I; } template void SymbolTableSection::addSymbol(SymbolBody *Body) { Symbols.push_back( std::make_pair(Body, StrTabSec.addString(Body->getName(), false))); } template void SymbolTableSection::writeTo(uint8_t *Buf) { Buf += sizeof(Elf_Sym); // All symbols with STB_LOCAL binding precede the weak and global symbols. // .dynsym only contains global symbols. if (!Config->DiscardAll && !StrTabSec.isDynamic()) writeLocalSymbols(Buf); writeGlobalSymbols(Buf); } template void SymbolTableSection::writeLocalSymbols(uint8_t *&Buf) { // Iterate over all input object files to copy their local symbols // to the output symbol table pointed by Buf. for (const std::unique_ptr> &File : Table.getObjectFiles()) { for (const std::pair &P : File->KeptLocalSyms) { const Elf_Sym *Sym = P.first; auto *ESym = reinterpret_cast(Buf); uintX_t VA = 0; if (Sym->st_shndx == SHN_ABS) { ESym->st_shndx = SHN_ABS; VA = Sym->st_value; } else { InputSectionBase *Section = File->getSection(*Sym); const OutputSectionBase *OutSec = Section->OutSec; ESym->st_shndx = OutSec->SectionIndex; VA = Section->getOffset(*Sym); // Symbol offsets for AMDGPU need to be the offset in bytes of the // symbol from the beginning of the section. if (Config->EMachine != EM_AMDGPU) VA += OutSec->getVA(); } ESym->st_name = P.second; ESym->st_size = Sym->st_size; ESym->setBindingAndType(Sym->getBinding(), Sym->getType()); ESym->st_value = VA; Buf += sizeof(*ESym); } } } template static const typename llvm::object::ELFFile::Elf_Sym * getElfSym(SymbolBody &Body) { if (auto *EBody = dyn_cast>(&Body)) return &EBody->Sym; if (auto *EBody = dyn_cast>(&Body)) return &EBody->Sym; return nullptr; } template void SymbolTableSection::writeGlobalSymbols(uint8_t *Buf) { // Write the internal symbol table contents to the output symbol table // pointed by Buf. auto *ESym = reinterpret_cast(Buf); for (const std::pair &P : Symbols) { SymbolBody *Body = P.first; const OutputSectionBase *OutSec = nullptr; switch (Body->kind()) { case SymbolBody::DefinedSyntheticKind: OutSec = &cast>(Body)->Section; break; case SymbolBody::DefinedRegularKind: { auto *Sym = cast>(Body->repl()); if (InputSectionBase *Sec = Sym->Section) { if (!Sec->isLive()) continue; OutSec = Sec->OutSec; } break; } case SymbolBody::DefinedCommonKind: OutSec = Out::Bss; break; case SymbolBody::SharedKind: { if (cast>(Body)->needsCopy()) OutSec = Out::Bss; break; } case SymbolBody::UndefinedElfKind: case SymbolBody::UndefinedKind: case SymbolBody::LazyKind: break; case SymbolBody::DefinedBitcodeKind: llvm_unreachable("Should have been replaced"); } ESym->st_name = P.second; unsigned char Type = STT_NOTYPE; uintX_t Size = 0; if (const Elf_Sym *InputSym = getElfSym(*Body)) { Type = InputSym->getType(); Size = InputSym->st_size; } else if (auto *C = dyn_cast(Body)) { Type = STT_OBJECT; Size = C->Size; } ESym->setBindingAndType(getSymbolBinding(Body), Type); ESym->st_size = Size; ESym->setVisibility(Body->getVisibility()); ESym->st_value = Body->getVA(); if (OutSec) ESym->st_shndx = OutSec->SectionIndex; else if (isa>(Body)) ESym->st_shndx = SHN_ABS; ++ESym; } } template uint8_t SymbolTableSection::getSymbolBinding(SymbolBody *Body) { uint8_t Visibility = Body->getVisibility(); if (Visibility != STV_DEFAULT && Visibility != STV_PROTECTED) return STB_LOCAL; if (const Elf_Sym *ESym = getElfSym(*Body)) return ESym->getBinding(); if (isa>(Body)) return STB_LOCAL; return Body->isWeak() ? STB_WEAK : STB_GLOBAL; } template MipsReginfoOutputSection::MipsReginfoOutputSection() : OutputSectionBase(".reginfo", SHT_MIPS_REGINFO, SHF_ALLOC) { this->Header.sh_addralign = 4; this->Header.sh_entsize = sizeof(Elf_Mips_RegInfo); this->Header.sh_size = sizeof(Elf_Mips_RegInfo); } template void MipsReginfoOutputSection::writeTo(uint8_t *Buf) { auto *R = reinterpret_cast(Buf); R->ri_gp_value = getMipsGpAddr(); R->ri_gprmask = GprMask; } template void MipsReginfoOutputSection::addSection(InputSectionBase *C) { // Copy input object file's .reginfo gprmask to output. auto *S = cast>(C); GprMask |= S->Reginfo->ri_gprmask; } namespace lld { namespace elf2 { template class OutputSectionBase; template class OutputSectionBase; template class OutputSectionBase; template class OutputSectionBase; template class EhFrameHeader; template class EhFrameHeader; template class EhFrameHeader; template class EhFrameHeader; template class GotPltSection; template class GotPltSection; template class GotPltSection; template class GotPltSection; template class GotSection; template class GotSection; template class GotSection; template class GotSection; template class PltSection; template class PltSection; template class PltSection; template class PltSection; template class RelocationSection; template class RelocationSection; template class RelocationSection; template class RelocationSection; template class InterpSection; template class InterpSection; template class InterpSection; template class InterpSection; template class GnuHashTableSection; template class GnuHashTableSection; template class GnuHashTableSection; template class GnuHashTableSection; template class HashTableSection; template class HashTableSection; template class HashTableSection; template class HashTableSection; template class DynamicSection; template class DynamicSection; template class DynamicSection; template class DynamicSection; template class OutputSection; template class OutputSection; template class OutputSection; template class OutputSection; template class EHOutputSection; template class EHOutputSection; template class EHOutputSection; template class EHOutputSection; template class MipsReginfoOutputSection; template class MipsReginfoOutputSection; template class MipsReginfoOutputSection; template class MipsReginfoOutputSection; template class MergeOutputSection; template class MergeOutputSection; template class MergeOutputSection; template class MergeOutputSection; template class StringTableSection; template class StringTableSection; template class StringTableSection; template class StringTableSection; template class SymbolTableSection; template class SymbolTableSection; template class SymbolTableSection; template class SymbolTableSection; template uint32_t getLocalRelTarget(const ObjectFile &, const ELFFile::Elf_Rel &, uint32_t); template uint32_t getLocalRelTarget(const ObjectFile &, const ELFFile::Elf_Rel &, uint32_t); template uint64_t getLocalRelTarget(const ObjectFile &, const ELFFile::Elf_Rel &, uint64_t); template uint64_t getLocalRelTarget(const ObjectFile &, const ELFFile::Elf_Rel &, uint64_t); template uint32_t getLocalRelTarget(const ObjectFile &, const ELFFile::Elf_Rela &, uint32_t); template uint32_t getLocalRelTarget(const ObjectFile &, const ELFFile::Elf_Rela &, uint32_t); template uint64_t getLocalRelTarget(const ObjectFile &, const ELFFile::Elf_Rela &, uint64_t); template uint64_t getLocalRelTarget(const ObjectFile &, const ELFFile::Elf_Rela &, uint64_t); } }