1 //===- OutputSections.cpp -------------------------------------------------===// 2 // 3 // Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions. 4 // See https://llvm.org/LICENSE.txt for license information. 5 // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception 6 // 7 //===----------------------------------------------------------------------===// 8 9 #include "OutputSections.h" 10 #include "Config.h" 11 #include "LinkerScript.h" 12 #include "SymbolTable.h" 13 #include "SyntheticSections.h" 14 #include "Target.h" 15 #include "lld/Common/Memory.h" 16 #include "lld/Common/Strings.h" 17 #include "lld/Common/Threads.h" 18 #include "llvm/BinaryFormat/Dwarf.h" 19 #include "llvm/Support/Compression.h" 20 #include "llvm/Support/MD5.h" 21 #include "llvm/Support/MathExtras.h" 22 #include "llvm/Support/SHA1.h" 23 24 using namespace llvm; 25 using namespace llvm::dwarf; 26 using namespace llvm::object; 27 using namespace llvm::support::endian; 28 using namespace llvm::ELF; 29 30 using namespace lld; 31 using namespace lld::elf; 32 33 uint8_t *Out::BufferStart; 34 uint8_t Out::First; 35 PhdrEntry *Out::TlsPhdr; 36 OutputSection *Out::ElfHeader; 37 OutputSection *Out::ProgramHeaders; 38 OutputSection *Out::PreinitArray; 39 OutputSection *Out::InitArray; 40 OutputSection *Out::FiniArray; 41 42 std::vector<OutputSection *> elf::OutputSections; 43 44 uint32_t OutputSection::getPhdrFlags() const { 45 uint32_t Ret = 0; 46 if (Config->EMachine != EM_ARM || !(Flags & SHF_ARM_PURECODE)) 47 Ret |= PF_R; 48 if (Flags & SHF_WRITE) 49 Ret |= PF_W; 50 if (Flags & SHF_EXECINSTR) 51 Ret |= PF_X; 52 return Ret; 53 } 54 55 template <class ELFT> 56 void OutputSection::writeHeaderTo(typename ELFT::Shdr *Shdr) { 57 Shdr->sh_entsize = Entsize; 58 Shdr->sh_addralign = Alignment; 59 Shdr->sh_type = Type; 60 Shdr->sh_offset = Offset; 61 Shdr->sh_flags = Flags; 62 Shdr->sh_info = Info; 63 Shdr->sh_link = Link; 64 Shdr->sh_addr = Addr; 65 Shdr->sh_size = Size; 66 Shdr->sh_name = ShName; 67 } 68 69 OutputSection::OutputSection(StringRef Name, uint32_t Type, uint64_t Flags) 70 : BaseCommand(OutputSectionKind), 71 SectionBase(Output, Name, Flags, /*Entsize*/ 0, /*Alignment*/ 1, Type, 72 /*Info*/ 0, /*Link*/ 0) {} 73 74 // We allow sections of types listed below to merged into a 75 // single progbits section. This is typically done by linker 76 // scripts. Merging nobits and progbits will force disk space 77 // to be allocated for nobits sections. Other ones don't require 78 // any special treatment on top of progbits, so there doesn't 79 // seem to be a harm in merging them. 80 static bool canMergeToProgbits(unsigned Type) { 81 return Type == SHT_NOBITS || Type == SHT_PROGBITS || Type == SHT_INIT_ARRAY || 82 Type == SHT_PREINIT_ARRAY || Type == SHT_FINI_ARRAY || 83 Type == SHT_NOTE; 84 } 85 86 void OutputSection::addSection(InputSection *IS) { 87 if (!Live) { 88 // If IS is the first section to be added to this section, 89 // initialize Type, Entsize and flags from IS. 90 Live = true; 91 Type = IS->Type; 92 Entsize = IS->Entsize; 93 Flags = IS->Flags; 94 } else { 95 // Otherwise, check if new type or flags are compatible with existing ones. 96 unsigned Mask = SHF_TLS | SHF_LINK_ORDER; 97 if ((Flags & Mask) != (IS->Flags & Mask)) 98 error("incompatible section flags for " + Name + "\n>>> " + toString(IS) + 99 ": 0x" + utohexstr(IS->Flags) + "\n>>> output section " + Name + 100 ": 0x" + utohexstr(Flags)); 101 102 if (Type != IS->Type) { 103 if (!canMergeToProgbits(Type) || !canMergeToProgbits(IS->Type)) 104 error("section type mismatch for " + IS->Name + "\n>>> " + 105 toString(IS) + ": " + 106 getELFSectionTypeName(Config->EMachine, IS->Type) + 107 "\n>>> output section " + Name + ": " + 108 getELFSectionTypeName(Config->EMachine, Type)); 109 Type = SHT_PROGBITS; 110 } 111 } 112 113 IS->Parent = this; 114 uint64_t AndMask = 115 Config->EMachine == EM_ARM ? (uint64_t)SHF_ARM_PURECODE : 0; 116 uint64_t OrMask = ~AndMask; 117 uint64_t AndFlags = (Flags & IS->Flags) & AndMask; 118 uint64_t OrFlags = (Flags | IS->Flags) & OrMask; 119 Flags = AndFlags | OrFlags; 120 121 Alignment = std::max(Alignment, IS->Alignment); 122 123 // If this section contains a table of fixed-size entries, sh_entsize 124 // holds the element size. If it contains elements of different size we 125 // set sh_entsize to 0. 126 if (Entsize != IS->Entsize) 127 Entsize = 0; 128 129 if (!IS->Assigned) { 130 IS->Assigned = true; 131 if (SectionCommands.empty() || 132 !isa<InputSectionDescription>(SectionCommands.back())) 133 SectionCommands.push_back(make<InputSectionDescription>("")); 134 auto *ISD = cast<InputSectionDescription>(SectionCommands.back()); 135 ISD->Sections.push_back(IS); 136 } 137 } 138 139 static void sortByOrder(MutableArrayRef<InputSection *> In, 140 llvm::function_ref<int(InputSectionBase *S)> Order) { 141 using Pair = std::pair<int, InputSection *>; 142 auto Comp = [](const Pair &A, const Pair &B) { return A.first < B.first; }; 143 144 std::vector<Pair> V; 145 for (InputSection *S : In) 146 V.push_back({Order(S), S}); 147 std::stable_sort(V.begin(), V.end(), Comp); 148 149 for (size_t I = 0; I < V.size(); ++I) 150 In[I] = V[I].second; 151 } 152 153 uint64_t elf::getHeaderSize() { 154 if (Config->OFormatBinary) 155 return 0; 156 return Out::ElfHeader->Size + Out::ProgramHeaders->Size; 157 } 158 159 bool OutputSection::classof(const BaseCommand *C) { 160 return C->Kind == OutputSectionKind; 161 } 162 163 void OutputSection::sort(llvm::function_ref<int(InputSectionBase *S)> Order) { 164 assert(Live); 165 for (BaseCommand *B : SectionCommands) 166 if (auto *ISD = dyn_cast<InputSectionDescription>(B)) 167 sortByOrder(ISD->Sections, Order); 168 } 169 170 // Fill [Buf, Buf + Size) with Filler. 171 // This is used for linker script "=fillexp" command. 172 static void fill(uint8_t *Buf, size_t Size, 173 const std::array<uint8_t, 4> &Filler) { 174 size_t I = 0; 175 for (; I + 4 < Size; I += 4) 176 memcpy(Buf + I, Filler.data(), 4); 177 memcpy(Buf + I, Filler.data(), Size - I); 178 } 179 180 // Compress section contents if this section contains debug info. 181 template <class ELFT> void OutputSection::maybeCompress() { 182 using Elf_Chdr = typename ELFT::Chdr; 183 184 // Compress only DWARF debug sections. 185 if (!Config->CompressDebugSections || (Flags & SHF_ALLOC) || 186 !Name.startswith(".debug_")) 187 return; 188 189 // Create a section header. 190 ZDebugHeader.resize(sizeof(Elf_Chdr)); 191 auto *Hdr = reinterpret_cast<Elf_Chdr *>(ZDebugHeader.data()); 192 Hdr->ch_type = ELFCOMPRESS_ZLIB; 193 Hdr->ch_size = Size; 194 Hdr->ch_addralign = Alignment; 195 196 // Write section contents to a temporary buffer and compress it. 197 std::vector<uint8_t> Buf(Size); 198 writeTo<ELFT>(Buf.data()); 199 if (Error E = zlib::compress(toStringRef(Buf), CompressedData)) 200 fatal("compress failed: " + llvm::toString(std::move(E))); 201 202 // Update section headers. 203 Size = sizeof(Elf_Chdr) + CompressedData.size(); 204 Flags |= SHF_COMPRESSED; 205 } 206 207 static void writeInt(uint8_t *Buf, uint64_t Data, uint64_t Size) { 208 if (Size == 1) 209 *Buf = Data; 210 else if (Size == 2) 211 write16(Buf, Data); 212 else if (Size == 4) 213 write32(Buf, Data); 214 else if (Size == 8) 215 write64(Buf, Data); 216 else 217 llvm_unreachable("unsupported Size argument"); 218 } 219 220 template <class ELFT> void OutputSection::writeTo(uint8_t *Buf) { 221 if (Type == SHT_NOBITS) 222 return; 223 224 // If -compress-debug-section is specified and if this is a debug seciton, 225 // we've already compressed section contents. If that's the case, 226 // just write it down. 227 if (!CompressedData.empty()) { 228 memcpy(Buf, ZDebugHeader.data(), ZDebugHeader.size()); 229 memcpy(Buf + ZDebugHeader.size(), CompressedData.data(), 230 CompressedData.size()); 231 return; 232 } 233 234 // Write leading padding. 235 std::vector<InputSection *> Sections = getInputSections(this); 236 std::array<uint8_t, 4> Filler = getFiller(); 237 bool NonZeroFiller = read32(Filler.data()) != 0; 238 if (NonZeroFiller) 239 fill(Buf, Sections.empty() ? Size : Sections[0]->OutSecOff, Filler); 240 241 parallelForEachN(0, Sections.size(), [&](size_t I) { 242 InputSection *IS = Sections[I]; 243 IS->writeTo<ELFT>(Buf); 244 245 // Fill gaps between sections. 246 if (NonZeroFiller) { 247 uint8_t *Start = Buf + IS->OutSecOff + IS->getSize(); 248 uint8_t *End; 249 if (I + 1 == Sections.size()) 250 End = Buf + Size; 251 else 252 End = Buf + Sections[I + 1]->OutSecOff; 253 fill(Start, End - Start, Filler); 254 } 255 }); 256 257 // Linker scripts may have BYTE()-family commands with which you 258 // can write arbitrary bytes to the output. Process them if any. 259 for (BaseCommand *Base : SectionCommands) 260 if (auto *Data = dyn_cast<ByteCommand>(Base)) 261 writeInt(Buf + Data->Offset, Data->Expression().getValue(), Data->Size); 262 } 263 264 static void finalizeShtGroup(OutputSection *OS, 265 InputSection *Section) { 266 assert(Config->Relocatable); 267 268 // sh_link field for SHT_GROUP sections should contain the section index of 269 // the symbol table. 270 OS->Link = In.SymTab->getParent()->SectionIndex; 271 272 // sh_info then contain index of an entry in symbol table section which 273 // provides signature of the section group. 274 ArrayRef<Symbol *> Symbols = Section->File->getSymbols(); 275 OS->Info = In.SymTab->getSymbolIndex(Symbols[Section->Info]); 276 } 277 278 void OutputSection::finalize() { 279 if (Type == SHT_NOBITS) 280 for (BaseCommand *Base : SectionCommands) 281 if (isa<ByteCommand>(Base)) 282 Type = SHT_PROGBITS; 283 284 std::vector<InputSection *> V = getInputSections(this); 285 InputSection *First = V.empty() ? nullptr : V[0]; 286 287 if (Flags & SHF_LINK_ORDER) { 288 // We must preserve the link order dependency of sections with the 289 // SHF_LINK_ORDER flag. The dependency is indicated by the sh_link field. We 290 // need to translate the InputSection sh_link to the OutputSection sh_link, 291 // all InputSections in the OutputSection have the same dependency. 292 if (auto *EX = dyn_cast<ARMExidxSyntheticSection>(First)) 293 Link = EX->getLinkOrderDep()->getParent()->SectionIndex; 294 else if (auto *D = First->getLinkOrderDep()) 295 Link = D->getParent()->SectionIndex; 296 } 297 298 if (Type == SHT_GROUP) { 299 finalizeShtGroup(this, First); 300 return; 301 } 302 303 if (!Config->CopyRelocs || (Type != SHT_RELA && Type != SHT_REL)) 304 return; 305 306 if (isa<SyntheticSection>(First)) 307 return; 308 309 Link = In.SymTab->getParent()->SectionIndex; 310 // sh_info for SHT_REL[A] sections should contain the section header index of 311 // the section to which the relocation applies. 312 InputSectionBase *S = First->getRelocatedSection(); 313 Info = S->getOutputSection()->SectionIndex; 314 Flags |= SHF_INFO_LINK; 315 } 316 317 // Returns true if S matches /Filename.?\.o$/. 318 static bool isCrtBeginEnd(StringRef S, StringRef Filename) { 319 if (!S.endswith(".o")) 320 return false; 321 S = S.drop_back(2); 322 if (S.endswith(Filename)) 323 return true; 324 return !S.empty() && S.drop_back().endswith(Filename); 325 } 326 327 static bool isCrtbegin(StringRef S) { return isCrtBeginEnd(S, "crtbegin"); } 328 static bool isCrtend(StringRef S) { return isCrtBeginEnd(S, "crtend"); } 329 330 // .ctors and .dtors are sorted by this priority from highest to lowest. 331 // 332 // 1. The section was contained in crtbegin (crtbegin contains 333 // some sentinel value in its .ctors and .dtors so that the runtime 334 // can find the beginning of the sections.) 335 // 336 // 2. The section has an optional priority value in the form of ".ctors.N" 337 // or ".dtors.N" where N is a number. Unlike .{init,fini}_array, 338 // they are compared as string rather than number. 339 // 340 // 3. The section is just ".ctors" or ".dtors". 341 // 342 // 4. The section was contained in crtend, which contains an end marker. 343 // 344 // In an ideal world, we don't need this function because .init_array and 345 // .ctors are duplicate features (and .init_array is newer.) However, there 346 // are too many real-world use cases of .ctors, so we had no choice to 347 // support that with this rather ad-hoc semantics. 348 static bool compCtors(const InputSection *A, const InputSection *B) { 349 bool BeginA = isCrtbegin(A->File->getName()); 350 bool BeginB = isCrtbegin(B->File->getName()); 351 if (BeginA != BeginB) 352 return BeginA; 353 bool EndA = isCrtend(A->File->getName()); 354 bool EndB = isCrtend(B->File->getName()); 355 if (EndA != EndB) 356 return EndB; 357 StringRef X = A->Name; 358 StringRef Y = B->Name; 359 assert(X.startswith(".ctors") || X.startswith(".dtors")); 360 assert(Y.startswith(".ctors") || Y.startswith(".dtors")); 361 X = X.substr(6); 362 Y = Y.substr(6); 363 return X < Y; 364 } 365 366 // Sorts input sections by the special rules for .ctors and .dtors. 367 // Unfortunately, the rules are different from the one for .{init,fini}_array. 368 // Read the comment above. 369 void OutputSection::sortCtorsDtors() { 370 assert(SectionCommands.size() == 1); 371 auto *ISD = cast<InputSectionDescription>(SectionCommands[0]); 372 std::stable_sort(ISD->Sections.begin(), ISD->Sections.end(), compCtors); 373 } 374 375 // If an input string is in the form of "foo.N" where N is a number, 376 // return N. Otherwise, returns 65536, which is one greater than the 377 // lowest priority. 378 int elf::getPriority(StringRef S) { 379 size_t Pos = S.rfind('.'); 380 if (Pos == StringRef::npos) 381 return 65536; 382 int V; 383 if (!to_integer(S.substr(Pos + 1), V, 10)) 384 return 65536; 385 return V; 386 } 387 388 std::vector<InputSection *> elf::getInputSections(OutputSection *OS) { 389 std::vector<InputSection *> Ret; 390 for (BaseCommand *Base : OS->SectionCommands) 391 if (auto *ISD = dyn_cast<InputSectionDescription>(Base)) 392 Ret.insert(Ret.end(), ISD->Sections.begin(), ISD->Sections.end()); 393 return Ret; 394 } 395 396 // Sorts input sections by section name suffixes, so that .foo.N comes 397 // before .foo.M if N < M. Used to sort .{init,fini}_array.N sections. 398 // We want to keep the original order if the priorities are the same 399 // because the compiler keeps the original initialization order in a 400 // translation unit and we need to respect that. 401 // For more detail, read the section of the GCC's manual about init_priority. 402 void OutputSection::sortInitFini() { 403 // Sort sections by priority. 404 sort([](InputSectionBase *S) { return getPriority(S->Name); }); 405 } 406 407 std::array<uint8_t, 4> OutputSection::getFiller() { 408 if (Filler) 409 return *Filler; 410 if (Flags & SHF_EXECINSTR) 411 return Target->TrapInstr; 412 return {0, 0, 0, 0}; 413 } 414 415 template void OutputSection::writeHeaderTo<ELF32LE>(ELF32LE::Shdr *Shdr); 416 template void OutputSection::writeHeaderTo<ELF32BE>(ELF32BE::Shdr *Shdr); 417 template void OutputSection::writeHeaderTo<ELF64LE>(ELF64LE::Shdr *Shdr); 418 template void OutputSection::writeHeaderTo<ELF64BE>(ELF64BE::Shdr *Shdr); 419 420 template void OutputSection::writeTo<ELF32LE>(uint8_t *Buf); 421 template void OutputSection::writeTo<ELF32BE>(uint8_t *Buf); 422 template void OutputSection::writeTo<ELF64LE>(uint8_t *Buf); 423 template void OutputSection::writeTo<ELF64BE>(uint8_t *Buf); 424 425 template void OutputSection::maybeCompress<ELF32LE>(); 426 template void OutputSection::maybeCompress<ELF32BE>(); 427 template void OutputSection::maybeCompress<ELF64LE>(); 428 template void OutputSection::maybeCompress<ELF64BE>(); 429