1 //===------ JITLinkGeneric.h - Generic JIT linker utilities -----*- C++ -*-===//
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 // Generic JITLinker utilities. E.g. graph pruning, eh-frame parsing.
10 //
11 //===----------------------------------------------------------------------===//
12 
13 #ifndef LIB_EXECUTIONENGINE_JITLINK_JITLINKGENERIC_H
14 #define LIB_EXECUTIONENGINE_JITLINK_JITLINKGENERIC_H
15 
16 #include "llvm/ADT/DenseSet.h"
17 #include "llvm/ExecutionEngine/JITLink/JITLink.h"
18 
19 #define DEBUG_TYPE "jitlink"
20 
21 namespace llvm {
22 
23 class MemoryBufferRef;
24 
25 namespace jitlink {
26 
27 /// Base class for a JIT linker.
28 ///
29 /// A JITLinkerBase instance links one object file into an ongoing JIT
30 /// session. Symbol resolution and finalization operations are pluggable,
31 /// and called using continuation passing (passing a continuation for the
32 /// remaining linker work) to allow them to be performed asynchronously.
33 class JITLinkerBase {
34 public:
JITLinkerBase(std::unique_ptr<JITLinkContext> Ctx,PassConfiguration Passes)35   JITLinkerBase(std::unique_ptr<JITLinkContext> Ctx, PassConfiguration Passes)
36       : Ctx(std::move(Ctx)), Passes(std::move(Passes)) {
37     assert(this->Ctx && "Ctx can not be null");
38   }
39 
40   virtual ~JITLinkerBase();
41 
42 protected:
43   struct SegmentLayout {
44     using BlocksList = std::vector<Block *>;
45 
46     BlocksList ContentBlocks;
47     BlocksList ZeroFillBlocks;
48   };
49 
50   using SegmentLayoutMap = DenseMap<unsigned, SegmentLayout>;
51 
52   // Phase 1:
53   //   1.1: Build link graph
54   //   1.2: Run pre-prune passes
55   //   1.2: Prune graph
56   //   1.3: Run post-prune passes
57   //   1.4: Sort blocks into segments
58   //   1.5: Allocate segment memory
59   //   1.6: Identify externals and make an async call to resolve function
60   void linkPhase1(std::unique_ptr<JITLinkerBase> Self);
61 
62   // Phase 2:
63   //   2.1: Apply resolution results
64   //   2.2: Fix up block contents
65   //   2.3: Call OnResolved callback
66   //   2.3: Make an async call to transfer and finalize memory.
67   void linkPhase2(std::unique_ptr<JITLinkerBase> Self,
68                   Expected<AsyncLookupResult> LookupResult,
69                   SegmentLayoutMap Layout);
70 
71   // Phase 3:
72   //   3.1: Call OnFinalized callback, handing off allocation.
73   void linkPhase3(std::unique_ptr<JITLinkerBase> Self, Error Err);
74 
75   // Build a graph from the given object buffer.
76   // To be implemented by the client.
77   virtual Expected<std::unique_ptr<LinkGraph>>
78   buildGraph(MemoryBufferRef ObjBuffer) = 0;
79 
80   // For debug dumping of the link graph.
81   virtual StringRef getEdgeKindName(Edge::Kind K) const = 0;
82 
83   // Align a JITTargetAddress to conform with block alignment requirements.
alignToBlock(JITTargetAddress Addr,Block & B)84   static JITTargetAddress alignToBlock(JITTargetAddress Addr, Block &B) {
85     uint64_t Delta = (B.getAlignmentOffset() - Addr) % B.getAlignment();
86     return Addr + Delta;
87   }
88 
89   // Align a pointer to conform with block alignment requirements.
alignToBlock(char * P,Block & B)90   static char *alignToBlock(char *P, Block &B) {
91     uint64_t PAddr = static_cast<uint64_t>(reinterpret_cast<uintptr_t>(P));
92     uint64_t Delta = (B.getAlignmentOffset() - PAddr) % B.getAlignment();
93     return P + Delta;
94   }
95 
96 private:
97   // Run all passes in the given pass list, bailing out immediately if any pass
98   // returns an error.
99   Error runPasses(LinkGraphPassList &Passes);
100 
101   // Copy block contents and apply relocations.
102   // Implemented in JITLinker.
103   virtual Error fixUpBlocks(LinkGraph &G) const = 0;
104 
105   SegmentLayoutMap layOutBlocks();
106   Error allocateSegments(const SegmentLayoutMap &Layout);
107   JITLinkContext::LookupMap getExternalSymbolNames() const;
108   void applyLookupResult(AsyncLookupResult LR);
109   void copyBlockContentToWorkingMemory(const SegmentLayoutMap &Layout,
110                                        JITLinkMemoryManager::Allocation &Alloc);
111   void deallocateAndBailOut(Error Err);
112 
113   void dumpGraph(raw_ostream &OS);
114 
115   std::unique_ptr<JITLinkContext> Ctx;
116   PassConfiguration Passes;
117   std::unique_ptr<LinkGraph> G;
118   std::unique_ptr<JITLinkMemoryManager::Allocation> Alloc;
119 };
120 
121 template <typename LinkerImpl> class JITLinker : public JITLinkerBase {
122 public:
123   using JITLinkerBase::JITLinkerBase;
124 
125   /// Link constructs a LinkerImpl instance and calls linkPhase1.
126   /// Link should be called with the constructor arguments for LinkerImpl, which
127   /// will be forwarded to the constructor.
link(ArgTs &&...Args)128   template <typename... ArgTs> static void link(ArgTs &&... Args) {
129     auto L = std::make_unique<LinkerImpl>(std::forward<ArgTs>(Args)...);
130 
131     // Ownership of the linker is passed into the linker's doLink function to
132     // allow it to be passed on to async continuations.
133     //
134     // FIXME: Remove LTmp once we have c++17.
135     // C++17 sequencing rules guarantee that function name expressions are
136     // sequenced before arguments, so L->linkPhase1(std::move(L), ...) will be
137     // well formed.
138     auto &LTmp = *L;
139     LTmp.linkPhase1(std::move(L));
140   }
141 
142 private:
impl()143   const LinkerImpl &impl() const {
144     return static_cast<const LinkerImpl &>(*this);
145   }
146 
fixUpBlocks(LinkGraph & G)147   Error fixUpBlocks(LinkGraph &G) const override {
148     LLVM_DEBUG(dbgs() << "Fixing up blocks:\n");
149 
150     for (auto *B : G.blocks()) {
151       LLVM_DEBUG(dbgs() << "  " << *B << ":\n");
152 
153       // Copy Block data and apply fixups.
154       LLVM_DEBUG(dbgs() << "    Applying fixups.\n");
155       for (auto &E : B->edges()) {
156 
157         // Skip non-relocation edges.
158         if (!E.isRelocation())
159           continue;
160 
161         // Dispatch to LinkerImpl for fixup.
162         auto *BlockData = const_cast<char *>(B->getContent().data());
163         if (auto Err = impl().applyFixup(*B, E, BlockData))
164           return Err;
165       }
166     }
167 
168     return Error::success();
169   }
170 };
171 
172 /// Removes dead symbols/blocks/addressables.
173 ///
174 /// Finds the set of symbols and addressables reachable from any symbol
175 /// initially marked live. All symbols/addressables not marked live at the end
176 /// of this process are removed.
177 void prune(LinkGraph &G);
178 
179 } // end namespace jitlink
180 } // end namespace llvm
181 
182 #undef DEBUG_TYPE // "jitlink"
183 
184 #endif // LLVM_EXECUTIONENGINE_JITLINK_JITLINKGENERIC_H
185