2020-04-03 02:54:05 +08:00
|
|
|
//===- OutputSegment.cpp --------------------------------------------------===//
|
|
|
|
//
|
|
|
|
// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
|
|
|
|
// See https://llvm.org/LICENSE.txt for license information.
|
|
|
|
// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
|
|
|
|
//
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
|
|
|
#include "OutputSegment.h"
|
2021-05-26 02:57:16 +08:00
|
|
|
#include "ConcatOutputSection.h"
|
2020-04-28 03:50:59 +08:00
|
|
|
#include "InputSection.h"
|
2020-05-02 07:29:06 +08:00
|
|
|
#include "SyntheticSections.h"
|
2020-04-28 03:50:59 +08:00
|
|
|
|
2020-05-02 07:29:06 +08:00
|
|
|
#include "lld/Common/ErrorHandler.h"
|
2020-04-03 02:54:05 +08:00
|
|
|
#include "lld/Common/Memory.h"
|
2021-05-26 02:57:18 +08:00
|
|
|
#include "llvm/ADT/StringSwitch.h"
|
2020-04-28 03:50:59 +08:00
|
|
|
#include "llvm/BinaryFormat/MachO.h"
|
2020-04-03 02:54:05 +08:00
|
|
|
|
|
|
|
using namespace llvm;
|
2020-04-28 03:50:59 +08:00
|
|
|
using namespace llvm::MachO;
|
2020-04-03 02:54:05 +08:00
|
|
|
using namespace lld;
|
|
|
|
using namespace lld::macho;
|
|
|
|
|
2020-04-28 03:50:59 +08:00
|
|
|
static uint32_t initProt(StringRef name) {
|
2021-03-30 02:08:12 +08:00
|
|
|
auto it = find_if(
|
|
|
|
config->segmentProtections,
|
|
|
|
[&](const SegmentProtection &segprot) { return segprot.name == name; });
|
|
|
|
if (it != config->segmentProtections.end())
|
|
|
|
return it->initProt;
|
|
|
|
|
2020-04-28 03:50:59 +08:00
|
|
|
if (name == segment_names::text)
|
|
|
|
return VM_PROT_READ | VM_PROT_EXECUTE;
|
|
|
|
if (name == segment_names::pageZero)
|
|
|
|
return 0;
|
|
|
|
if (name == segment_names::linkEdit)
|
|
|
|
return VM_PROT_READ;
|
|
|
|
return VM_PROT_READ | VM_PROT_WRITE;
|
|
|
|
}
|
|
|
|
|
|
|
|
static uint32_t maxProt(StringRef name) {
|
2021-04-22 03:43:38 +08:00
|
|
|
assert(config->arch() != AK_i386 &&
|
2020-10-15 03:46:49 +08:00
|
|
|
"TODO: i386 has different maxProt requirements");
|
|
|
|
return initProt(name);
|
2020-04-28 03:50:59 +08:00
|
|
|
}
|
|
|
|
|
2020-05-02 07:29:06 +08:00
|
|
|
size_t OutputSegment::numNonHiddenSections() const {
|
|
|
|
size_t count = 0;
|
2021-03-17 12:34:28 +08:00
|
|
|
for (const OutputSection *osec : sections)
|
[lld-macho] Refactor segment/section creation, sorting, and merging
Summary:
There were a few issues with the previous setup:
1. The section sorting comparator used a declarative map of section names to
determine the correct order, but it turns out we need to match on more than
just names -- in particular, an upcoming diff will sort based on whether the
S_ZERO_FILL flag is set. This diff changes the sorter to a more imperative but
flexible form.
2. We were sorting OutputSections stored in a MapVector, which left the
MapVector in an inconsistent state -- the wrong keys map to the wrong values!
In practice, we weren't doing key lookups (only container iteration) after the
sort, so this was fine, but it was still a dubious state of affairs. This diff
copies the OutputSections to a vector before sorting them.
3. We were adding unneeded OutputSections to OutputSegments and then filtering
them out later, which meant that we had to remember whether an OutputSegment
was in a pre- or post-filtered state. This diff only adds the sections to the
segments if they are needed.
In addition to those major changes, two minor ones worth noting:
1. I renamed all OutputSection variable names to `osec`, to parallel `isec`.
Previously we were using some inconsistent combination of `osec`, `os`, and
`section`.
2. I added a check (and a test) for InputSections with names that clashed with
those of our synthetic OutputSections.
Reviewers: #lld-macho
Subscribers: llvm-commits
Tags: #llvm
Differential Revision: https://reviews.llvm.org/D81887
2020-06-15 15:03:24 +08:00
|
|
|
count += (!osec->isHidden() ? 1 : 0);
|
2020-05-02 07:29:06 +08:00
|
|
|
return count;
|
|
|
|
}
|
|
|
|
|
[lld-macho] Refactor segment/section creation, sorting, and merging
Summary:
There were a few issues with the previous setup:
1. The section sorting comparator used a declarative map of section names to
determine the correct order, but it turns out we need to match on more than
just names -- in particular, an upcoming diff will sort based on whether the
S_ZERO_FILL flag is set. This diff changes the sorter to a more imperative but
flexible form.
2. We were sorting OutputSections stored in a MapVector, which left the
MapVector in an inconsistent state -- the wrong keys map to the wrong values!
In practice, we weren't doing key lookups (only container iteration) after the
sort, so this was fine, but it was still a dubious state of affairs. This diff
copies the OutputSections to a vector before sorting them.
3. We were adding unneeded OutputSections to OutputSegments and then filtering
them out later, which meant that we had to remember whether an OutputSegment
was in a pre- or post-filtered state. This diff only adds the sections to the
segments if they are needed.
In addition to those major changes, two minor ones worth noting:
1. I renamed all OutputSection variable names to `osec`, to parallel `isec`.
Previously we were using some inconsistent combination of `osec`, `os`, and
`section`.
2. I added a check (and a test) for InputSections with names that clashed with
those of our synthetic OutputSections.
Reviewers: #lld-macho
Subscribers: llvm-commits
Tags: #llvm
Differential Revision: https://reviews.llvm.org/D81887
2020-06-15 15:03:24 +08:00
|
|
|
void OutputSegment::addOutputSection(OutputSection *osec) {
|
2021-05-26 02:57:17 +08:00
|
|
|
inputOrder = std::min(inputOrder, osec->inputOrder);
|
|
|
|
|
[lld-macho] Refactor segment/section creation, sorting, and merging
Summary:
There were a few issues with the previous setup:
1. The section sorting comparator used a declarative map of section names to
determine the correct order, but it turns out we need to match on more than
just names -- in particular, an upcoming diff will sort based on whether the
S_ZERO_FILL flag is set. This diff changes the sorter to a more imperative but
flexible form.
2. We were sorting OutputSections stored in a MapVector, which left the
MapVector in an inconsistent state -- the wrong keys map to the wrong values!
In practice, we weren't doing key lookups (only container iteration) after the
sort, so this was fine, but it was still a dubious state of affairs. This diff
copies the OutputSections to a vector before sorting them.
3. We were adding unneeded OutputSections to OutputSegments and then filtering
them out later, which meant that we had to remember whether an OutputSegment
was in a pre- or post-filtered state. This diff only adds the sections to the
segments if they are needed.
In addition to those major changes, two minor ones worth noting:
1. I renamed all OutputSection variable names to `osec`, to parallel `isec`.
Previously we were using some inconsistent combination of `osec`, `os`, and
`section`.
2. I added a check (and a test) for InputSections with names that clashed with
those of our synthetic OutputSections.
Reviewers: #lld-macho
Subscribers: llvm-commits
Tags: #llvm
Differential Revision: https://reviews.llvm.org/D81887
2020-06-15 15:03:24 +08:00
|
|
|
osec->parent = this;
|
|
|
|
sections.push_back(osec);
|
2021-05-11 23:43:48 +08:00
|
|
|
|
|
|
|
for (const SectionAlign §Align : config->sectionAlignments)
|
|
|
|
if (sectAlign.segName == name && sectAlign.sectName == osec->name)
|
|
|
|
osec->align = sectAlign.align;
|
2020-04-28 03:50:59 +08:00
|
|
|
}
|
|
|
|
|
2021-05-26 02:57:18 +08:00
|
|
|
template <typename T, typename F> static auto compareByOrder(F ord) {
|
|
|
|
return [=](T a, T b) { return ord(a) < ord(b); };
|
|
|
|
}
|
|
|
|
|
|
|
|
static int segmentOrder(OutputSegment *seg) {
|
|
|
|
return StringSwitch<int>(seg->name)
|
|
|
|
.Case(segment_names::pageZero, -4)
|
|
|
|
.Case(segment_names::text, -3)
|
|
|
|
.Case(segment_names::dataConst, -2)
|
|
|
|
.Case(segment_names::data, -1)
|
|
|
|
.Case(segment_names::llvm, std::numeric_limits<int>::max() - 1)
|
|
|
|
// Make sure __LINKEDIT is the last segment (i.e. all its hidden
|
|
|
|
// sections must be ordered after other sections).
|
|
|
|
.Case(segment_names::linkEdit, std::numeric_limits<int>::max())
|
|
|
|
.Default(seg->inputOrder);
|
|
|
|
}
|
|
|
|
|
|
|
|
static int sectionOrder(OutputSection *osec) {
|
|
|
|
StringRef segname = osec->parent->name;
|
|
|
|
// Sections are uniquely identified by their segment + section name.
|
|
|
|
if (segname == segment_names::text) {
|
|
|
|
return StringSwitch<int>(osec->name)
|
|
|
|
.Case(section_names::header, -4)
|
|
|
|
.Case(section_names::text, -3)
|
|
|
|
.Case(section_names::stubs, -2)
|
|
|
|
.Case(section_names::stubHelper, -1)
|
|
|
|
.Case(section_names::unwindInfo, std::numeric_limits<int>::max() - 1)
|
|
|
|
.Case(section_names::ehFrame, std::numeric_limits<int>::max())
|
|
|
|
.Default(osec->inputOrder);
|
|
|
|
} else if (segname == segment_names::data ||
|
|
|
|
segname == segment_names::dataConst) {
|
|
|
|
// For each thread spawned, dyld will initialize its TLVs by copying the
|
|
|
|
// address range from the start of the first thread-local data section to
|
|
|
|
// the end of the last one. We therefore arrange these sections contiguously
|
|
|
|
// to minimize the amount of memory used. Additionally, since zerofill
|
|
|
|
// sections must be at the end of their segments, and since TLV data
|
|
|
|
// sections can be zerofills, we end up putting all TLV data sections at the
|
|
|
|
// end of the segment.
|
|
|
|
switch (sectionType(osec->flags)) {
|
2021-06-19 22:55:48 +08:00
|
|
|
case S_THREAD_LOCAL_VARIABLE_POINTERS:
|
|
|
|
return std::numeric_limits<int>::max() - 3;
|
2021-05-26 02:57:18 +08:00
|
|
|
case S_THREAD_LOCAL_REGULAR:
|
|
|
|
return std::numeric_limits<int>::max() - 2;
|
|
|
|
case S_THREAD_LOCAL_ZEROFILL:
|
|
|
|
return std::numeric_limits<int>::max() - 1;
|
|
|
|
case S_ZEROFILL:
|
|
|
|
return std::numeric_limits<int>::max();
|
|
|
|
default:
|
|
|
|
return StringSwitch<int>(osec->name)
|
|
|
|
.Case(section_names::got, -3)
|
|
|
|
.Case(section_names::lazySymbolPtr, -2)
|
|
|
|
.Case(section_names::const_, -1)
|
|
|
|
.Default(osec->inputOrder);
|
|
|
|
}
|
|
|
|
} else if (segname == segment_names::linkEdit) {
|
|
|
|
return StringSwitch<int>(osec->name)
|
2021-06-17 03:23:07 +08:00
|
|
|
.Case(section_names::rebase, -10)
|
|
|
|
.Case(section_names::binding, -9)
|
|
|
|
.Case(section_names::weakBinding, -8)
|
|
|
|
.Case(section_names::lazyBinding, -7)
|
|
|
|
.Case(section_names::export_, -6)
|
|
|
|
.Case(section_names::functionStarts, -5)
|
|
|
|
.Case(section_names::dataInCode, -4)
|
2021-05-26 02:57:18 +08:00
|
|
|
.Case(section_names::symbolTable, -3)
|
|
|
|
.Case(section_names::indirectSymbolTable, -2)
|
|
|
|
.Case(section_names::stringTable, -1)
|
|
|
|
.Case(section_names::codeSignature, std::numeric_limits<int>::max())
|
|
|
|
.Default(osec->inputOrder);
|
|
|
|
}
|
2021-06-21 07:39:09 +08:00
|
|
|
// ZeroFill sections must always be the at the end of their segments:
|
|
|
|
// dyld checks if a segment's file size is smaller than its in-memory
|
|
|
|
// size to detect if a segment has zerofill sections, and if so it maps
|
|
|
|
// the missing tail as zerofill.
|
2021-05-26 02:57:18 +08:00
|
|
|
if (sectionType(osec->flags) == S_ZEROFILL)
|
|
|
|
return std::numeric_limits<int>::max();
|
|
|
|
return osec->inputOrder;
|
|
|
|
}
|
|
|
|
|
|
|
|
void OutputSegment::sortOutputSections() {
|
|
|
|
llvm::sort(sections, compareByOrder<OutputSection *>(sectionOrder));
|
|
|
|
}
|
|
|
|
|
|
|
|
void macho::sortOutputSegments() {
|
|
|
|
llvm::sort(outputSegments, compareByOrder<OutputSegment *>(segmentOrder));
|
|
|
|
}
|
|
|
|
|
2021-01-10 00:58:19 +08:00
|
|
|
static DenseMap<StringRef, OutputSegment *> nameToOutputSegment;
|
2020-04-03 02:54:05 +08:00
|
|
|
std::vector<OutputSegment *> macho::outputSegments;
|
|
|
|
|
2020-04-28 03:50:59 +08:00
|
|
|
OutputSegment *macho::getOrCreateOutputSegment(StringRef name) {
|
|
|
|
OutputSegment *&segRef = nameToOutputSegment[name];
|
2020-09-24 11:09:49 +08:00
|
|
|
if (segRef)
|
2020-04-28 03:50:59 +08:00
|
|
|
return segRef;
|
|
|
|
|
|
|
|
segRef = make<OutputSegment>();
|
|
|
|
segRef->name = name;
|
|
|
|
segRef->maxProt = maxProt(name);
|
|
|
|
segRef->initProt = initProt(name);
|
|
|
|
|
|
|
|
outputSegments.push_back(segRef);
|
|
|
|
return segRef;
|
2020-04-03 02:54:05 +08:00
|
|
|
}
|