Dan Gohman | f17a25c | 2007-07-18 16:29:46 +0000 | [diff] [blame] | 1 | //===--- examples/Fibonacci/fibonacci.cpp - An example use of the JIT -----===// |
| 2 | // |
| 3 | // The LLVM Compiler Infrastructure |
| 4 | // |
Chris Lattner | 45ca7c1 | 2007-12-29 20:37:57 +0000 | [diff] [blame] | 5 | // This file is distributed under the University of Illinois Open Source |
| 6 | // License. See LICENSE.TXT for details. |
Dan Gohman | f17a25c | 2007-07-18 16:29:46 +0000 | [diff] [blame] | 7 | // |
| 8 | //===----------------------------------------------------------------------===// |
| 9 | // |
| 10 | // This small program provides an example of how to build quickly a small module |
| 11 | // with function Fibonacci and execute it with the JIT. |
| 12 | // |
| 13 | // The goal of this snippet is to create in the memory the LLVM module |
| 14 | // consisting of one function as follow: |
| 15 | // |
| 16 | // int fib(int x) { |
| 17 | // if(x<=2) return 1; |
| 18 | // return fib(x-1)+fib(x-2); |
| 19 | // } |
| 20 | // |
| 21 | // Once we have this, we compile the module via JIT, then execute the `fib' |
| 22 | // function and return result to a driver, i.e. to a "host program". |
| 23 | // |
| 24 | //===----------------------------------------------------------------------===// |
| 25 | |
| 26 | #include "llvm/Module.h" |
| 27 | #include "llvm/DerivedTypes.h" |
| 28 | #include "llvm/Constants.h" |
| 29 | #include "llvm/Instructions.h" |
| 30 | #include "llvm/ModuleProvider.h" |
| 31 | #include "llvm/Analysis/Verifier.h" |
| 32 | #include "llvm/ExecutionEngine/JIT.h" |
| 33 | #include "llvm/ExecutionEngine/Interpreter.h" |
| 34 | #include "llvm/ExecutionEngine/GenericValue.h" |
Chris Lattner | 1fefaac | 2008-08-23 22:23:09 +0000 | [diff] [blame] | 35 | #include "llvm/Support/raw_ostream.h" |
Dan Gohman | f17a25c | 2007-07-18 16:29:46 +0000 | [diff] [blame] | 36 | using namespace llvm; |
| 37 | |
| 38 | static Function *CreateFibFunction(Module *M) { |
| 39 | // Create the fib function and insert it into module M. This function is said |
| 40 | // to return an int and take an int parameter. |
| 41 | Function *FibF = |
| 42 | cast<Function>(M->getOrInsertFunction("fib", Type::Int32Ty, Type::Int32Ty, |
| 43 | (Type *)0)); |
| 44 | |
| 45 | // Add a basic block to the function. |
Gabor Greif | d6da1d0 | 2008-04-06 20:25:17 +0000 | [diff] [blame] | 46 | BasicBlock *BB = BasicBlock::Create("EntryBlock", FibF); |
Dan Gohman | f17a25c | 2007-07-18 16:29:46 +0000 | [diff] [blame] | 47 | |
| 48 | // Get pointers to the constants. |
| 49 | Value *One = ConstantInt::get(Type::Int32Ty, 1); |
| 50 | Value *Two = ConstantInt::get(Type::Int32Ty, 2); |
| 51 | |
| 52 | // Get pointer to the integer argument of the add1 function... |
| 53 | Argument *ArgX = FibF->arg_begin(); // Get the arg. |
| 54 | ArgX->setName("AnArg"); // Give it a nice symbolic name for fun. |
| 55 | |
| 56 | // Create the true_block. |
Gabor Greif | d6da1d0 | 2008-04-06 20:25:17 +0000 | [diff] [blame] | 57 | BasicBlock *RetBB = BasicBlock::Create("return", FibF); |
Dan Gohman | f17a25c | 2007-07-18 16:29:46 +0000 | [diff] [blame] | 58 | // Create an exit block. |
Gabor Greif | d6da1d0 | 2008-04-06 20:25:17 +0000 | [diff] [blame] | 59 | BasicBlock* RecurseBB = BasicBlock::Create("recurse", FibF); |
Dan Gohman | f17a25c | 2007-07-18 16:29:46 +0000 | [diff] [blame] | 60 | |
Chris Lattner | d6298a3 | 2008-03-13 03:29:42 +0000 | [diff] [blame] | 61 | // Create the "if (arg <= 2) goto exitbb" |
Dan Gohman | f17a25c | 2007-07-18 16:29:46 +0000 | [diff] [blame] | 62 | Value *CondInst = new ICmpInst(ICmpInst::ICMP_SLE, ArgX, Two, "cond", BB); |
Gabor Greif | d6da1d0 | 2008-04-06 20:25:17 +0000 | [diff] [blame] | 63 | BranchInst::Create(RetBB, RecurseBB, CondInst, BB); |
Dan Gohman | f17a25c | 2007-07-18 16:29:46 +0000 | [diff] [blame] | 64 | |
| 65 | // Create: ret int 1 |
Gabor Greif | d6da1d0 | 2008-04-06 20:25:17 +0000 | [diff] [blame] | 66 | ReturnInst::Create(One, RetBB); |
Dan Gohman | f17a25c | 2007-07-18 16:29:46 +0000 | [diff] [blame] | 67 | |
| 68 | // create fib(x-1) |
Gabor Greif | a645dd3 | 2008-05-16 19:29:10 +0000 | [diff] [blame] | 69 | Value *Sub = BinaryOperator::CreateSub(ArgX, One, "arg", RecurseBB); |
Gabor Greif | d6da1d0 | 2008-04-06 20:25:17 +0000 | [diff] [blame] | 70 | CallInst *CallFibX1 = CallInst::Create(FibF, Sub, "fibx1", RecurseBB); |
Dan Gohman | f17a25c | 2007-07-18 16:29:46 +0000 | [diff] [blame] | 71 | CallFibX1->setTailCall(); |
| 72 | |
| 73 | // create fib(x-2) |
Gabor Greif | a645dd3 | 2008-05-16 19:29:10 +0000 | [diff] [blame] | 74 | Sub = BinaryOperator::CreateSub(ArgX, Two, "arg", RecurseBB); |
Gabor Greif | d6da1d0 | 2008-04-06 20:25:17 +0000 | [diff] [blame] | 75 | CallInst *CallFibX2 = CallInst::Create(FibF, Sub, "fibx2", RecurseBB); |
Dan Gohman | f17a25c | 2007-07-18 16:29:46 +0000 | [diff] [blame] | 76 | CallFibX2->setTailCall(); |
| 77 | |
| 78 | |
| 79 | // fib(x-1)+fib(x-2) |
Gabor Greif | a645dd3 | 2008-05-16 19:29:10 +0000 | [diff] [blame] | 80 | Value *Sum = BinaryOperator::CreateAdd(CallFibX1, CallFibX2, |
Dan Gohman | f17a25c | 2007-07-18 16:29:46 +0000 | [diff] [blame] | 81 | "addresult", RecurseBB); |
| 82 | |
| 83 | // Create the return instruction and add it to the basic block |
Gabor Greif | d6da1d0 | 2008-04-06 20:25:17 +0000 | [diff] [blame] | 84 | ReturnInst::Create(Sum, RecurseBB); |
Dan Gohman | f17a25c | 2007-07-18 16:29:46 +0000 | [diff] [blame] | 85 | |
| 86 | return FibF; |
| 87 | } |
| 88 | |
| 89 | |
| 90 | int main(int argc, char **argv) { |
| 91 | int n = argc > 1 ? atol(argv[1]) : 24; |
| 92 | |
| 93 | // Create some module to put our function into it. |
| 94 | Module *M = new Module("test"); |
| 95 | |
| 96 | // We are about to create the "fib" function: |
| 97 | Function *FibF = CreateFibFunction(M); |
| 98 | |
| 99 | // Now we going to create JIT |
| 100 | ExistingModuleProvider *MP = new ExistingModuleProvider(M); |
| 101 | ExecutionEngine *EE = ExecutionEngine::create(MP, false); |
| 102 | |
Chris Lattner | 1fefaac | 2008-08-23 22:23:09 +0000 | [diff] [blame] | 103 | errs() << "verifying... "; |
Dan Gohman | f17a25c | 2007-07-18 16:29:46 +0000 | [diff] [blame] | 104 | if (verifyModule(*M)) { |
Chris Lattner | 1fefaac | 2008-08-23 22:23:09 +0000 | [diff] [blame] | 105 | errs() << argv[0] << ": Error constructing function!\n"; |
Dan Gohman | f17a25c | 2007-07-18 16:29:46 +0000 | [diff] [blame] | 106 | return 1; |
| 107 | } |
| 108 | |
Chris Lattner | 1fefaac | 2008-08-23 22:23:09 +0000 | [diff] [blame] | 109 | errs() << "OK\n"; |
| 110 | errs() << "We just constructed this LLVM module:\n\n---------\n" << *M; |
| 111 | errs() << "---------\nstarting fibonacci(" << n << ") with JIT...\n"; |
Dan Gohman | f17a25c | 2007-07-18 16:29:46 +0000 | [diff] [blame] | 112 | |
| 113 | // Call the Fibonacci function with argument n: |
| 114 | std::vector<GenericValue> Args(1); |
| 115 | Args[0].IntVal = APInt(32, n); |
| 116 | GenericValue GV = EE->runFunction(FibF, Args); |
| 117 | |
| 118 | // import result of execution |
Chris Lattner | 1fefaac | 2008-08-23 22:23:09 +0000 | [diff] [blame] | 119 | outs() << "Result: " << GV.IntVal << "\n"; |
Dan Gohman | f17a25c | 2007-07-18 16:29:46 +0000 | [diff] [blame] | 120 | return 0; |
| 121 | } |