fibonacci.cpp 4.2 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124
  1. //===--- examples/Fibonacci/fibonacci.cpp - An example use of the JIT -----===//
  2. //
  3. // The LLVM Compiler Infrastructure
  4. //
  5. // This file is distributed under the University of Illinois Open Source
  6. // License. See LICENSE.TXT for details.
  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. #include "llvm/LLVMContext.h"
  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"
  35. #include "llvm/Support/raw_ostream.h"
  36. using namespace llvm;
  37. static Function *CreateFibFunction(Module *M, LLVMContext &Context) {
  38. // Create the fib function and insert it into module M. This function is said
  39. // to return an int and take an int parameter.
  40. Function *FibF =
  41. cast<Function>(M->getOrInsertFunction("fib", Type::getInt32Ty(Context),
  42. Type::getInt32Ty(Context),
  43. (Type *)0));
  44. // Add a basic block to the function.
  45. BasicBlock *BB = BasicBlock::Create(Context, "EntryBlock", FibF);
  46. // Get pointers to the constants.
  47. Value *One = ConstantInt::get(Type::getInt32Ty(Context), 1);
  48. Value *Two = ConstantInt::get(Type::getInt32Ty(Context), 2);
  49. // Get pointer to the integer argument of the add1 function...
  50. Argument *ArgX = FibF->arg_begin(); // Get the arg.
  51. ArgX->setName("AnArg"); // Give it a nice symbolic name for fun.
  52. // Create the true_block.
  53. BasicBlock *RetBB = BasicBlock::Create(Context, "return", FibF);
  54. // Create an exit block.
  55. BasicBlock* RecurseBB = BasicBlock::Create(Context, "recurse", FibF);
  56. // Create the "if (arg <= 2) goto exitbb"
  57. Value *CondInst = new ICmpInst(*BB, ICmpInst::ICMP_SLE, ArgX, Two, "cond");
  58. BranchInst::Create(RetBB, RecurseBB, CondInst, BB);
  59. // Create: ret int 1
  60. ReturnInst::Create(Context, One, RetBB);
  61. // create fib(x-1)
  62. Value *Sub = BinaryOperator::CreateSub(ArgX, One, "arg", RecurseBB);
  63. CallInst *CallFibX1 = CallInst::Create(FibF, Sub, "fibx1", RecurseBB);
  64. CallFibX1->setTailCall();
  65. // create fib(x-2)
  66. Sub = BinaryOperator::CreateSub(ArgX, Two, "arg", RecurseBB);
  67. CallInst *CallFibX2 = CallInst::Create(FibF, Sub, "fibx2", RecurseBB);
  68. CallFibX2->setTailCall();
  69. // fib(x-1)+fib(x-2)
  70. Value *Sum = BinaryOperator::CreateAdd(CallFibX1, CallFibX2,
  71. "addresult", RecurseBB);
  72. // Create the return instruction and add it to the basic block
  73. ReturnInst::Create(Context, Sum, RecurseBB);
  74. return FibF;
  75. }
  76. int main(int argc, char **argv) {
  77. int n = argc > 1 ? atol(argv[1]) : 24;
  78. LLVMContext Context;
  79. // Create some module to put our function into it.
  80. Module *M = new Module("test", Context);
  81. // We are about to create the "fib" function:
  82. Function *FibF = CreateFibFunction(M, Context);
  83. // Now we going to create JIT
  84. ExecutionEngine *EE = EngineBuilder(M).create();
  85. errs() << "verifying... ";
  86. if (verifyModule(*M)) {
  87. errs() << argv[0] << ": Error constructing function!\n";
  88. return 1;
  89. }
  90. errs() << "OK\n";
  91. errs() << "We just constructed this LLVM module:\n\n---------\n" << *M;
  92. errs() << "---------\nstarting fibonacci(" << n << ") with JIT...\n";
  93. // Call the Fibonacci function with argument n:
  94. std::vector<GenericValue> Args(1);
  95. Args[0].IntVal = APInt(32, n);
  96. GenericValue GV = EE->runFunction(FibF, Args);
  97. // import result of execution
  98. outs() << "Result: " << GV.IntVal << "\n";
  99. return 0;
  100. }