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   Live = false;
74 }
75 
76 // We allow sections of types listed below to merged into a
77 // single progbits section. This is typically done by linker
78 // scripts. Merging nobits and progbits will force disk space
79 // to be allocated for nobits sections. Other ones don't require
80 // any special treatment on top of progbits, so there doesn't
81 // seem to be a harm in merging them.
82 static bool canMergeToProgbits(unsigned Type) {
83   return Type == SHT_NOBITS || Type == SHT_PROGBITS || Type == SHT_INIT_ARRAY ||
84          Type == SHT_PREINIT_ARRAY || Type == SHT_FINI_ARRAY ||
85          Type == SHT_NOTE;
86 }
87 
88 void OutputSection::addSection(InputSection *IS) {
89   if (!Live) {
90     // If IS is the first section to be added to this section,
91     // initialize Type, Entsize and flags from IS.
92     Live = true;
93     Type = IS->Type;
94     Entsize = IS->Entsize;
95     Flags = IS->Flags;
96   } else {
97     // Otherwise, check if new type or flags are compatible with existing ones.
98     unsigned Mask = SHF_TLS | SHF_LINK_ORDER;
99     if ((Flags & Mask) != (IS->Flags & Mask))
100       error("incompatible section flags for " + Name + "\n>>> " + toString(IS) +
101             ": 0x" + utohexstr(IS->Flags) + "\n>>> output section " + Name +
102             ": 0x" + utohexstr(Flags));
103 
104     if (Type != IS->Type) {
105       if (!canMergeToProgbits(Type) || !canMergeToProgbits(IS->Type))
106         error("section type mismatch for " + IS->Name + "\n>>> " +
107               toString(IS) + ": " +
108               getELFSectionTypeName(Config->EMachine, IS->Type) +
109               "\n>>> output section " + Name + ": " +
110               getELFSectionTypeName(Config->EMachine, Type));
111       Type = SHT_PROGBITS;
112     }
113   }
114 
115   IS->Parent = this;
116   uint64_t AndMask =
117       Config->EMachine == EM_ARM ? (uint64_t)SHF_ARM_PURECODE : 0;
118   uint64_t OrMask = ~AndMask;
119   uint64_t AndFlags = (Flags & IS->Flags) & AndMask;
120   uint64_t OrFlags = (Flags | IS->Flags) & OrMask;
121   Flags = AndFlags | OrFlags;
122 
123   Alignment = std::max(Alignment, IS->Alignment);
124 
125   // If this section contains a table of fixed-size entries, sh_entsize
126   // holds the element size. If it contains elements of different size we
127   // set sh_entsize to 0.
128   if (Entsize != IS->Entsize)
129     Entsize = 0;
130 
131   if (!IS->Assigned) {
132     IS->Assigned = true;
133     if (SectionCommands.empty() ||
134         !isa<InputSectionDescription>(SectionCommands.back()))
135       SectionCommands.push_back(make<InputSectionDescription>(""));
136     auto *ISD = cast<InputSectionDescription>(SectionCommands.back());
137     ISD->Sections.push_back(IS);
138   }
139 }
140 
141 static void sortByOrder(MutableArrayRef<InputSection *> In,
142                         llvm::function_ref<int(InputSectionBase *S)> Order) {
143   typedef std::pair<int, InputSection *> Pair;
144   auto Comp = [](const Pair &A, const Pair &B) { return A.first < B.first; };
145 
146   std::vector<Pair> V;
147   for (InputSection *S : In)
148     V.push_back({Order(S), S});
149   std::stable_sort(V.begin(), V.end(), Comp);
150 
151   for (size_t I = 0; I < V.size(); ++I)
152     In[I] = V[I].second;
153 }
154 
155 uint64_t elf::getHeaderSize() {
156   if (Config->OFormatBinary)
157     return 0;
158   return Out::ElfHeader->Size + Out::ProgramHeaders->Size;
159 }
160 
161 bool OutputSection::classof(const BaseCommand *C) {
162   return C->Kind == OutputSectionKind;
163 }
164 
165 void OutputSection::sort(llvm::function_ref<int(InputSectionBase *S)> Order) {
166   assert(Live);
167   for (BaseCommand *B : SectionCommands)
168     if (auto *ISD = dyn_cast<InputSectionDescription>(B))
169       sortByOrder(ISD->Sections, Order);
170 }
171 
172 // Fill [Buf, Buf + Size) with Filler.
173 // This is used for linker script "=fillexp" command.
174 static void fill(uint8_t *Buf, size_t Size,
175                  const std::array<uint8_t, 4> &Filler) {
176   size_t I = 0;
177   for (; I + 4 < Size; I += 4)
178     memcpy(Buf + I, Filler.data(), 4);
179   memcpy(Buf + I, Filler.data(), Size - I);
180 }
181 
182 // Compress section contents if this section contains debug info.
183 template <class ELFT> void OutputSection::maybeCompress() {
184   typedef typename ELFT::Chdr Elf_Chdr;
185 
186   // Compress only DWARF debug sections.
187   if (!Config->CompressDebugSections || (Flags & SHF_ALLOC) ||
188       !Name.startswith(".debug_"))
189     return;
190 
191   // Create a section header.
192   ZDebugHeader.resize(sizeof(Elf_Chdr));
193   auto *Hdr = reinterpret_cast<Elf_Chdr *>(ZDebugHeader.data());
194   Hdr->ch_type = ELFCOMPRESS_ZLIB;
195   Hdr->ch_size = Size;
196   Hdr->ch_addralign = Alignment;
197 
198   // Write section contents to a temporary buffer and compress it.
199   std::vector<uint8_t> Buf(Size);
200   writeTo<ELFT>(Buf.data());
201   if (Error E = zlib::compress(toStringRef(Buf), CompressedData))
202     fatal("compress failed: " + llvm::toString(std::move(E)));
203 
204   // Update section headers.
205   Size = sizeof(Elf_Chdr) + CompressedData.size();
206   Flags |= SHF_COMPRESSED;
207 }
208 
209 static void writeInt(uint8_t *Buf, uint64_t Data, uint64_t Size) {
210   if (Size == 1)
211     *Buf = Data;
212   else if (Size == 2)
213     write16(Buf, Data);
214   else if (Size == 4)
215     write32(Buf, Data);
216   else if (Size == 8)
217     write64(Buf, Data);
218   else
219     llvm_unreachable("unsupported Size argument");
220 }
221 
222 template <class ELFT> void OutputSection::writeTo(uint8_t *Buf) {
223   if (Type == SHT_NOBITS)
224     return;
225 
226   // If -compress-debug-section is specified and if this is a debug seciton,
227   // we've already compressed section contents. If that's the case,
228   // just write it down.
229   if (!CompressedData.empty()) {
230     memcpy(Buf, ZDebugHeader.data(), ZDebugHeader.size());
231     memcpy(Buf + ZDebugHeader.size(), CompressedData.data(),
232            CompressedData.size());
233     return;
234   }
235 
236   // Write leading padding.
237   std::vector<InputSection *> Sections = getInputSections(this);
238   std::array<uint8_t, 4> Filler = getFiller();
239   bool NonZeroFiller = read32(Filler.data()) != 0;
240   if (NonZeroFiller)
241     fill(Buf, Sections.empty() ? Size : Sections[0]->OutSecOff, Filler);
242 
243   parallelForEachN(0, Sections.size(), [&](size_t I) {
244     InputSection *IS = Sections[I];
245     IS->writeTo<ELFT>(Buf);
246 
247     // Fill gaps between sections.
248     if (NonZeroFiller) {
249       uint8_t *Start = Buf + IS->OutSecOff + IS->getSize();
250       uint8_t *End;
251       if (I + 1 == Sections.size())
252         End = Buf + Size;
253       else
254         End = Buf + Sections[I + 1]->OutSecOff;
255       fill(Start, End - Start, Filler);
256     }
257   });
258 
259   // Linker scripts may have BYTE()-family commands with which you
260   // can write arbitrary bytes to the output. Process them if any.
261   for (BaseCommand *Base : SectionCommands)
262     if (auto *Data = dyn_cast<ByteCommand>(Base))
263       writeInt(Buf + Data->Offset, Data->Expression().getValue(), Data->Size);
264 }
265 
266 static void finalizeShtGroup(OutputSection *OS,
267                              InputSection *Section) {
268   assert(Config->Relocatable);
269 
270   // sh_link field for SHT_GROUP sections should contain the section index of
271   // the symbol table.
272   OS->Link = In.SymTab->getParent()->SectionIndex;
273 
274   // sh_info then contain index of an entry in symbol table section which
275   // provides signature of the section group.
276   ArrayRef<Symbol *> Symbols = Section->File->getSymbols();
277   OS->Info = In.SymTab->getSymbolIndex(Symbols[Section->Info]);
278 }
279 
280 void OutputSection::finalize() {
281   if (Type == SHT_NOBITS)
282     for (BaseCommand *Base : SectionCommands)
283       if (isa<ByteCommand>(Base))
284         Type = SHT_PROGBITS;
285 
286   std::vector<InputSection *> V = getInputSections(this);
287   InputSection *First = V.empty() ? nullptr : V[0];
288 
289   if (Flags & SHF_LINK_ORDER) {
290     // We must preserve the link order dependency of sections with the
291     // SHF_LINK_ORDER flag. The dependency is indicated by the sh_link field. We
292     // need to translate the InputSection sh_link to the OutputSection sh_link,
293     // all InputSections in the OutputSection have the same dependency.
294     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