1 #include "llvm/Analysis/Passes.h"
2 #include "llvm/ExecutionEngine/ExecutionEngine.h"
3 #include "llvm/ExecutionEngine/JIT.h"
4 #include "llvm/IR/DataLayout.h"
5 #include "llvm/IR/DerivedTypes.h"
6 #include "llvm/IR/IRBuilder.h"
7 #include "llvm/IR/LLVMContext.h"
8 #include "llvm/IR/Module.h"
9 #include "llvm/IR/Verifier.h"
10 #include "llvm/PassManager.h"
11 #include "llvm/Support/TargetSelect.h"
12 #include "llvm/Transforms/Scalar.h"
20 //===----------------------------------------------------------------------===//
22 //===----------------------------------------------------------------------===//
24 // The lexer returns tokens [0-255] if it is an unknown character, otherwise one
25 // of these for known things.
30 tok_def = -2, tok_extern = -3,
33 tok_identifier = -4, tok_number = -5,
36 tok_if = -6, tok_then = -7, tok_else = -8,
37 tok_for = -9, tok_in = -10,
40 tok_binary = -11, tok_unary = -12
43 static std::string IdentifierStr; // Filled in if tok_identifier
44 static double NumVal; // Filled in if tok_number
46 /// gettok - Return the next token from standard input.
48 static int LastChar = ' ';
50 // Skip any whitespace.
51 while (isspace(LastChar))
54 if (isalpha(LastChar)) { // identifier: [a-zA-Z][a-zA-Z0-9]*
55 IdentifierStr = LastChar;
56 while (isalnum((LastChar = getchar())))
57 IdentifierStr += LastChar;
59 if (IdentifierStr == "def") return tok_def;
60 if (IdentifierStr == "extern") return tok_extern;
61 if (IdentifierStr == "if") return tok_if;
62 if (IdentifierStr == "then") return tok_then;
63 if (IdentifierStr == "else") return tok_else;
64 if (IdentifierStr == "for") return tok_for;
65 if (IdentifierStr == "in") return tok_in;
66 if (IdentifierStr == "binary") return tok_binary;
67 if (IdentifierStr == "unary") return tok_unary;
68 return tok_identifier;
71 if (isdigit(LastChar) || LastChar == '.') { // Number: [0-9.]+
76 } while (isdigit(LastChar) || LastChar == '.');
78 NumVal = strtod(NumStr.c_str(), 0);
82 if (LastChar == '#') {
83 // Comment until end of line.
84 do LastChar = getchar();
85 while (LastChar != EOF && LastChar != '\n' && LastChar != '\r');
91 // Check for end of file. Don't eat the EOF.
95 // Otherwise, just return the character as its ascii value.
96 int ThisChar = LastChar;
101 //===----------------------------------------------------------------------===//
102 // Abstract Syntax Tree (aka Parse Tree)
103 //===----------------------------------------------------------------------===//
105 /// ExprAST - Base class for all expression nodes.
108 virtual ~ExprAST() {}
109 virtual Value *Codegen() = 0;
112 /// NumberExprAST - Expression class for numeric literals like "1.0".
113 class NumberExprAST : public ExprAST {
116 NumberExprAST(double val) : Val(val) {}
117 virtual Value *Codegen();
120 /// VariableExprAST - Expression class for referencing a variable, like "a".
121 class VariableExprAST : public ExprAST {
124 VariableExprAST(const std::string &name) : Name(name) {}
125 virtual Value *Codegen();
128 /// UnaryExprAST - Expression class for a unary operator.
129 class UnaryExprAST : public ExprAST {
133 UnaryExprAST(char opcode, ExprAST *operand)
134 : Opcode(opcode), Operand(operand) {}
135 virtual Value *Codegen();
138 /// BinaryExprAST - Expression class for a binary operator.
139 class BinaryExprAST : public ExprAST {
143 BinaryExprAST(char op, ExprAST *lhs, ExprAST *rhs)
144 : Op(op), LHS(lhs), RHS(rhs) {}
145 virtual Value *Codegen();
148 /// CallExprAST - Expression class for function calls.
149 class CallExprAST : public ExprAST {
151 std::vector<ExprAST*> Args;
153 CallExprAST(const std::string &callee, std::vector<ExprAST*> &args)
154 : Callee(callee), Args(args) {}
155 virtual Value *Codegen();
158 /// IfExprAST - Expression class for if/then/else.
159 class IfExprAST : public ExprAST {
160 ExprAST *Cond, *Then, *Else;
162 IfExprAST(ExprAST *cond, ExprAST *then, ExprAST *_else)
163 : Cond(cond), Then(then), Else(_else) {}
164 virtual Value *Codegen();
167 /// ForExprAST - Expression class for for/in.
168 class ForExprAST : public ExprAST {
170 ExprAST *Start, *End, *Step, *Body;
172 ForExprAST(const std::string &varname, ExprAST *start, ExprAST *end,
173 ExprAST *step, ExprAST *body)
174 : VarName(varname), Start(start), End(end), Step(step), Body(body) {}
175 virtual Value *Codegen();
178 /// PrototypeAST - This class represents the "prototype" for a function,
179 /// which captures its name, and its argument names (thus implicitly the number
180 /// of arguments the function takes), as well as if it is an operator.
183 std::vector<std::string> Args;
185 unsigned Precedence; // Precedence if a binary op.
187 PrototypeAST(const std::string &name, const std::vector<std::string> &args,
188 bool isoperator = false, unsigned prec = 0)
189 : Name(name), Args(args), isOperator(isoperator), Precedence(prec) {}
191 bool isUnaryOp() const { return isOperator && Args.size() == 1; }
192 bool isBinaryOp() const { return isOperator && Args.size() == 2; }
194 char getOperatorName() const {
195 assert(isUnaryOp() || isBinaryOp());
196 return Name[Name.size()-1];
199 unsigned getBinaryPrecedence() const { return Precedence; }
204 /// FunctionAST - This class represents a function definition itself.
209 FunctionAST(PrototypeAST *proto, ExprAST *body)
210 : Proto(proto), Body(body) {}
214 } // end anonymous namespace
216 //===----------------------------------------------------------------------===//
218 //===----------------------------------------------------------------------===//
220 /// CurTok/getNextToken - Provide a simple token buffer. CurTok is the current
221 /// token the parser is looking at. getNextToken reads another token from the
222 /// lexer and updates CurTok with its results.
224 static int getNextToken() {
225 return CurTok = gettok();
228 /// BinopPrecedence - This holds the precedence for each binary operator that is
230 static std::map<char, int> BinopPrecedence;
232 /// GetTokPrecedence - Get the precedence of the pending binary operator token.
233 static int GetTokPrecedence() {
234 if (!isascii(CurTok))
237 // Make sure it's a declared binop.
238 int TokPrec = BinopPrecedence[CurTok];
239 if (TokPrec <= 0) return -1;
243 /// Error* - These are little helper functions for error handling.
244 ExprAST *Error(const char *Str) { fprintf(stderr, "Error: %s\n", Str);return 0;}
245 PrototypeAST *ErrorP(const char *Str) { Error(Str); return 0; }
246 FunctionAST *ErrorF(const char *Str) { Error(Str); return 0; }
248 static ExprAST *ParseExpression();
252 /// ::= identifier '(' expression* ')'
253 static ExprAST *ParseIdentifierExpr() {
254 std::string IdName = IdentifierStr;
256 getNextToken(); // eat identifier.
258 if (CurTok != '(') // Simple variable ref.
259 return new VariableExprAST(IdName);
262 getNextToken(); // eat (
263 std::vector<ExprAST*> Args;
266 ExprAST *Arg = ParseExpression();
270 if (CurTok == ')') break;
273 return Error("Expected ')' or ',' in argument list");
281 return new CallExprAST(IdName, Args);
284 /// numberexpr ::= number
285 static ExprAST *ParseNumberExpr() {
286 ExprAST *Result = new NumberExprAST(NumVal);
287 getNextToken(); // consume the number
291 /// parenexpr ::= '(' expression ')'
292 static ExprAST *ParseParenExpr() {
293 getNextToken(); // eat (.
294 ExprAST *V = ParseExpression();
298 return Error("expected ')'");
299 getNextToken(); // eat ).
303 /// ifexpr ::= 'if' expression 'then' expression 'else' expression
304 static ExprAST *ParseIfExpr() {
305 getNextToken(); // eat the if.
308 ExprAST *Cond = ParseExpression();
311 if (CurTok != tok_then)
312 return Error("expected then");
313 getNextToken(); // eat the then
315 ExprAST *Then = ParseExpression();
316 if (Then == 0) return 0;
318 if (CurTok != tok_else)
319 return Error("expected else");
323 ExprAST *Else = ParseExpression();
326 return new IfExprAST(Cond, Then, Else);
329 /// forexpr ::= 'for' identifier '=' expr ',' expr (',' expr)? 'in' expression
330 static ExprAST *ParseForExpr() {
331 getNextToken(); // eat the for.
333 if (CurTok != tok_identifier)
334 return Error("expected identifier after for");
336 std::string IdName = IdentifierStr;
337 getNextToken(); // eat identifier.
340 return Error("expected '=' after for");
341 getNextToken(); // eat '='.
344 ExprAST *Start = ParseExpression();
345 if (Start == 0) return 0;
347 return Error("expected ',' after for start value");
350 ExprAST *End = ParseExpression();
351 if (End == 0) return 0;
353 // The step value is optional.
357 Step = ParseExpression();
358 if (Step == 0) return 0;
361 if (CurTok != tok_in)
362 return Error("expected 'in' after for");
363 getNextToken(); // eat 'in'.
365 ExprAST *Body = ParseExpression();
366 if (Body == 0) return 0;
368 return new ForExprAST(IdName, Start, End, Step, Body);
372 /// ::= identifierexpr
377 static ExprAST *ParsePrimary() {
379 default: return Error("unknown token when expecting an expression");
380 case tok_identifier: return ParseIdentifierExpr();
381 case tok_number: return ParseNumberExpr();
382 case '(': return ParseParenExpr();
383 case tok_if: return ParseIfExpr();
384 case tok_for: return ParseForExpr();
391 static ExprAST *ParseUnary() {
392 // If the current token is not an operator, it must be a primary expr.
393 if (!isascii(CurTok) || CurTok == '(' || CurTok == ',')
394 return ParsePrimary();
396 // If this is a unary operator, read it.
399 if (ExprAST *Operand = ParseUnary())
400 return new UnaryExprAST(Opc, Operand);
406 static ExprAST *ParseBinOpRHS(int ExprPrec, ExprAST *LHS) {
407 // If this is a binop, find its precedence.
409 int TokPrec = GetTokPrecedence();
411 // If this is a binop that binds at least as tightly as the current binop,
412 // consume it, otherwise we are done.
413 if (TokPrec < ExprPrec)
416 // Okay, we know this is a binop.
418 getNextToken(); // eat binop
420 // Parse the unary expression after the binary operator.
421 ExprAST *RHS = ParseUnary();
424 // If BinOp binds less tightly with RHS than the operator after RHS, let
425 // the pending operator take RHS as its LHS.
426 int NextPrec = GetTokPrecedence();
427 if (TokPrec < NextPrec) {
428 RHS = ParseBinOpRHS(TokPrec+1, RHS);
429 if (RHS == 0) return 0;
433 LHS = new BinaryExprAST(BinOp, LHS, RHS);
438 /// ::= unary binoprhs
440 static ExprAST *ParseExpression() {
441 ExprAST *LHS = ParseUnary();
444 return ParseBinOpRHS(0, LHS);
448 /// ::= id '(' id* ')'
449 /// ::= binary LETTER number? (id, id)
450 /// ::= unary LETTER (id)
451 static PrototypeAST *ParsePrototype() {
454 unsigned Kind = 0; // 0 = identifier, 1 = unary, 2 = binary.
455 unsigned BinaryPrecedence = 30;
459 return ErrorP("Expected function name in prototype");
461 FnName = IdentifierStr;
467 if (!isascii(CurTok))
468 return ErrorP("Expected unary operator");
470 FnName += (char)CurTok;
476 if (!isascii(CurTok))
477 return ErrorP("Expected binary operator");
479 FnName += (char)CurTok;
483 // Read the precedence if present.
484 if (CurTok == tok_number) {
485 if (NumVal < 1 || NumVal > 100)
486 return ErrorP("Invalid precedecnce: must be 1..100");
487 BinaryPrecedence = (unsigned)NumVal;
494 return ErrorP("Expected '(' in prototype");
496 std::vector<std::string> ArgNames;
497 while (getNextToken() == tok_identifier)
498 ArgNames.push_back(IdentifierStr);
500 return ErrorP("Expected ')' in prototype");
503 getNextToken(); // eat ')'.
505 // Verify right number of names for operator.
506 if (Kind && ArgNames.size() != Kind)
507 return ErrorP("Invalid number of operands for operator");
509 return new PrototypeAST(FnName, ArgNames, Kind != 0, BinaryPrecedence);
512 /// definition ::= 'def' prototype expression
513 static FunctionAST *ParseDefinition() {
514 getNextToken(); // eat def.
515 PrototypeAST *Proto = ParsePrototype();
516 if (Proto == 0) return 0;
518 if (ExprAST *E = ParseExpression())
519 return new FunctionAST(Proto, E);
523 /// toplevelexpr ::= expression
524 static FunctionAST *ParseTopLevelExpr() {
525 if (ExprAST *E = ParseExpression()) {
526 // Make an anonymous proto.
527 PrototypeAST *Proto = new PrototypeAST("", std::vector<std::string>());
528 return new FunctionAST(Proto, E);
533 /// external ::= 'extern' prototype
534 static PrototypeAST *ParseExtern() {
535 getNextToken(); // eat extern.
536 return ParsePrototype();
539 //===----------------------------------------------------------------------===//
541 //===----------------------------------------------------------------------===//
543 static Module *TheModule;
544 static IRBuilder<> Builder(getGlobalContext());
545 static std::map<std::string, Value*> NamedValues;
546 static FunctionPassManager *TheFPM;
548 Value *ErrorV(const char *Str) { Error(Str); return 0; }
550 Value *NumberExprAST::Codegen() {
551 return ConstantFP::get(getGlobalContext(), APFloat(Val));
554 Value *VariableExprAST::Codegen() {
555 // Look this variable up in the function.
556 Value *V = NamedValues[Name];
557 return V ? V : ErrorV("Unknown variable name");
560 Value *UnaryExprAST::Codegen() {
561 Value *OperandV = Operand->Codegen();
562 if (OperandV == 0) return 0;
564 Function *F = TheModule->getFunction(std::string("unary")+Opcode);
566 return ErrorV("Unknown unary operator");
568 return Builder.CreateCall(F, OperandV, "unop");
571 Value *BinaryExprAST::Codegen() {
572 Value *L = LHS->Codegen();
573 Value *R = RHS->Codegen();
574 if (L == 0 || R == 0) return 0;
577 case '+': return Builder.CreateFAdd(L, R, "addtmp");
578 case '-': return Builder.CreateFSub(L, R, "subtmp");
579 case '*': return Builder.CreateFMul(L, R, "multmp");
581 L = Builder.CreateFCmpULT(L, R, "cmptmp");
582 // Convert bool 0/1 to double 0.0 or 1.0
583 return Builder.CreateUIToFP(L, Type::getDoubleTy(getGlobalContext()),
588 // If it wasn't a builtin binary operator, it must be a user defined one. Emit
590 Function *F = TheModule->getFunction(std::string("binary")+Op);
591 assert(F && "binary operator not found!");
593 Value *Ops[] = { L, R };
594 return Builder.CreateCall(F, Ops, "binop");
597 Value *CallExprAST::Codegen() {
598 // Look up the name in the global module table.
599 Function *CalleeF = TheModule->getFunction(Callee);
601 return ErrorV("Unknown function referenced");
603 // If argument mismatch error.
604 if (CalleeF->arg_size() != Args.size())
605 return ErrorV("Incorrect # arguments passed");
607 std::vector<Value*> ArgsV;
608 for (unsigned i = 0, e = Args.size(); i != e; ++i) {
609 ArgsV.push_back(Args[i]->Codegen());
610 if (ArgsV.back() == 0) return 0;
613 return Builder.CreateCall(CalleeF, ArgsV, "calltmp");
616 Value *IfExprAST::Codegen() {
617 Value *CondV = Cond->Codegen();
618 if (CondV == 0) return 0;
620 // Convert condition to a bool by comparing equal to 0.0.
621 CondV = Builder.CreateFCmpONE(CondV,
622 ConstantFP::get(getGlobalContext(), APFloat(0.0)),
625 Function *TheFunction = Builder.GetInsertBlock()->getParent();
627 // Create blocks for the then and else cases. Insert the 'then' block at the
628 // end of the function.
629 BasicBlock *ThenBB = BasicBlock::Create(getGlobalContext(), "then", TheFunction);
630 BasicBlock *ElseBB = BasicBlock::Create(getGlobalContext(), "else");
631 BasicBlock *MergeBB = BasicBlock::Create(getGlobalContext(), "ifcont");
633 Builder.CreateCondBr(CondV, ThenBB, ElseBB);
636 Builder.SetInsertPoint(ThenBB);
638 Value *ThenV = Then->Codegen();
639 if (ThenV == 0) return 0;
641 Builder.CreateBr(MergeBB);
642 // Codegen of 'Then' can change the current block, update ThenBB for the PHI.
643 ThenBB = Builder.GetInsertBlock();
646 TheFunction->getBasicBlockList().push_back(ElseBB);
647 Builder.SetInsertPoint(ElseBB);
649 Value *ElseV = Else->Codegen();
650 if (ElseV == 0) return 0;
652 Builder.CreateBr(MergeBB);
653 // Codegen of 'Else' can change the current block, update ElseBB for the PHI.
654 ElseBB = Builder.GetInsertBlock();
657 TheFunction->getBasicBlockList().push_back(MergeBB);
658 Builder.SetInsertPoint(MergeBB);
659 PHINode *PN = Builder.CreatePHI(Type::getDoubleTy(getGlobalContext()), 2,
662 PN->addIncoming(ThenV, ThenBB);
663 PN->addIncoming(ElseV, ElseBB);
667 Value *ForExprAST::Codegen() {
673 // variable = phi [start, loopheader], [nextvariable, loopend]
679 // nextvariable = variable + step
681 // br endcond, loop, endloop
684 // Emit the start code first, without 'variable' in scope.
685 Value *StartVal = Start->Codegen();
686 if (StartVal == 0) return 0;
688 // Make the new basic block for the loop header, inserting after current
690 Function *TheFunction = Builder.GetInsertBlock()->getParent();
691 BasicBlock *PreheaderBB = Builder.GetInsertBlock();
692 BasicBlock *LoopBB = BasicBlock::Create(getGlobalContext(), "loop", TheFunction);
694 // Insert an explicit fall through from the current block to the LoopBB.
695 Builder.CreateBr(LoopBB);
697 // Start insertion in LoopBB.
698 Builder.SetInsertPoint(LoopBB);
700 // Start the PHI node with an entry for Start.
701 PHINode *Variable = Builder.CreatePHI(Type::getDoubleTy(getGlobalContext()), 2, VarName.c_str());
702 Variable->addIncoming(StartVal, PreheaderBB);
704 // Within the loop, the variable is defined equal to the PHI node. If it
705 // shadows an existing variable, we have to restore it, so save it now.
706 Value *OldVal = NamedValues[VarName];
707 NamedValues[VarName] = Variable;
709 // Emit the body of the loop. This, like any other expr, can change the
710 // current BB. Note that we ignore the value computed by the body, but don't
712 if (Body->Codegen() == 0)
715 // Emit the step value.
718 StepVal = Step->Codegen();
719 if (StepVal == 0) return 0;
721 // If not specified, use 1.0.
722 StepVal = ConstantFP::get(getGlobalContext(), APFloat(1.0));
725 Value *NextVar = Builder.CreateFAdd(Variable, StepVal, "nextvar");
727 // Compute the end condition.
728 Value *EndCond = End->Codegen();
729 if (EndCond == 0) return EndCond;
731 // Convert condition to a bool by comparing equal to 0.0.
732 EndCond = Builder.CreateFCmpONE(EndCond,
733 ConstantFP::get(getGlobalContext(), APFloat(0.0)),
736 // Create the "after loop" block and insert it.
737 BasicBlock *LoopEndBB = Builder.GetInsertBlock();
738 BasicBlock *AfterBB = BasicBlock::Create(getGlobalContext(), "afterloop", TheFunction);
740 // Insert the conditional branch into the end of LoopEndBB.
741 Builder.CreateCondBr(EndCond, LoopBB, AfterBB);
743 // Any new code will be inserted in AfterBB.
744 Builder.SetInsertPoint(AfterBB);
746 // Add a new entry to the PHI node for the backedge.
747 Variable->addIncoming(NextVar, LoopEndBB);
749 // Restore the unshadowed variable.
751 NamedValues[VarName] = OldVal;
753 NamedValues.erase(VarName);
756 // for expr always returns 0.0.
757 return Constant::getNullValue(Type::getDoubleTy(getGlobalContext()));
760 Function *PrototypeAST::Codegen() {
761 // Make the function type: double(double,double) etc.
762 std::vector<Type*> Doubles(Args.size(),
763 Type::getDoubleTy(getGlobalContext()));
764 FunctionType *FT = FunctionType::get(Type::getDoubleTy(getGlobalContext()),
767 Function *F = Function::Create(FT, Function::ExternalLinkage, Name, TheModule);
769 // If F conflicted, there was already something named 'Name'. If it has a
770 // body, don't allow redefinition or reextern.
771 if (F->getName() != Name) {
772 // Delete the one we just made and get the existing one.
773 F->eraseFromParent();
774 F = TheModule->getFunction(Name);
776 // If F already has a body, reject this.
778 ErrorF("redefinition of function");
782 // If F took a different number of args, reject.
783 if (F->arg_size() != Args.size()) {
784 ErrorF("redefinition of function with different # args");
789 // Set names for all arguments.
791 for (Function::arg_iterator AI = F->arg_begin(); Idx != Args.size();
793 AI->setName(Args[Idx]);
795 // Add arguments to variable symbol table.
796 NamedValues[Args[Idx]] = AI;
802 Function *FunctionAST::Codegen() {
805 Function *TheFunction = Proto->Codegen();
806 if (TheFunction == 0)
809 // If this is an operator, install it.
810 if (Proto->isBinaryOp())
811 BinopPrecedence[Proto->getOperatorName()] = Proto->getBinaryPrecedence();
813 // Create a new basic block to start insertion into.
814 BasicBlock *BB = BasicBlock::Create(getGlobalContext(), "entry", TheFunction);
815 Builder.SetInsertPoint(BB);
817 if (Value *RetVal = Body->Codegen()) {
818 // Finish off the function.
819 Builder.CreateRet(RetVal);
821 // Validate the generated code, checking for consistency.
822 verifyFunction(*TheFunction);
824 // Optimize the function.
825 TheFPM->run(*TheFunction);
830 // Error reading body, remove function.
831 TheFunction->eraseFromParent();
833 if (Proto->isBinaryOp())
834 BinopPrecedence.erase(Proto->getOperatorName());
838 //===----------------------------------------------------------------------===//
839 // Top-Level parsing and JIT Driver
840 //===----------------------------------------------------------------------===//
842 static ExecutionEngine *TheExecutionEngine;
844 static void HandleDefinition() {
845 if (FunctionAST *F = ParseDefinition()) {
846 if (Function *LF = F->Codegen()) {
847 fprintf(stderr, "Read function definition:");
851 // Skip token for error recovery.
856 static void HandleExtern() {
857 if (PrototypeAST *P = ParseExtern()) {
858 if (Function *F = P->Codegen()) {
859 fprintf(stderr, "Read extern: ");
863 // Skip token for error recovery.
868 static void HandleTopLevelExpression() {
869 // Evaluate a top-level expression into an anonymous function.
870 if (FunctionAST *F = ParseTopLevelExpr()) {
871 if (Function *LF = F->Codegen()) {
872 // JIT the function, returning a function pointer.
873 void *FPtr = TheExecutionEngine->getPointerToFunction(LF);
875 // Cast it to the right type (takes no arguments, returns a double) so we
876 // can call it as a native function.
877 double (*FP)() = (double (*)())(intptr_t)FPtr;
878 fprintf(stderr, "Evaluated to %f\n", FP());
881 // Skip token for error recovery.
886 /// top ::= definition | external | expression | ';'
887 static void MainLoop() {
889 fprintf(stderr, "ready> ");
891 case tok_eof: return;
892 case ';': getNextToken(); break; // ignore top-level semicolons.
893 case tok_def: HandleDefinition(); break;
894 case tok_extern: HandleExtern(); break;
895 default: HandleTopLevelExpression(); break;
900 //===----------------------------------------------------------------------===//
901 // "Library" functions that can be "extern'd" from user code.
902 //===----------------------------------------------------------------------===//
904 /// putchard - putchar that takes a double and returns 0.
906 double putchard(double X) {
911 /// printd - printf that takes a double prints it as "%f\n", returning 0.
913 double printd(double X) {
918 //===----------------------------------------------------------------------===//
920 //===----------------------------------------------------------------------===//
923 InitializeNativeTarget();
924 LLVMContext &Context = getGlobalContext();
926 // Install standard binary operators.
927 // 1 is lowest precedence.
928 BinopPrecedence['<'] = 10;
929 BinopPrecedence['+'] = 20;
930 BinopPrecedence['-'] = 20;
931 BinopPrecedence['*'] = 40; // highest.
933 // Prime the first token.
934 fprintf(stderr, "ready> ");
937 // Make the module, which holds all the code.
938 TheModule = new Module("my cool jit", Context);
940 // Create the JIT. This takes ownership of the module.
942 TheExecutionEngine = EngineBuilder(TheModule).setErrorStr(&ErrStr).create();
943 if (!TheExecutionEngine) {
944 fprintf(stderr, "Could not create ExecutionEngine: %s\n", ErrStr.c_str());
948 FunctionPassManager OurFPM(TheModule);
950 // Set up the optimizer pipeline. Start with registering info about how the
951 // target lays out data structures.
952 OurFPM.add(new DataLayout(*TheExecutionEngine->getDataLayout()));
953 // Provide basic AliasAnalysis support for GVN.
954 OurFPM.add(createBasicAliasAnalysisPass());
955 // Do simple "peephole" optimizations and bit-twiddling optzns.
956 OurFPM.add(createInstructionCombiningPass());
957 // Reassociate expressions.
958 OurFPM.add(createReassociatePass());
959 // Eliminate Common SubExpressions.
960 OurFPM.add(createGVNPass());
961 // Simplify the control flow graph (deleting unreachable blocks, etc).
962 OurFPM.add(createCFGSimplificationPass());
964 OurFPM.doInitialization();
966 // Set the global so the code gen can use this.
969 // Run the main "interpreter loop" now.
974 // Print out all of the generated code.