blob: d782fdac5d130d88f5d17d1cb1ca286b0ba9b3e8 [file] [log] [blame]
Rafael Espindola5805c4f2015-09-21 21:38:08 +00001//===- OutputSections.cpp -------------------------------------------------===//
2//
3// The LLVM Linker
4//
5// This file is distributed under the University of Illinois Open Source
6// License. See LICENSE.TXT for details.
7//
8//===----------------------------------------------------------------------===//
9
10#include "OutputSections.h"
11#include "Config.h"
Rui Ueyama95642b92016-11-01 23:09:07 +000012#include "LinkerScript.h"
Rui Ueyama9381eb12016-12-18 14:06:06 +000013#include "Memory.h"
Rui Ueyamafbbde542016-06-29 09:08:02 +000014#include "Strings.h"
Rafael Espindola5805c4f2015-09-21 21:38:08 +000015#include "SymbolTable.h"
Rui Ueyamae8a61022016-11-05 23:05:47 +000016#include "SyntheticSections.h"
Rafael Espindola01205f72015-09-22 18:19:46 +000017#include "Target.h"
Rui Ueyama244a4352016-12-03 21:24:51 +000018#include "Threads.h"
George Rimarf6bc65a2016-01-15 13:34:52 +000019#include "llvm/Support/Dwarf.h"
Rui Ueyama3a41be22016-04-07 22:49:21 +000020#include "llvm/Support/MD5.h"
Igor Kudrin1b0d7062015-10-22 08:21:35 +000021#include "llvm/Support/MathExtras.h"
Rafael Espindolaa42b3bc2016-09-27 16:43:49 +000022#include "llvm/Support/SHA1.h"
Rafael Espindola5805c4f2015-09-21 21:38:08 +000023
Rafael Espindola5805c4f2015-09-21 21:38:08 +000024using namespace llvm;
Rui Ueyamadbcfedb2016-02-09 21:46:11 +000025using namespace llvm::dwarf;
Rafael Espindola5805c4f2015-09-21 21:38:08 +000026using namespace llvm::object;
Rafael Espindolaa6627382015-10-06 23:56:53 +000027using namespace llvm::support::endian;
Rafael Espindola5805c4f2015-09-21 21:38:08 +000028using namespace llvm::ELF;
29
30using namespace lld;
Rafael Espindolae0df00b2016-02-28 00:25:54 +000031using namespace lld::elf;
Rafael Espindola5805c4f2015-09-21 21:38:08 +000032
Rui Ueyama9d1bacb12017-02-27 02:31:26 +000033uint8_t Out::First;
Rui Ueyama9d1bacb12017-02-27 02:31:26 +000034OutputSection *Out::Opd;
35uint8_t *Out::OpdBuf;
36PhdrEntry *Out::TlsPhdr;
37OutputSection *Out::DebugInfo;
38OutputSection *Out::ElfHeader;
39OutputSection *Out::ProgramHeaders;
40OutputSection *Out::PreinitArray;
41OutputSection *Out::InitArray;
42OutputSection *Out::FiniArray;
43
Rafael Espindola24e6f362017-02-24 15:07:30 +000044uint32_t OutputSection::getPhdrFlags() const {
Rafael Espindola0b113672016-07-27 14:10:56 +000045 uint32_t Ret = PF_R;
46 if (Flags & SHF_WRITE)
47 Ret |= PF_W;
48 if (Flags & SHF_EXECINSTR)
49 Ret |= PF_X;
50 return Ret;
51}
52
Rafael Espindola35c6af32015-09-25 17:19:10 +000053template <class ELFT>
Rafael Espindola24e6f362017-02-24 15:07:30 +000054void OutputSection::writeHeaderTo(typename ELFT::Shdr *Shdr) {
Rafael Espindola04a2e342016-11-09 01:42:41 +000055 Shdr->sh_entsize = Entsize;
Rafael Espindola37707632017-03-07 14:55:52 +000056 Shdr->sh_addralign = Alignment;
Rafael Espindola04a2e342016-11-09 01:42:41 +000057 Shdr->sh_type = Type;
58 Shdr->sh_offset = Offset;
59 Shdr->sh_flags = Flags;
60 Shdr->sh_info = Info;
61 Shdr->sh_link = Link;
Rafael Espindolaea590d92017-02-08 15:19:03 +000062 Shdr->sh_addr = Addr;
Rafael Espindola04a2e342016-11-09 01:42:41 +000063 Shdr->sh_size = Size;
64 Shdr->sh_name = ShName;
Rui Ueyamac63c1db2016-03-13 06:50:33 +000065}
66
Rafael Espindola24e6f362017-02-24 15:07:30 +000067OutputSection::OutputSection(StringRef Name, uint32_t Type, uint64_t Flags)
Rafael Espindola5616adf2017-03-08 22:36:28 +000068 : SectionBase(Output, Name, Flags, /*Entsize*/ 0, /*Alignment*/ 1, Type,
69 /*Info*/ 0,
70 /*Link*/ 0) {}
George Rimar58941ee2016-02-25 08:23:37 +000071
Rafael Espindola774ea7d2017-02-23 16:49:07 +000072static bool compareByFilePosition(InputSection *A, InputSection *B) {
Peter Smith719eb8e2016-11-24 11:43:55 +000073 // Synthetic doesn't have link order dependecy, stable_sort will keep it last
Rafael Espindolac404d502017-02-23 02:32:18 +000074 if (A->kind() == InputSectionBase::Synthetic ||
75 B->kind() == InputSectionBase::Synthetic)
Peter Smith719eb8e2016-11-24 11:43:55 +000076 return false;
George Rimar9353e2d2017-03-21 08:29:48 +000077 auto *LA = cast<InputSection>(A->getLinkOrderDep());
78 auto *LB = cast<InputSection>(B->getLinkOrderDep());
Rafael Espindola24e6f362017-02-24 15:07:30 +000079 OutputSection *AOut = LA->OutSec;
80 OutputSection *BOut = LB->OutSec;
Rafael Espindola4d2d9c02016-11-18 19:02:15 +000081 if (AOut != BOut)
82 return AOut->SectionIndex < BOut->SectionIndex;
83 return LA->OutSecOff < LB->OutSecOff;
84}
85
Rafael Espindola24e6f362017-02-24 15:07:30 +000086template <class ELFT> void OutputSection::finalize() {
Eugene Levianta96d9022016-11-16 10:02:27 +000087 if ((this->Flags & SHF_LINK_ORDER) && !this->Sections.empty()) {
George Rimar9353e2d2017-03-21 08:29:48 +000088 std::sort(Sections.begin(), Sections.end(), compareByFilePosition);
George Rimarf98c5c12017-03-16 10:24:54 +000089 assignOffsets();
Rafael Espindola4d2d9c02016-11-18 19:02:15 +000090
Rafael Espindola933fcab2016-11-17 23:16:39 +000091 // We must preserve the link order dependency of sections with the
92 // SHF_LINK_ORDER flag. The dependency is indicated by the sh_link field. We
93 // need to translate the InputSection sh_link to the OutputSection sh_link,
94 // all InputSections in the OutputSection have the same dependency.
George Rimar9353e2d2017-03-21 08:29:48 +000095 if (auto *D = this->Sections.front()->getLinkOrderDep())
Eugene Levianta96d9022016-11-16 10:02:27 +000096 this->Link = D->OutSec->SectionIndex;
Peter Smith580ba952016-10-21 11:25:33 +000097 }
Eugene Leviant22eb0262016-11-14 09:16:00 +000098
Rafael Espindola933fcab2016-11-17 23:16:39 +000099 uint32_t Type = this->Type;
Rui Ueyamad57e74b72017-03-17 23:29:01 +0000100 if (!Config->CopyRelocs || (Type != SHT_RELA && Type != SHT_REL))
George Rimar58941ee2016-02-25 08:23:37 +0000101 return;
Rafael Espindola933fcab2016-11-17 23:16:39 +0000102
Rafael Espindola774ea7d2017-02-23 16:49:07 +0000103 InputSection *First = Sections[0];
Rui Ueyama9320cb02017-02-27 02:56:02 +0000104 if (isa<SyntheticSection>(First))
Rafael Espindola82f00ec2017-02-16 14:23:43 +0000105 return;
106
Eugene Leviant9230db92016-11-17 09:16:34 +0000107 this->Link = In<ELFT>::SymTab->OutSec->SectionIndex;
George Rimar58941ee2016-02-25 08:23:37 +0000108 // sh_info for SHT_REL[A] sections should contain the section header index of
109 // the section to which the relocation applies.
George Rimar1ec03e42017-03-21 09:13:27 +0000110 InputSectionBase *S = First->getRelocatedSection();
Rafael Espindola04a2e342016-11-09 01:42:41 +0000111 this->Info = S->OutSec->SectionIndex;
George Rimar58941ee2016-02-25 08:23:37 +0000112}
Rafael Espindola35c6af32015-09-25 17:19:10 +0000113
Rafael Espindoladc8eb812017-04-07 01:40:21 +0000114void OutputSection::addSection(InputSection *S) {
115 assert(S->Live);
Rui Ueyama40845e62015-12-26 05:51:07 +0000116 Sections.push_back(S);
117 S->OutSec = this;
Rui Ueyama424b4082016-06-17 01:18:46 +0000118 this->updateAlignment(S->Alignment);
Rui Ueyama27876642017-03-01 04:04:23 +0000119
120 // If this section contains a table of fixed-size entries, sh_entsize
121 // holds the element size. Consequently, if this contains two or more
122 // input sections, all of them must have the same sh_entsize. However,
123 // you can put different types of input sections into one output
124 // sectin by using linker scripts. I don't know what to do here.
125 // Probably we sholuld handle that as an error. But for now we just
126 // pick the largest sh_entsize.
127 this->Entsize = std::max(this->Entsize, S->Entsize);
Rafael Espindola5805c4f2015-09-21 21:38:08 +0000128}
129
Rui Ueyama809d8e22016-06-23 04:33:42 +0000130// This function is called after we sort input sections
131// and scan relocations to setup sections' offsets.
George Rimarf98c5c12017-03-16 10:24:54 +0000132void OutputSection::assignOffsets() {
George Rimarefc31dd2017-03-01 11:10:53 +0000133 uint64_t Off = 0;
Rafael Espindola774ea7d2017-02-23 16:49:07 +0000134 for (InputSection *S : Sections) {
Rui Ueyama809d8e22016-06-23 04:33:42 +0000135 Off = alignTo(Off, S->Alignment);
136 S->OutSecOff = Off;
Rafael Espindola76b6bd32017-03-08 15:44:30 +0000137 Off += S->getSize();
Rui Ueyama809d8e22016-06-23 04:33:42 +0000138 }
Rafael Espindola04a2e342016-11-09 01:42:41 +0000139 this->Size = Off;
Rui Ueyama5af83682016-02-11 23:41:38 +0000140}
141
Rafael Espindola24e6f362017-02-24 15:07:30 +0000142void OutputSection::sort(std::function<int(InputSectionBase *S)> Order) {
Rafael Espindola774ea7d2017-02-23 16:49:07 +0000143 typedef std::pair<unsigned, InputSection *> Pair;
George Rimar1a33c0f2016-11-10 09:05:20 +0000144 auto Comp = [](const Pair &A, const Pair &B) { return A.first < B.first; };
145
146 std::vector<Pair> V;
Rafael Espindola774ea7d2017-02-23 16:49:07 +0000147 for (InputSection *S : Sections)
George Rimar1a33c0f2016-11-10 09:05:20 +0000148 V.push_back({Order(S), S});
149 std::stable_sort(V.begin(), V.end(), Comp);
150 Sections.clear();
151 for (Pair &P : V)
152 Sections.push_back(P.second);
153}
154
Rui Ueyamac4185702016-02-10 23:20:42 +0000155// Sorts input sections by section name suffixes, so that .foo.N comes
156// before .foo.M if N < M. Used to sort .{init,fini}_array.N sections.
Rui Ueyama5af83682016-02-11 23:41:38 +0000157// We want to keep the original order if the priorities are the same
158// because the compiler keeps the original initialization order in a
159// translation unit and we need to respect that.
Rui Ueyamac4185702016-02-10 23:20:42 +0000160// For more detail, read the section of the GCC's manual about init_priority.
Rafael Espindola24e6f362017-02-24 15:07:30 +0000161void OutputSection::sortInitFini() {
Rui Ueyamac4185702016-02-10 23:20:42 +0000162 // Sort sections by priority.
Rafael Espindolac404d502017-02-23 02:32:18 +0000163 sort([](InputSectionBase *S) { return getPriority(S->Name); });
Rui Ueyama5af83682016-02-11 23:41:38 +0000164}
Rui Ueyamac4185702016-02-10 23:20:42 +0000165
Rui Ueyama5af83682016-02-11 23:41:38 +0000166// Returns true if S matches /Filename.?\.o$/.
167static bool isCrtBeginEnd(StringRef S, StringRef Filename) {
168 if (!S.endswith(".o"))
169 return false;
170 S = S.drop_back(2);
171 if (S.endswith(Filename))
172 return true;
173 return !S.empty() && S.drop_back().endswith(Filename);
174}
175
176static bool isCrtbegin(StringRef S) { return isCrtBeginEnd(S, "crtbegin"); }
177static bool isCrtend(StringRef S) { return isCrtBeginEnd(S, "crtend"); }
178
179// .ctors and .dtors are sorted by this priority from highest to lowest.
180//
181// 1. The section was contained in crtbegin (crtbegin contains
182// some sentinel value in its .ctors and .dtors so that the runtime
183// can find the beginning of the sections.)
184//
185// 2. The section has an optional priority value in the form of ".ctors.N"
186// or ".dtors.N" where N is a number. Unlike .{init,fini}_array,
187// they are compared as string rather than number.
188//
189// 3. The section is just ".ctors" or ".dtors".
190//
191// 4. The section was contained in crtend, which contains an end marker.
192//
193// In an ideal world, we don't need this function because .init_array and
194// .ctors are duplicate features (and .init_array is newer.) However, there
195// are too many real-world use cases of .ctors, so we had no choice to
196// support that with this rather ad-hoc semantics.
Rafael Espindola774ea7d2017-02-23 16:49:07 +0000197static bool compCtors(const InputSection *A, const InputSection *B) {
Rafael Espindolaa2e3fee2017-02-24 13:19:33 +0000198 bool BeginA = isCrtbegin(A->File->getName());
199 bool BeginB = isCrtbegin(B->File->getName());
Rui Ueyama5af83682016-02-11 23:41:38 +0000200 if (BeginA != BeginB)
201 return BeginA;
Rafael Espindolaa2e3fee2017-02-24 13:19:33 +0000202 bool EndA = isCrtend(A->File->getName());
203 bool EndB = isCrtend(B->File->getName());
Rui Ueyama5af83682016-02-11 23:41:38 +0000204 if (EndA != EndB)
205 return EndB;
Rafael Espindola042a3f22016-09-08 14:06:08 +0000206 StringRef X = A->Name;
207 StringRef Y = B->Name;
Rui Ueyama5af83682016-02-11 23:41:38 +0000208 assert(X.startswith(".ctors") || X.startswith(".dtors"));
209 assert(Y.startswith(".ctors") || Y.startswith(".dtors"));
210 X = X.substr(6);
211 Y = Y.substr(6);
Rui Ueyama24b794e2016-02-12 00:38:46 +0000212 if (X.empty() && Y.empty())
213 return false;
Rui Ueyama5af83682016-02-11 23:41:38 +0000214 return X < Y;
215}
216
217// Sorts input sections by the special rules for .ctors and .dtors.
218// Unfortunately, the rules are different from the one for .{init,fini}_array.
219// Read the comment above.
Rafael Espindola24e6f362017-02-24 15:07:30 +0000220void OutputSection::sortCtorsDtors() {
Rafael Espindolaa2e3fee2017-02-24 13:19:33 +0000221 std::stable_sort(Sections.begin(), Sections.end(), compCtors);
Rui Ueyamac4185702016-02-10 23:20:42 +0000222}
223
Rui Ueyama16068ae2016-11-19 18:05:56 +0000224// Fill [Buf, Buf + Size) with Filler. Filler is written in big
225// endian order. This is used for linker script "=fillexp" command.
Rui Ueyamac49bb0f2017-04-03 19:14:35 +0000226static void fill(uint8_t *Buf, size_t Size, uint32_t Filler) {
Rui Ueyama16068ae2016-11-19 18:05:56 +0000227 uint8_t V[4];
228 write32be(V, Filler);
George Rimare2ee72b2016-02-26 14:48:31 +0000229 size_t I = 0;
Rui Ueyama16068ae2016-11-19 18:05:56 +0000230 for (; I + 4 < Size; I += 4)
231 memcpy(Buf + I, V, 4);
232 memcpy(Buf + I, V, Size - I);
George Rimare2ee72b2016-02-26 14:48:31 +0000233}
234
Rafael Espindola24e6f362017-02-24 15:07:30 +0000235template <class ELFT> void OutputSection::writeTo(uint8_t *Buf) {
Eugene Leviant84569e62016-11-29 08:05:44 +0000236 Loc = Buf;
James Hendersond9831802017-04-06 15:22:58 +0000237 if (uint32_t Filler = Script->getFiller(this->Name))
238 fill(Buf, this->Size, Filler);
Rui Ueyama16068ae2016-11-19 18:05:56 +0000239
James Hendersond9831802017-04-06 15:22:58 +0000240 parallelForEach(Sections.begin(), Sections.end(),
241 [=](InputSection *IS) { IS->writeTo<ELFT>(Buf); });
Rui Ueyama16068ae2016-11-19 18:05:56 +0000242
George Rimare38cbab2016-09-26 19:22:50 +0000243 // Linker scripts may have BYTE()-family commands with which you
244 // can write arbitrary bytes to the output. Process them if any.
James Hendersond9831802017-04-06 15:22:58 +0000245 Script->writeDataBytes(this->Name, Buf);
Rafael Espindola5805c4f2015-09-21 21:38:08 +0000246}
247
George Rimar788fe382017-03-14 09:14:28 +0000248static uint64_t getOutFlags(InputSectionBase *S) {
Rafael Espindola1854a8e2016-10-26 12:36:56 +0000249 return S->Flags & ~SHF_GROUP & ~SHF_COMPRESSED;
Rafael Espindola10897f12016-09-13 14:23:14 +0000250}
251
Rafael Espindolab4c9b812017-02-23 02:28:28 +0000252static SectionKey createKey(InputSectionBase *C, StringRef OutsecName) {
Rafael Espindola33713982017-01-05 14:20:35 +0000253 // The ELF spec just says
254 // ----------------------------------------------------------------
255 // In the first phase, input sections that match in name, type and
256 // attribute flags should be concatenated into single sections.
257 // ----------------------------------------------------------------
258 //
259 // However, it is clear that at least some flags have to be ignored for
260 // section merging. At the very least SHF_GROUP and SHF_COMPRESSED have to be
261 // ignored. We should not have two output .text sections just because one was
262 // in a group and another was not for example.
263 //
264 // It also seems that that wording was a late addition and didn't get the
265 // necessary scrutiny.
266 //
267 // Merging sections with different flags is expected by some users. One
268 // reason is that if one file has
269 //
270 // int *const bar __attribute__((section(".foo"))) = (int *)0;
271 //
272 // gcc with -fPIC will produce a read only .foo section. But if another
273 // file has
274 //
275 // int zed;
276 // int *const bar __attribute__((section(".foo"))) = (int *)&zed;
277 //
278 // gcc with -fPIC will produce a read write section.
279 //
280 // Last but not least, when using linker script the merge rules are forced by
281 // the script. Unfortunately, linker scripts are name based. This means that
282 // expressions like *(.foo*) can refer to multiple input sections with
283 // different flags. We cannot put them in different output sections or we
284 // would produce wrong results for
285 //
286 // start = .; *(.foo.*) end = .; *(.bar)
287 //
288 // and a mapping of .foo1 and .bar1 to one section and .foo2 and .bar2 to
289 // another. The problem is that there is no way to layout those output
290 // sections such that the .foo sections are the only thing between the start
291 // and end symbols.
292 //
293 // Given the above issues, we instead merge sections by name and error on
294 // incompatible types and flags.
Rafael Espindola17c35832016-09-13 12:25:30 +0000295
Rafael Espindolafcd208f2017-03-08 19:35:29 +0000296 uint32_t Alignment = 0;
George Rimar09268b72017-03-14 09:25:03 +0000297 uint64_t Flags = 0;
Rafael Espindola9e9754b2017-02-03 13:06:18 +0000298 if (Config->Relocatable && (C->Flags & SHF_MERGE)) {
George Rimar09268b72017-03-14 09:25:03 +0000299 Alignment = std::max<uint64_t>(C->Alignment, C->Entsize);
Rafael Espindola9e9754b2017-02-03 13:06:18 +0000300 Flags = C->Flags & (SHF_MERGE | SHF_STRINGS);
301 }
Rafael Espindola17c35832016-09-13 12:25:30 +0000302
Rafael Espindola72447082017-01-05 14:35:41 +0000303 return SectionKey{OutsecName, Flags, Alignment};
Rafael Espindola17c35832016-09-13 12:25:30 +0000304}
305
Rui Ueyama02a036f2017-02-27 02:31:48 +0000306OutputSectionFactory::OutputSectionFactory(
Rafael Espindola24e6f362017-02-24 15:07:30 +0000307 std::vector<OutputSection *> &OutputSections)
Rafael Espindola82902742017-02-16 17:32:26 +0000308 : OutputSections(OutputSections) {}
George Rimar6892afa2016-07-12 09:49:43 +0000309
Rafael Espindola33713982017-01-05 14:20:35 +0000310static uint64_t getIncompatibleFlags(uint64_t Flags) {
311 return Flags & (SHF_ALLOC | SHF_TLS);
312}
313
Eugene Leviant0c0789b2017-01-31 10:26:52 +0000314// We allow sections of types listed below to merged into a
315// single progbits section. This is typically done by linker
316// scripts. Merging nobits and progbits will force disk space
317// to be allocated for nobits sections. Other ones don't require
318// any special treatment on top of progbits, so there doesn't
319// seem to be a harm in merging them.
320static bool canMergeToProgbits(unsigned Type) {
321 return Type == SHT_NOBITS || Type == SHT_PROGBITS || Type == SHT_INIT_ARRAY ||
322 Type == SHT_PREINIT_ARRAY || Type == SHT_FINI_ARRAY ||
323 Type == SHT_NOTE;
324}
325
George Rimarf08b5922017-03-14 09:19:34 +0000326static void reportDiscarded(InputSectionBase *IS) {
Rafael Espindolaecbfd872017-02-17 17:35:07 +0000327 if (!Config->PrintGcSections)
328 return;
Rui Ueyamae6e206d2017-02-21 23:22:56 +0000329 message("removing unused section from '" + IS->Name + "' in file '" +
George Rimarf08b5922017-03-14 09:19:34 +0000330 IS->File->getName());
Rafael Espindolaecbfd872017-02-17 17:35:07 +0000331}
332
Rui Ueyama02a036f2017-02-27 02:31:48 +0000333void OutputSectionFactory::addInputSec(InputSectionBase *IS,
334 StringRef OutsecName) {
Rafael Espindola82902742017-02-16 17:32:26 +0000335 if (!IS->Live) {
George Rimarf08b5922017-03-14 09:19:34 +0000336 reportDiscarded(IS);
Rafael Espindola82902742017-02-16 17:32:26 +0000337 return;
338 }
339
George Rimar09268b72017-03-14 09:25:03 +0000340 SectionKey Key = createKey(IS, OutsecName);
George Rimar788fe382017-03-14 09:14:28 +0000341 uint64_t Flags = getOutFlags(IS);
Rafael Espindola24e6f362017-02-24 15:07:30 +0000342 OutputSection *&Sec = Map[Key];
Rafael Espindola10897f12016-09-13 14:23:14 +0000343 if (Sec) {
Rafael Espindola82902742017-02-16 17:32:26 +0000344 if (getIncompatibleFlags(Sec->Flags) != getIncompatibleFlags(IS->Flags))
Rafael Espindola33713982017-01-05 14:20:35 +0000345 error("Section has flags incompatible with others with the same name " +
Rafael Espindola82902742017-02-16 17:32:26 +0000346 toString(IS));
347 if (Sec->Type != IS->Type) {
348 if (canMergeToProgbits(Sec->Type) && canMergeToProgbits(IS->Type))
Eugene Leviant0c0789b2017-01-31 10:26:52 +0000349 Sec->Type = SHT_PROGBITS;
350 else
351 error("Section has different type from others with the same name " +
Rafael Espindola82902742017-02-16 17:32:26 +0000352 toString(IS));
Eugene Leviant0c0789b2017-01-31 10:26:52 +0000353 }
Rafael Espindola04a2e342016-11-09 01:42:41 +0000354 Sec->Flags |= Flags;
Rafael Espindola82902742017-02-16 17:32:26 +0000355 } else {
Petr Hosek7b793212017-03-10 20:00:42 +0000356 Sec = make<OutputSection>(Key.Name, IS->Type, Flags);
Rafael Espindola82902742017-02-16 17:32:26 +0000357 OutputSections.push_back(Sec);
Rafael Espindola10897f12016-09-13 14:23:14 +0000358 }
359
Rafael Espindoladc8eb812017-04-07 01:40:21 +0000360 Sec->addSection(cast<InputSection>(IS));
George Rimar6892afa2016-07-12 09:49:43 +0000361}
362
Rui Ueyama02a036f2017-02-27 02:31:48 +0000363OutputSectionFactory::~OutputSectionFactory() {}
Rafael Espindola82902742017-02-16 17:32:26 +0000364
Rafael Espindola72447082017-01-05 14:35:41 +0000365SectionKey DenseMapInfo<SectionKey>::getEmptyKey() {
366 return SectionKey{DenseMapInfo<StringRef>::getEmptyKey(), 0, 0};
George Rimar6892afa2016-07-12 09:49:43 +0000367}
368
Rafael Espindola72447082017-01-05 14:35:41 +0000369SectionKey DenseMapInfo<SectionKey>::getTombstoneKey() {
370 return SectionKey{DenseMapInfo<StringRef>::getTombstoneKey(), 0, 0};
George Rimar6892afa2016-07-12 09:49:43 +0000371}
372
Rafael Espindola72447082017-01-05 14:35:41 +0000373unsigned DenseMapInfo<SectionKey>::getHashValue(const SectionKey &Val) {
Rafael Espindola33713982017-01-05 14:20:35 +0000374 return hash_combine(Val.Name, Val.Flags, Val.Alignment);
George Rimar6892afa2016-07-12 09:49:43 +0000375}
376
Rafael Espindola72447082017-01-05 14:35:41 +0000377bool DenseMapInfo<SectionKey>::isEqual(const SectionKey &LHS,
378 const SectionKey &RHS) {
George Rimar6892afa2016-07-12 09:49:43 +0000379 return DenseMapInfo<StringRef>::isEqual(LHS.Name, RHS.Name) &&
Rafael Espindola33713982017-01-05 14:20:35 +0000380 LHS.Flags == RHS.Flags && LHS.Alignment == RHS.Alignment;
George Rimar6892afa2016-07-12 09:49:43 +0000381}
382
George Rimar78aa2702017-03-13 14:40:58 +0000383uint64_t elf::getHeaderSize() {
384 if (Config->OFormatBinary)
385 return 0;
386 return Out::ElfHeader->Size + Out::ProgramHeaders->Size;
387}
388
Rafael Espindola5805c4f2015-09-21 21:38:08 +0000389namespace lld {
Rafael Espindolae0df00b2016-02-28 00:25:54 +0000390namespace elf {
Rafael Espindolae08e78d2016-11-09 23:23:45 +0000391
Rafael Espindola24e6f362017-02-24 15:07:30 +0000392template void OutputSection::writeHeaderTo<ELF32LE>(ELF32LE::Shdr *Shdr);
393template void OutputSection::writeHeaderTo<ELF32BE>(ELF32BE::Shdr *Shdr);
394template void OutputSection::writeHeaderTo<ELF64LE>(ELF64LE::Shdr *Shdr);
395template void OutputSection::writeHeaderTo<ELF64BE>(ELF64BE::Shdr *Shdr);
Rafael Espindola5805c4f2015-09-21 21:38:08 +0000396
Rafael Espindola24e6f362017-02-24 15:07:30 +0000397template void OutputSection::finalize<ELF32LE>();
398template void OutputSection::finalize<ELF32BE>();
399template void OutputSection::finalize<ELF64LE>();
400template void OutputSection::finalize<ELF64BE>();
401
402template void OutputSection::writeTo<ELF32LE>(uint8_t *Buf);
403template void OutputSection::writeTo<ELF32BE>(uint8_t *Buf);
404template void OutputSection::writeTo<ELF64LE>(uint8_t *Buf);
405template void OutputSection::writeTo<ELF64BE>(uint8_t *Buf);
Rafael Espindola5805c4f2015-09-21 21:38:08 +0000406
Rafael Espindola5805c4f2015-09-21 21:38:08 +0000407}
408}