blob: f739aef5ba04705f11d23b3c8ca1b89240dfe17e [file] [log] [blame]
Lang Hamesbe84d2be2016-05-26 00:38:04 +00001====================================================================
2Building a JIT: Adding Optimizations - An introduction to ORC Layers
3====================================================================
4
5.. contents::
6 :local:
7
8**This tutorial is under active development. It is incomplete and details may
9change frequently.** Nonetheless we invite you to try it out as it stands, and
10we welcome any feedback.
11
12Chapter 2 Introduction
13======================
14
Lang Hamesc499d2a2016-06-06 03:28:12 +000015Welcome to Chapter 2 of the "Building an ORC-based JIT in LLVM" tutorial. In
16`Chapter 1 <BuildingAJIT1.html>`_ of this series we examined a basic JIT
17class, KaleidoscopeJIT, that could take LLVM IR modules as input and produce
18executable code in memory. KaleidoscopeJIT was able to do this with relatively
19little code by composing two off-the-shelf *ORC layers*: IRCompileLayer and
20ObjectLinkingLayer, to do much of the heavy lifting.
Lang Hamesbe84d2be2016-05-26 00:38:04 +000021
Lang Hamesc499d2a2016-06-06 03:28:12 +000022In this layer we'll learn more about the ORC layer concept by using a new layer,
23IRTransformLayer, to add IR optimization support to KaleidoscopeJIT.
Lang Hamesbe84d2be2016-05-26 00:38:04 +000024
Lang Hamesc499d2a2016-06-06 03:28:12 +000025Optimizing Modules using the IRTransformLayer
26=============================================
Lang Hamesbe84d2be2016-05-26 00:38:04 +000027
Lang Hamesc499d2a2016-06-06 03:28:12 +000028In `Chapter 4 <LangImpl4.html>`_ of the "Implementing a language with LLVM"
29tutorial series the llvm *FunctionPassManager* is introduced as a means for
30optimizing LLVM IR. Interested readers may read that chapter for details, but
31in short, to optimize a Module we create an llvm::FunctionPassManager
32instance, configure it with a set of optimizations, then run the PassManager on
33a Module to mutate it into a (hopefully) more optimized but semantically
34equivalent form. In the original tutorial series the FunctionPassManager was
35created outside the KaleidoscopeJIT, and modules were optimized before being
36added to it. In this Chapter we will make optimization a phase of our JIT
37instead. For now, this will provide us a motivation to learn more about ORC
38layers, but in the long term making optimization part of our JIT will yield an
39important benefit: When we begin lazily compiling code (i.e. deferring
40compilation of each function until the first time it's run), having
41optimization managed by our JIT will allow us to optimize lazily too, rather
42than having to do all our optimization up-front.
Lang Hamesbe84d2be2016-05-26 00:38:04 +000043
Lang Hamesc499d2a2016-06-06 03:28:12 +000044To add optimization support to our JIT we will take the KaleidoscopeJIT from
45Chapter 1 and compose an ORC *IRTransformLayer* on top. We will look at how the
46IRTransformLayer works in more detail below, but the interface is simple: the
47constructor for this layer takes a reference to the layer below (as all layers
48do) plus an *IR optimization function* that it will apply to each Module that
49is added via addModuleSet:
50
51.. code-block: c++
52
53 class KaleidoscopeJIT {
54 private:
55 std::unique_ptr<TargetMachine> TM;
56 const DataLayout DL;
57 ObjectLinkingLayer<> ObjectLayer;
58 IRCompileLayer<decltype(ObjectLayer)> CompileLayer;
59
60 typedef std::function<std::unique_ptr<Module>(std::unique_ptr<Module>)>
61 OptimizeFunction;
62
63 IRTransformLayer<decltype(CompileLayer), OptimizeFunction> OptimizeLayer;
64
65 public:
66 typedef decltype(OptimizeLayer)::ModuleSetHandleT ModuleHandle;
67
68 KaleidoscopeJIT()
69 : TM(EngineBuilder().selectTarget()), DL(TM->createDataLayout()),
70 CompileLayer(ObjectLayer, SimpleCompiler(*TM)),
71 OptimizeLayer(CompileLayer,
72 [this](std::unique_ptr<Module> M) {
73 return optimizeModule(std::move(M));
74 }) {
75 llvm::sys::DynamicLibrary::LoadLibraryPermanently(nullptr);
76 }
77
78Our extended KaleidoscopeJIT class starts out the same as it did in Chapter 1,
79but after the CompileLayer we introduce a typedef for our optimization function.
80In this case we use a std::function (a handy wrapper for "function-like" things)
81from a single unique_ptr<Module> input to a std::unique_ptr<Module> output. With
82our optimization function typedef in place we can declare our OptimizeLayer,
83which sits on top of our CompileLayer.
84
85To initialize our OptimizeLayer we pass it a reference to the CompileLayer
86below (standard practice for layers), and we initialize the OptimizeFunction
87using a lambda. In the lambda, we just call out to the "optimizeModule" function
88that we will define below.
89
90.. code-block:
91
92 // ...
93 auto Resolver = createLambdaResolver(
94 [&](const std::string &Name) {
95 if (auto Sym = OptimizeLayer.findSymbol(Name, false))
96 return Sym.toRuntimeDyldSymbol();
97 return RuntimeDyld::SymbolInfo(nullptr);
98 },
99 // ...
100 // Add the set to the JIT with the resolver we created above and a newly
101 // created SectionMemoryManager.
102 return OptimizeLayer.addModuleSet(std::move(Ms),
103 make_unique<SectionMemoryManager>(),
104 std::move(Resolver));
105 // ...
106
107 // ...
108 return OptimizeLayer.findSymbol(MangledNameStream.str(), true);
109 // ...
110
111 // ...
112 OptimizeLayer.removeModuleSet(H);
113 // ...
114
115Next we need to replace references to 'CompileLayer' with references to
116OptimizeLayer in our key methods: addModule, findSymbol, and removeModule. In
117addModule we need to be careful to replace both references: the findSymbol call
118inside our resolver, and the call through to addModuleSet.
119
120.. code-block: c++
121
122 std::unique_ptr<Module> optimizeModule(std::unique_ptr<Module> M) {
123 // Create a function pass manager.
124 auto FPM = llvm::make_unique<legacy::FunctionPassManager>(M.get());
125
126 // Add some optimizations.
127 FPM->add(createInstructionCombiningPass());
128 FPM->add(createReassociatePass());
129 FPM->add(createGVNPass());
130 FPM->add(createCFGSimplificationPass());
131 FPM->doInitialization();
132
133 // Run the optimizations over all functions in the module being added to
134 // the JIT.
135 for (auto &F : *M)
136 FPM->run(F);
137
138 return M;
139 }
140
141At the bottom of our JIT we add a private method to do the actual optimization:
142*optimizeModule*. This function sets up a FunctionPassManager, adds some passes
143to it, runs it over every function in the module, and then returns the mutated
144module. The specific optimizations used are the same ones used in
145`Chapter 4 <LangImpl4.html>`_ of the "Implementing a language with LLVM"
146tutorial series -- readers may visit that chapter for a more in-depth
147discussion of them, and of IR optimization in general.
148
149And that's it: When a module is added to our JIT the OptimizeLayer will now
150pass it to our optimizeModule function before passing the transformed module
151on to the CompileLayer below. Of course, we could have called optimizeModule
152directly in our addModule function and not gone to the bother of using the
153IRTransformLayer, but it gives us an opportunity to see how layers compose, and
154how one can be implemented, because IRTransformLayer turns out to be one of
155the simplest implementations of the *layer* concept that can be devised:
156
157.. code-block:
158
159 template <typename BaseLayerT, typename TransformFtor>
160 class IRTransformLayer {
161 public:
162 typedef typename BaseLayerT::ModuleSetHandleT ModuleSetHandleT;
163
164 IRTransformLayer(BaseLayerT &BaseLayer,
165 TransformFtor Transform = TransformFtor())
166 : BaseLayer(BaseLayer), Transform(std::move(Transform)) {}
167
168 template <typename ModuleSetT, typename MemoryManagerPtrT,
169 typename SymbolResolverPtrT>
170 ModuleSetHandleT addModuleSet(ModuleSetT Ms,
171 MemoryManagerPtrT MemMgr,
172 SymbolResolverPtrT Resolver) {
173
174 for (auto I = Ms.begin(), E = Ms.end(); I != E; ++I)
175 *I = Transform(std::move(*I));
176
177 return BaseLayer.addModuleSet(std::move(Ms), std::move(MemMgr),
178 std::move(Resolver));
179 }
180
181 void removeModuleSet(ModuleSetHandleT H) { BaseLayer.removeModuleSet(H); }
182
183 JITSymbol findSymbol(const std::string &Name, bool ExportedSymbolsOnly) {
184 return BaseLayer.findSymbol(Name, ExportedSymbolsOnly);
185 }
186
187 JITSymbol findSymbolIn(ModuleSetHandleT H, const std::string &Name,
188 bool ExportedSymbolsOnly) {
189 return BaseLayer.findSymbolIn(H, Name, ExportedSymbolsOnly);
190 }
191
192 void emitAndFinalize(ModuleSetHandleT H) {
193 BaseLayer.emitAndFinalize(H);
194 }
195
196 TransformFtor& getTransform() { return Transform; }
197
198 const TransformFtor& getTransform() const { return Transform; }
199
200 private:
201 BaseLayerT &BaseLayer;
202 TransformFtor Transform;
203 };
204
205This is the whole definition of IRTransformLayer, from
206``llvm/include/llvm/ExecutionEngine/Orc/IRTransformLayer.h``, stripped of its
207comments. It is a template class with two template arguments: ``BaesLayerT`` and
208``TransformFtor`` that provide the type of the base layer, and the type of the
209"transform functor" (in our case a std::function) respectively. The body of the
210class is concerned with two very simple jobs: (1) Running every IR Module that
211is added with addModuleSet through the transform functor, and (2) conforming to
212the ORC layer interface, which is:
213
214+------------------------------------------------------------------------------+
215| Interface | Description |
216+==================+===========================================================+
217| | Provides a handle that can be used to identify a module |
218| ModuleSetHandleT | set when calling findSymbolIn, removeModuleSet, or |
219| | emitAndFinalize. |
220+------------------+-----------------------------------------------------------+
221| | Takes a given set of Modules and makes them "available |
222| | for execution. This means that symbols in those modules |
223| | should be searchable via findSymbol and findSymbolIn, and |
224| | the address of the symbols should be read/writable (for |
225| | data symbols), or executable (for function symbols) after |
226| | JITSymbol::getAddress() is called. Note: This means that |
227| addModuleSet | addModuleSet doesn't have to compile (or do any other |
228| | work) up-front. It *can*, like IRCompileLayer, act |
229| | eagerly, but it can also simply record the module and |
230| | take no further action until somebody calls |
231| | JITSymbol::getAddress(). In IRTransformLayer's case |
232| | addModuleSet eagerly applies the transform functor to |
233| | each module in the set, then passes the resulting set |
234| | of mutated modules down to the layer below. |
235+------------------+-----------------------------------------------------------+
236| | Removes a set of modules from the JIT. Code or data |
237| removeModuleSet | defined in these modules will no longer be available, and |
238| | the memory holding the JIT'd definitions will be freed. |
239+------------------+-----------------------------------------------------------+
240| | Searches for the named symbol in all modules that have |
241| | previously been added via addModuleSet (and not yet |
242| findSymbol | removed by a call to removeModuleSet). In |
243| | IRTransformLayer we just pass the query on to the layer |
244| | below. In our REPL this is our default way to search for |
245| | function definitions. |
246+------------------+-----------------------------------------------------------+
247| | Searches for the named symbol in the module set indicated |
248| | by the given ModuleSetHandleT. This is just an optimized |
249| | search, better for lookup-speed when you know exactly |
250| | a symbol definition should be found. In IRTransformLayer |
251| findSymbolIn | we just pass this query on to the layer below. In our |
252| | REPL we use this method to search for functions |
253| | representing top-level expressions, since we know exactly |
254| | where we'll find them: in the top-level expression module |
255| | we just added. |
256+------------------+-----------------------------------------------------------+
257| | Forces all of the actions required to make the code and |
258| | data in a module set (represented by a ModuleSetHandleT) |
259| | accessible. Behaves as if some symbol in the set had been |
260| | searched for and JITSymbol::getSymbolAddress called. This |
261| emitAndFinalize | is rarely needed, but can be useful when dealing with |
262| | layers that usually behave lazily if the user wants to |
263| | trigger early compilation (for example, to use idle CPU |
264| | time to eagerly compile code in the background). |
265+------------------+-----------------------------------------------------------+
266
267This interface attempts to capture the natural operations of a JIT (with some
268wrinkles like emitAndFinalize for performance), similar to the basic JIT API
269operations we identified in Chapter 1. Conforming to the layer concept allows
270classes to compose neatly by implementing their behaviors in terms of the these
271same operations, carried out on the layer below. For example, an eager layer
272(like IRTransformLayer) can implement addModuleSet by running each module in the
273set through its transform up-front and immediately passing the result to the
274layer below. A lazy layer, by contrast, could implement addModuleSet by
275squirreling away the modules doing no other up-front work, but applying the
276transform (and calling addModuleSet on the layer below) when the client calls
277findSymbol instead. The JIT'd program behavior will be the same either way, but
278these choices will have different performance characteristics: Doing work
279eagerly means the JIT takes longer up-front, but proceeds smoothly once this is
280done. Deferring work allows the JIT to get up-and-running quickly, but will
281force the JIT to pause and wait whenever some code or data is needed that hasn't
282already been procesed.
283
284Our current REPL is eager: Each function definition is optimized and compiled as
285soon as it's typed in. If we were to make the transform layer lazy (but not
286change things otherwise) we could defer optimization until the first time we
287reference a function in a top-level expression (see if you can figure out why,
288then check out the answer below [1]_). In the next chapter, however we'll
289introduce fully lazy compilation, in which function's aren't compiled until
290they're first called at run-time. At this point the trade-offs get much more
291interesting: the lazier we are, the quicker we can start executing the first
292function, but the more often we'll have to pause to compile newly encountered
293functions. If we only code-gen lazily, but optimize eagerly, we'll have a slow
294startup (which everything is optimized) but relatively short pauses as each
295function just passes through code-gen. If we both optimize and code-gen lazily
296we can start executing the first function more quickly, but we'll have longer
297pauses as each function has to be both optimized and code-gen'd when it's first
298executed. Things become even more interesting if we consider interproceedural
299optimizations like inlining, which must be performed eagerly. These are
300complex trade-offs, and there is no one-size-fits all solution to them, but by
301providing composable layers we leave the decisions to the person implementing
302the JIT, and make it easy for them to experiment with different configurations.
303
304`Next: Adding Per-function Lazy Compilation <BuildingAJIT3.html>`_
Lang Hamesbe84d2be2016-05-26 00:38:04 +0000305
306Full Code Listing
307=================
308
309Here is the complete code listing for our running example with an
310IRTransformLayer added to enable optimization. To build this example, use:
311
312.. code-block:: bash
313
314 # Compile
315 clang++ -g toy.cpp `llvm-config --cxxflags --ldflags --system-libs --libs core orc native` -O3 -o toy
316 # Run
317 ./toy
318
319Here is the code:
320
321.. literalinclude:: ../../examples/Kaleidoscope/BuildingAJIT/Chapter2/KaleidoscopeJIT.h
322 :language: c++
323
Lang Hamesc499d2a2016-06-06 03:28:12 +0000324.. [1] When we add our top-level expression to the JIT, any calls to functions
325 that we defined earlier will appear to the ObjectLinkingLayer as
326 external symbols. The ObjectLinkingLayer will call the SymbolResolver
327 that we defined in addModuleSet, which in turn calls findSymbol on the
328 OptimizeLayer, at which point even a lazy transform layer will have to
329 do its work.