1 //===-- CBackend.cpp - Library for converting LLVM code to C --------------===//
3 // The LLVM Compiler Infrastructure
5 // This file was developed by the LLVM research group and is distributed under
6 // the University of Illinois Open Source License. See LICENSE.TXT for details.
8 //===----------------------------------------------------------------------===//
10 // This library converts LLVM code to C code, compilable by GCC and other C
13 //===----------------------------------------------------------------------===//
15 #include "CTargetMachine.h"
16 #include "llvm/CallingConv.h"
17 #include "llvm/Constants.h"
18 #include "llvm/DerivedTypes.h"
19 #include "llvm/Module.h"
20 #include "llvm/Instructions.h"
21 #include "llvm/ParameterAttributes.h"
22 #include "llvm/Pass.h"
23 #include "llvm/PassManager.h"
24 #include "llvm/TypeSymbolTable.h"
25 #include "llvm/Intrinsics.h"
26 #include "llvm/IntrinsicInst.h"
27 #include "llvm/InlineAsm.h"
28 #include "llvm/Analysis/ConstantsScanner.h"
29 #include "llvm/Analysis/FindUsedTypes.h"
30 #include "llvm/Analysis/LoopInfo.h"
31 #include "llvm/CodeGen/IntrinsicLowering.h"
32 #include "llvm/Transforms/Scalar.h"
33 #include "llvm/Target/TargetMachineRegistry.h"
34 #include "llvm/Target/TargetAsmInfo.h"
35 #include "llvm/Target/TargetData.h"
36 #include "llvm/Support/CallSite.h"
37 #include "llvm/Support/CFG.h"
38 #include "llvm/Support/GetElementPtrTypeIterator.h"
39 #include "llvm/Support/InstVisitor.h"
40 #include "llvm/Support/Mangler.h"
41 #include "llvm/Support/MathExtras.h"
42 #include "llvm/ADT/StringExtras.h"
43 #include "llvm/ADT/STLExtras.h"
44 #include "llvm/Support/MathExtras.h"
45 #include "llvm/Config/config.h"
51 // Register the target.
52 RegisterTarget<CTargetMachine> X("c", " C backend");
54 /// CBackendNameAllUsedStructsAndMergeFunctions - This pass inserts names for
55 /// any unnamed structure types that are used by the program, and merges
56 /// external functions with the same name.
58 class CBackendNameAllUsedStructsAndMergeFunctions : public ModulePass {
61 CBackendNameAllUsedStructsAndMergeFunctions()
62 : ModulePass((intptr_t)&ID) {}
63 void getAnalysisUsage(AnalysisUsage &AU) const {
64 AU.addRequired<FindUsedTypes>();
67 virtual const char *getPassName() const {
68 return "C backend type canonicalizer";
71 virtual bool runOnModule(Module &M);
74 char CBackendNameAllUsedStructsAndMergeFunctions::ID = 0;
76 /// CWriter - This class is the main chunk of code that converts an LLVM
77 /// module to a C translation unit.
78 class CWriter : public FunctionPass, public InstVisitor<CWriter> {
80 IntrinsicLowering *IL;
83 const Module *TheModule;
84 const TargetAsmInfo* TAsm;
86 std::map<const Type *, std::string> TypeNames;
87 std::map<const ConstantFP *, unsigned> FPConstantMap;
88 std::set<Function*> intrinsicPrototypesAlreadyGenerated;
92 CWriter(std::ostream &o)
93 : FunctionPass((intptr_t)&ID), Out(o), IL(0), Mang(0), LI(0),
94 TheModule(0), TAsm(0), TD(0) {}
96 virtual const char *getPassName() const { return "C backend"; }
98 void getAnalysisUsage(AnalysisUsage &AU) const {
99 AU.addRequired<LoopInfo>();
100 AU.setPreservesAll();
103 virtual bool doInitialization(Module &M);
105 bool runOnFunction(Function &F) {
106 LI = &getAnalysis<LoopInfo>();
108 // Get rid of intrinsics we can't handle.
111 // Output all floating point constants that cannot be printed accurately.
112 printFloatingPointConstants(F);
115 FPConstantMap.clear();
119 virtual bool doFinalization(Module &M) {
126 std::ostream &printType(std::ostream &Out, const Type *Ty,
127 bool isSigned = false,
128 const std::string &VariableName = "",
129 bool IgnoreName = false);
130 std::ostream &printSimpleType(std::ostream &Out, const Type *Ty,
132 const std::string &NameSoFar = "");
134 void printStructReturnPointerFunctionType(std::ostream &Out,
135 const PointerType *Ty);
137 void writeOperand(Value *Operand);
138 void writeOperandRaw(Value *Operand);
139 void writeOperandInternal(Value *Operand);
140 void writeOperandWithCast(Value* Operand, unsigned Opcode);
141 void writeOperandWithCast(Value* Operand, ICmpInst::Predicate predicate);
142 bool writeInstructionCast(const Instruction &I);
145 std::string InterpretASMConstraint(InlineAsm::ConstraintInfo& c);
147 void lowerIntrinsics(Function &F);
149 void printModule(Module *M);
150 void printModuleTypes(const TypeSymbolTable &ST);
151 void printContainedStructs(const Type *Ty, std::set<const StructType *> &);
152 void printFloatingPointConstants(Function &F);
153 void printFunctionSignature(const Function *F, bool Prototype);
155 void printFunction(Function &);
156 void printBasicBlock(BasicBlock *BB);
157 void printLoop(Loop *L);
159 void printCast(unsigned opcode, const Type *SrcTy, const Type *DstTy);
160 void printConstant(Constant *CPV);
161 void printConstantWithCast(Constant *CPV, unsigned Opcode);
162 bool printConstExprCast(const ConstantExpr *CE);
163 void printConstantArray(ConstantArray *CPA);
164 void printConstantVector(ConstantVector *CP);
166 // isInlinableInst - Attempt to inline instructions into their uses to build
167 // trees as much as possible. To do this, we have to consistently decide
168 // what is acceptable to inline, so that variable declarations don't get
169 // printed and an extra copy of the expr is not emitted.
171 static bool isInlinableInst(const Instruction &I) {
172 // Always inline cmp instructions, even if they are shared by multiple
173 // expressions. GCC generates horrible code if we don't.
177 // Must be an expression, must be used exactly once. If it is dead, we
178 // emit it inline where it would go.
179 if (I.getType() == Type::VoidTy || !I.hasOneUse() ||
180 isa<TerminatorInst>(I) || isa<CallInst>(I) || isa<PHINode>(I) ||
181 isa<LoadInst>(I) || isa<VAArgInst>(I))
182 // Don't inline a load across a store or other bad things!
185 // Must not be used in inline asm
186 if (I.hasOneUse() && isInlineAsm(*I.use_back())) return false;
188 // Only inline instruction it if it's use is in the same BB as the inst.
189 return I.getParent() == cast<Instruction>(I.use_back())->getParent();
192 // isDirectAlloca - Define fixed sized allocas in the entry block as direct
193 // variables which are accessed with the & operator. This causes GCC to
194 // generate significantly better code than to emit alloca calls directly.
196 static const AllocaInst *isDirectAlloca(const Value *V) {
197 const AllocaInst *AI = dyn_cast<AllocaInst>(V);
198 if (!AI) return false;
199 if (AI->isArrayAllocation())
200 return 0; // FIXME: we can also inline fixed size array allocas!
201 if (AI->getParent() != &AI->getParent()->getParent()->getEntryBlock())
206 // isInlineAsm - Check if the instruction is a call to an inline asm chunk
207 static bool isInlineAsm(const Instruction& I) {
208 if (isa<CallInst>(&I) && isa<InlineAsm>(I.getOperand(0)))
213 // Instruction visitation functions
214 friend class InstVisitor<CWriter>;
216 void visitReturnInst(ReturnInst &I);
217 void visitBranchInst(BranchInst &I);
218 void visitSwitchInst(SwitchInst &I);
219 void visitInvokeInst(InvokeInst &I) {
220 assert(0 && "Lowerinvoke pass didn't work!");
223 void visitUnwindInst(UnwindInst &I) {
224 assert(0 && "Lowerinvoke pass didn't work!");
226 void visitUnreachableInst(UnreachableInst &I);
228 void visitPHINode(PHINode &I);
229 void visitBinaryOperator(Instruction &I);
230 void visitICmpInst(ICmpInst &I);
231 void visitFCmpInst(FCmpInst &I);
233 void visitCastInst (CastInst &I);
234 void visitSelectInst(SelectInst &I);
235 void visitCallInst (CallInst &I);
236 void visitInlineAsm(CallInst &I);
238 void visitMallocInst(MallocInst &I);
239 void visitAllocaInst(AllocaInst &I);
240 void visitFreeInst (FreeInst &I);
241 void visitLoadInst (LoadInst &I);
242 void visitStoreInst (StoreInst &I);
243 void visitGetElementPtrInst(GetElementPtrInst &I);
244 void visitVAArgInst (VAArgInst &I);
246 void visitInstruction(Instruction &I) {
247 cerr << "C Writer does not know about " << I;
251 void outputLValue(Instruction *I) {
252 Out << " " << GetValueName(I) << " = ";
255 bool isGotoCodeNecessary(BasicBlock *From, BasicBlock *To);
256 void printPHICopiesForSuccessor(BasicBlock *CurBlock,
257 BasicBlock *Successor, unsigned Indent);
258 void printBranchToBlock(BasicBlock *CurBlock, BasicBlock *SuccBlock,
260 void printIndexingExpression(Value *Ptr, gep_type_iterator I,
261 gep_type_iterator E);
263 std::string GetValueName(const Value *Operand);
267 char CWriter::ID = 0;
269 /// This method inserts names for any unnamed structure types that are used by
270 /// the program, and removes names from structure types that are not used by the
273 bool CBackendNameAllUsedStructsAndMergeFunctions::runOnModule(Module &M) {
274 // Get a set of types that are used by the program...
275 std::set<const Type *> UT = getAnalysis<FindUsedTypes>().getTypes();
277 // Loop over the module symbol table, removing types from UT that are
278 // already named, and removing names for types that are not used.
280 TypeSymbolTable &TST = M.getTypeSymbolTable();
281 for (TypeSymbolTable::iterator TI = TST.begin(), TE = TST.end();
283 TypeSymbolTable::iterator I = TI++;
285 // If this isn't a struct type, remove it from our set of types to name.
286 // This simplifies emission later.
287 if (!isa<StructType>(I->second) && !isa<OpaqueType>(I->second)) {
290 // If this is not used, remove it from the symbol table.
291 std::set<const Type *>::iterator UTI = UT.find(I->second);
295 UT.erase(UTI); // Only keep one name for this type.
299 // UT now contains types that are not named. Loop over it, naming
302 bool Changed = false;
303 unsigned RenameCounter = 0;
304 for (std::set<const Type *>::const_iterator I = UT.begin(), E = UT.end();
306 if (const StructType *ST = dyn_cast<StructType>(*I)) {
307 while (M.addTypeName("unnamed"+utostr(RenameCounter), ST))
313 // Loop over all external functions and globals. If we have two with
314 // identical names, merge them.
315 // FIXME: This code should disappear when we don't allow values with the same
316 // names when they have different types!
317 std::map<std::string, GlobalValue*> ExtSymbols;
318 for (Module::iterator I = M.begin(), E = M.end(); I != E;) {
320 if (GV->isDeclaration() && GV->hasName()) {
321 std::pair<std::map<std::string, GlobalValue*>::iterator, bool> X
322 = ExtSymbols.insert(std::make_pair(GV->getName(), GV));
324 // Found a conflict, replace this global with the previous one.
325 GlobalValue *OldGV = X.first->second;
326 GV->replaceAllUsesWith(ConstantExpr::getBitCast(OldGV, GV->getType()));
327 GV->eraseFromParent();
332 // Do the same for globals.
333 for (Module::global_iterator I = M.global_begin(), E = M.global_end();
335 GlobalVariable *GV = I++;
336 if (GV->isDeclaration() && GV->hasName()) {
337 std::pair<std::map<std::string, GlobalValue*>::iterator, bool> X
338 = ExtSymbols.insert(std::make_pair(GV->getName(), GV));
340 // Found a conflict, replace this global with the previous one.
341 GlobalValue *OldGV = X.first->second;
342 GV->replaceAllUsesWith(ConstantExpr::getBitCast(OldGV, GV->getType()));
343 GV->eraseFromParent();
352 /// printStructReturnPointerFunctionType - This is like printType for a struct
353 /// return type, except, instead of printing the type as void (*)(Struct*, ...)
354 /// print it as "Struct (*)(...)", for struct return functions.
355 void CWriter::printStructReturnPointerFunctionType(std::ostream &Out,
356 const PointerType *TheTy) {
357 const FunctionType *FTy = cast<FunctionType>(TheTy->getElementType());
358 std::stringstream FunctionInnards;
359 FunctionInnards << " (*) (";
360 bool PrintedType = false;
362 FunctionType::param_iterator I = FTy->param_begin(), E = FTy->param_end();
363 const Type *RetTy = cast<PointerType>(I->get())->getElementType();
365 const ParamAttrsList *Attrs = FTy->getParamAttrs();
366 for (++I; I != E; ++I) {
368 FunctionInnards << ", ";
369 printType(FunctionInnards, *I,
370 /*isSigned=*/Attrs && Attrs->paramHasAttr(Idx, ParamAttr::SExt), "");
373 if (FTy->isVarArg()) {
375 FunctionInnards << ", ...";
376 } else if (!PrintedType) {
377 FunctionInnards << "void";
379 FunctionInnards << ')';
380 std::string tstr = FunctionInnards.str();
381 printType(Out, RetTy,
382 /*isSigned=*/Attrs && Attrs->paramHasAttr(0, ParamAttr::SExt), tstr);
386 CWriter::printSimpleType(std::ostream &Out, const Type *Ty, bool isSigned,
387 const std::string &NameSoFar) {
388 assert((Ty->isPrimitiveType() || Ty->isInteger()) &&
389 "Invalid type for printSimpleType");
390 switch (Ty->getTypeID()) {
391 case Type::VoidTyID: return Out << "void " << NameSoFar;
392 case Type::IntegerTyID: {
393 unsigned NumBits = cast<IntegerType>(Ty)->getBitWidth();
395 return Out << "bool " << NameSoFar;
396 else if (NumBits <= 8)
397 return Out << (isSigned?"signed":"unsigned") << " char " << NameSoFar;
398 else if (NumBits <= 16)
399 return Out << (isSigned?"signed":"unsigned") << " short " << NameSoFar;
400 else if (NumBits <= 32)
401 return Out << (isSigned?"signed":"unsigned") << " int " << NameSoFar;
403 assert(NumBits <= 64 && "Bit widths > 64 not implemented yet");
404 return Out << (isSigned?"signed":"unsigned") << " long long "<< NameSoFar;
407 case Type::FloatTyID: return Out << "float " << NameSoFar;
408 case Type::DoubleTyID: return Out << "double " << NameSoFar;
410 cerr << "Unknown primitive type: " << *Ty << "\n";
415 // Pass the Type* and the variable name and this prints out the variable
418 std::ostream &CWriter::printType(std::ostream &Out, const Type *Ty,
419 bool isSigned, const std::string &NameSoFar,
421 if (Ty->isPrimitiveType() || Ty->isInteger()) {
422 printSimpleType(Out, Ty, isSigned, NameSoFar);
426 // Check to see if the type is named.
427 if (!IgnoreName || isa<OpaqueType>(Ty)) {
428 std::map<const Type *, std::string>::iterator I = TypeNames.find(Ty);
429 if (I != TypeNames.end()) return Out << I->second << ' ' << NameSoFar;
432 switch (Ty->getTypeID()) {
433 case Type::FunctionTyID: {
434 const FunctionType *FTy = cast<FunctionType>(Ty);
435 std::stringstream FunctionInnards;
436 FunctionInnards << " (" << NameSoFar << ") (";
437 const ParamAttrsList *Attrs = FTy->getParamAttrs();
439 for (FunctionType::param_iterator I = FTy->param_begin(),
440 E = FTy->param_end(); I != E; ++I) {
441 if (I != FTy->param_begin())
442 FunctionInnards << ", ";
443 printType(FunctionInnards, *I,
444 /*isSigned=*/Attrs && Attrs->paramHasAttr(Idx, ParamAttr::SExt), "");
447 if (FTy->isVarArg()) {
448 if (FTy->getNumParams())
449 FunctionInnards << ", ...";
450 } else if (!FTy->getNumParams()) {
451 FunctionInnards << "void";
453 FunctionInnards << ')';
454 std::string tstr = FunctionInnards.str();
455 printType(Out, FTy->getReturnType(),
456 /*isSigned=*/Attrs && Attrs->paramHasAttr(0, ParamAttr::SExt), tstr);
459 case Type::StructTyID: {
460 const StructType *STy = cast<StructType>(Ty);
461 Out << NameSoFar + " {\n";
463 for (StructType::element_iterator I = STy->element_begin(),
464 E = STy->element_end(); I != E; ++I) {
466 printType(Out, *I, false, "field" + utostr(Idx++));
471 Out << " __attribute__ ((packed))";
475 case Type::PointerTyID: {
476 const PointerType *PTy = cast<PointerType>(Ty);
477 std::string ptrName = "*" + NameSoFar;
479 if (isa<ArrayType>(PTy->getElementType()) ||
480 isa<VectorType>(PTy->getElementType()))
481 ptrName = "(" + ptrName + ")";
483 return printType(Out, PTy->getElementType(), false, ptrName);
486 case Type::ArrayTyID: {
487 const ArrayType *ATy = cast<ArrayType>(Ty);
488 unsigned NumElements = ATy->getNumElements();
489 if (NumElements == 0) NumElements = 1;
490 return printType(Out, ATy->getElementType(), false,
491 NameSoFar + "[" + utostr(NumElements) + "]");
494 case Type::VectorTyID: {
495 const VectorType *PTy = cast<VectorType>(Ty);
496 unsigned NumElements = PTy->getNumElements();
497 if (NumElements == 0) NumElements = 1;
498 return printType(Out, PTy->getElementType(), false,
499 NameSoFar + "[" + utostr(NumElements) + "]");
502 case Type::OpaqueTyID: {
503 static int Count = 0;
504 std::string TyName = "struct opaque_" + itostr(Count++);
505 assert(TypeNames.find(Ty) == TypeNames.end());
506 TypeNames[Ty] = TyName;
507 return Out << TyName << ' ' << NameSoFar;
510 assert(0 && "Unhandled case in getTypeProps!");
517 void CWriter::printConstantArray(ConstantArray *CPA) {
519 // As a special case, print the array as a string if it is an array of
520 // ubytes or an array of sbytes with positive values.
522 const Type *ETy = CPA->getType()->getElementType();
523 bool isString = (ETy == Type::Int8Ty || ETy == Type::Int8Ty);
525 // Make sure the last character is a null char, as automatically added by C
526 if (isString && (CPA->getNumOperands() == 0 ||
527 !cast<Constant>(*(CPA->op_end()-1))->isNullValue()))
532 // Keep track of whether the last number was a hexadecimal escape
533 bool LastWasHex = false;
535 // Do not include the last character, which we know is null
536 for (unsigned i = 0, e = CPA->getNumOperands()-1; i != e; ++i) {
537 unsigned char C = cast<ConstantInt>(CPA->getOperand(i))->getZExtValue();
539 // Print it out literally if it is a printable character. The only thing
540 // to be careful about is when the last letter output was a hex escape
541 // code, in which case we have to be careful not to print out hex digits
542 // explicitly (the C compiler thinks it is a continuation of the previous
543 // character, sheesh...)
545 if (isprint(C) && (!LastWasHex || !isxdigit(C))) {
547 if (C == '"' || C == '\\')
554 case '\n': Out << "\\n"; break;
555 case '\t': Out << "\\t"; break;
556 case '\r': Out << "\\r"; break;
557 case '\v': Out << "\\v"; break;
558 case '\a': Out << "\\a"; break;
559 case '\"': Out << "\\\""; break;
560 case '\'': Out << "\\\'"; break;
563 Out << (char)(( C/16 < 10) ? ( C/16 +'0') : ( C/16 -10+'A'));
564 Out << (char)(((C&15) < 10) ? ((C&15)+'0') : ((C&15)-10+'A'));
573 if (CPA->getNumOperands()) {
575 printConstant(cast<Constant>(CPA->getOperand(0)));
576 for (unsigned i = 1, e = CPA->getNumOperands(); i != e; ++i) {
578 printConstant(cast<Constant>(CPA->getOperand(i)));
585 void CWriter::printConstantVector(ConstantVector *CP) {
587 if (CP->getNumOperands()) {
589 printConstant(cast<Constant>(CP->getOperand(0)));
590 for (unsigned i = 1, e = CP->getNumOperands(); i != e; ++i) {
592 printConstant(cast<Constant>(CP->getOperand(i)));
598 // isFPCSafeToPrint - Returns true if we may assume that CFP may be written out
599 // textually as a double (rather than as a reference to a stack-allocated
600 // variable). We decide this by converting CFP to a string and back into a
601 // double, and then checking whether the conversion results in a bit-equal
602 // double to the original value of CFP. This depends on us and the target C
603 // compiler agreeing on the conversion process (which is pretty likely since we
604 // only deal in IEEE FP).
606 static bool isFPCSafeToPrint(const ConstantFP *CFP) {
607 // Do long doubles the hard way for now.
608 if (CFP->getType()!=Type::FloatTy && CFP->getType()!=Type::DoubleTy)
610 APFloat APF = APFloat(CFP->getValueAPF()); // copy
611 if (CFP->getType()==Type::FloatTy)
612 APF.convert(APFloat::IEEEdouble, APFloat::rmNearestTiesToEven);
613 #if HAVE_PRINTF_A && ENABLE_CBE_PRINTF_A
615 sprintf(Buffer, "%a", APF.convertToDouble());
616 if (!strncmp(Buffer, "0x", 2) ||
617 !strncmp(Buffer, "-0x", 3) ||
618 !strncmp(Buffer, "+0x", 3))
619 return APF.bitwiseIsEqual(APFloat(atof(Buffer)));
622 std::string StrVal = ftostr(APF);
624 while (StrVal[0] == ' ')
625 StrVal.erase(StrVal.begin());
627 // Check to make sure that the stringized number is not some string like "Inf"
628 // or NaN. Check that the string matches the "[-+]?[0-9]" regex.
629 if ((StrVal[0] >= '0' && StrVal[0] <= '9') ||
630 ((StrVal[0] == '-' || StrVal[0] == '+') &&
631 (StrVal[1] >= '0' && StrVal[1] <= '9')))
632 // Reparse stringized version!
633 return APF.bitwiseIsEqual(APFloat(atof(StrVal.c_str())));
638 /// Print out the casting for a cast operation. This does the double casting
639 /// necessary for conversion to the destination type, if necessary.
640 /// @brief Print a cast
641 void CWriter::printCast(unsigned opc, const Type *SrcTy, const Type *DstTy) {
642 // Print the destination type cast
644 case Instruction::UIToFP:
645 case Instruction::SIToFP:
646 case Instruction::IntToPtr:
647 case Instruction::Trunc:
648 case Instruction::BitCast:
649 case Instruction::FPExt:
650 case Instruction::FPTrunc: // For these the DstTy sign doesn't matter
652 printType(Out, DstTy);
655 case Instruction::ZExt:
656 case Instruction::PtrToInt:
657 case Instruction::FPToUI: // For these, make sure we get an unsigned dest
659 printSimpleType(Out, DstTy, false);
662 case Instruction::SExt:
663 case Instruction::FPToSI: // For these, make sure we get a signed dest
665 printSimpleType(Out, DstTy, true);
669 assert(0 && "Invalid cast opcode");
672 // Print the source type cast
674 case Instruction::UIToFP:
675 case Instruction::ZExt:
677 printSimpleType(Out, SrcTy, false);
680 case Instruction::SIToFP:
681 case Instruction::SExt:
683 printSimpleType(Out, SrcTy, true);
686 case Instruction::IntToPtr:
687 case Instruction::PtrToInt:
688 // Avoid "cast to pointer from integer of different size" warnings
689 Out << "(unsigned long)";
691 case Instruction::Trunc:
692 case Instruction::BitCast:
693 case Instruction::FPExt:
694 case Instruction::FPTrunc:
695 case Instruction::FPToSI:
696 case Instruction::FPToUI:
697 break; // These don't need a source cast.
699 assert(0 && "Invalid cast opcode");
704 // printConstant - The LLVM Constant to C Constant converter.
705 void CWriter::printConstant(Constant *CPV) {
706 if (const ConstantExpr *CE = dyn_cast<ConstantExpr>(CPV)) {
707 switch (CE->getOpcode()) {
708 case Instruction::Trunc:
709 case Instruction::ZExt:
710 case Instruction::SExt:
711 case Instruction::FPTrunc:
712 case Instruction::FPExt:
713 case Instruction::UIToFP:
714 case Instruction::SIToFP:
715 case Instruction::FPToUI:
716 case Instruction::FPToSI:
717 case Instruction::PtrToInt:
718 case Instruction::IntToPtr:
719 case Instruction::BitCast:
721 printCast(CE->getOpcode(), CE->getOperand(0)->getType(), CE->getType());
722 if (CE->getOpcode() == Instruction::SExt &&
723 CE->getOperand(0)->getType() == Type::Int1Ty) {
724 // Make sure we really sext from bool here by subtracting from 0
727 printConstant(CE->getOperand(0));
728 if (CE->getType() == Type::Int1Ty &&
729 (CE->getOpcode() == Instruction::Trunc ||
730 CE->getOpcode() == Instruction::FPToUI ||
731 CE->getOpcode() == Instruction::FPToSI ||
732 CE->getOpcode() == Instruction::PtrToInt)) {
733 // Make sure we really truncate to bool here by anding with 1
739 case Instruction::GetElementPtr:
741 printIndexingExpression(CE->getOperand(0), gep_type_begin(CPV),
745 case Instruction::Select:
747 printConstant(CE->getOperand(0));
749 printConstant(CE->getOperand(1));
751 printConstant(CE->getOperand(2));
754 case Instruction::Add:
755 case Instruction::Sub:
756 case Instruction::Mul:
757 case Instruction::SDiv:
758 case Instruction::UDiv:
759 case Instruction::FDiv:
760 case Instruction::URem:
761 case Instruction::SRem:
762 case Instruction::FRem:
763 case Instruction::And:
764 case Instruction::Or:
765 case Instruction::Xor:
766 case Instruction::ICmp:
767 case Instruction::Shl:
768 case Instruction::LShr:
769 case Instruction::AShr:
772 bool NeedsClosingParens = printConstExprCast(CE);
773 printConstantWithCast(CE->getOperand(0), CE->getOpcode());
774 switch (CE->getOpcode()) {
775 case Instruction::Add: Out << " + "; break;
776 case Instruction::Sub: Out << " - "; break;
777 case Instruction::Mul: Out << " * "; break;
778 case Instruction::URem:
779 case Instruction::SRem:
780 case Instruction::FRem: Out << " % "; break;
781 case Instruction::UDiv:
782 case Instruction::SDiv:
783 case Instruction::FDiv: Out << " / "; break;
784 case Instruction::And: Out << " & "; break;
785 case Instruction::Or: Out << " | "; break;
786 case Instruction::Xor: Out << " ^ "; break;
787 case Instruction::Shl: Out << " << "; break;
788 case Instruction::LShr:
789 case Instruction::AShr: Out << " >> "; break;
790 case Instruction::ICmp:
791 switch (CE->getPredicate()) {
792 case ICmpInst::ICMP_EQ: Out << " == "; break;
793 case ICmpInst::ICMP_NE: Out << " != "; break;
794 case ICmpInst::ICMP_SLT:
795 case ICmpInst::ICMP_ULT: Out << " < "; break;
796 case ICmpInst::ICMP_SLE:
797 case ICmpInst::ICMP_ULE: Out << " <= "; break;
798 case ICmpInst::ICMP_SGT:
799 case ICmpInst::ICMP_UGT: Out << " > "; break;
800 case ICmpInst::ICMP_SGE:
801 case ICmpInst::ICMP_UGE: Out << " >= "; break;
802 default: assert(0 && "Illegal ICmp predicate");
805 default: assert(0 && "Illegal opcode here!");
807 printConstantWithCast(CE->getOperand(1), CE->getOpcode());
808 if (NeedsClosingParens)
813 case Instruction::FCmp: {
815 bool NeedsClosingParens = printConstExprCast(CE);
816 if (CE->getPredicate() == FCmpInst::FCMP_FALSE)
818 else if (CE->getPredicate() == FCmpInst::FCMP_TRUE)
822 switch (CE->getPredicate()) {
823 default: assert(0 && "Illegal FCmp predicate");
824 case FCmpInst::FCMP_ORD: op = "ord"; break;
825 case FCmpInst::FCMP_UNO: op = "uno"; break;
826 case FCmpInst::FCMP_UEQ: op = "ueq"; break;
827 case FCmpInst::FCMP_UNE: op = "une"; break;
828 case FCmpInst::FCMP_ULT: op = "ult"; break;
829 case FCmpInst::FCMP_ULE: op = "ule"; break;
830 case FCmpInst::FCMP_UGT: op = "ugt"; break;
831 case FCmpInst::FCMP_UGE: op = "uge"; break;
832 case FCmpInst::FCMP_OEQ: op = "oeq"; break;
833 case FCmpInst::FCMP_ONE: op = "one"; break;
834 case FCmpInst::FCMP_OLT: op = "olt"; break;
835 case FCmpInst::FCMP_OLE: op = "ole"; break;
836 case FCmpInst::FCMP_OGT: op = "ogt"; break;
837 case FCmpInst::FCMP_OGE: op = "oge"; break;
839 Out << "llvm_fcmp_" << op << "(";
840 printConstantWithCast(CE->getOperand(0), CE->getOpcode());
842 printConstantWithCast(CE->getOperand(1), CE->getOpcode());
845 if (NeedsClosingParens)
850 cerr << "CWriter Error: Unhandled constant expression: "
854 } else if (isa<UndefValue>(CPV) && CPV->getType()->isFirstClassType()) {
856 printType(Out, CPV->getType()); // sign doesn't matter
857 Out << ")/*UNDEF*/0)";
861 if (ConstantInt *CI = dyn_cast<ConstantInt>(CPV)) {
862 const Type* Ty = CI->getType();
863 if (Ty == Type::Int1Ty)
864 Out << (CI->getZExtValue() ? '1' : '0') ;
867 printSimpleType(Out, Ty, false) << ')';
868 if (CI->isMinValue(true))
869 Out << CI->getZExtValue() << 'u';
871 Out << CI->getSExtValue();
872 if (Ty->getPrimitiveSizeInBits() > 32)
879 switch (CPV->getType()->getTypeID()) {
880 case Type::FloatTyID:
881 case Type::DoubleTyID: {
882 ConstantFP *FPC = cast<ConstantFP>(CPV);
883 std::map<const ConstantFP*, unsigned>::iterator I = FPConstantMap.find(FPC);
884 if (I != FPConstantMap.end()) {
885 // Because of FP precision problems we must load from a stack allocated
886 // value that holds the value in hex.
887 Out << "(*(" << (FPC->getType() == Type::FloatTy ? "float" : "double")
888 << "*)&FPConstant" << I->second << ')';
890 double V = FPC->getType() == Type::FloatTy ?
891 FPC->getValueAPF().convertToFloat() :
892 FPC->getValueAPF().convertToDouble();
896 // FIXME the actual NaN bits should be emitted.
897 // The prefix for a quiet NaN is 0x7FF8. For a signalling NaN,
899 const unsigned long QuietNaN = 0x7ff8UL;
900 //const unsigned long SignalNaN = 0x7ff4UL;
902 // We need to grab the first part of the FP #
905 uint64_t ll = DoubleToBits(V);
906 sprintf(Buffer, "0x%llx", static_cast<long long>(ll));
908 std::string Num(&Buffer[0], &Buffer[6]);
909 unsigned long Val = strtoul(Num.c_str(), 0, 16);
911 if (FPC->getType() == Type::FloatTy)
912 Out << "LLVM_NAN" << (Val == QuietNaN ? "" : "S") << "F(\""
913 << Buffer << "\") /*nan*/ ";
915 Out << "LLVM_NAN" << (Val == QuietNaN ? "" : "S") << "(\""
916 << Buffer << "\") /*nan*/ ";
917 } else if (IsInf(V)) {
919 if (V < 0) Out << '-';
920 Out << "LLVM_INF" << (FPC->getType() == Type::FloatTy ? "F" : "")
924 #if HAVE_PRINTF_A && ENABLE_CBE_PRINTF_A
925 // Print out the constant as a floating point number.
927 sprintf(Buffer, "%a", V);
930 Num = ftostr(FPC->getValueAPF());
938 case Type::ArrayTyID:
939 if (isa<ConstantAggregateZero>(CPV) || isa<UndefValue>(CPV)) {
940 const ArrayType *AT = cast<ArrayType>(CPV->getType());
942 if (AT->getNumElements()) {
944 Constant *CZ = Constant::getNullValue(AT->getElementType());
946 for (unsigned i = 1, e = AT->getNumElements(); i != e; ++i) {
953 printConstantArray(cast<ConstantArray>(CPV));
957 case Type::VectorTyID:
958 if (isa<ConstantAggregateZero>(CPV) || isa<UndefValue>(CPV)) {
959 const VectorType *AT = cast<VectorType>(CPV->getType());
961 if (AT->getNumElements()) {
963 Constant *CZ = Constant::getNullValue(AT->getElementType());
965 for (unsigned i = 1, e = AT->getNumElements(); i != e; ++i) {
972 printConstantVector(cast<ConstantVector>(CPV));
976 case Type::StructTyID:
977 if (isa<ConstantAggregateZero>(CPV) || isa<UndefValue>(CPV)) {
978 const StructType *ST = cast<StructType>(CPV->getType());
980 if (ST->getNumElements()) {
982 printConstant(Constant::getNullValue(ST->getElementType(0)));
983 for (unsigned i = 1, e = ST->getNumElements(); i != e; ++i) {
985 printConstant(Constant::getNullValue(ST->getElementType(i)));
991 if (CPV->getNumOperands()) {
993 printConstant(cast<Constant>(CPV->getOperand(0)));
994 for (unsigned i = 1, e = CPV->getNumOperands(); i != e; ++i) {
996 printConstant(cast<Constant>(CPV->getOperand(i)));
1003 case Type::PointerTyID:
1004 if (isa<ConstantPointerNull>(CPV)) {
1006 printType(Out, CPV->getType()); // sign doesn't matter
1007 Out << ")/*NULL*/0)";
1009 } else if (GlobalValue *GV = dyn_cast<GlobalValue>(CPV)) {
1015 cerr << "Unknown constant type: " << *CPV << "\n";
1020 // Some constant expressions need to be casted back to the original types
1021 // because their operands were casted to the expected type. This function takes
1022 // care of detecting that case and printing the cast for the ConstantExpr.
1023 bool CWriter::printConstExprCast(const ConstantExpr* CE) {
1024 bool NeedsExplicitCast = false;
1025 const Type *Ty = CE->getOperand(0)->getType();
1026 bool TypeIsSigned = false;
1027 switch (CE->getOpcode()) {
1028 case Instruction::LShr:
1029 case Instruction::URem:
1030 case Instruction::UDiv: NeedsExplicitCast = true; break;
1031 case Instruction::AShr:
1032 case Instruction::SRem:
1033 case Instruction::SDiv: NeedsExplicitCast = true; TypeIsSigned = true; break;
1034 case Instruction::SExt:
1036 NeedsExplicitCast = true;
1037 TypeIsSigned = true;
1039 case Instruction::ZExt:
1040 case Instruction::Trunc:
1041 case Instruction::FPTrunc:
1042 case Instruction::FPExt:
1043 case Instruction::UIToFP:
1044 case Instruction::SIToFP:
1045 case Instruction::FPToUI:
1046 case Instruction::FPToSI:
1047 case Instruction::PtrToInt:
1048 case Instruction::IntToPtr:
1049 case Instruction::BitCast:
1051 NeedsExplicitCast = true;
1055 if (NeedsExplicitCast) {
1057 if (Ty->isInteger() && Ty != Type::Int1Ty)
1058 printSimpleType(Out, Ty, TypeIsSigned);
1060 printType(Out, Ty); // not integer, sign doesn't matter
1063 return NeedsExplicitCast;
1066 // Print a constant assuming that it is the operand for a given Opcode. The
1067 // opcodes that care about sign need to cast their operands to the expected
1068 // type before the operation proceeds. This function does the casting.
1069 void CWriter::printConstantWithCast(Constant* CPV, unsigned Opcode) {
1071 // Extract the operand's type, we'll need it.
1072 const Type* OpTy = CPV->getType();
1074 // Indicate whether to do the cast or not.
1075 bool shouldCast = false;
1076 bool typeIsSigned = false;
1078 // Based on the Opcode for which this Constant is being written, determine
1079 // the new type to which the operand should be casted by setting the value
1080 // of OpTy. If we change OpTy, also set shouldCast to true so it gets
1084 // for most instructions, it doesn't matter
1086 case Instruction::LShr:
1087 case Instruction::UDiv:
1088 case Instruction::URem:
1091 case Instruction::AShr:
1092 case Instruction::SDiv:
1093 case Instruction::SRem:
1095 typeIsSigned = true;
1099 // Write out the casted constant if we should, otherwise just write the
1103 printSimpleType(Out, OpTy, typeIsSigned);
1111 std::string CWriter::GetValueName(const Value *Operand) {
1114 if (!isa<GlobalValue>(Operand) && Operand->getName() != "") {
1115 std::string VarName;
1117 Name = Operand->getName();
1118 VarName.reserve(Name.capacity());
1120 for (std::string::iterator I = Name.begin(), E = Name.end();
1124 if (!((ch >= 'a' && ch <= 'z') || (ch >= 'A' && ch <= 'Z') ||
1125 (ch >= '0' && ch <= '9') || ch == '_'))
1131 Name = "llvm_cbe_" + VarName;
1133 Name = Mang->getValueName(Operand);
1139 void CWriter::writeOperandInternal(Value *Operand) {
1140 if (Instruction *I = dyn_cast<Instruction>(Operand))
1141 if (isInlinableInst(*I) && !isDirectAlloca(I)) {
1142 // Should we inline this instruction to build a tree?
1149 Constant* CPV = dyn_cast<Constant>(Operand);
1151 if (CPV && !isa<GlobalValue>(CPV))
1154 Out << GetValueName(Operand);
1157 void CWriter::writeOperandRaw(Value *Operand) {
1158 Constant* CPV = dyn_cast<Constant>(Operand);
1159 if (CPV && !isa<GlobalValue>(CPV)) {
1162 Out << GetValueName(Operand);
1166 void CWriter::writeOperand(Value *Operand) {
1167 if (isa<GlobalVariable>(Operand) || isDirectAlloca(Operand))
1168 Out << "(&"; // Global variables are referenced as their addresses by llvm
1170 writeOperandInternal(Operand);
1172 if (isa<GlobalVariable>(Operand) || isDirectAlloca(Operand))
1176 // Some instructions need to have their result value casted back to the
1177 // original types because their operands were casted to the expected type.
1178 // This function takes care of detecting that case and printing the cast
1179 // for the Instruction.
1180 bool CWriter::writeInstructionCast(const Instruction &I) {
1181 const Type *Ty = I.getOperand(0)->getType();
1182 switch (I.getOpcode()) {
1183 case Instruction::LShr:
1184 case Instruction::URem:
1185 case Instruction::UDiv:
1187 printSimpleType(Out, Ty, false);
1190 case Instruction::AShr:
1191 case Instruction::SRem:
1192 case Instruction::SDiv:
1194 printSimpleType(Out, Ty, true);
1202 // Write the operand with a cast to another type based on the Opcode being used.
1203 // This will be used in cases where an instruction has specific type
1204 // requirements (usually signedness) for its operands.
1205 void CWriter::writeOperandWithCast(Value* Operand, unsigned Opcode) {
1207 // Extract the operand's type, we'll need it.
1208 const Type* OpTy = Operand->getType();
1210 // Indicate whether to do the cast or not.
1211 bool shouldCast = false;
1213 // Indicate whether the cast should be to a signed type or not.
1214 bool castIsSigned = false;
1216 // Based on the Opcode for which this Operand is being written, determine
1217 // the new type to which the operand should be casted by setting the value
1218 // of OpTy. If we change OpTy, also set shouldCast to true.
1221 // for most instructions, it doesn't matter
1223 case Instruction::LShr:
1224 case Instruction::UDiv:
1225 case Instruction::URem: // Cast to unsigned first
1227 castIsSigned = false;
1229 case Instruction::AShr:
1230 case Instruction::SDiv:
1231 case Instruction::SRem: // Cast to signed first
1233 castIsSigned = true;
1237 // Write out the casted operand if we should, otherwise just write the
1241 printSimpleType(Out, OpTy, castIsSigned);
1243 writeOperand(Operand);
1246 writeOperand(Operand);
1249 // Write the operand with a cast to another type based on the icmp predicate
1251 void CWriter::writeOperandWithCast(Value* Operand, ICmpInst::Predicate predicate) {
1253 // Extract the operand's type, we'll need it.
1254 const Type* OpTy = Operand->getType();
1256 // Indicate whether to do the cast or not.
1257 bool shouldCast = false;
1259 // Indicate whether the cast should be to a signed type or not.
1260 bool castIsSigned = false;
1262 // Based on the Opcode for which this Operand is being written, determine
1263 // the new type to which the operand should be casted by setting the value
1264 // of OpTy. If we change OpTy, also set shouldCast to true.
1265 switch (predicate) {
1267 // for eq and ne, it doesn't matter
1269 case ICmpInst::ICMP_UGT:
1270 case ICmpInst::ICMP_UGE:
1271 case ICmpInst::ICMP_ULT:
1272 case ICmpInst::ICMP_ULE:
1275 case ICmpInst::ICMP_SGT:
1276 case ICmpInst::ICMP_SGE:
1277 case ICmpInst::ICMP_SLT:
1278 case ICmpInst::ICMP_SLE:
1280 castIsSigned = true;
1284 // Write out the casted operand if we should, otherwise just write the
1288 if (OpTy->isInteger() && OpTy != Type::Int1Ty)
1289 printSimpleType(Out, OpTy, castIsSigned);
1291 printType(Out, OpTy); // not integer, sign doesn't matter
1293 writeOperand(Operand);
1296 writeOperand(Operand);
1299 // generateCompilerSpecificCode - This is where we add conditional compilation
1300 // directives to cater to specific compilers as need be.
1302 static void generateCompilerSpecificCode(std::ostream& Out) {
1303 // Alloca is hard to get, and we don't want to include stdlib.h here.
1304 Out << "/* get a declaration for alloca */\n"
1305 << "#if defined(__CYGWIN__) || defined(__MINGW32__)\n"
1306 << "#define alloca(x) __builtin_alloca((x))\n"
1307 << "#define _alloca(x) __builtin_alloca((x))\n"
1308 << "#elif defined(__APPLE__)\n"
1309 << "extern void *__builtin_alloca(unsigned long);\n"
1310 << "#define alloca(x) __builtin_alloca(x)\n"
1311 << "#define longjmp _longjmp\n"
1312 << "#define setjmp _setjmp\n"
1313 << "#elif defined(__sun__)\n"
1314 << "#if defined(__sparcv9)\n"
1315 << "extern void *__builtin_alloca(unsigned long);\n"
1317 << "extern void *__builtin_alloca(unsigned int);\n"
1319 << "#define alloca(x) __builtin_alloca(x)\n"
1320 << "#elif defined(__FreeBSD__) || defined(__OpenBSD__)\n"
1321 << "#define alloca(x) __builtin_alloca(x)\n"
1322 << "#elif defined(_MSC_VER)\n"
1323 << "#define inline _inline\n"
1324 << "#define alloca(x) _alloca(x)\n"
1326 << "#include <alloca.h>\n"
1329 // We output GCC specific attributes to preserve 'linkonce'ness on globals.
1330 // If we aren't being compiled with GCC, just drop these attributes.
1331 Out << "#ifndef __GNUC__ /* Can only support \"linkonce\" vars with GCC */\n"
1332 << "#define __attribute__(X)\n"
1335 // On Mac OS X, "external weak" is spelled "__attribute__((weak_import))".
1336 Out << "#if defined(__GNUC__) && defined(__APPLE_CC__)\n"
1337 << "#define __EXTERNAL_WEAK__ __attribute__((weak_import))\n"
1338 << "#elif defined(__GNUC__)\n"
1339 << "#define __EXTERNAL_WEAK__ __attribute__((weak))\n"
1341 << "#define __EXTERNAL_WEAK__\n"
1344 // For now, turn off the weak linkage attribute on Mac OS X. (See above.)
1345 Out << "#if defined(__GNUC__) && defined(__APPLE_CC__)\n"
1346 << "#define __ATTRIBUTE_WEAK__\n"
1347 << "#elif defined(__GNUC__)\n"
1348 << "#define __ATTRIBUTE_WEAK__ __attribute__((weak))\n"
1350 << "#define __ATTRIBUTE_WEAK__\n"
1353 // Add hidden visibility support. FIXME: APPLE_CC?
1354 Out << "#if defined(__GNUC__)\n"
1355 << "#define __HIDDEN__ __attribute__((visibility(\"hidden\")))\n"
1358 // Define NaN and Inf as GCC builtins if using GCC, as 0 otherwise
1359 // From the GCC documentation:
1361 // double __builtin_nan (const char *str)
1363 // This is an implementation of the ISO C99 function nan.
1365 // Since ISO C99 defines this function in terms of strtod, which we do
1366 // not implement, a description of the parsing is in order. The string is
1367 // parsed as by strtol; that is, the base is recognized by leading 0 or
1368 // 0x prefixes. The number parsed is placed in the significand such that
1369 // the least significant bit of the number is at the least significant
1370 // bit of the significand. The number is truncated to fit the significand
1371 // field provided. The significand is forced to be a quiet NaN.
1373 // This function, if given a string literal, is evaluated early enough
1374 // that it is considered a compile-time constant.
1376 // float __builtin_nanf (const char *str)
1378 // Similar to __builtin_nan, except the return type is float.
1380 // double __builtin_inf (void)
1382 // Similar to __builtin_huge_val, except a warning is generated if the
1383 // target floating-point format does not support infinities. This
1384 // function is suitable for implementing the ISO C99 macro INFINITY.
1386 // float __builtin_inff (void)
1388 // Similar to __builtin_inf, except the return type is float.
1389 Out << "#ifdef __GNUC__\n"
1390 << "#define LLVM_NAN(NanStr) __builtin_nan(NanStr) /* Double */\n"
1391 << "#define LLVM_NANF(NanStr) __builtin_nanf(NanStr) /* Float */\n"
1392 << "#define LLVM_NANS(NanStr) __builtin_nans(NanStr) /* Double */\n"
1393 << "#define LLVM_NANSF(NanStr) __builtin_nansf(NanStr) /* Float */\n"
1394 << "#define LLVM_INF __builtin_inf() /* Double */\n"
1395 << "#define LLVM_INFF __builtin_inff() /* Float */\n"
1396 << "#define LLVM_PREFETCH(addr,rw,locality) "
1397 "__builtin_prefetch(addr,rw,locality)\n"
1398 << "#define __ATTRIBUTE_CTOR__ __attribute__((constructor))\n"
1399 << "#define __ATTRIBUTE_DTOR__ __attribute__((destructor))\n"
1400 << "#define LLVM_ASM __asm__\n"
1402 << "#define LLVM_NAN(NanStr) ((double)0.0) /* Double */\n"
1403 << "#define LLVM_NANF(NanStr) 0.0F /* Float */\n"
1404 << "#define LLVM_NANS(NanStr) ((double)0.0) /* Double */\n"
1405 << "#define LLVM_NANSF(NanStr) 0.0F /* Float */\n"
1406 << "#define LLVM_INF ((double)0.0) /* Double */\n"
1407 << "#define LLVM_INFF 0.0F /* Float */\n"
1408 << "#define LLVM_PREFETCH(addr,rw,locality) /* PREFETCH */\n"
1409 << "#define __ATTRIBUTE_CTOR__\n"
1410 << "#define __ATTRIBUTE_DTOR__\n"
1411 << "#define LLVM_ASM(X)\n"
1414 Out << "#if __GNUC__ < 4 /* Old GCC's, or compilers not GCC */ \n"
1415 << "#define __builtin_stack_save() 0 /* not implemented */\n"
1416 << "#define __builtin_stack_restore(X) /* noop */\n"
1419 // Output target-specific code that should be inserted into main.
1420 Out << "#define CODE_FOR_MAIN() /* Any target-specific code for main()*/\n";
1423 /// FindStaticTors - Given a static ctor/dtor list, unpack its contents into
1424 /// the StaticTors set.
1425 static void FindStaticTors(GlobalVariable *GV, std::set<Function*> &StaticTors){
1426 ConstantArray *InitList = dyn_cast<ConstantArray>(GV->getInitializer());
1427 if (!InitList) return;
1429 for (unsigned i = 0, e = InitList->getNumOperands(); i != e; ++i)
1430 if (ConstantStruct *CS = dyn_cast<ConstantStruct>(InitList->getOperand(i))){
1431 if (CS->getNumOperands() != 2) return; // Not array of 2-element structs.
1433 if (CS->getOperand(1)->isNullValue())
1434 return; // Found a null terminator, exit printing.
1435 Constant *FP = CS->getOperand(1);
1436 if (ConstantExpr *CE = dyn_cast<ConstantExpr>(FP))
1438 FP = CE->getOperand(0);
1439 if (Function *F = dyn_cast<Function>(FP))
1440 StaticTors.insert(F);
1444 enum SpecialGlobalClass {
1446 GlobalCtors, GlobalDtors,
1450 /// getGlobalVariableClass - If this is a global that is specially recognized
1451 /// by LLVM, return a code that indicates how we should handle it.
1452 static SpecialGlobalClass getGlobalVariableClass(const GlobalVariable *GV) {
1453 // If this is a global ctors/dtors list, handle it now.
1454 if (GV->hasAppendingLinkage() && GV->use_empty()) {
1455 if (GV->getName() == "llvm.global_ctors")
1457 else if (GV->getName() == "llvm.global_dtors")
1461 // Otherwise, it it is other metadata, don't print it. This catches things
1462 // like debug information.
1463 if (GV->getSection() == "llvm.metadata")
1470 bool CWriter::doInitialization(Module &M) {
1474 TD = new TargetData(&M);
1475 IL = new IntrinsicLowering(*TD);
1476 IL->AddPrototypes(M);
1478 // Ensure that all structure types have names...
1479 Mang = new Mangler(M);
1480 Mang->markCharUnacceptable('.');
1482 // Keep track of which functions are static ctors/dtors so they can have
1483 // an attribute added to their prototypes.
1484 std::set<Function*> StaticCtors, StaticDtors;
1485 for (Module::global_iterator I = M.global_begin(), E = M.global_end();
1487 switch (getGlobalVariableClass(I)) {
1490 FindStaticTors(I, StaticCtors);
1493 FindStaticTors(I, StaticDtors);
1498 // get declaration for alloca
1499 Out << "/* Provide Declarations */\n";
1500 Out << "#include <stdarg.h>\n"; // Varargs support
1501 Out << "#include <setjmp.h>\n"; // Unwind support
1502 generateCompilerSpecificCode(Out);
1504 // Provide a definition for `bool' if not compiling with a C++ compiler.
1506 << "#ifndef __cplusplus\ntypedef unsigned char bool;\n#endif\n"
1508 << "\n\n/* Support for floating point constants */\n"
1509 << "typedef unsigned long long ConstantDoubleTy;\n"
1510 << "typedef unsigned int ConstantFloatTy;\n"
1512 << "\n\n/* Global Declarations */\n";
1514 // First output all the declarations for the program, because C requires
1515 // Functions & globals to be declared before they are used.
1518 // Loop over the symbol table, emitting all named constants...
1519 printModuleTypes(M.getTypeSymbolTable());
1521 // Global variable declarations...
1522 if (!M.global_empty()) {
1523 Out << "\n/* External Global Variable Declarations */\n";
1524 for (Module::global_iterator I = M.global_begin(), E = M.global_end();
1527 if (I->hasExternalLinkage() || I->hasExternalWeakLinkage())
1529 else if (I->hasDLLImportLinkage())
1530 Out << "__declspec(dllimport) ";
1532 continue; // Internal Global
1534 // Thread Local Storage
1535 if (I->isThreadLocal())
1538 printType(Out, I->getType()->getElementType(), false, GetValueName(I));
1540 if (I->hasExternalWeakLinkage())
1541 Out << " __EXTERNAL_WEAK__";
1546 // Function declarations
1547 Out << "\n/* Function Declarations */\n";
1548 Out << "double fmod(double, double);\n"; // Support for FP rem
1549 Out << "float fmodf(float, float);\n";
1551 for (Module::iterator I = M.begin(), E = M.end(); I != E; ++I) {
1552 // Don't print declarations for intrinsic functions.
1553 if (!I->getIntrinsicID() && I->getName() != "setjmp" &&
1554 I->getName() != "longjmp" && I->getName() != "_setjmp") {
1555 if (I->hasExternalWeakLinkage())
1557 printFunctionSignature(I, true);
1558 if (I->hasWeakLinkage() || I->hasLinkOnceLinkage())
1559 Out << " __ATTRIBUTE_WEAK__";
1560 if (I->hasExternalWeakLinkage())
1561 Out << " __EXTERNAL_WEAK__";
1562 if (StaticCtors.count(I))
1563 Out << " __ATTRIBUTE_CTOR__";
1564 if (StaticDtors.count(I))
1565 Out << " __ATTRIBUTE_DTOR__";
1566 if (I->hasHiddenVisibility())
1567 Out << " __HIDDEN__";
1569 if (I->hasName() && I->getName()[0] == 1)
1570 Out << " LLVM_ASM(\"" << I->getName().c_str()+1 << "\")";
1576 // Output the global variable declarations
1577 if (!M.global_empty()) {
1578 Out << "\n\n/* Global Variable Declarations */\n";
1579 for (Module::global_iterator I = M.global_begin(), E = M.global_end();
1581 if (!I->isDeclaration()) {
1582 // Ignore special globals, such as debug info.
1583 if (getGlobalVariableClass(I))
1586 if (I->hasInternalLinkage())
1591 // Thread Local Storage
1592 if (I->isThreadLocal())
1595 printType(Out, I->getType()->getElementType(), false,
1598 if (I->hasLinkOnceLinkage())
1599 Out << " __attribute__((common))";
1600 else if (I->hasWeakLinkage())
1601 Out << " __ATTRIBUTE_WEAK__";
1602 else if (I->hasExternalWeakLinkage())
1603 Out << " __EXTERNAL_WEAK__";
1604 if (I->hasHiddenVisibility())
1605 Out << " __HIDDEN__";
1610 // Output the global variable definitions and contents...
1611 if (!M.global_empty()) {
1612 Out << "\n\n/* Global Variable Definitions and Initialization */\n";
1613 for (Module::global_iterator I = M.global_begin(), E = M.global_end();
1615 if (!I->isDeclaration()) {
1616 // Ignore special globals, such as debug info.
1617 if (getGlobalVariableClass(I))
1620 if (I->hasInternalLinkage())
1622 else if (I->hasDLLImportLinkage())
1623 Out << "__declspec(dllimport) ";
1624 else if (I->hasDLLExportLinkage())
1625 Out << "__declspec(dllexport) ";
1627 // Thread Local Storage
1628 if (I->isThreadLocal())
1631 printType(Out, I->getType()->getElementType(), false,
1633 if (I->hasLinkOnceLinkage())
1634 Out << " __attribute__((common))";
1635 else if (I->hasWeakLinkage())
1636 Out << " __ATTRIBUTE_WEAK__";
1638 if (I->hasHiddenVisibility())
1639 Out << " __HIDDEN__";
1641 // If the initializer is not null, emit the initializer. If it is null,
1642 // we try to avoid emitting large amounts of zeros. The problem with
1643 // this, however, occurs when the variable has weak linkage. In this
1644 // case, the assembler will complain about the variable being both weak
1645 // and common, so we disable this optimization.
1646 if (!I->getInitializer()->isNullValue()) {
1648 writeOperand(I->getInitializer());
1649 } else if (I->hasWeakLinkage()) {
1650 // We have to specify an initializer, but it doesn't have to be
1651 // complete. If the value is an aggregate, print out { 0 }, and let
1652 // the compiler figure out the rest of the zeros.
1654 if (isa<StructType>(I->getInitializer()->getType()) ||
1655 isa<ArrayType>(I->getInitializer()->getType()) ||
1656 isa<VectorType>(I->getInitializer()->getType())) {
1659 // Just print it out normally.
1660 writeOperand(I->getInitializer());
1668 Out << "\n\n/* Function Bodies */\n";
1670 // Emit some helper functions for dealing with FCMP instruction's
1672 Out << "static inline int llvm_fcmp_ord(double X, double Y) { ";
1673 Out << "return X == X && Y == Y; }\n";
1674 Out << "static inline int llvm_fcmp_uno(double X, double Y) { ";
1675 Out << "return X != X || Y != Y; }\n";
1676 Out << "static inline int llvm_fcmp_ueq(double X, double Y) { ";
1677 Out << "return X == Y || llvm_fcmp_uno(X, Y); }\n";
1678 Out << "static inline int llvm_fcmp_une(double X, double Y) { ";
1679 Out << "return X != Y; }\n";
1680 Out << "static inline int llvm_fcmp_ult(double X, double Y) { ";
1681 Out << "return X < Y || llvm_fcmp_uno(X, Y); }\n";
1682 Out << "static inline int llvm_fcmp_ugt(double X, double Y) { ";
1683 Out << "return X > Y || llvm_fcmp_uno(X, Y); }\n";
1684 Out << "static inline int llvm_fcmp_ule(double X, double Y) { ";
1685 Out << "return X <= Y || llvm_fcmp_uno(X, Y); }\n";
1686 Out << "static inline int llvm_fcmp_uge(double X, double Y) { ";
1687 Out << "return X >= Y || llvm_fcmp_uno(X, Y); }\n";
1688 Out << "static inline int llvm_fcmp_oeq(double X, double Y) { ";
1689 Out << "return X == Y ; }\n";
1690 Out << "static inline int llvm_fcmp_one(double X, double Y) { ";
1691 Out << "return X != Y && llvm_fcmp_ord(X, Y); }\n";
1692 Out << "static inline int llvm_fcmp_olt(double X, double Y) { ";
1693 Out << "return X < Y ; }\n";
1694 Out << "static inline int llvm_fcmp_ogt(double X, double Y) { ";
1695 Out << "return X > Y ; }\n";
1696 Out << "static inline int llvm_fcmp_ole(double X, double Y) { ";
1697 Out << "return X <= Y ; }\n";
1698 Out << "static inline int llvm_fcmp_oge(double X, double Y) { ";
1699 Out << "return X >= Y ; }\n";
1704 /// Output all floating point constants that cannot be printed accurately...
1705 void CWriter::printFloatingPointConstants(Function &F) {
1706 // Scan the module for floating point constants. If any FP constant is used
1707 // in the function, we want to redirect it here so that we do not depend on
1708 // the precision of the printed form, unless the printed form preserves
1711 static unsigned FPCounter = 0;
1712 for (constant_iterator I = constant_begin(&F), E = constant_end(&F);
1714 if (const ConstantFP *FPC = dyn_cast<ConstantFP>(*I))
1715 if (!isFPCSafeToPrint(FPC) && // Do not put in FPConstantMap if safe.
1716 !FPConstantMap.count(FPC)) {
1717 FPConstantMap[FPC] = FPCounter; // Number the FP constants
1719 if (FPC->getType() == Type::DoubleTy) {
1720 double Val = FPC->getValueAPF().convertToDouble();
1721 uint64_t i = FPC->getValueAPF().convertToAPInt().getZExtValue();
1722 Out << "static const ConstantDoubleTy FPConstant" << FPCounter++
1723 << " = 0x" << std::hex << i << std::dec
1724 << "ULL; /* " << Val << " */\n";
1725 } else if (FPC->getType() == Type::FloatTy) {
1726 float Val = FPC->getValueAPF().convertToFloat();
1727 uint32_t i = (uint32_t)FPC->getValueAPF().convertToAPInt().
1729 Out << "static const ConstantFloatTy FPConstant" << FPCounter++
1730 << " = 0x" << std::hex << i << std::dec
1731 << "U; /* " << Val << " */\n";
1733 assert(0 && "Unknown float type!");
1740 /// printSymbolTable - Run through symbol table looking for type names. If a
1741 /// type name is found, emit its declaration...
1743 void CWriter::printModuleTypes(const TypeSymbolTable &TST) {
1744 Out << "/* Helper union for bitcasts */\n";
1745 Out << "typedef union {\n";
1746 Out << " unsigned int Int32;\n";
1747 Out << " unsigned long long Int64;\n";
1748 Out << " float Float;\n";
1749 Out << " double Double;\n";
1750 Out << "} llvmBitCastUnion;\n";
1752 // We are only interested in the type plane of the symbol table.
1753 TypeSymbolTable::const_iterator I = TST.begin();
1754 TypeSymbolTable::const_iterator End = TST.end();
1756 // If there are no type names, exit early.
1757 if (I == End) return;
1759 // Print out forward declarations for structure types before anything else!
1760 Out << "/* Structure forward decls */\n";
1761 for (; I != End; ++I) {
1762 std::string Name = "struct l_" + Mang->makeNameProper(I->first);
1763 Out << Name << ";\n";
1764 TypeNames.insert(std::make_pair(I->second, Name));
1769 // Now we can print out typedefs. Above, we guaranteed that this can only be
1770 // for struct or opaque types.
1771 Out << "/* Typedefs */\n";
1772 for (I = TST.begin(); I != End; ++I) {
1773 std::string Name = "l_" + Mang->makeNameProper(I->first);
1775 printType(Out, I->second, false, Name);
1781 // Keep track of which structures have been printed so far...
1782 std::set<const StructType *> StructPrinted;
1784 // Loop over all structures then push them into the stack so they are
1785 // printed in the correct order.
1787 Out << "/* Structure contents */\n";
1788 for (I = TST.begin(); I != End; ++I)
1789 if (const StructType *STy = dyn_cast<StructType>(I->second))
1790 // Only print out used types!
1791 printContainedStructs(STy, StructPrinted);
1794 // Push the struct onto the stack and recursively push all structs
1795 // this one depends on.
1797 // TODO: Make this work properly with vector types
1799 void CWriter::printContainedStructs(const Type *Ty,
1800 std::set<const StructType*> &StructPrinted){
1801 // Don't walk through pointers.
1802 if (isa<PointerType>(Ty) || Ty->isPrimitiveType() || Ty->isInteger()) return;
1804 // Print all contained types first.
1805 for (Type::subtype_iterator I = Ty->subtype_begin(),
1806 E = Ty->subtype_end(); I != E; ++I)
1807 printContainedStructs(*I, StructPrinted);
1809 if (const StructType *STy = dyn_cast<StructType>(Ty)) {
1810 // Check to see if we have already printed this struct.
1811 if (StructPrinted.insert(STy).second) {
1812 // Print structure type out.
1813 std::string Name = TypeNames[STy];
1814 printType(Out, STy, false, Name, true);
1820 void CWriter::printFunctionSignature(const Function *F, bool Prototype) {
1821 /// isStructReturn - Should this function actually return a struct by-value?
1822 bool isStructReturn = F->getFunctionType()->isStructReturn();
1824 if (F->hasInternalLinkage()) Out << "static ";
1825 if (F->hasDLLImportLinkage()) Out << "__declspec(dllimport) ";
1826 if (F->hasDLLExportLinkage()) Out << "__declspec(dllexport) ";
1827 switch (F->getCallingConv()) {
1828 case CallingConv::X86_StdCall:
1829 Out << "__stdcall ";
1831 case CallingConv::X86_FastCall:
1832 Out << "__fastcall ";
1836 // Loop over the arguments, printing them...
1837 const FunctionType *FT = cast<FunctionType>(F->getFunctionType());
1838 const ParamAttrsList *Attrs = FT->getParamAttrs();
1840 std::stringstream FunctionInnards;
1842 // Print out the name...
1843 FunctionInnards << GetValueName(F) << '(';
1845 bool PrintedArg = false;
1846 if (!F->isDeclaration()) {
1847 if (!F->arg_empty()) {
1848 Function::const_arg_iterator I = F->arg_begin(), E = F->arg_end();
1850 // If this is a struct-return function, don't print the hidden
1851 // struct-return argument.
1852 if (isStructReturn) {
1853 assert(I != E && "Invalid struct return function!");
1857 std::string ArgName;
1859 for (; I != E; ++I) {
1860 if (PrintedArg) FunctionInnards << ", ";
1861 if (I->hasName() || !Prototype)
1862 ArgName = GetValueName(I);
1865 printType(FunctionInnards, I->getType(),
1866 /*isSigned=*/Attrs && Attrs->paramHasAttr(Idx, ParamAttr::SExt),
1873 // Loop over the arguments, printing them.
1874 FunctionType::param_iterator I = FT->param_begin(), E = FT->param_end();
1876 // If this is a struct-return function, don't print the hidden
1877 // struct-return argument.
1878 if (isStructReturn) {
1879 assert(I != E && "Invalid struct return function!");
1884 for (; I != E; ++I) {
1885 if (PrintedArg) FunctionInnards << ", ";
1886 printType(FunctionInnards, *I,
1887 /*isSigned=*/Attrs && Attrs->paramHasAttr(Idx, ParamAttr::SExt));
1893 // Finish printing arguments... if this is a vararg function, print the ...,
1894 // unless there are no known types, in which case, we just emit ().
1896 if (FT->isVarArg() && PrintedArg) {
1897 if (PrintedArg) FunctionInnards << ", ";
1898 FunctionInnards << "..."; // Output varargs portion of signature!
1899 } else if (!FT->isVarArg() && !PrintedArg) {
1900 FunctionInnards << "void"; // ret() -> ret(void) in C.
1902 FunctionInnards << ')';
1904 // Get the return tpe for the function.
1906 if (!isStructReturn)
1907 RetTy = F->getReturnType();
1909 // If this is a struct-return function, print the struct-return type.
1910 RetTy = cast<PointerType>(FT->getParamType(0))->getElementType();
1913 // Print out the return type and the signature built above.
1914 printType(Out, RetTy,
1915 /*isSigned=*/ Attrs && Attrs->paramHasAttr(0, ParamAttr::SExt),
1916 FunctionInnards.str());
1919 static inline bool isFPIntBitCast(const Instruction &I) {
1920 if (!isa<BitCastInst>(I))
1922 const Type *SrcTy = I.getOperand(0)->getType();
1923 const Type *DstTy = I.getType();
1924 return (SrcTy->isFloatingPoint() && DstTy->isInteger()) ||
1925 (DstTy->isFloatingPoint() && SrcTy->isInteger());
1928 void CWriter::printFunction(Function &F) {
1929 /// isStructReturn - Should this function actually return a struct by-value?
1930 bool isStructReturn = F.getFunctionType()->isStructReturn();
1932 printFunctionSignature(&F, false);
1935 // If this is a struct return function, handle the result with magic.
1936 if (isStructReturn) {
1937 const Type *StructTy =
1938 cast<PointerType>(F.arg_begin()->getType())->getElementType();
1940 printType(Out, StructTy, false, "StructReturn");
1941 Out << "; /* Struct return temporary */\n";
1944 printType(Out, F.arg_begin()->getType(), false,
1945 GetValueName(F.arg_begin()));
1946 Out << " = &StructReturn;\n";
1949 bool PrintedVar = false;
1951 // print local variable information for the function
1952 for (inst_iterator I = inst_begin(&F), E = inst_end(&F); I != E; ++I) {
1953 if (const AllocaInst *AI = isDirectAlloca(&*I)) {
1955 printType(Out, AI->getAllocatedType(), false, GetValueName(AI));
1956 Out << "; /* Address-exposed local */\n";
1958 } else if (I->getType() != Type::VoidTy && !isInlinableInst(*I)) {
1960 printType(Out, I->getType(), false, GetValueName(&*I));
1963 if (isa<PHINode>(*I)) { // Print out PHI node temporaries as well...
1965 printType(Out, I->getType(), false,
1966 GetValueName(&*I)+"__PHI_TEMPORARY");
1971 // We need a temporary for the BitCast to use so it can pluck a value out
1972 // of a union to do the BitCast. This is separate from the need for a
1973 // variable to hold the result of the BitCast.
1974 if (isFPIntBitCast(*I)) {
1975 Out << " llvmBitCastUnion " << GetValueName(&*I)
1976 << "__BITCAST_TEMPORARY;\n";
1984 if (F.hasExternalLinkage() && F.getName() == "main")
1985 Out << " CODE_FOR_MAIN();\n";
1987 // print the basic blocks
1988 for (Function::iterator BB = F.begin(), E = F.end(); BB != E; ++BB) {
1989 if (Loop *L = LI->getLoopFor(BB)) {
1990 if (L->getHeader() == BB && L->getParentLoop() == 0)
1993 printBasicBlock(BB);
2000 void CWriter::printLoop(Loop *L) {
2001 Out << " do { /* Syntactic loop '" << L->getHeader()->getName()
2002 << "' to make GCC happy */\n";
2003 for (unsigned i = 0, e = L->getBlocks().size(); i != e; ++i) {
2004 BasicBlock *BB = L->getBlocks()[i];
2005 Loop *BBLoop = LI->getLoopFor(BB);
2007 printBasicBlock(BB);
2008 else if (BB == BBLoop->getHeader() && BBLoop->getParentLoop() == L)
2011 Out << " } while (1); /* end of syntactic loop '"
2012 << L->getHeader()->getName() << "' */\n";
2015 void CWriter::printBasicBlock(BasicBlock *BB) {
2017 // Don't print the label for the basic block if there are no uses, or if
2018 // the only terminator use is the predecessor basic block's terminator.
2019 // We have to scan the use list because PHI nodes use basic blocks too but
2020 // do not require a label to be generated.
2022 bool NeedsLabel = false;
2023 for (pred_iterator PI = pred_begin(BB), E = pred_end(BB); PI != E; ++PI)
2024 if (isGotoCodeNecessary(*PI, BB)) {
2029 if (NeedsLabel) Out << GetValueName(BB) << ":\n";
2031 // Output all of the instructions in the basic block...
2032 for (BasicBlock::iterator II = BB->begin(), E = --BB->end(); II != E;
2034 if (!isInlinableInst(*II) && !isDirectAlloca(II)) {
2035 if (II->getType() != Type::VoidTy && !isInlineAsm(*II))
2044 // Don't emit prefix or suffix for the terminator...
2045 visit(*BB->getTerminator());
2049 // Specific Instruction type classes... note that all of the casts are
2050 // necessary because we use the instruction classes as opaque types...
2052 void CWriter::visitReturnInst(ReturnInst &I) {
2053 // If this is a struct return function, return the temporary struct.
2054 bool isStructReturn = I.getParent()->getParent()->
2055 getFunctionType()->isStructReturn();
2057 if (isStructReturn) {
2058 Out << " return StructReturn;\n";
2062 // Don't output a void return if this is the last basic block in the function
2063 if (I.getNumOperands() == 0 &&
2064 &*--I.getParent()->getParent()->end() == I.getParent() &&
2065 !I.getParent()->size() == 1) {
2070 if (I.getNumOperands()) {
2072 writeOperand(I.getOperand(0));
2077 void CWriter::visitSwitchInst(SwitchInst &SI) {
2080 writeOperand(SI.getOperand(0));
2081 Out << ") {\n default:\n";
2082 printPHICopiesForSuccessor (SI.getParent(), SI.getDefaultDest(), 2);
2083 printBranchToBlock(SI.getParent(), SI.getDefaultDest(), 2);
2085 for (unsigned i = 2, e = SI.getNumOperands(); i != e; i += 2) {
2087 writeOperand(SI.getOperand(i));
2089 BasicBlock *Succ = cast<BasicBlock>(SI.getOperand(i+1));
2090 printPHICopiesForSuccessor (SI.getParent(), Succ, 2);
2091 printBranchToBlock(SI.getParent(), Succ, 2);
2092 if (Function::iterator(Succ) == next(Function::iterator(SI.getParent())))
2098 void CWriter::visitUnreachableInst(UnreachableInst &I) {
2099 Out << " /*UNREACHABLE*/;\n";
2102 bool CWriter::isGotoCodeNecessary(BasicBlock *From, BasicBlock *To) {
2103 /// FIXME: This should be reenabled, but loop reordering safe!!
2106 if (next(Function::iterator(From)) != Function::iterator(To))
2107 return true; // Not the direct successor, we need a goto.
2109 //isa<SwitchInst>(From->getTerminator())
2111 if (LI->getLoopFor(From) != LI->getLoopFor(To))
2116 void CWriter::printPHICopiesForSuccessor (BasicBlock *CurBlock,
2117 BasicBlock *Successor,
2119 for (BasicBlock::iterator I = Successor->begin(); isa<PHINode>(I); ++I) {
2120 PHINode *PN = cast<PHINode>(I);
2121 // Now we have to do the printing.
2122 Value *IV = PN->getIncomingValueForBlock(CurBlock);
2123 if (!isa<UndefValue>(IV)) {
2124 Out << std::string(Indent, ' ');
2125 Out << " " << GetValueName(I) << "__PHI_TEMPORARY = ";
2127 Out << "; /* for PHI node */\n";
2132 void CWriter::printBranchToBlock(BasicBlock *CurBB, BasicBlock *Succ,
2134 if (isGotoCodeNecessary(CurBB, Succ)) {
2135 Out << std::string(Indent, ' ') << " goto ";
2141 // Branch instruction printing - Avoid printing out a branch to a basic block
2142 // that immediately succeeds the current one.
2144 void CWriter::visitBranchInst(BranchInst &I) {
2146 if (I.isConditional()) {
2147 if (isGotoCodeNecessary(I.getParent(), I.getSuccessor(0))) {
2149 writeOperand(I.getCondition());
2152 printPHICopiesForSuccessor (I.getParent(), I.getSuccessor(0), 2);
2153 printBranchToBlock(I.getParent(), I.getSuccessor(0), 2);
2155 if (isGotoCodeNecessary(I.getParent(), I.getSuccessor(1))) {
2156 Out << " } else {\n";
2157 printPHICopiesForSuccessor (I.getParent(), I.getSuccessor(1), 2);
2158 printBranchToBlock(I.getParent(), I.getSuccessor(1), 2);
2161 // First goto not necessary, assume second one is...
2163 writeOperand(I.getCondition());
2166 printPHICopiesForSuccessor (I.getParent(), I.getSuccessor(1), 2);
2167 printBranchToBlock(I.getParent(), I.getSuccessor(1), 2);
2172 printPHICopiesForSuccessor (I.getParent(), I.getSuccessor(0), 0);
2173 printBranchToBlock(I.getParent(), I.getSuccessor(0), 0);
2178 // PHI nodes get copied into temporary values at the end of predecessor basic
2179 // blocks. We now need to copy these temporary values into the REAL value for
2181 void CWriter::visitPHINode(PHINode &I) {
2183 Out << "__PHI_TEMPORARY";
2187 void CWriter::visitBinaryOperator(Instruction &I) {
2188 // binary instructions, shift instructions, setCond instructions.
2189 assert(!isa<PointerType>(I.getType()));
2191 // We must cast the results of binary operations which might be promoted.
2192 bool needsCast = false;
2193 if ((I.getType() == Type::Int8Ty) || (I.getType() == Type::Int16Ty)
2194 || (I.getType() == Type::FloatTy)) {
2197 printType(Out, I.getType(), false);
2201 // If this is a negation operation, print it out as such. For FP, we don't
2202 // want to print "-0.0 - X".
2203 if (BinaryOperator::isNeg(&I)) {
2205 writeOperand(BinaryOperator::getNegArgument(cast<BinaryOperator>(&I)));
2207 } else if (I.getOpcode() == Instruction::FRem) {
2208 // Output a call to fmod/fmodf instead of emitting a%b
2209 if (I.getType() == Type::FloatTy)
2213 writeOperand(I.getOperand(0));
2215 writeOperand(I.getOperand(1));
2219 // Write out the cast of the instruction's value back to the proper type
2221 bool NeedsClosingParens = writeInstructionCast(I);
2223 // Certain instructions require the operand to be forced to a specific type
2224 // so we use writeOperandWithCast here instead of writeOperand. Similarly
2225 // below for operand 1
2226 writeOperandWithCast(I.getOperand(0), I.getOpcode());
2228 switch (I.getOpcode()) {
2229 case Instruction::Add: Out << " + "; break;
2230 case Instruction::Sub: Out << " - "; break;
2231 case Instruction::Mul: Out << " * "; break;
2232 case Instruction::URem:
2233 case Instruction::SRem:
2234 case Instruction::FRem: Out << " % "; break;
2235 case Instruction::UDiv:
2236 case Instruction::SDiv:
2237 case Instruction::FDiv: Out << " / "; break;
2238 case Instruction::And: Out << " & "; break;
2239 case Instruction::Or: Out << " | "; break;
2240 case Instruction::Xor: Out << " ^ "; break;
2241 case Instruction::Shl : Out << " << "; break;
2242 case Instruction::LShr:
2243 case Instruction::AShr: Out << " >> "; break;
2244 default: cerr << "Invalid operator type!" << I; abort();
2247 writeOperandWithCast(I.getOperand(1), I.getOpcode());
2248 if (NeedsClosingParens)
2257 void CWriter::visitICmpInst(ICmpInst &I) {
2258 // We must cast the results of icmp which might be promoted.
2259 bool needsCast = false;
2261 // Write out the cast of the instruction's value back to the proper type
2263 bool NeedsClosingParens = writeInstructionCast(I);
2265 // Certain icmp predicate require the operand to be forced to a specific type
2266 // so we use writeOperandWithCast here instead of writeOperand. Similarly
2267 // below for operand 1
2268 writeOperandWithCast(I.getOperand(0), I.getPredicate());
2270 switch (I.getPredicate()) {
2271 case ICmpInst::ICMP_EQ: Out << " == "; break;
2272 case ICmpInst::ICMP_NE: Out << " != "; break;
2273 case ICmpInst::ICMP_ULE:
2274 case ICmpInst::ICMP_SLE: Out << " <= "; break;
2275 case ICmpInst::ICMP_UGE:
2276 case ICmpInst::ICMP_SGE: Out << " >= "; break;
2277 case ICmpInst::ICMP_ULT:
2278 case ICmpInst::ICMP_SLT: Out << " < "; break;
2279 case ICmpInst::ICMP_UGT:
2280 case ICmpInst::ICMP_SGT: Out << " > "; break;
2281 default: cerr << "Invalid icmp predicate!" << I; abort();
2284 writeOperandWithCast(I.getOperand(1), I.getPredicate());
2285 if (NeedsClosingParens)
2293 void CWriter::visitFCmpInst(FCmpInst &I) {
2294 if (I.getPredicate() == FCmpInst::FCMP_FALSE) {
2298 if (I.getPredicate() == FCmpInst::FCMP_TRUE) {
2304 switch (I.getPredicate()) {
2305 default: assert(0 && "Illegal FCmp predicate");
2306 case FCmpInst::FCMP_ORD: op = "ord"; break;
2307 case FCmpInst::FCMP_UNO: op = "uno"; break;
2308 case FCmpInst::FCMP_UEQ: op = "ueq"; break;
2309 case FCmpInst::FCMP_UNE: op = "une"; break;
2310 case FCmpInst::FCMP_ULT: op = "ult"; break;
2311 case FCmpInst::FCMP_ULE: op = "ule"; break;
2312 case FCmpInst::FCMP_UGT: op = "ugt"; break;
2313 case FCmpInst::FCMP_UGE: op = "uge"; break;
2314 case FCmpInst::FCMP_OEQ: op = "oeq"; break;
2315 case FCmpInst::FCMP_ONE: op = "one"; break;
2316 case FCmpInst::FCMP_OLT: op = "olt"; break;
2317 case FCmpInst::FCMP_OLE: op = "ole"; break;
2318 case FCmpInst::FCMP_OGT: op = "ogt"; break;
2319 case FCmpInst::FCMP_OGE: op = "oge"; break;
2322 Out << "llvm_fcmp_" << op << "(";
2323 // Write the first operand
2324 writeOperand(I.getOperand(0));
2326 // Write the second operand
2327 writeOperand(I.getOperand(1));
2331 static const char * getFloatBitCastField(const Type *Ty) {
2332 switch (Ty->getTypeID()) {
2333 default: assert(0 && "Invalid Type");
2334 case Type::FloatTyID: return "Float";
2335 case Type::DoubleTyID: return "Double";
2336 case Type::IntegerTyID: {
2337 unsigned NumBits = cast<IntegerType>(Ty)->getBitWidth();
2346 void CWriter::visitCastInst(CastInst &I) {
2347 const Type *DstTy = I.getType();
2348 const Type *SrcTy = I.getOperand(0)->getType();
2350 if (isFPIntBitCast(I)) {
2351 // These int<->float and long<->double casts need to be handled specially
2352 Out << GetValueName(&I) << "__BITCAST_TEMPORARY."
2353 << getFloatBitCastField(I.getOperand(0)->getType()) << " = ";
2354 writeOperand(I.getOperand(0));
2355 Out << ", " << GetValueName(&I) << "__BITCAST_TEMPORARY."
2356 << getFloatBitCastField(I.getType());
2358 printCast(I.getOpcode(), SrcTy, DstTy);
2359 if (I.getOpcode() == Instruction::SExt && SrcTy == Type::Int1Ty) {
2360 // Make sure we really get a sext from bool by subtracing the bool from 0
2363 writeOperand(I.getOperand(0));
2364 if (DstTy == Type::Int1Ty &&
2365 (I.getOpcode() == Instruction::Trunc ||
2366 I.getOpcode() == Instruction::FPToUI ||
2367 I.getOpcode() == Instruction::FPToSI ||
2368 I.getOpcode() == Instruction::PtrToInt)) {
2369 // Make sure we really get a trunc to bool by anding the operand with 1
2376 void CWriter::visitSelectInst(SelectInst &I) {
2378 writeOperand(I.getCondition());
2380 writeOperand(I.getTrueValue());
2382 writeOperand(I.getFalseValue());
2387 void CWriter::lowerIntrinsics(Function &F) {
2388 // This is used to keep track of intrinsics that get generated to a lowered
2389 // function. We must generate the prototypes before the function body which
2390 // will only be expanded on first use (by the loop below).
2391 std::vector<Function*> prototypesToGen;
2393 // Examine all the instructions in this function to find the intrinsics that
2394 // need to be lowered.
2395 for (Function::iterator BB = F.begin(), EE = F.end(); BB != EE; ++BB)
2396 for (BasicBlock::iterator I = BB->begin(), E = BB->end(); I != E; )
2397 if (CallInst *CI = dyn_cast<CallInst>(I++))
2398 if (Function *F = CI->getCalledFunction())
2399 switch (F->getIntrinsicID()) {
2400 case Intrinsic::not_intrinsic:
2401 case Intrinsic::vastart:
2402 case Intrinsic::vacopy:
2403 case Intrinsic::vaend:
2404 case Intrinsic::returnaddress:
2405 case Intrinsic::frameaddress:
2406 case Intrinsic::setjmp:
2407 case Intrinsic::longjmp:
2408 case Intrinsic::prefetch:
2409 case Intrinsic::dbg_stoppoint:
2410 case Intrinsic::powi_f32:
2411 case Intrinsic::powi_f64:
2412 // We directly implement these intrinsics
2415 // If this is an intrinsic that directly corresponds to a GCC
2416 // builtin, we handle it.
2417 const char *BuiltinName = "";
2418 #define GET_GCC_BUILTIN_NAME
2419 #include "llvm/Intrinsics.gen"
2420 #undef GET_GCC_BUILTIN_NAME
2421 // If we handle it, don't lower it.
2422 if (BuiltinName[0]) break;
2424 // All other intrinsic calls we must lower.
2425 Instruction *Before = 0;
2426 if (CI != &BB->front())
2427 Before = prior(BasicBlock::iterator(CI));
2429 IL->LowerIntrinsicCall(CI);
2430 if (Before) { // Move iterator to instruction after call
2435 // If the intrinsic got lowered to another call, and that call has
2436 // a definition then we need to make sure its prototype is emitted
2437 // before any calls to it.
2438 if (CallInst *Call = dyn_cast<CallInst>(I))
2439 if (Function *NewF = Call->getCalledFunction())
2440 if (!NewF->isDeclaration())
2441 prototypesToGen.push_back(NewF);
2446 // We may have collected some prototypes to emit in the loop above.
2447 // Emit them now, before the function that uses them is emitted. But,
2448 // be careful not to emit them twice.
2449 std::vector<Function*>::iterator I = prototypesToGen.begin();
2450 std::vector<Function*>::iterator E = prototypesToGen.end();
2451 for ( ; I != E; ++I) {
2452 if (intrinsicPrototypesAlreadyGenerated.insert(*I).second) {
2454 printFunctionSignature(*I, true);
2461 void CWriter::visitCallInst(CallInst &I) {
2462 //check if we have inline asm
2463 if (isInlineAsm(I)) {
2468 bool WroteCallee = false;
2470 // Handle intrinsic function calls first...
2471 if (Function *F = I.getCalledFunction())
2472 if (Intrinsic::ID ID = (Intrinsic::ID)F->getIntrinsicID()) {
2475 // If this is an intrinsic that directly corresponds to a GCC
2476 // builtin, we emit it here.
2477 const char *BuiltinName = "";
2478 #define GET_GCC_BUILTIN_NAME
2479 #include "llvm/Intrinsics.gen"
2480 #undef GET_GCC_BUILTIN_NAME
2481 assert(BuiltinName[0] && "Unknown LLVM intrinsic!");
2487 case Intrinsic::vastart:
2490 Out << "va_start(*(va_list*)";
2491 writeOperand(I.getOperand(1));
2493 // Output the last argument to the enclosing function...
2494 if (I.getParent()->getParent()->arg_empty()) {
2495 cerr << "The C backend does not currently support zero "
2496 << "argument varargs functions, such as '"
2497 << I.getParent()->getParent()->getName() << "'!\n";
2500 writeOperand(--I.getParent()->getParent()->arg_end());
2503 case Intrinsic::vaend:
2504 if (!isa<ConstantPointerNull>(I.getOperand(1))) {
2505 Out << "0; va_end(*(va_list*)";
2506 writeOperand(I.getOperand(1));
2509 Out << "va_end(*(va_list*)0)";
2512 case Intrinsic::vacopy:
2514 Out << "va_copy(*(va_list*)";
2515 writeOperand(I.getOperand(1));
2516 Out << ", *(va_list*)";
2517 writeOperand(I.getOperand(2));
2520 case Intrinsic::returnaddress:
2521 Out << "__builtin_return_address(";
2522 writeOperand(I.getOperand(1));
2525 case Intrinsic::frameaddress:
2526 Out << "__builtin_frame_address(";
2527 writeOperand(I.getOperand(1));
2530 case Intrinsic::powi_f32:
2531 case Intrinsic::powi_f64:
2532 Out << "__builtin_powi(";
2533 writeOperand(I.getOperand(1));
2535 writeOperand(I.getOperand(2));
2538 case Intrinsic::setjmp:
2539 Out << "setjmp(*(jmp_buf*)";
2540 writeOperand(I.getOperand(1));
2543 case Intrinsic::longjmp:
2544 Out << "longjmp(*(jmp_buf*)";
2545 writeOperand(I.getOperand(1));
2547 writeOperand(I.getOperand(2));
2550 case Intrinsic::prefetch:
2551 Out << "LLVM_PREFETCH((const void *)";
2552 writeOperand(I.getOperand(1));
2554 writeOperand(I.getOperand(2));
2556 writeOperand(I.getOperand(3));
2559 case Intrinsic::dbg_stoppoint: {
2560 // If we use writeOperand directly we get a "u" suffix which is rejected
2562 DbgStopPointInst &SPI = cast<DbgStopPointInst>(I);
2566 << " \"" << SPI.getDirectory()
2567 << SPI.getFileName() << "\"\n";
2573 Value *Callee = I.getCalledValue();
2575 const PointerType *PTy = cast<PointerType>(Callee->getType());
2576 const FunctionType *FTy = cast<FunctionType>(PTy->getElementType());
2578 // If this is a call to a struct-return function, assign to the first
2579 // parameter instead of passing it to the call.
2580 bool isStructRet = FTy->isStructReturn();
2583 writeOperand(I.getOperand(1));
2587 if (I.isTailCall()) Out << " /*tail*/ ";
2590 // If this is an indirect call to a struct return function, we need to cast
2592 bool NeedsCast = isStructRet && !isa<Function>(Callee);
2594 // GCC is a real PITA. It does not permit codegening casts of functions to
2595 // function pointers if they are in a call (it generates a trap instruction
2596 // instead!). We work around this by inserting a cast to void* in between
2597 // the function and the function pointer cast. Unfortunately, we can't just
2598 // form the constant expression here, because the folder will immediately
2601 // Note finally, that this is completely unsafe. ANSI C does not guarantee
2602 // that void* and function pointers have the same size. :( To deal with this
2603 // in the common case, we handle casts where the number of arguments passed
2606 if (ConstantExpr *CE = dyn_cast<ConstantExpr>(Callee))
2608 if (Function *RF = dyn_cast<Function>(CE->getOperand(0))) {
2614 // Ok, just cast the pointer type.
2617 printType(Out, I.getCalledValue()->getType());
2619 printStructReturnPointerFunctionType(Out,
2620 cast<PointerType>(I.getCalledValue()->getType()));
2623 writeOperand(Callee);
2624 if (NeedsCast) Out << ')';
2629 unsigned NumDeclaredParams = FTy->getNumParams();
2631 CallSite::arg_iterator AI = I.op_begin()+1, AE = I.op_end();
2633 if (isStructRet) { // Skip struct return argument.
2638 const ParamAttrsList *Attrs = FTy->getParamAttrs();
2639 bool PrintedArg = false;
2641 for (; AI != AE; ++AI, ++ArgNo, ++Idx) {
2642 if (PrintedArg) Out << ", ";
2643 if (ArgNo < NumDeclaredParams &&
2644 (*AI)->getType() != FTy->getParamType(ArgNo)) {
2646 printType(Out, FTy->getParamType(ArgNo),
2647 /*isSigned=*/Attrs && Attrs->paramHasAttr(Idx, ParamAttr::SExt));
2657 //This converts the llvm constraint string to something gcc is expecting.
2658 //TODO: work out platform independent constraints and factor those out
2659 // of the per target tables
2660 // handle multiple constraint codes
2661 std::string CWriter::InterpretASMConstraint(InlineAsm::ConstraintInfo& c) {
2663 assert(c.Codes.size() == 1 && "Too many asm constraint codes to handle");
2665 const char** table = 0;
2667 //Grab the translation table from TargetAsmInfo if it exists
2670 const TargetMachineRegistry::Entry* Match =
2671 TargetMachineRegistry::getClosestStaticTargetForModule(*TheModule, E);
2673 //Per platform Target Machines don't exist, so create it
2674 // this must be done only once
2675 const TargetMachine* TM = Match->CtorFn(*TheModule, "");
2676 TAsm = TM->getTargetAsmInfo();
2680 table = TAsm->getAsmCBE();
2682 //Search the translation table if it exists
2683 for (int i = 0; table && table[i]; i += 2)
2684 if (c.Codes[0] == table[i])
2687 //default is identity
2691 //TODO: import logic from AsmPrinter.cpp
2692 static std::string gccifyAsm(std::string asmstr) {
2693 for (std::string::size_type i = 0; i != asmstr.size(); ++i)
2694 if (asmstr[i] == '\n')
2695 asmstr.replace(i, 1, "\\n");
2696 else if (asmstr[i] == '\t')
2697 asmstr.replace(i, 1, "\\t");
2698 else if (asmstr[i] == '$') {
2699 if (asmstr[i + 1] == '{') {
2700 std::string::size_type a = asmstr.find_first_of(':', i + 1);
2701 std::string::size_type b = asmstr.find_first_of('}', i + 1);
2702 std::string n = "%" +
2703 asmstr.substr(a + 1, b - a - 1) +
2704 asmstr.substr(i + 2, a - i - 2);
2705 asmstr.replace(i, b - i + 1, n);
2708 asmstr.replace(i, 1, "%");
2710 else if (asmstr[i] == '%')//grr
2711 { asmstr.replace(i, 1, "%%"); ++i;}
2716 //TODO: assumptions about what consume arguments from the call are likely wrong
2717 // handle communitivity
2718 void CWriter::visitInlineAsm(CallInst &CI) {
2719 InlineAsm* as = cast<InlineAsm>(CI.getOperand(0));
2720 std::vector<InlineAsm::ConstraintInfo> Constraints = as->ParseConstraints();
2721 std::vector<std::pair<std::string, Value*> > Input;
2722 std::vector<std::pair<std::string, Value*> > Output;
2723 std::string Clobber;
2724 int count = CI.getType() == Type::VoidTy ? 1 : 0;
2725 for (std::vector<InlineAsm::ConstraintInfo>::iterator I = Constraints.begin(),
2726 E = Constraints.end(); I != E; ++I) {
2727 assert(I->Codes.size() == 1 && "Too many asm constraint codes to handle");
2729 InterpretASMConstraint(*I);
2732 assert(0 && "Unknown asm constraint");
2734 case InlineAsm::isInput: {
2736 Input.push_back(std::make_pair(c, count ? CI.getOperand(count) : &CI));
2737 ++count; //consume arg
2741 case InlineAsm::isOutput: {
2743 Output.push_back(std::make_pair("="+((I->isEarlyClobber ? "&" : "")+c),
2744 count ? CI.getOperand(count) : &CI));
2745 ++count; //consume arg
2749 case InlineAsm::isClobber: {
2751 Clobber += ",\"" + c + "\"";
2757 //fix up the asm string for gcc
2758 std::string asmstr = gccifyAsm(as->getAsmString());
2760 Out << "__asm__ volatile (\"" << asmstr << "\"\n";
2762 for (std::vector<std::pair<std::string, Value*> >::iterator I = Output.begin(),
2763 E = Output.end(); I != E; ++I) {
2764 Out << "\"" << I->first << "\"(";
2765 writeOperandRaw(I->second);
2771 for (std::vector<std::pair<std::string, Value*> >::iterator I = Input.begin(),
2772 E = Input.end(); I != E; ++I) {
2773 Out << "\"" << I->first << "\"(";
2774 writeOperandRaw(I->second);
2780 Out << "\n :" << Clobber.substr(1);
2784 void CWriter::visitMallocInst(MallocInst &I) {
2785 assert(0 && "lowerallocations pass didn't work!");
2788 void CWriter::visitAllocaInst(AllocaInst &I) {
2790 printType(Out, I.getType());
2791 Out << ") alloca(sizeof(";
2792 printType(Out, I.getType()->getElementType());
2794 if (I.isArrayAllocation()) {
2796 writeOperand(I.getOperand(0));
2801 void CWriter::visitFreeInst(FreeInst &I) {
2802 assert(0 && "lowerallocations pass didn't work!");
2805 void CWriter::printIndexingExpression(Value *Ptr, gep_type_iterator I,
2806 gep_type_iterator E) {
2807 bool HasImplicitAddress = false;
2808 // If accessing a global value with no indexing, avoid *(&GV) syndrome
2809 if (isa<GlobalValue>(Ptr)) {
2810 HasImplicitAddress = true;
2811 } else if (isDirectAlloca(Ptr)) {
2812 HasImplicitAddress = true;
2816 if (!HasImplicitAddress)
2817 Out << '*'; // Implicit zero first argument: '*x' is equivalent to 'x[0]'
2819 writeOperandInternal(Ptr);
2823 const Constant *CI = dyn_cast<Constant>(I.getOperand());
2824 if (HasImplicitAddress && (!CI || !CI->isNullValue()))
2827 writeOperandInternal(Ptr);
2829 if (HasImplicitAddress && (!CI || !CI->isNullValue())) {
2831 HasImplicitAddress = false; // HIA is only true if we haven't addressed yet
2834 assert(!HasImplicitAddress || (CI && CI->isNullValue()) &&
2835 "Can only have implicit address with direct accessing");
2837 if (HasImplicitAddress) {
2839 } else if (CI && CI->isNullValue()) {
2840 gep_type_iterator TmpI = I; ++TmpI;
2842 // Print out the -> operator if possible...
2843 if (TmpI != E && isa<StructType>(*TmpI)) {
2844 Out << (HasImplicitAddress ? "." : "->");
2845 Out << "field" << cast<ConstantInt>(TmpI.getOperand())->getZExtValue();
2851 if (isa<StructType>(*I)) {
2852 Out << ".field" << cast<ConstantInt>(I.getOperand())->getZExtValue();
2855 writeOperand(I.getOperand());
2860 void CWriter::visitLoadInst(LoadInst &I) {
2862 if (I.isVolatile()) {
2864 printType(Out, I.getType(), false, "volatile*");
2868 writeOperand(I.getOperand(0));
2874 void CWriter::visitStoreInst(StoreInst &I) {
2876 if (I.isVolatile()) {
2878 printType(Out, I.getOperand(0)->getType(), false, " volatile*");
2881 writeOperand(I.getPointerOperand());
2882 if (I.isVolatile()) Out << ')';
2884 Value *Operand = I.getOperand(0);
2885 Constant *BitMask = 0;
2886 if (const IntegerType* ITy = dyn_cast<IntegerType>(Operand->getType()))
2887 if (!ITy->isPowerOf2ByteWidth())
2888 // We have a bit width that doesn't match an even power-of-2 byte
2889 // size. Consequently we must & the value with the type's bit mask
2890 BitMask = ConstantInt::get(ITy, ITy->getBitMask());
2893 writeOperand(Operand);
2896 printConstant(BitMask);
2901 void CWriter::visitGetElementPtrInst(GetElementPtrInst &I) {
2903 printIndexingExpression(I.getPointerOperand(), gep_type_begin(I),
2907 void CWriter::visitVAArgInst(VAArgInst &I) {
2908 Out << "va_arg(*(va_list*)";
2909 writeOperand(I.getOperand(0));
2911 printType(Out, I.getType());
2915 //===----------------------------------------------------------------------===//
2916 // External Interface declaration
2917 //===----------------------------------------------------------------------===//
2919 bool CTargetMachine::addPassesToEmitWholeFile(PassManager &PM,
2921 CodeGenFileType FileType,
2923 if (FileType != TargetMachine::AssemblyFile) return true;
2925 PM.add(createLowerGCPass());
2926 PM.add(createLowerAllocationsPass(true));
2927 PM.add(createLowerInvokePass());
2928 PM.add(createCFGSimplificationPass()); // clean up after lower invoke.
2929 PM.add(new CBackendNameAllUsedStructsAndMergeFunctions());
2930 PM.add(new CWriter(o));