28#define DEBUG_TYPE "jitlink"
32enum JITLinkErrorCode { GenericJITLinkError = 1 };
37class JITLinkerErrorCategory :
public std::error_category {
39 const char *
name()
const noexcept override {
return "runtimedyld"; }
41 std::string message(
int Condition)
const override {
42 switch (
static_cast<JITLinkErrorCode
>(Condition)) {
43 case GenericJITLinkError:
44 return "Generic JITLink error";
60 static JITLinkerErrorCategory TheJITLinkerErrorCategory;
61 return std::error_code(GenericJITLinkError, TheJITLinkerErrorCategory);
67 return "INVALID RELOCATION";
71 return "<Unrecognized edge kind>";
92 return "side-effects-only";
100 if (
B.getSize() == 0)
105 return B.getSize() == 1;
107 for (
size_t I = 0;
I !=
B.getSize() - 1; ++
I)
108 if (
B.getContent()[
I] ==
'\0')
111 return B.getContent()[
B.getSize() - 1] ==
'\0';
115 return OS <<
B.getAddress() <<
" -- " << (
B.getAddress() +
B.getSize())
117 <<
"size = " <<
formatv(
"{0:x8}",
B.getSize()) <<
", "
118 << (
B.isZeroFill() ?
"zero-fill" :
"content")
119 <<
", align = " <<
B.getAlignment()
120 <<
", align-ofs = " <<
B.getAlignmentOffset()
121 <<
", section = " <<
B.getSection().getName();
130 << (Sym.
isLive() ?
"live" :
"dead") <<
" - "
137 OS <<
"edge@" <<
B.getAddress() + E.getOffset() <<
": " <<
B.getAddress()
138 <<
" + " <<
formatv(
"{0:x}", E.getOffset()) <<
" -- " << EdgeKindName
141 auto &TargetSym = E.getTarget();
142 if (TargetSym.hasName())
143 OS << TargetSym.getName();
145 auto &TargetBlock = TargetSym.getBlock();
146 auto &TargetSec = TargetBlock.getSection();
148 for (
auto *
B : TargetSec.blocks())
149 if (
B->getAddress() < SecAddress)
150 SecAddress =
B->getAddress();
153 OS << TargetSym.getAddress() <<
" (section " << TargetSec.getName();
155 OS <<
" + " <<
formatv(
"{0:x}", SecDelta);
156 OS <<
" / block " << TargetBlock.getAddress();
157 if (TargetSym.getOffset())
158 OS <<
" + " <<
formatv(
"{0:x}", TargetSym.getOffset());
162 if (E.getAddend() != 0)
163 OS <<
" + " << E.getAddend();
167 for (
auto *Sym : Symbols)
169 for (
auto *
B : Blocks)
174 for (
auto *Sym : AbsoluteSymbols) {
180 ExternalSymbols.clear();
183std::vector<Block *> LinkGraph::splitBlockImpl(std::vector<Block *> Blocks,
184 SplitBlockCache *Cache) {
185 assert(!Blocks.empty() &&
"Blocks must at least contain the original block");
189 for (
size_t I = 0;
I != Blocks.size() - 1; ++
I) {
190 Blocks[
I]->setContent(
191 Content.
slice(Blocks[
I]->getAddress() - Blocks[0]->getAddress(),
192 Blocks[
I + 1]->getAddress() - Blocks[
I]->getAddress()));
194 Blocks.back()->setContent(
195 Content.
slice(Blocks.back()->getAddress() - Blocks[0]->getAddress()));
196 bool IsMutable = Blocks[0]->ContentMutable;
197 for (
auto *
B : Blocks)
198 B->ContentMutable = IsMutable;
204 Cache = &LocalBlockSymbolsCache;
207 if (*Cache == std::nullopt) {
208 *Cache = SplitBlockCache::value_type();
210 for (
auto *Sym : Blocks[0]->
getSection().symbols())
211 if (&Sym->getBlock() == Blocks[0])
212 (*Cache)->push_back(Sym);
213 llvm::sort(**Cache, [](
const Symbol *LHS,
const Symbol *RHS) {
214 return LHS->getAddress() > RHS->getAddress();
219 Sym.setOffset(Sym.getAddress() -
B.getAddress());
221 if (Sym.getSize() >
B.getSize())
222 Sym.setSize(
B.getSize() - Sym.getOffset());
226 for (
size_t I = 0;
I != Blocks.size() - 1; ++
I) {
227 if ((*Cache)->empty())
229 while (!(*Cache)->empty() &&
230 (*Cache)->back()->getAddress() < Blocks[
I + 1]->getAddress()) {
231 TransferSymbol(*(*Cache)->back(), *Blocks[
I]);
232 (*Cache)->pop_back();
236 while (!(*Cache)->empty()) {
237 auto &Sym = *(*Cache)->back();
238 (*Cache)->pop_back();
239 assert(Sym.getAddress() >= Blocks.back()->getAddress() &&
240 "Symbol address preceeds block");
241 assert(Sym.getAddress() <= Blocks.back()->getRange().End &&
242 "Symbol address starts past end of block");
243 TransferSymbol(Sym, *Blocks.back());
248 auto &Edges = Blocks[0]->Edges;
250 return LHS.getOffset() <
RHS.getOffset();
253 for (
size_t I = Blocks.size() - 1;
I != 0; --
I) {
259 Edge::OffsetT Delta = Blocks[
I]->getAddress() - Blocks[0]->getAddress();
262 if (Edges.back().getOffset() < Delta)
265 size_t EI = Edges.size() - 1;
266 while (EI != 0 && Edges[EI - 1].
getOffset() >= Delta)
269 for (
size_t J = EI; J != Edges.size(); ++J) {
270 Blocks[
I]->Edges.push_back(std::move(Edges[J]));
271 Blocks[
I]->Edges.back().setOffset(Blocks[
I]->Edges.back().getOffset() -
275 while (Edges.size() > EI)
285 OS <<
"LinkGraph \"" <<
getName()
290 BlockSymbols[&Sym->getBlock()].push_back(Sym);
294 for (
auto &KV : BlockSymbols)
296 if (LHS->getOffset() != RHS->getOffset())
297 return LHS->getOffset() < RHS->getOffset();
298 if (LHS->getLinkage() != RHS->getLinkage())
299 return LHS->getLinkage() < RHS->getLinkage();
300 if (LHS->getScope() != RHS->getScope())
301 return LHS->getScope() < RHS->getScope();
302 if (LHS->hasName()) {
305 return LHS->getName() < RHS->getName();
310 std::vector<Section *> SortedSections;
312 SortedSections.push_back(&Sec);
314 return LHS->getName() < RHS->getName();
317 for (
auto *Sec : SortedSections) {
318 OS <<
"section " << Sec->getName() <<
":\n\n";
320 std::vector<Block *> SortedBlocks;
323 return LHS->getAddress() < RHS->getAddress();
326 for (
auto *
B : SortedBlocks) {
327 OS <<
" block " <<
B->getAddress()
328 <<
" size = " <<
formatv(
"{0:x8}",
B->getSize())
329 <<
", align = " <<
B->getAlignment()
330 <<
", alignment-offset = " <<
B->getAlignmentOffset();
335 auto BlockSymsI = BlockSymbols.find(
B);
336 if (BlockSymsI != BlockSymbols.end()) {
338 auto &Syms = BlockSymsI->second;
339 for (
auto *Sym : Syms)
340 OS <<
" " << *Sym <<
"\n";
342 OS <<
" no symbols\n";
344 if (!
B->edges_empty()) {
346 std::vector<Edge> SortedEdges;
349 return LHS.getOffset() <
RHS.getOffset();
351 for (
auto &
E : SortedEdges) {
352 OS <<
" " <<
B->getFixupAddress(
E) <<
" (block + "
353 <<
formatv(
"{0:x8}",
E.getOffset()) <<
"), addend = ";
354 if (
E.getAddend() >= 0)
355 OS <<
formatv(
"+{0:x8}",
E.getAddend());
357 OS <<
formatv(
"-{0:x8}", -
E.getAddend());
359 if (
E.getTarget().hasName())
360 OS <<
E.getTarget().getName();
363 <<
formatv(
"{0:x16}",
E.getTarget().getAddress()) <<
"+"
364 <<
formatv(
"{0:x8}",
E.getTarget().getOffset());
373 OS <<
"Absolute symbols:\n";
374 if (!absolute_symbols().
empty()) {
375 for (
auto *Sym : absolute_symbols())
376 OS <<
" " << Sym->getAddress() <<
": " << *Sym <<
"\n";
380 OS <<
"\nExternal symbols:\n";
381 if (!external_symbols().
empty()) {
382 for (
auto *Sym : external_symbols())
383 OS <<
" " << Sym->getAddress() <<
": " << *Sym
384 << (Sym->isWeaklyReferenced() ?
" (weakly referenced)" :
"") <<
"\n";
392 return OS <<
"RequiredSymbol";
394 return OS <<
"WeaklyReferencedSymbol";
399void JITLinkAsyncLookupContinuation::anchor() {}
401JITLinkContext::~JITLinkContext() =
default;
417 for (
auto *Sym :
G.defined_symbols())
428 ErrStream <<
"In graph " <<
G.getName() <<
", section " << Sec.
getName()
429 <<
": relocation target "
430 <<
formatv(
"{0:x}", E.getTarget().getAddress() + E.getAddend())
432 if (E.getTarget().hasName())
433 ErrStream << E.getTarget().getName();
435 ErrStream <<
"<anonymous symbol>";
438 ErrStream <<
formatv(
":{0:x}", E.getTarget().getAddress()) <<
" + "
439 <<
formatv(
"{0:x}", E.getAddend());
441 ErrStream <<
") is out of range of " <<
G.getEdgeKindName(E.getKind())
442 <<
" fixup at address "
443 <<
formatv(
"{0:x}", E.getTarget().getAddress()) <<
" (";
445 Symbol *BestSymbolForBlock =
nullptr;
446 for (
auto *Sym : Sec.
symbols())
447 if (&Sym->getBlock() == &
B && Sym->hasName() && Sym->getOffset() == 0 &&
448 (!BestSymbolForBlock ||
449 Sym->getScope() < BestSymbolForBlock->
getScope() ||
450 Sym->getLinkage() < BestSymbolForBlock->
getLinkage()))
451 BestSymbolForBlock = Sym;
453 if (BestSymbolForBlock)
454 ErrStream << BestSymbolForBlock->
getName() <<
", ";
456 ErrStream <<
"<anonymous block> @ ";
458 ErrStream <<
formatv(
"{0:x}",
B.getAddress()) <<
" + "
459 <<
formatv(
"{0:x}", E.getOffset()) <<
")";
467 " improper alignment for relocation " +
468 formatv(
"{0:d}", E.getKind()) +
": 0x" +
470 " is not aligned to " +
Twine(
N) +
" bytes");
474 switch (TT.getArch()) {
495 switch (TT.getArch()) {
519 std::shared_ptr<orc::SymbolStringPool> SSP) {
535std::unique_ptr<LinkGraph>
538 static std::atomic<uint64_t> Counter = {0};
539 auto Index = Counter.fetch_add(1, std::memory_order_relaxed);
540 auto G = std::make_unique<LinkGraph>(
541 "<Absolute Symbols " + std::to_string(Index) +
">", std::move(SSP),
543 for (
auto &[Name, Def] : Symbols) {
545 G->addAbsoluteSymbol(*Name, Def.getAddress(), 0,
547 Sym.setCallable(Def.getFlags().isCallable());
553void link(std::unique_ptr<LinkGraph>
G, std::unique_ptr<JITLinkContext> Ctx) {
554 switch (
G->getTargetTriple().getObjectFormat()) {
558 return link_ELF(std::move(
G), std::move(Ctx));
560 return link_COFF(std::move(
G), std::move(Ctx));
assert(UImm &&(UImm !=~static_cast< T >(0)) &&"Invalid immediate!")
bbsections Prepares for basic block sections
static GCRegistry::Add< CoreCLRGC > E("coreclr", "CoreCLR-compatible GC")
static GCRegistry::Add< OcamlGC > B("ocaml", "ocaml 3.10-compatible GC")
std::pair< BasicBlock *, BasicBlock * > Edge
Represent a constant reference to an array (0 or more elements consecutively in memory),...
ArrayRef< T > slice(size_t N, size_t M) const
slice(n, m) - Chop off the first N elements of the array, and keep M elements in the array.
Lightweight error class with error context and mandatory checking.
static ErrorSuccess success()
Create a success value.
Tagged union holding either a T or a Error.
StringRef getBuffer() const
Represent a constant reference to a string, i.e.
Manages the enabling and disabling of subtarget specific features.
Triple - Helper class for working with autoconf configuration names.
const std::string & str() const
Twine - A lightweight data structure for efficiently representing the concatenation of temporary valu...
LLVM Value Representation.
An Addressable with content and edges.
Represents fixups and constraints in the LinkGraph.
virtual Error modifyPassConfig(LinkGraph &G, PassConfiguration &Config)
Called by JITLink to modify the pass pipeline prior to linking.
virtual bool shouldAddDefaultTargetPasses(const Triple &TT) const
Called by JITLink prior to linking to determine whether default passes for the target should be added...
virtual LinkGraphPassFunction getMarkLivePass(const Triple &TT) const
Returns the mark-live pass to be used for this link.
std::error_code convertToErrorCode() const override
Convert this error to a std::error_code.
void log(raw_ostream &OS) const override
Print an error message to an output stream.
const std::string & getName() const
Returns the name of this graph (usually the name of the original underlying MemoryBuffer).
LLVM_ABI void dump(raw_ostream &OS)
Dump the graph.
iterator_range< external_symbol_iterator > external_symbols()
const Triple & getTargetTriple() const
Returns the target triple for this Graph.
iterator_range< defined_symbol_iterator > defined_symbols()
std::optional< SmallVector< Symbol *, 8 > > SplitBlockCache
Cache type for the splitBlock function.
Represents an object file section.
iterator_range< symbol_iterator > symbols()
Returns an iterator over the symbols defined in this section.
StringRef getName() const
Returns the name of this section.
bool isLive() const
Returns true if this symbol is live (i.e.
const orc::SymbolStringPtr & getName() const
Returns the name of this symbol (empty if the symbol is anonymous).
bool isDefined() const
Returns true if this Symbol has content (potentially) defined within this object file (i....
Scope getScope() const
Get the visibility for this Symbol.
Linkage getLinkage() const
Get the linkage for this Symbol.
orc::ExecutorAddr getAddress() const
Returns the address of this symbol.
orc::ExecutorAddrDiff getSize() const
Returns the size of this symbol.
orc::ExecutorAddrDiff getOffset() const
Returns the offset for this symbol within the underlying addressable.
bool hasName() const
Returns true if this symbol has a name.
Represents an address in the executor process.
This class implements an extremely fast bulk output stream that can only output to a stream.
A raw_ostream that writes to an std::string.
#define llvm_unreachable(msg)
Marks that the current location is not supposed to be reachable.
LLVM_ABI const char * getEdgeKindName(Edge::Kind K)
Get a human-readable name for the given AArch32 edge kind.
Symbol & createAnonymousPointer(LinkGraph &G, Section &PointerSection, Symbol *InitialTarget=nullptr, uint64_t InitialAddend=0)
Creates a new pointer block in the given section and returns an Anonymous symbol pointing to it.
Symbol & createAnonymousPointerJumpStub(LinkGraph &G, Section &StubSection, Symbol &PointerSymbol)
Create a jump stub that jumps via the pointer at the given symbol and an anonymous symbol pointing to...
Symbol & createAnonymousPointerJumpStub(LinkGraph &G, Section &StubSection, Symbol &PointerSymbol)
Create a jump stub that jumps via the pointer at the given symbol and an anonymous symbol pointing to...
Symbol & createAnonymousPointer(LinkGraph &G, Section &PointerSection, Symbol *InitialTarget=nullptr, uint64_t InitialAddend=0)
Creates a new pointer block in the given section and returns an Anonymous symbol pointing to it.
Symbol & createAnonymousPointer(LinkGraph &G, Section &PointerSection, Symbol *InitialTarget=nullptr, uint64_t InitialAddend=0)
Symbol & createDefaultAnonymousPointerJumpStub(LinkGraph &G, Section &StubSection, Symbol &PointerSymbol)
Symbol & createAnonymousPointerJumpStub(LinkGraph &G, Section &StubSection, Symbol &PointerSymbol)
Create a jump stub that jumps via the pointer at the given symbol and an anonymous symbol pointing to...
Symbol & createAnonymousPointer(LinkGraph &G, Section &PointerSection, Symbol *InitialTarget=nullptr, uint64_t InitialAddend=0)
Creates a new pointer block in the given section and returns an Anonymous symbol pointing to it.
Symbol & createAnonymousPointer(LinkGraph &G, Section &PointerSection, Symbol *InitialTarget=nullptr, uint64_t InitialAddend=0)
Creates a new pointer block in the given section and returns an anonymous symbol pointing to it.
Symbol & createAnonymousPointerJumpStub(LinkGraph &G, Section &StubSection, Symbol &PointerSymbol)
Create a jump stub that jumps via the pointer at the given symbol and an anonymous symbol pointing to...
Symbol & createAnonymousPointerJumpStub(LinkGraph &G, Section &StubSection, Symbol &PointerSymbol)
Create a jump stub that jumps via the pointer at the given symbol and an anonymous symbol pointing to...
Symbol & createAnonymousPointer(LinkGraph &G, Section &PointerSection, Symbol *InitialTarget=nullptr, uint64_t InitialAddend=0)
Creates a new pointer block in the given section and returns an anonymous symbol pointing to it.
unique_function< Error(LinkGraph &)> LinkGraphPassFunction
A function for mutating LinkGraphs.
LLVM_ABI Error makeTargetOutOfRangeError(const LinkGraph &G, const Block &B, const Edge &E)
Create an out of range error for the given edge in the given block.
LLVM_ABI const char * getGenericEdgeKindName(Edge::Kind K)
Returns the string name of the given generic edge kind, or "unknown" otherwise.
LLVM_ABI const char * getLinkageName(Linkage L)
For errors and debugging output.
SymbolLookupFlags
Flags for symbol lookup.
LLVM_ABI Expected< std::unique_ptr< LinkGraph > > createLinkGraphFromCOFFObject(MemoryBufferRef ObjectBuffer, std::shared_ptr< orc::SymbolStringPool > SSP)
Create a LinkGraph from an COFF relocatable object.
LLVM_ABI std::unique_ptr< LinkGraph > absoluteSymbolsLinkGraph(Triple TT, std::shared_ptr< orc::SymbolStringPool > SSP, orc::SymbolMap Symbols)
Create a LinkGraph defining the given absolute symbols.
LLVM_ABI Expected< std::unique_ptr< LinkGraph > > createLinkGraphFromELFObject(MemoryBufferRef ObjectBuffer, std::shared_ptr< orc::SymbolStringPool > SSP)
Create a LinkGraph from an ELF relocatable object.
LLVM_ABI Error makeAlignmentError(llvm::orc::ExecutorAddr Loc, uint64_t Value, int N, const Edge &E)
LLVM_ABI raw_ostream & operator<<(raw_ostream &OS, const Block &B)
LLVM_ABI Expected< std::unique_ptr< LinkGraph > > createLinkGraphFromXCOFFObject(MemoryBufferRef ObjectBuffer, std::shared_ptr< orc::SymbolStringPool > SSP)
Create a LinkGraph from an XCOFF relocatable object.
LLVM_ABI PointerJumpStubCreator getPointerJumpStubCreator(const Triple &TT)
Get target-specific PointerJumpStubCreator.
unique_function< Symbol &( LinkGraph &G, Section &StubSection, Symbol &PointerSymbol)> PointerJumpStubCreator
Create a jump stub that jumps via the pointer at the given symbol and an anonymous symbol pointing to...
LLVM_ABI void link(std::unique_ptr< LinkGraph > G, std::unique_ptr< JITLinkContext > Ctx)
Link the given graph.
LLVM_ABI Expected< std::unique_ptr< LinkGraph > > createLinkGraphFromMachOObject(MemoryBufferRef ObjectBuffer, std::shared_ptr< orc::SymbolStringPool > SSP)
Create a LinkGraph from a MachO relocatable object.
LLVM_ABI Error markAllSymbolsLive(LinkGraph &G)
Marks all symbols in a graph live.
LLVM_ABI void link_COFF(std::unique_ptr< LinkGraph > G, std::unique_ptr< JITLinkContext > Ctx)
Link the given graph.
LLVM_ABI void link_ELF(std::unique_ptr< LinkGraph > G, std::unique_ptr< JITLinkContext > Ctx)
Link the given graph.
LLVM_ABI const char * getScopeName(Scope S)
For debugging output.
LLVM_ABI Expected< std::unique_ptr< LinkGraph > > createLinkGraphFromObject(MemoryBufferRef ObjectBuffer, std::shared_ptr< orc::SymbolStringPool > SSP)
Create a LinkGraph from the given object buffer.
Linkage
Describes symbol linkage. This can be used to resolve definition clashes.
unique_function< Symbol &(LinkGraph &G, Section &PointerSection, Symbol *InitialTarget, uint64_t InitialAddend)> AnonymousPointerCreator
Creates a new pointer block in the given section and returns an Anonymous symbol pointing to it.
LLVM_ABI void printEdge(raw_ostream &OS, const Block &B, const Edge &E, StringRef EdgeKindName)
LLVM_ABI void link_XCOFF(std::unique_ptr< LinkGraph > G, std::unique_ptr< JITLinkContext > Ctx)
Link the given graph.
Scope
Defines the scope in which this symbol should be visible: Default – Visible in the public interface o...
LLVM_ABI bool isCStringBlock(Block &B)
LLVM_ABI void link_MachO(std::unique_ptr< LinkGraph > G, std::unique_ptr< JITLinkContext > Ctx)
jit-link the given ObjBuffer, which must be a MachO object file.
LLVM_ABI AnonymousPointerCreator getAnonymousPointerCreator(const Triple &TT)
Get target-specific AnonymousPointerCreator.
Expected< const typename ELFT::Shdr * > getSection(typename ELFT::ShdrRange Sections, uint32_t Index)
uint64_t ExecutorAddrDiff
DenseMap< SymbolStringPtr, ExecutorSymbolDef > SymbolMap
A map from symbol names (as SymbolStringPtrs) to JITSymbols (address/flags pairs).
This is an optimization pass for GlobalISel generic memory operations.
LLVM_ABI file_magic identify_magic(StringRef magic)
Identify the type of a binary file based on how magical it is.
void append_range(Container &C, Range &&R)
Wrapper function to append range R to container C.
std::string utohexstr(uint64_t X, bool LowerCase=false, unsigned Width=0)
static Error getOffset(const SymbolRef &Sym, SectionRef Sec, uint64_t &Result)
auto formatv(bool Validate, const char *Fmt, Ts &&...Vals)
void sort(IteratorTy Start, IteratorTy End)
Error make_error(ArgTs &&... Args)
Make a Error instance representing failure using the given error info type.
raw_ostream & operator<<(raw_ostream &OS, const APFixedPoint &FX)
@ elf_relocatable
ELF Relocatable object file.
@ xcoff_object_64
64-bit XCOFF object file
@ macho_object
Mach-O Object file.
@ coff_object
COFF object file.
An LinkGraph pass configuration, consisting of a list of pre-prune, post-prune, and post-fixup passes...