• Home
  • Line#
  • Scopes#
  • Navigate#
  • Raw
  • Download
1=======================================================
2Building a JIT: Starting out with KaleidoscopeJIT
3=======================================================
4
5.. contents::
6   :local:
7
8Chapter 1 Introduction
9======================
10
11Welcome to Chapter 1 of the "Building an ORC-based JIT in LLVM" tutorial. This
12tutorial runs through the implementation of a JIT compiler using LLVM's
13On-Request-Compilation (ORC) APIs. It begins with a simplified version of the
14KaleidoscopeJIT class used in the
15`Implementing a language with LLVM <LangImpl1.html>`_ tutorials and then
16introduces new features like optimization, lazy compilation and remote
17execution.
18
19The goal of this tutorial is to introduce you to LLVM's ORC JIT APIs, show how
20these APIs interact with other parts of LLVM, and to teach you how to recombine
21them to build a custom JIT that is suited to your use-case.
22
23The structure of the tutorial is:
24
25- Chapter #1: Investigate the simple KaleidoscopeJIT class. This will
26  introduce some of the basic concepts of the ORC JIT APIs, including the
27  idea of an ORC *Layer*.
28
29- `Chapter #2 <BuildingAJIT2.html>`_: Extend the basic KaleidoscopeJIT by adding
30  a new layer that will optimize IR and generated code.
31
32- `Chapter #3 <BuildingAJIT3.html>`_: Further extend the JIT by adding a
33  Compile-On-Demand layer to lazily compile IR.
34
35- `Chapter #4 <BuildingAJIT4.html>`_: Improve the laziness of our JIT by
36  replacing the Compile-On-Demand layer with a custom layer that uses the ORC
37  Compile Callbacks API directly to defer IR-generation until functions are
38  called.
39
40- `Chapter #5 <BuildingAJIT5.html>`_: Add process isolation by JITing code into
41  a remote process with reduced privileges using the JIT Remote APIs.
42
43To provide input for our JIT we will use the Kaleidoscope REPL from
44`Chapter 7 <LangImpl7.html>`_ of the "Implementing a language in LLVM tutorial",
45with one minor modification: We will remove the FunctionPassManager from the
46code for that chapter and replace it with optimization support in our JIT class
47in Chapter #2.
48
49Finally, a word on API generations: ORC is the 3rd generation of LLVM JIT API.
50It was preceded by MCJIT, and before that by the (now deleted) legacy JIT.
51These tutorials don't assume any experience with these earlier APIs, but
52readers acquainted with them will see many familiar elements. Where appropriate
53we will make this connection with the earlier APIs explicit to help people who
54are transitioning from them to ORC.
55
56JIT API Basics
57==============
58
59The purpose of a JIT compiler is to compile code "on-the-fly" as it is needed,
60rather than compiling whole programs to disk ahead of time as a traditional
61compiler does. To support that aim our initial, bare-bones JIT API will be:
62
631. Handle addModule(Module &M) -- Make the given IR module available for
64   execution.
652. JITSymbol findSymbol(const std::string &Name) -- Search for pointers to
66   symbols (functions or variables) that have been added to the JIT.
673. void removeModule(Handle H) -- Remove a module from the JIT, releasing any
68   memory that had been used for the compiled code.
69
70A basic use-case for this API, executing the 'main' function from a module,
71will look like:
72
73.. code-block:: c++
74
75  std::unique_ptr<Module> M = buildModule();
76  JIT J;
77  Handle H = J.addModule(*M);
78  int (*Main)(int, char*[]) =
79    (int(*)(int, char*[])J.findSymbol("main").getAddress();
80  int Result = Main();
81  J.removeModule(H);
82
83The APIs that we build in these tutorials will all be variations on this simple
84theme. Behind the API we will refine the implementation of the JIT to add
85support for optimization and lazy compilation. Eventually we will extend the
86API itself to allow higher-level program representations (e.g. ASTs) to be
87added to the JIT.
88
89KaleidoscopeJIT
90===============
91
92In the previous section we described our API, now we examine a simple
93implementation of it: The KaleidoscopeJIT class [1]_ that was used in the
94`Implementing a language with LLVM <LangImpl1.html>`_ tutorials. We will use
95the REPL code from `Chapter 7 <LangImpl7.html>`_ of that tutorial to supply the
96input for our JIT: Each time the user enters an expression the REPL will add a
97new IR module containing the code for that expression to the JIT. If the
98expression is a top-level expression like '1+1' or 'sin(x)', the REPL will also
99use the findSymbol method of our JIT class find and execute the code for the
100expression, and then use the removeModule method to remove the code again
101(since there's no way to re-invoke an anonymous expression). In later chapters
102of this tutorial we'll modify the REPL to enable new interactions with our JIT
103class, but for now we will take this setup for granted and focus our attention on
104the implementation of our JIT itself.
105
106Our KaleidoscopeJIT class is defined in the KaleidoscopeJIT.h header. After the
107usual include guards and #includes [2]_, we get to the definition of our class:
108
109.. code-block:: c++
110
111  #ifndef LLVM_EXECUTIONENGINE_ORC_KALEIDOSCOPEJIT_H
112  #define LLVM_EXECUTIONENGINE_ORC_KALEIDOSCOPEJIT_H
113
114  #include "llvm/ExecutionEngine/ExecutionEngine.h"
115  #include "llvm/ExecutionEngine/RTDyldMemoryManager.h"
116  #include "llvm/ExecutionEngine/Orc/CompileUtils.h"
117  #include "llvm/ExecutionEngine/Orc/IRCompileLayer.h"
118  #include "llvm/ExecutionEngine/Orc/LambdaResolver.h"
119  #include "llvm/ExecutionEngine/Orc/ObjectLinkingLayer.h"
120  #include "llvm/IR/Mangler.h"
121  #include "llvm/Support/DynamicLibrary.h"
122
123  namespace llvm {
124  namespace orc {
125
126  class KaleidoscopeJIT {
127  private:
128
129    std::unique_ptr<TargetMachine> TM;
130    const DataLayout DL;
131    ObjectLinkingLayer<> ObjectLayer;
132    IRCompileLayer<decltype(ObjectLayer)> CompileLayer;
133
134  public:
135
136    typedef decltype(CompileLayer)::ModuleSetHandleT ModuleHandleT;
137
138Our class begins with four members: A TargetMachine, TM, which will be used
139to build our LLVM compiler instance; A DataLayout, DL, which will be used for
140symbol mangling (more on that later), and two ORC *layers*: an
141ObjectLinkingLayer and a IRCompileLayer. We'll be talking more about layers in
142the next chapter, but for now you can think of them as analogous to LLVM
143Passes: they wrap up useful JIT utilities behind an easy to compose interface.
144The first layer, ObjectLinkingLayer, is the foundation of our JIT: it takes
145in-memory object files produced by a compiler and links them on the fly to make
146them executable. This JIT-on-top-of-a-linker design was introduced in MCJIT,
147however the linker was hidden inside the MCJIT class. In ORC we expose the
148linker so that clients can access and configure it directly if they need to. In
149this tutorial our ObjectLinkingLayer will just be used to support the next layer
150in our stack: the IRCompileLayer, which will be responsible for taking LLVM IR,
151compiling it, and passing the resulting in-memory object files down to the
152object linking layer below.
153
154That's it for member variables, after that we have a single typedef:
155ModuleHandle. This is the handle type that will be returned from our JIT's
156addModule method, and can be passed to the removeModule method to remove a
157module. The IRCompileLayer class already provides a convenient handle type
158(IRCompileLayer::ModuleSetHandleT), so we just alias our ModuleHandle to this.
159
160.. code-block:: c++
161
162  KaleidoscopeJIT()
163      : TM(EngineBuilder().selectTarget()), DL(TM->createDataLayout()),
164    CompileLayer(ObjectLayer, SimpleCompiler(*TM)) {
165    llvm::sys::DynamicLibrary::LoadLibraryPermanently(nullptr);
166  }
167
168  TargetMachine &getTargetMachine() { return *TM; }
169
170Next up we have our class constructor. We begin by initializing TM using the
171EngineBuilder::selectTarget helper method, which constructs a TargetMachine for
172the current process. Next we use our newly created TargetMachine to initialize
173DL, our DataLayout. Then we initialize our IRCompileLayer. Our IRCompile layer
174needs two things: (1) A reference to our object linking layer, and (2) a
175compiler instance to use to perform the actual compilation from IR to object
176files. We use the off-the-shelf SimpleCompiler instance for now. Finally, in
177the body of the constructor, we call the DynamicLibrary::LoadLibraryPermanently
178method with a nullptr argument. Normally the LoadLibraryPermanently method is
179called with the path of a dynamic library to load, but when passed a null
180pointer it will 'load' the host process itself, making its exported symbols
181available for execution.
182
183.. code-block:: c++
184
185  ModuleHandle addModule(std::unique_ptr<Module> M) {
186    // Build our symbol resolver:
187    // Lambda 1: Look back into the JIT itself to find symbols that are part of
188    //           the same "logical dylib".
189    // Lambda 2: Search for external symbols in the host process.
190    auto Resolver = createLambdaResolver(
191        [&](const std::string &Name) {
192          if (auto Sym = CompileLayer.findSymbol(Name, false))
193            return Sym.toRuntimeDyldSymbol();
194          return RuntimeDyld::SymbolInfo(nullptr);
195        },
196        [](const std::string &S) {
197          if (auto SymAddr =
198                RTDyldMemoryManager::getSymbolAddressInProcess(Name))
199            return RuntimeDyld::SymbolInfo(SymAddr, JITSymbolFlags::Exported);
200          return RuntimeDyld::SymbolInfo(nullptr);
201        });
202
203    // Build a singlton module set to hold our module.
204    std::vector<std::unique_ptr<Module>> Ms;
205    Ms.push_back(std::move(M));
206
207    // Add the set to the JIT with the resolver we created above and a newly
208    // created SectionMemoryManager.
209    return CompileLayer.addModuleSet(std::move(Ms),
210                                     make_unique<SectionMemoryManager>(),
211                                     std::move(Resolver));
212  }
213
214Now we come to the first of our JIT API methods: addModule. This method is
215responsible for adding IR to the JIT and making it available for execution. In
216this initial implementation of our JIT we will make our modules "available for
217execution" by adding them straight to the IRCompileLayer, which will
218immediately compile them. In later chapters we will teach our JIT to be lazier
219and instead add the Modules to a "pending" list to be compiled if and when they
220are first executed.
221
222To add our module to the IRCompileLayer we need to supply two auxiliary objects
223(as well as the module itself): a memory manager and a symbol resolver.  The
224memory manager will be responsible for managing the memory allocated to JIT'd
225machine code, setting memory permissions, and registering exception handling
226tables (if the JIT'd code uses exceptions). For our memory manager we will use
227the SectionMemoryManager class: another off-the-shelf utility that provides all
228the basic functionality we need. The second auxiliary class, the symbol
229resolver, is more interesting for us. It exists to tell the JIT where to look
230when it encounters an *external symbol* in the module we are adding.  External
231symbols are any symbol not defined within the module itself, including calls to
232functions outside the JIT and calls to functions defined in other modules that
233have already been added to the JIT. It may seem as though modules added to the
234JIT should "know about one another" by default, but since we would still have to
235supply a symbol resolver for references to code outside the JIT it turns out to
236be easier to just re-use this one mechanism for all symbol resolution. This has
237the added benefit that the user has full control over the symbol resolution
238process. Should we search for definitions within the JIT first, then fall back
239on external definitions? Or should we prefer external definitions where
240available and only JIT code if we don't already have an available
241implementation? By using a single symbol resolution scheme we are free to choose
242whatever makes the most sense for any given use case.
243
244Building a symbol resolver is made especially easy by the *createLambdaResolver*
245function. This function takes two lambdas [3]_ and returns a
246RuntimeDyld::SymbolResolver instance. The first lambda is used as the
247implementation of the resolver's findSymbolInLogicalDylib method, which searches
248for symbol definitions that should be thought of as being part of the same
249"logical" dynamic library as this Module. If you are familiar with static
250linking: this means that findSymbolInLogicalDylib should expose symbols with
251common linkage and hidden visibility. If all this sounds foreign you can ignore
252the details and just remember that this is the first method that the linker will
253use to try to find a symbol definition. If the findSymbolInLogicalDylib method
254returns a null result then the linker will call the second symbol resolver
255method, called findSymbol, which searches for symbols that should be thought of
256as external to (but visibile from) the module and its logical dylib. In this
257tutorial we will adopt the following simple scheme: All modules added to the JIT
258will behave as if they were linked into a single, ever-growing logical dylib. To
259implement this our first lambda (the one defining findSymbolInLogicalDylib) will
260just search for JIT'd code by calling the CompileLayer's findSymbol method. If
261we don't find a symbol in the JIT itself we'll fall back to our second lambda,
262which implements findSymbol. This will use the
263RTDyldMemoyrManager::getSymbolAddressInProcess method to search for the symbol
264within the program itself. If we can't find a symbol definition via either of
265these paths the JIT will refuse to accept our module, returning a "symbol not
266found" error.
267
268Now that we've built our symbol resolver we're ready to add our module to the
269JIT. We do this by calling the CompileLayer's addModuleSet method [4]_. Since
270we only have a single Module and addModuleSet expects a collection, we will
271create a vector of modules and add our module as the only member. Since we
272have already typedef'd our ModuleHandle type to be the same as the
273CompileLayer's handle type, we can return the handle from addModuleSet
274directly from our addModule method.
275
276.. code-block:: c++
277
278  JITSymbol findSymbol(const std::string Name) {
279    std::string MangledName;
280    raw_string_ostream MangledNameStream(MangledName);
281    Mangler::getNameWithPrefix(MangledNameStream, Name, DL);
282    return CompileLayer.findSymbol(MangledNameStream.str(), true);
283  }
284
285  void removeModule(ModuleHandle H) {
286    CompileLayer.removeModuleSet(H);
287  }
288
289Now that we can add code to our JIT, we need a way to find the symbols we've
290added to it. To do that we call the findSymbol method on our IRCompileLayer,
291but with a twist: We have to *mangle* the name of the symbol we're searching
292for first. The reason for this is that the ORC JIT components use mangled
293symbols internally the same way a static compiler and linker would, rather
294than using plain IR symbol names. The kind of mangling will depend on the
295DataLayout, which in turn depends on the target platform. To allow us to
296remain portable and search based on the un-mangled name, we just re-produce
297this mangling ourselves.
298
299We now come to the last method in our JIT API: removeModule. This method is
300responsible for destructing the MemoryManager and SymbolResolver that were
301added with a given module, freeing any resources they were using in the
302process. In our Kaleidoscope demo we rely on this method to remove the module
303representing the most recent top-level expression, preventing it from being
304treated as a duplicate definition when the next top-level expression is
305entered. It is generally good to free any module that you know you won't need
306to call further, just to free up the resources dedicated to it. However, you
307don't strictly need to do this: All resources will be cleaned up when your
308JIT class is destructed, if the haven't been freed before then.
309
310This brings us to the end of Chapter 1 of Building a JIT. You now have a basic
311but fully functioning JIT stack that you can use to take LLVM IR and make it
312executable within the context of your JIT process. In the next chapter we'll
313look at how to extend this JIT to produce better quality code, and in the
314process take a deeper look at the ORC layer concept.
315
316`Next: Extending the KaleidoscopeJIT <BuildingAJIT2.html>`_
317
318Full Code Listing
319=================
320
321Here is the complete code listing for our running example. To build this
322example, use:
323
324.. code-block:: bash
325
326    # Compile
327    clang++ -g toy.cpp `llvm-config --cxxflags --ldflags --system-libs --libs core orc native` -O3 -o toy
328    # Run
329    ./toy
330
331Here is the code:
332
333.. literalinclude:: ../../examples/Kaleidoscope/BuildingAJIT/Chapter1/KaleidoscopeJIT.h
334   :language: c++
335
336.. [1] Actually we use a cut-down version of KaleidoscopeJIT that makes a
337       simplifying assumption: symbols cannot be re-defined. This will make it
338       impossible to re-define symbols in the REPL, but will make our symbol
339       lookup logic simpler. Re-introducing support for symbol redefinition is
340       left as an exercise for the reader. (The KaleidoscopeJIT.h used in the
341       original tutorials will be a helpful reference).
342
343.. [2] +-----------------------+-----------------------------------------------+
344       |         File          |               Reason for inclusion            |
345       +=======================+===============================================+
346       |   ExecutionEngine.h   | Access to the EngineBuilder::selectTarget     |
347       |                       | method.                                       |
348       +-----------------------+-----------------------------------------------+
349       |                       | Access to the                                 |
350       | RTDyldMemoryManager.h | RTDyldMemoryManager::getSymbolAddressInProcess|
351       |                       | method.                                       |
352       +-----------------------+-----------------------------------------------+
353       |    CompileUtils.h     | Provides the SimpleCompiler class.            |
354       +-----------------------+-----------------------------------------------+
355       |   IRCompileLayer.h    | Provides the IRCompileLayer class.            |
356       +-----------------------+-----------------------------------------------+
357       |                       | Access the createLambdaResolver function,     |
358       |   LambdaResolver.h    | which provides easy construction of symbol    |
359       |                       | resolvers.                                    |
360       +-----------------------+-----------------------------------------------+
361       |  ObjectLinkingLayer.h | Provides the ObjectLinkingLayer class.        |
362       +-----------------------+-----------------------------------------------+
363       |       Mangler.h       | Provides the Mangler class for platform       |
364       |                       | specific name-mangling.                       |
365       +-----------------------+-----------------------------------------------+
366       |   DynamicLibrary.h    | Provides the DynamicLibrary class, which      |
367       |                       | makes symbols in the host process searchable. |
368       +-----------------------+-----------------------------------------------+
369
370.. [3] Actually they don't have to be lambdas, any object with a call operator
371       will do, including plain old functions or std::functions.
372
373.. [4] ORC layers accept sets of Modules, rather than individual ones, so that
374       all Modules in the set could be co-located by the memory manager, though
375       this feature is not yet implemented.
376