fibonacci.cpp 4.8 KB

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