//===--- examples/Fibonacci/fibonacci.cpp - An example use of the JIT -----===//
-//
+//
// The LLVM Compiler Infrastructure
//
// This file was developed by Valery A. Khamenya and is distributed under the
// University of Illinois Open Source License. See LICENSE.TXT for details.
-//
+//
//===----------------------------------------------------------------------===//
//
// This small program provides an example of how to build quickly a small module
// if(x<=2) return 1;
// return fib(x-1)+fib(x-2);
// }
-//
+//
// Once we have this, we compile the module via JIT, then execute the `fib'
// function and return result to a driver, i.e. to a "host program".
//
// Create the fib function and insert it into module M. This function is said
// to return an int and take an int parameter.
Function *FibF = M->getOrInsertFunction("fib", Type::IntTy, Type::IntTy, 0);
-
+
// Add a basic block to the function.
BasicBlock *BB = new BasicBlock("EntryBlock", FibF);
-
+
// Get pointers to the constants.
Value *One = ConstantSInt::get(Type::IntTy, 1);
Value *Two = ConstantSInt::get(Type::IntTy, 2);
// Get pointer to the integer argument of the add1 function...
- Argument *ArgX = FibF->abegin(); // Get the arg.
+ Argument *ArgX = FibF->arg_begin(); // Get the arg.
ArgX->setName("AnArg"); // Give it a nice symbolic name for fun.
-
// Create the true_block.
BasicBlock *RetBB = new BasicBlock("return", FibF);
// Create an exit block.
// Create: ret int 1
new ReturnInst(One, RetBB);
-
+
// create fib(x-1)
Value *Sub = BinaryOperator::createSub(ArgX, One, "arg", RecurseBB);
Value *CallFibX1 = new CallInst(FibF, Sub, "fibx1", RecurseBB);
-
+
// create fib(x-2)
Sub = BinaryOperator::createSub(ArgX, Two, "arg", RecurseBB);
Value *CallFibX2 = new CallInst(FibF, Sub, "fibx2", RecurseBB);
// fib(x-1)+fib(x-2)
Value *Sum = BinaryOperator::createAdd(CallFibX1, CallFibX2,
"addresult", RecurseBB);
-
+
// Create the return instruction and add it to the basic block
new ReturnInst(Sum, RecurseBB);
// We are about to create the "fib" function:
Function *FibF = CreateFibFunction(M);
- // Now we going to create JIT
+ // Now we going to create JIT
ExistingModuleProvider *MP = new ExistingModuleProvider(M);
ExecutionEngine *EE = ExecutionEngine::create(MP, false);
std::cerr << "OK\n";
std::cerr << "We just constructed this LLVM module:\n\n---------\n" << *M;
- std::cerr << "---------\nstarting fibonacci("
- << n << ") with JIT...\n";
+ std::cerr << "---------\nstarting fibonacci(" << n << ") with JIT...\n";
- // Call the `foo' function with argument n:
+ // Call the Fibonacci function with argument n:
std::vector<GenericValue> Args(1);
Args[0].IntVal = n;
GenericValue GV = EE->runFunction(FibF, Args);