fibonacci.cpp 4.8 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149
  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/ADT/APInt.h"
  26. #include "llvm/IR/Verifier.h"
  27. #include "llvm/ExecutionEngine/ExecutionEngine.h"
  28. #include "llvm/ExecutionEngine/GenericValue.h"
  29. #include "llvm/ExecutionEngine/MCJIT.h"
  30. #include "llvm/IR/Argument.h"
  31. #include "llvm/IR/BasicBlock.h"
  32. #include "llvm/IR/Constants.h"
  33. #include "llvm/IR/DerivedTypes.h"
  34. #include "llvm/IR/Function.h"
  35. #include "llvm/IR/InstrTypes.h"
  36. #include "llvm/IR/Instructions.h"
  37. #include "llvm/IR/LLVMContext.h"
  38. #include "llvm/IR/Module.h"
  39. #include "llvm/IR/Type.h"
  40. #include "llvm/Support/Casting.h"
  41. #include "llvm/Support/TargetSelect.h"
  42. #include "llvm/Support/raw_ostream.h"
  43. #include <algorithm>
  44. #include <cstdlib>
  45. #include <memory>
  46. #include <string>
  47. #include <vector>
  48. using namespace llvm;
  49. static Function *CreateFibFunction(Module *M, LLVMContext &Context) {
  50. // Create the fib function and insert it into module M. This function is said
  51. // to return an int and take an int parameter.
  52. Function *FibF =
  53. cast<Function>(M->getOrInsertFunction("fib", Type::getInt32Ty(Context),
  54. Type::getInt32Ty(Context),
  55. nullptr));
  56. // Add a basic block to the function.
  57. BasicBlock *BB = BasicBlock::Create(Context, "EntryBlock", FibF);
  58. // Get pointers to the constants.
  59. Value *One = ConstantInt::get(Type::getInt32Ty(Context), 1);
  60. Value *Two = ConstantInt::get(Type::getInt32Ty(Context), 2);
  61. // Get pointer to the integer argument of the add1 function...
  62. Argument *ArgX = &*FibF->arg_begin(); // Get the arg.
  63. ArgX->setName("AnArg"); // Give it a nice symbolic name for fun.
  64. // Create the true_block.
  65. BasicBlock *RetBB = BasicBlock::Create(Context, "return", FibF);
  66. // Create an exit block.
  67. BasicBlock* RecurseBB = BasicBlock::Create(Context, "recurse", FibF);
  68. // Create the "if (arg <= 2) goto exitbb"
  69. Value *CondInst = new ICmpInst(*BB, ICmpInst::ICMP_SLE, ArgX, Two, "cond");
  70. BranchInst::Create(RetBB, RecurseBB, CondInst, BB);
  71. // Create: ret int 1
  72. ReturnInst::Create(Context, One, RetBB);
  73. // create fib(x-1)
  74. Value *Sub = BinaryOperator::CreateSub(ArgX, One, "arg", RecurseBB);
  75. CallInst *CallFibX1 = CallInst::Create(FibF, Sub, "fibx1", RecurseBB);
  76. CallFibX1->setTailCall();
  77. // create fib(x-2)
  78. Sub = BinaryOperator::CreateSub(ArgX, Two, "arg", RecurseBB);
  79. CallInst *CallFibX2 = CallInst::Create(FibF, Sub, "fibx2", RecurseBB);
  80. CallFibX2->setTailCall();
  81. // fib(x-1)+fib(x-2)
  82. Value *Sum = BinaryOperator::CreateAdd(CallFibX1, CallFibX2,
  83. "addresult", RecurseBB);
  84. // Create the return instruction and add it to the basic block
  85. ReturnInst::Create(Context, Sum, RecurseBB);
  86. return FibF;
  87. }
  88. int main(int argc, char **argv) {
  89. int n = argc > 1 ? atol(argv[1]) : 24;
  90. InitializeNativeTarget();
  91. InitializeNativeTargetAsmPrinter();
  92. LLVMContext Context;
  93. // Create some module to put our function into it.
  94. std::unique_ptr<Module> Owner(new Module("test", Context));
  95. Module *M = Owner.get();
  96. // We are about to create the "fib" function:
  97. Function *FibF = CreateFibFunction(M, Context);
  98. // Now we going to create JIT
  99. std::string errStr;
  100. ExecutionEngine *EE =
  101. EngineBuilder(std::move(Owner))
  102. .setErrorStr(&errStr)
  103. .create();
  104. if (!EE) {
  105. errs() << argv[0] << ": Failed to construct ExecutionEngine: " << errStr
  106. << "\n";
  107. return 1;
  108. }
  109. errs() << "verifying... ";
  110. if (verifyModule(*M)) {
  111. errs() << argv[0] << ": Error constructing function!\n";
  112. return 1;
  113. }
  114. errs() << "OK\n";
  115. errs() << "We just constructed this LLVM module:\n\n---------\n" << *M;
  116. errs() << "---------\nstarting fibonacci(" << n << ") with JIT...\n";
  117. // Call the Fibonacci function with argument n:
  118. std::vector<GenericValue> Args(1);
  119. Args[0].IntVal = APInt(32, n);
  120. GenericValue GV = EE->runFunction(FibF, Args);
  121. // import result of execution
  122. outs() << "Result: " << GV.IntVal << "\n";
  123. return 0;
  124. }