blob: f5ef0d02a8fbbed5d19b67adb127d30eaadc5cfa [file] [log] [blame]
Reid Spencer66e7cd02004-09-11 20:30:11 +00001//===--- examples/Fibonacci/fibonacci.cpp - An example use of the JIT -----===//
Misha Brukman237cef42005-04-20 16:42:34 +00002//
Reid Spencere784fa42004-08-19 20:10:04 +00003// The LLVM Compiler Infrastructure
4//
Chris Lattnerfc001bb2007-12-29 20:37:57 +00005// This file is distributed under the University of Illinois Open Source
6// License. See LICENSE.TXT for details.
Misha Brukman237cef42005-04-20 16:42:34 +00007//
Reid Spencere784fa42004-08-19 20:10:04 +00008//===----------------------------------------------------------------------===//
9//
Chris Lattner38f024d2004-11-03 21:43:03 +000010// This small program provides an example of how to build quickly a small module
11// with function Fibonacci and execute it with the JIT.
Reid Spencere784fa42004-08-19 20:10:04 +000012//
Chris Lattner38f024d2004-11-03 21:43:03 +000013// The goal of this snippet is to create in the memory the LLVM module
14// consisting of one function as follow:
Reid Spencere784fa42004-08-19 20:10:04 +000015//
Chris Lattner38f024d2004-11-03 21:43:03 +000016// int fib(int x) {
17// if(x<=2) return 1;
18// return fib(x-1)+fib(x-2);
19// }
Misha Brukman237cef42005-04-20 16:42:34 +000020//
Chris Lattner38f024d2004-11-03 21:43:03 +000021// Once we have this, we compile the module via JIT, then execute the `fib'
Reid Spencere784fa42004-08-19 20:10:04 +000022// function and return result to a driver, i.e. to a "host program".
23//
Chris Lattner38f024d2004-11-03 21:43:03 +000024//===----------------------------------------------------------------------===//
Reid Spencere784fa42004-08-19 20:10:04 +000025
Chris Lattner38f024d2004-11-03 21:43:03 +000026#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"
Jeff Cohenafebb442006-03-24 03:11:31 +000032#include "llvm/ExecutionEngine/JIT.h"
33#include "llvm/ExecutionEngine/Interpreter.h"
Reid Spencere784fa42004-08-19 20:10:04 +000034#include "llvm/ExecutionEngine/GenericValue.h"
Chris Lattner38f024d2004-11-03 21:43:03 +000035#include <iostream>
Reid Spencere784fa42004-08-19 20:10:04 +000036using namespace llvm;
37
Chris Lattner38f024d2004-11-03 21:43:03 +000038static 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.
Chris Lattner6a987542007-01-07 07:40:09 +000041 Function *FibF =
42 cast<Function>(M->getOrInsertFunction("fib", Type::Int32Ty, Type::Int32Ty,
43 (Type *)0));
Misha Brukman237cef42005-04-20 16:42:34 +000044
Chris Lattner38f024d2004-11-03 21:43:03 +000045 // Add a basic block to the function.
Gabor Greif051a9502008-04-06 20:25:17 +000046 BasicBlock *BB = BasicBlock::Create("EntryBlock", FibF);
Misha Brukman237cef42005-04-20 16:42:34 +000047
Chris Lattner38f024d2004-11-03 21:43:03 +000048 // Get pointers to the constants.
Reid Spencerdb8d2be2006-12-31 05:50:28 +000049 Value *One = ConstantInt::get(Type::Int32Ty, 1);
50 Value *Two = ConstantInt::get(Type::Int32Ty, 2);
Reid Spencere784fa42004-08-19 20:10:04 +000051
Chris Lattner38f024d2004-11-03 21:43:03 +000052 // Get pointer to the integer argument of the add1 function...
Alkis Evlogimenosdadf8812005-03-15 07:12:30 +000053 Argument *ArgX = FibF->arg_begin(); // Get the arg.
Chris Lattner38f024d2004-11-03 21:43:03 +000054 ArgX->setName("AnArg"); // Give it a nice symbolic name for fun.
55
Chris Lattner38f024d2004-11-03 21:43:03 +000056 // Create the true_block.
Gabor Greif051a9502008-04-06 20:25:17 +000057 BasicBlock *RetBB = BasicBlock::Create("return", FibF);
Chris Lattner38f024d2004-11-03 21:43:03 +000058 // Create an exit block.
Gabor Greif051a9502008-04-06 20:25:17 +000059 BasicBlock* RecurseBB = BasicBlock::Create("recurse", FibF);
Chris Lattner38f024d2004-11-03 21:43:03 +000060
Chris Lattner7520fcd2008-03-13 03:29:42 +000061 // Create the "if (arg <= 2) goto exitbb"
Reid Spencere4d87aa2006-12-23 06:05:41 +000062 Value *CondInst = new ICmpInst(ICmpInst::ICMP_SLE, ArgX, Two, "cond", BB);
Gabor Greif051a9502008-04-06 20:25:17 +000063 BranchInst::Create(RetBB, RecurseBB, CondInst, BB);
Chris Lattner38f024d2004-11-03 21:43:03 +000064
65 // Create: ret int 1
Gabor Greif051a9502008-04-06 20:25:17 +000066 ReturnInst::Create(One, RetBB);
Misha Brukman237cef42005-04-20 16:42:34 +000067
Chris Lattner38f024d2004-11-03 21:43:03 +000068 // create fib(x-1)
69 Value *Sub = BinaryOperator::createSub(ArgX, One, "arg", RecurseBB);
Gabor Greif051a9502008-04-06 20:25:17 +000070 CallInst *CallFibX1 = CallInst::Create(FibF, Sub, "fibx1", RecurseBB);
Chris Lattnerf6b5c1a2005-05-06 06:21:59 +000071 CallFibX1->setTailCall();
Misha Brukman237cef42005-04-20 16:42:34 +000072
Chris Lattner38f024d2004-11-03 21:43:03 +000073 // create fib(x-2)
74 Sub = BinaryOperator::createSub(ArgX, Two, "arg", RecurseBB);
Gabor Greif051a9502008-04-06 20:25:17 +000075 CallInst *CallFibX2 = CallInst::Create(FibF, Sub, "fibx2", RecurseBB);
Chris Lattnerf6b5c1a2005-05-06 06:21:59 +000076 CallFibX2->setTailCall();
Chris Lattner47968e42005-05-06 05:59:50 +000077
Chris Lattner38f024d2004-11-03 21:43:03 +000078
79 // fib(x-1)+fib(x-2)
80 Value *Sum = BinaryOperator::createAdd(CallFibX1, CallFibX2,
81 "addresult", RecurseBB);
Misha Brukman237cef42005-04-20 16:42:34 +000082
Chris Lattner38f024d2004-11-03 21:43:03 +000083 // Create the return instruction and add it to the basic block
Gabor Greif051a9502008-04-06 20:25:17 +000084 ReturnInst::Create(Sum, RecurseBB);
Chris Lattner38f024d2004-11-03 21:43:03 +000085
86 return FibF;
87}
88
89
90int main(int argc, char **argv) {
91 int n = argc > 1 ? atol(argv[1]) : 24;
Reid Spencere784fa42004-08-19 20:10:04 +000092
93 // Create some module to put our function into it.
94 Module *M = new Module("test");
95
Reid Spencere784fa42004-08-19 20:10:04 +000096 // We are about to create the "fib" function:
Chris Lattner38f024d2004-11-03 21:43:03 +000097 Function *FibF = CreateFibFunction(M);
Reid Spencere784fa42004-08-19 20:10:04 +000098
Misha Brukman237cef42005-04-20 16:42:34 +000099 // Now we going to create JIT
Chris Lattner38f024d2004-11-03 21:43:03 +0000100 ExistingModuleProvider *MP = new ExistingModuleProvider(M);
101 ExecutionEngine *EE = ExecutionEngine::create(MP, false);
Reid Spencere784fa42004-08-19 20:10:04 +0000102
Chris Lattner38f024d2004-11-03 21:43:03 +0000103 std::cerr << "verifying... ";
Reid Spencere784fa42004-08-19 20:10:04 +0000104 if (verifyModule(*M)) {
Chris Lattner38f024d2004-11-03 21:43:03 +0000105 std::cerr << argv[0] << ": Error constructing function!\n";
Reid Spencere784fa42004-08-19 20:10:04 +0000106 return 1;
107 }
Reid Spencere784fa42004-08-19 20:10:04 +0000108
Chris Lattner38f024d2004-11-03 21:43:03 +0000109 std::cerr << "OK\n";
110 std::cerr << "We just constructed this LLVM module:\n\n---------\n" << *M;
Misha Brukman7cf540b2004-11-05 04:11:40 +0000111 std::cerr << "---------\nstarting fibonacci(" << n << ") with JIT...\n";
Reid Spencere784fa42004-08-19 20:10:04 +0000112
Misha Brukman7cf540b2004-11-05 04:11:40 +0000113 // Call the Fibonacci function with argument n:
Chris Lattner38f024d2004-11-03 21:43:03 +0000114 std::vector<GenericValue> Args(1);
Reid Spencer34bd70d2007-03-06 17:24:31 +0000115 Args[0].IntVal = APInt(32, n);
Chris Lattner38f024d2004-11-03 21:43:03 +0000116 GenericValue GV = EE->runFunction(FibF, Args);
Reid Spencere784fa42004-08-19 20:10:04 +0000117
Chris Lattner38f024d2004-11-03 21:43:03 +0000118 // import result of execution
Chris Lattner9132a2b2007-08-23 05:15:32 +0000119 std::cout << "Result: " << GV.IntVal.toStringUnsigned(10) << "\n";
Reid Spencere784fa42004-08-19 20:10:04 +0000120 return 0;
121}