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, const ICmpInst &I);
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;
409 // Lacking emulation of FP80 on PPC, etc., we assume whichever of these is
410 // present matches host 'long double'.
411 case Type::X86_FP80TyID:
412 case Type::PPC_FP128TyID:
413 case Type::FP128TyID: return Out << "long double " << NameSoFar;
415 cerr << "Unknown primitive type: " << *Ty << "\n";
420 // Pass the Type* and the variable name and this prints out the variable
423 std::ostream &CWriter::printType(std::ostream &Out, const Type *Ty,
424 bool isSigned, const std::string &NameSoFar,
426 if (Ty->isPrimitiveType() || Ty->isInteger()) {
427 printSimpleType(Out, Ty, isSigned, NameSoFar);
431 // Check to see if the type is named.
432 if (!IgnoreName || isa<OpaqueType>(Ty)) {
433 std::map<const Type *, std::string>::iterator I = TypeNames.find(Ty);
434 if (I != TypeNames.end()) return Out << I->second << ' ' << NameSoFar;
437 switch (Ty->getTypeID()) {
438 case Type::FunctionTyID: {
439 const FunctionType *FTy = cast<FunctionType>(Ty);
440 std::stringstream FunctionInnards;
441 FunctionInnards << " (" << NameSoFar << ") (";
442 const ParamAttrsList *Attrs = FTy->getParamAttrs();
444 for (FunctionType::param_iterator I = FTy->param_begin(),
445 E = FTy->param_end(); I != E; ++I) {
446 if (I != FTy->param_begin())
447 FunctionInnards << ", ";
448 printType(FunctionInnards, *I,
449 /*isSigned=*/Attrs && Attrs->paramHasAttr(Idx, ParamAttr::SExt), "");
452 if (FTy->isVarArg()) {
453 if (FTy->getNumParams())
454 FunctionInnards << ", ...";
455 } else if (!FTy->getNumParams()) {
456 FunctionInnards << "void";
458 FunctionInnards << ')';
459 std::string tstr = FunctionInnards.str();
460 printType(Out, FTy->getReturnType(),
461 /*isSigned=*/Attrs && Attrs->paramHasAttr(0, ParamAttr::SExt), tstr);
464 case Type::StructTyID: {
465 const StructType *STy = cast<StructType>(Ty);
466 Out << NameSoFar + " {\n";
468 for (StructType::element_iterator I = STy->element_begin(),
469 E = STy->element_end(); I != E; ++I) {
471 printType(Out, *I, false, "field" + utostr(Idx++));
476 Out << " __attribute__ ((packed))";
480 case Type::PointerTyID: {
481 const PointerType *PTy = cast<PointerType>(Ty);
482 std::string ptrName = "*" + NameSoFar;
484 if (isa<ArrayType>(PTy->getElementType()) ||
485 isa<VectorType>(PTy->getElementType()))
486 ptrName = "(" + ptrName + ")";
488 return printType(Out, PTy->getElementType(), false, ptrName);
491 case Type::ArrayTyID: {
492 const ArrayType *ATy = cast<ArrayType>(Ty);
493 unsigned NumElements = ATy->getNumElements();
494 if (NumElements == 0) NumElements = 1;
495 return printType(Out, ATy->getElementType(), false,
496 NameSoFar + "[" + utostr(NumElements) + "]");
499 case Type::VectorTyID: {
500 const VectorType *PTy = cast<VectorType>(Ty);
501 unsigned NumElements = PTy->getNumElements();
502 if (NumElements == 0) NumElements = 1;
503 return printType(Out, PTy->getElementType(), false,
504 NameSoFar + "[" + utostr(NumElements) + "]");
507 case Type::OpaqueTyID: {
508 static int Count = 0;
509 std::string TyName = "struct opaque_" + itostr(Count++);
510 assert(TypeNames.find(Ty) == TypeNames.end());
511 TypeNames[Ty] = TyName;
512 return Out << TyName << ' ' << NameSoFar;
515 assert(0 && "Unhandled case in getTypeProps!");
522 void CWriter::printConstantArray(ConstantArray *CPA) {
524 // As a special case, print the array as a string if it is an array of
525 // ubytes or an array of sbytes with positive values.
527 const Type *ETy = CPA->getType()->getElementType();
528 bool isString = (ETy == Type::Int8Ty || ETy == Type::Int8Ty);
530 // Make sure the last character is a null char, as automatically added by C
531 if (isString && (CPA->getNumOperands() == 0 ||
532 !cast<Constant>(*(CPA->op_end()-1))->isNullValue()))
537 // Keep track of whether the last number was a hexadecimal escape
538 bool LastWasHex = false;
540 // Do not include the last character, which we know is null
541 for (unsigned i = 0, e = CPA->getNumOperands()-1; i != e; ++i) {
542 unsigned char C = cast<ConstantInt>(CPA->getOperand(i))->getZExtValue();
544 // Print it out literally if it is a printable character. The only thing
545 // to be careful about is when the last letter output was a hex escape
546 // code, in which case we have to be careful not to print out hex digits
547 // explicitly (the C compiler thinks it is a continuation of the previous
548 // character, sheesh...)
550 if (isprint(C) && (!LastWasHex || !isxdigit(C))) {
552 if (C == '"' || C == '\\')
559 case '\n': Out << "\\n"; break;
560 case '\t': Out << "\\t"; break;
561 case '\r': Out << "\\r"; break;
562 case '\v': Out << "\\v"; break;
563 case '\a': Out << "\\a"; break;
564 case '\"': Out << "\\\""; break;
565 case '\'': Out << "\\\'"; break;
568 Out << (char)(( C/16 < 10) ? ( C/16 +'0') : ( C/16 -10+'A'));
569 Out << (char)(((C&15) < 10) ? ((C&15)+'0') : ((C&15)-10+'A'));
578 if (CPA->getNumOperands()) {
580 printConstant(cast<Constant>(CPA->getOperand(0)));
581 for (unsigned i = 1, e = CPA->getNumOperands(); i != e; ++i) {
583 printConstant(cast<Constant>(CPA->getOperand(i)));
590 void CWriter::printConstantVector(ConstantVector *CP) {
592 if (CP->getNumOperands()) {
594 printConstant(cast<Constant>(CP->getOperand(0)));
595 for (unsigned i = 1, e = CP->getNumOperands(); i != e; ++i) {
597 printConstant(cast<Constant>(CP->getOperand(i)));
603 // isFPCSafeToPrint - Returns true if we may assume that CFP may be written out
604 // textually as a double (rather than as a reference to a stack-allocated
605 // variable). We decide this by converting CFP to a string and back into a
606 // double, and then checking whether the conversion results in a bit-equal
607 // double to the original value of CFP. This depends on us and the target C
608 // compiler agreeing on the conversion process (which is pretty likely since we
609 // only deal in IEEE FP).
611 static bool isFPCSafeToPrint(const ConstantFP *CFP) {
612 // Do long doubles in hex for now.
613 if (CFP->getType()!=Type::FloatTy && CFP->getType()!=Type::DoubleTy)
615 APFloat APF = APFloat(CFP->getValueAPF()); // copy
616 if (CFP->getType()==Type::FloatTy)
617 APF.convert(APFloat::IEEEdouble, APFloat::rmNearestTiesToEven);
618 #if HAVE_PRINTF_A && ENABLE_CBE_PRINTF_A
620 sprintf(Buffer, "%a", APF.convertToDouble());
621 if (!strncmp(Buffer, "0x", 2) ||
622 !strncmp(Buffer, "-0x", 3) ||
623 !strncmp(Buffer, "+0x", 3))
624 return APF.bitwiseIsEqual(APFloat(atof(Buffer)));
627 std::string StrVal = ftostr(APF);
629 while (StrVal[0] == ' ')
630 StrVal.erase(StrVal.begin());
632 // Check to make sure that the stringized number is not some string like "Inf"
633 // or NaN. Check that the string matches the "[-+]?[0-9]" regex.
634 if ((StrVal[0] >= '0' && StrVal[0] <= '9') ||
635 ((StrVal[0] == '-' || StrVal[0] == '+') &&
636 (StrVal[1] >= '0' && StrVal[1] <= '9')))
637 // Reparse stringized version!
638 return APF.bitwiseIsEqual(APFloat(atof(StrVal.c_str())));
643 /// Print out the casting for a cast operation. This does the double casting
644 /// necessary for conversion to the destination type, if necessary.
645 /// @brief Print a cast
646 void CWriter::printCast(unsigned opc, const Type *SrcTy, const Type *DstTy) {
647 // Print the destination type cast
649 case Instruction::UIToFP:
650 case Instruction::SIToFP:
651 case Instruction::IntToPtr:
652 case Instruction::Trunc:
653 case Instruction::BitCast:
654 case Instruction::FPExt:
655 case Instruction::FPTrunc: // For these the DstTy sign doesn't matter
657 printType(Out, DstTy);
660 case Instruction::ZExt:
661 case Instruction::PtrToInt:
662 case Instruction::FPToUI: // For these, make sure we get an unsigned dest
664 printSimpleType(Out, DstTy, false);
667 case Instruction::SExt:
668 case Instruction::FPToSI: // For these, make sure we get a signed dest
670 printSimpleType(Out, DstTy, true);
674 assert(0 && "Invalid cast opcode");
677 // Print the source type cast
679 case Instruction::UIToFP:
680 case Instruction::ZExt:
682 printSimpleType(Out, SrcTy, false);
685 case Instruction::SIToFP:
686 case Instruction::SExt:
688 printSimpleType(Out, SrcTy, true);
691 case Instruction::IntToPtr:
692 case Instruction::PtrToInt:
693 // Avoid "cast to pointer from integer of different size" warnings
694 Out << "(unsigned long)";
696 case Instruction::Trunc:
697 case Instruction::BitCast:
698 case Instruction::FPExt:
699 case Instruction::FPTrunc:
700 case Instruction::FPToSI:
701 case Instruction::FPToUI:
702 break; // These don't need a source cast.
704 assert(0 && "Invalid cast opcode");
709 // printConstant - The LLVM Constant to C Constant converter.
710 void CWriter::printConstant(Constant *CPV) {
711 if (const ConstantExpr *CE = dyn_cast<ConstantExpr>(CPV)) {
712 switch (CE->getOpcode()) {
713 case Instruction::Trunc:
714 case Instruction::ZExt:
715 case Instruction::SExt:
716 case Instruction::FPTrunc:
717 case Instruction::FPExt:
718 case Instruction::UIToFP:
719 case Instruction::SIToFP:
720 case Instruction::FPToUI:
721 case Instruction::FPToSI:
722 case Instruction::PtrToInt:
723 case Instruction::IntToPtr:
724 case Instruction::BitCast:
726 printCast(CE->getOpcode(), CE->getOperand(0)->getType(), CE->getType());
727 if (CE->getOpcode() == Instruction::SExt &&
728 CE->getOperand(0)->getType() == Type::Int1Ty) {
729 // Make sure we really sext from bool here by subtracting from 0
732 printConstant(CE->getOperand(0));
733 if (CE->getType() == Type::Int1Ty &&
734 (CE->getOpcode() == Instruction::Trunc ||
735 CE->getOpcode() == Instruction::FPToUI ||
736 CE->getOpcode() == Instruction::FPToSI ||
737 CE->getOpcode() == Instruction::PtrToInt)) {
738 // Make sure we really truncate to bool here by anding with 1
744 case Instruction::GetElementPtr:
746 printIndexingExpression(CE->getOperand(0), gep_type_begin(CPV),
750 case Instruction::Select:
752 printConstant(CE->getOperand(0));
754 printConstant(CE->getOperand(1));
756 printConstant(CE->getOperand(2));
759 case Instruction::Add:
760 case Instruction::Sub:
761 case Instruction::Mul:
762 case Instruction::SDiv:
763 case Instruction::UDiv:
764 case Instruction::FDiv:
765 case Instruction::URem:
766 case Instruction::SRem:
767 case Instruction::FRem:
768 case Instruction::And:
769 case Instruction::Or:
770 case Instruction::Xor:
771 case Instruction::ICmp:
772 case Instruction::Shl:
773 case Instruction::LShr:
774 case Instruction::AShr:
777 bool NeedsClosingParens = printConstExprCast(CE);
778 printConstantWithCast(CE->getOperand(0), CE->getOpcode());
779 switch (CE->getOpcode()) {
780 case Instruction::Add: Out << " + "; break;
781 case Instruction::Sub: Out << " - "; break;
782 case Instruction::Mul: Out << " * "; break;
783 case Instruction::URem:
784 case Instruction::SRem:
785 case Instruction::FRem: Out << " % "; break;
786 case Instruction::UDiv:
787 case Instruction::SDiv:
788 case Instruction::FDiv: Out << " / "; break;
789 case Instruction::And: Out << " & "; break;
790 case Instruction::Or: Out << " | "; break;
791 case Instruction::Xor: Out << " ^ "; break;
792 case Instruction::Shl: Out << " << "; break;
793 case Instruction::LShr:
794 case Instruction::AShr: Out << " >> "; break;
795 case Instruction::ICmp:
796 switch (CE->getPredicate()) {
797 case ICmpInst::ICMP_EQ: Out << " == "; break;
798 case ICmpInst::ICMP_NE: Out << " != "; break;
799 case ICmpInst::ICMP_SLT:
800 case ICmpInst::ICMP_ULT: Out << " < "; break;
801 case ICmpInst::ICMP_SLE:
802 case ICmpInst::ICMP_ULE: Out << " <= "; break;
803 case ICmpInst::ICMP_SGT:
804 case ICmpInst::ICMP_UGT: Out << " > "; break;
805 case ICmpInst::ICMP_SGE:
806 case ICmpInst::ICMP_UGE: Out << " >= "; break;
807 default: assert(0 && "Illegal ICmp predicate");
810 default: assert(0 && "Illegal opcode here!");
812 printConstantWithCast(CE->getOperand(1), CE->getOpcode());
813 if (NeedsClosingParens)
818 case Instruction::FCmp: {
820 bool NeedsClosingParens = printConstExprCast(CE);
821 if (CE->getPredicate() == FCmpInst::FCMP_FALSE)
823 else if (CE->getPredicate() == FCmpInst::FCMP_TRUE)
827 switch (CE->getPredicate()) {
828 default: assert(0 && "Illegal FCmp predicate");
829 case FCmpInst::FCMP_ORD: op = "ord"; break;
830 case FCmpInst::FCMP_UNO: op = "uno"; break;
831 case FCmpInst::FCMP_UEQ: op = "ueq"; break;
832 case FCmpInst::FCMP_UNE: op = "une"; break;
833 case FCmpInst::FCMP_ULT: op = "ult"; break;
834 case FCmpInst::FCMP_ULE: op = "ule"; break;
835 case FCmpInst::FCMP_UGT: op = "ugt"; break;
836 case FCmpInst::FCMP_UGE: op = "uge"; break;
837 case FCmpInst::FCMP_OEQ: op = "oeq"; break;
838 case FCmpInst::FCMP_ONE: op = "one"; break;
839 case FCmpInst::FCMP_OLT: op = "olt"; break;
840 case FCmpInst::FCMP_OLE: op = "ole"; break;
841 case FCmpInst::FCMP_OGT: op = "ogt"; break;
842 case FCmpInst::FCMP_OGE: op = "oge"; break;
844 Out << "llvm_fcmp_" << op << "(";
845 printConstantWithCast(CE->getOperand(0), CE->getOpcode());
847 printConstantWithCast(CE->getOperand(1), CE->getOpcode());
850 if (NeedsClosingParens)
855 cerr << "CWriter Error: Unhandled constant expression: "
859 } else if (isa<UndefValue>(CPV) && CPV->getType()->isFirstClassType()) {
861 printType(Out, CPV->getType()); // sign doesn't matter
862 Out << ")/*UNDEF*/0)";
866 if (ConstantInt *CI = dyn_cast<ConstantInt>(CPV)) {
867 const Type* Ty = CI->getType();
868 if (Ty == Type::Int1Ty)
869 Out << (CI->getZExtValue() ? '1' : '0') ;
872 printSimpleType(Out, Ty, false) << ')';
873 if (CI->isMinValue(true))
874 Out << CI->getZExtValue() << 'u';
876 Out << CI->getSExtValue();
877 if (Ty->getPrimitiveSizeInBits() > 32)
884 switch (CPV->getType()->getTypeID()) {
885 case Type::FloatTyID:
886 case Type::DoubleTyID:
887 case Type::X86_FP80TyID:
888 case Type::PPC_FP128TyID:
889 case Type::FP128TyID: {
890 ConstantFP *FPC = cast<ConstantFP>(CPV);
891 std::map<const ConstantFP*, unsigned>::iterator I = FPConstantMap.find(FPC);
892 if (I != FPConstantMap.end()) {
893 // Because of FP precision problems we must load from a stack allocated
894 // value that holds the value in hex.
895 Out << "(*(" << (FPC->getType() == Type::FloatTy ? "float" :
896 FPC->getType() == Type::DoubleTy ? "double" :
898 << "*)&FPConstant" << I->second << ')';
900 assert(FPC->getType() == Type::FloatTy ||
901 FPC->getType() == Type::DoubleTy);
902 double V = FPC->getType() == Type::FloatTy ?
903 FPC->getValueAPF().convertToFloat() :
904 FPC->getValueAPF().convertToDouble();
908 // FIXME the actual NaN bits should be emitted.
909 // The prefix for a quiet NaN is 0x7FF8. For a signalling NaN,
911 const unsigned long QuietNaN = 0x7ff8UL;
912 //const unsigned long SignalNaN = 0x7ff4UL;
914 // We need to grab the first part of the FP #
917 uint64_t ll = DoubleToBits(V);
918 sprintf(Buffer, "0x%llx", static_cast<long long>(ll));
920 std::string Num(&Buffer[0], &Buffer[6]);
921 unsigned long Val = strtoul(Num.c_str(), 0, 16);
923 if (FPC->getType() == Type::FloatTy)
924 Out << "LLVM_NAN" << (Val == QuietNaN ? "" : "S") << "F(\""
925 << Buffer << "\") /*nan*/ ";
927 Out << "LLVM_NAN" << (Val == QuietNaN ? "" : "S") << "(\""
928 << Buffer << "\") /*nan*/ ";
929 } else if (IsInf(V)) {
931 if (V < 0) Out << '-';
932 Out << "LLVM_INF" << (FPC->getType() == Type::FloatTy ? "F" : "")
936 #if HAVE_PRINTF_A && ENABLE_CBE_PRINTF_A
937 // Print out the constant as a floating point number.
939 sprintf(Buffer, "%a", V);
942 Num = ftostr(FPC->getValueAPF());
950 case Type::ArrayTyID:
951 if (isa<ConstantAggregateZero>(CPV) || isa<UndefValue>(CPV)) {
952 const ArrayType *AT = cast<ArrayType>(CPV->getType());
954 if (AT->getNumElements()) {
956 Constant *CZ = Constant::getNullValue(AT->getElementType());
958 for (unsigned i = 1, e = AT->getNumElements(); i != e; ++i) {
965 printConstantArray(cast<ConstantArray>(CPV));
969 case Type::VectorTyID:
970 if (isa<ConstantAggregateZero>(CPV) || isa<UndefValue>(CPV)) {
971 const VectorType *AT = cast<VectorType>(CPV->getType());
973 if (AT->getNumElements()) {
975 Constant *CZ = Constant::getNullValue(AT->getElementType());
977 for (unsigned i = 1, e = AT->getNumElements(); i != e; ++i) {
984 printConstantVector(cast<ConstantVector>(CPV));
988 case Type::StructTyID:
989 if (isa<ConstantAggregateZero>(CPV) || isa<UndefValue>(CPV)) {
990 const StructType *ST = cast<StructType>(CPV->getType());
992 if (ST->getNumElements()) {
994 printConstant(Constant::getNullValue(ST->getElementType(0)));
995 for (unsigned i = 1, e = ST->getNumElements(); i != e; ++i) {
997 printConstant(Constant::getNullValue(ST->getElementType(i)));
1003 if (CPV->getNumOperands()) {
1005 printConstant(cast<Constant>(CPV->getOperand(0)));
1006 for (unsigned i = 1, e = CPV->getNumOperands(); i != e; ++i) {
1008 printConstant(cast<Constant>(CPV->getOperand(i)));
1015 case Type::PointerTyID:
1016 if (isa<ConstantPointerNull>(CPV)) {
1018 printType(Out, CPV->getType()); // sign doesn't matter
1019 Out << ")/*NULL*/0)";
1021 } else if (GlobalValue *GV = dyn_cast<GlobalValue>(CPV)) {
1027 cerr << "Unknown constant type: " << *CPV << "\n";
1032 // Some constant expressions need to be casted back to the original types
1033 // because their operands were casted to the expected type. This function takes
1034 // care of detecting that case and printing the cast for the ConstantExpr.
1035 bool CWriter::printConstExprCast(const ConstantExpr* CE) {
1036 bool NeedsExplicitCast = false;
1037 const Type *Ty = CE->getOperand(0)->getType();
1038 bool TypeIsSigned = false;
1039 switch (CE->getOpcode()) {
1040 case Instruction::LShr:
1041 case Instruction::URem:
1042 case Instruction::UDiv: NeedsExplicitCast = true; break;
1043 case Instruction::AShr:
1044 case Instruction::SRem:
1045 case Instruction::SDiv: NeedsExplicitCast = true; TypeIsSigned = true; break;
1046 case Instruction::SExt:
1048 NeedsExplicitCast = true;
1049 TypeIsSigned = true;
1051 case Instruction::ZExt:
1052 case Instruction::Trunc:
1053 case Instruction::FPTrunc:
1054 case Instruction::FPExt:
1055 case Instruction::UIToFP:
1056 case Instruction::SIToFP:
1057 case Instruction::FPToUI:
1058 case Instruction::FPToSI:
1059 case Instruction::PtrToInt:
1060 case Instruction::IntToPtr:
1061 case Instruction::BitCast:
1063 NeedsExplicitCast = true;
1067 if (NeedsExplicitCast) {
1069 if (Ty->isInteger() && Ty != Type::Int1Ty)
1070 printSimpleType(Out, Ty, TypeIsSigned);
1072 printType(Out, Ty); // not integer, sign doesn't matter
1075 return NeedsExplicitCast;
1078 // Print a constant assuming that it is the operand for a given Opcode. The
1079 // opcodes that care about sign need to cast their operands to the expected
1080 // type before the operation proceeds. This function does the casting.
1081 void CWriter::printConstantWithCast(Constant* CPV, unsigned Opcode) {
1083 // Extract the operand's type, we'll need it.
1084 const Type* OpTy = CPV->getType();
1086 // Indicate whether to do the cast or not.
1087 bool shouldCast = false;
1088 bool typeIsSigned = false;
1090 // Based on the Opcode for which this Constant is being written, determine
1091 // the new type to which the operand should be casted by setting the value
1092 // of OpTy. If we change OpTy, also set shouldCast to true so it gets
1096 // for most instructions, it doesn't matter
1098 case Instruction::LShr:
1099 case Instruction::UDiv:
1100 case Instruction::URem:
1103 case Instruction::AShr:
1104 case Instruction::SDiv:
1105 case Instruction::SRem:
1107 typeIsSigned = true;
1111 // Write out the casted constant if we should, otherwise just write the
1115 printSimpleType(Out, OpTy, typeIsSigned);
1123 std::string CWriter::GetValueName(const Value *Operand) {
1126 if (!isa<GlobalValue>(Operand) && Operand->getName() != "") {
1127 std::string VarName;
1129 Name = Operand->getName();
1130 VarName.reserve(Name.capacity());
1132 for (std::string::iterator I = Name.begin(), E = Name.end();
1136 if (!((ch >= 'a' && ch <= 'z') || (ch >= 'A' && ch <= 'Z') ||
1137 (ch >= '0' && ch <= '9') || ch == '_'))
1143 Name = "llvm_cbe_" + VarName;
1145 Name = Mang->getValueName(Operand);
1151 void CWriter::writeOperandInternal(Value *Operand) {
1152 if (Instruction *I = dyn_cast<Instruction>(Operand))
1153 if (isInlinableInst(*I) && !isDirectAlloca(I)) {
1154 // Should we inline this instruction to build a tree?
1161 Constant* CPV = dyn_cast<Constant>(Operand);
1163 if (CPV && !isa<GlobalValue>(CPV))
1166 Out << GetValueName(Operand);
1169 void CWriter::writeOperandRaw(Value *Operand) {
1170 Constant* CPV = dyn_cast<Constant>(Operand);
1171 if (CPV && !isa<GlobalValue>(CPV)) {
1174 Out << GetValueName(Operand);
1178 void CWriter::writeOperand(Value *Operand) {
1179 if (isa<GlobalVariable>(Operand) || isDirectAlloca(Operand))
1180 Out << "(&"; // Global variables are referenced as their addresses by llvm
1182 writeOperandInternal(Operand);
1184 if (isa<GlobalVariable>(Operand) || isDirectAlloca(Operand))
1188 // Some instructions need to have their result value casted back to the
1189 // original types because their operands were casted to the expected type.
1190 // This function takes care of detecting that case and printing the cast
1191 // for the Instruction.
1192 bool CWriter::writeInstructionCast(const Instruction &I) {
1193 const Type *Ty = I.getOperand(0)->getType();
1194 switch (I.getOpcode()) {
1195 case Instruction::LShr:
1196 case Instruction::URem:
1197 case Instruction::UDiv:
1199 printSimpleType(Out, Ty, false);
1202 case Instruction::AShr:
1203 case Instruction::SRem:
1204 case Instruction::SDiv:
1206 printSimpleType(Out, Ty, true);
1214 // Write the operand with a cast to another type based on the Opcode being used.
1215 // This will be used in cases where an instruction has specific type
1216 // requirements (usually signedness) for its operands.
1217 void CWriter::writeOperandWithCast(Value* Operand, unsigned Opcode) {
1219 // Extract the operand's type, we'll need it.
1220 const Type* OpTy = Operand->getType();
1222 // Indicate whether to do the cast or not.
1223 bool shouldCast = false;
1225 // Indicate whether the cast should be to a signed type or not.
1226 bool castIsSigned = false;
1228 // Based on the Opcode for which this Operand is being written, determine
1229 // the new type to which the operand should be casted by setting the value
1230 // of OpTy. If we change OpTy, also set shouldCast to true.
1233 // for most instructions, it doesn't matter
1235 case Instruction::LShr:
1236 case Instruction::UDiv:
1237 case Instruction::URem: // Cast to unsigned first
1239 castIsSigned = false;
1241 case Instruction::AShr:
1242 case Instruction::SDiv:
1243 case Instruction::SRem: // Cast to signed first
1245 castIsSigned = true;
1249 // Write out the casted operand if we should, otherwise just write the
1253 printSimpleType(Out, OpTy, castIsSigned);
1255 writeOperand(Operand);
1258 writeOperand(Operand);
1261 // Write the operand with a cast to another type based on the icmp predicate
1263 void CWriter::writeOperandWithCast(Value* Operand, const ICmpInst &Cmp) {
1264 // This has to do a cast to ensure the operand has the right signedness.
1265 // Also, if the operand is a pointer, we make sure to cast to an integer when
1266 // doing the comparison both for signedness and so that the C compiler doesn't
1267 // optimize things like "p < NULL" to false (p may contain an integer value
1269 bool shouldCast = Cmp.isRelational();
1271 // Write out the casted operand if we should, otherwise just write the
1274 writeOperand(Operand);
1278 // Should this be a signed comparison? If so, convert to signed.
1279 bool castIsSigned = Cmp.isSignedPredicate();
1281 // If the operand was a pointer, convert to a large integer type.
1282 const Type* OpTy = Operand->getType();
1283 if (isa<PointerType>(OpTy))
1284 OpTy = TD->getIntPtrType();
1287 printSimpleType(Out, OpTy, castIsSigned);
1289 writeOperand(Operand);
1293 // generateCompilerSpecificCode - This is where we add conditional compilation
1294 // directives to cater to specific compilers as need be.
1296 static void generateCompilerSpecificCode(std::ostream& Out) {
1297 // Alloca is hard to get, and we don't want to include stdlib.h here.
1298 Out << "/* get a declaration for alloca */\n"
1299 << "#if defined(__CYGWIN__) || defined(__MINGW32__)\n"
1300 << "#define alloca(x) __builtin_alloca((x))\n"
1301 << "#define _alloca(x) __builtin_alloca((x))\n"
1302 << "#elif defined(__APPLE__)\n"
1303 << "extern void *__builtin_alloca(unsigned long);\n"
1304 << "#define alloca(x) __builtin_alloca(x)\n"
1305 << "#define longjmp _longjmp\n"
1306 << "#define setjmp _setjmp\n"
1307 << "#elif defined(__sun__)\n"
1308 << "#if defined(__sparcv9)\n"
1309 << "extern void *__builtin_alloca(unsigned long);\n"
1311 << "extern void *__builtin_alloca(unsigned int);\n"
1313 << "#define alloca(x) __builtin_alloca(x)\n"
1314 << "#elif defined(__FreeBSD__) || defined(__OpenBSD__)\n"
1315 << "#define alloca(x) __builtin_alloca(x)\n"
1316 << "#elif defined(_MSC_VER)\n"
1317 << "#define inline _inline\n"
1318 << "#define alloca(x) _alloca(x)\n"
1320 << "#include <alloca.h>\n"
1323 // We output GCC specific attributes to preserve 'linkonce'ness on globals.
1324 // If we aren't being compiled with GCC, just drop these attributes.
1325 Out << "#ifndef __GNUC__ /* Can only support \"linkonce\" vars with GCC */\n"
1326 << "#define __attribute__(X)\n"
1329 // On Mac OS X, "external weak" is spelled "__attribute__((weak_import))".
1330 Out << "#if defined(__GNUC__) && defined(__APPLE_CC__)\n"
1331 << "#define __EXTERNAL_WEAK__ __attribute__((weak_import))\n"
1332 << "#elif defined(__GNUC__)\n"
1333 << "#define __EXTERNAL_WEAK__ __attribute__((weak))\n"
1335 << "#define __EXTERNAL_WEAK__\n"
1338 // For now, turn off the weak linkage attribute on Mac OS X. (See above.)
1339 Out << "#if defined(__GNUC__) && defined(__APPLE_CC__)\n"
1340 << "#define __ATTRIBUTE_WEAK__\n"
1341 << "#elif defined(__GNUC__)\n"
1342 << "#define __ATTRIBUTE_WEAK__ __attribute__((weak))\n"
1344 << "#define __ATTRIBUTE_WEAK__\n"
1347 // Add hidden visibility support. FIXME: APPLE_CC?
1348 Out << "#if defined(__GNUC__)\n"
1349 << "#define __HIDDEN__ __attribute__((visibility(\"hidden\")))\n"
1352 // Define NaN and Inf as GCC builtins if using GCC, as 0 otherwise
1353 // From the GCC documentation:
1355 // double __builtin_nan (const char *str)
1357 // This is an implementation of the ISO C99 function nan.
1359 // Since ISO C99 defines this function in terms of strtod, which we do
1360 // not implement, a description of the parsing is in order. The string is
1361 // parsed as by strtol; that is, the base is recognized by leading 0 or
1362 // 0x prefixes. The number parsed is placed in the significand such that
1363 // the least significant bit of the number is at the least significant
1364 // bit of the significand. The number is truncated to fit the significand
1365 // field provided. The significand is forced to be a quiet NaN.
1367 // This function, if given a string literal, is evaluated early enough
1368 // that it is considered a compile-time constant.
1370 // float __builtin_nanf (const char *str)
1372 // Similar to __builtin_nan, except the return type is float.
1374 // double __builtin_inf (void)
1376 // Similar to __builtin_huge_val, except a warning is generated if the
1377 // target floating-point format does not support infinities. This
1378 // function is suitable for implementing the ISO C99 macro INFINITY.
1380 // float __builtin_inff (void)
1382 // Similar to __builtin_inf, except the return type is float.
1383 Out << "#ifdef __GNUC__\n"
1384 << "#define LLVM_NAN(NanStr) __builtin_nan(NanStr) /* Double */\n"
1385 << "#define LLVM_NANF(NanStr) __builtin_nanf(NanStr) /* Float */\n"
1386 << "#define LLVM_NANS(NanStr) __builtin_nans(NanStr) /* Double */\n"
1387 << "#define LLVM_NANSF(NanStr) __builtin_nansf(NanStr) /* Float */\n"
1388 << "#define LLVM_INF __builtin_inf() /* Double */\n"
1389 << "#define LLVM_INFF __builtin_inff() /* Float */\n"
1390 << "#define LLVM_PREFETCH(addr,rw,locality) "
1391 "__builtin_prefetch(addr,rw,locality)\n"
1392 << "#define __ATTRIBUTE_CTOR__ __attribute__((constructor))\n"
1393 << "#define __ATTRIBUTE_DTOR__ __attribute__((destructor))\n"
1394 << "#define LLVM_ASM __asm__\n"
1396 << "#define LLVM_NAN(NanStr) ((double)0.0) /* Double */\n"
1397 << "#define LLVM_NANF(NanStr) 0.0F /* Float */\n"
1398 << "#define LLVM_NANS(NanStr) ((double)0.0) /* Double */\n"
1399 << "#define LLVM_NANSF(NanStr) 0.0F /* Float */\n"
1400 << "#define LLVM_INF ((double)0.0) /* Double */\n"
1401 << "#define LLVM_INFF 0.0F /* Float */\n"
1402 << "#define LLVM_PREFETCH(addr,rw,locality) /* PREFETCH */\n"
1403 << "#define __ATTRIBUTE_CTOR__\n"
1404 << "#define __ATTRIBUTE_DTOR__\n"
1405 << "#define LLVM_ASM(X)\n"
1408 Out << "#if __GNUC__ < 4 /* Old GCC's, or compilers not GCC */ \n"
1409 << "#define __builtin_stack_save() 0 /* not implemented */\n"
1410 << "#define __builtin_stack_restore(X) /* noop */\n"
1413 // Output target-specific code that should be inserted into main.
1414 Out << "#define CODE_FOR_MAIN() /* Any target-specific code for main()*/\n";
1417 /// FindStaticTors - Given a static ctor/dtor list, unpack its contents into
1418 /// the StaticTors set.
1419 static void FindStaticTors(GlobalVariable *GV, std::set<Function*> &StaticTors){
1420 ConstantArray *InitList = dyn_cast<ConstantArray>(GV->getInitializer());
1421 if (!InitList) return;
1423 for (unsigned i = 0, e = InitList->getNumOperands(); i != e; ++i)
1424 if (ConstantStruct *CS = dyn_cast<ConstantStruct>(InitList->getOperand(i))){
1425 if (CS->getNumOperands() != 2) return; // Not array of 2-element structs.
1427 if (CS->getOperand(1)->isNullValue())
1428 return; // Found a null terminator, exit printing.
1429 Constant *FP = CS->getOperand(1);
1430 if (ConstantExpr *CE = dyn_cast<ConstantExpr>(FP))
1432 FP = CE->getOperand(0);
1433 if (Function *F = dyn_cast<Function>(FP))
1434 StaticTors.insert(F);
1438 enum SpecialGlobalClass {
1440 GlobalCtors, GlobalDtors,
1444 /// getGlobalVariableClass - If this is a global that is specially recognized
1445 /// by LLVM, return a code that indicates how we should handle it.
1446 static SpecialGlobalClass getGlobalVariableClass(const GlobalVariable *GV) {
1447 // If this is a global ctors/dtors list, handle it now.
1448 if (GV->hasAppendingLinkage() && GV->use_empty()) {
1449 if (GV->getName() == "llvm.global_ctors")
1451 else if (GV->getName() == "llvm.global_dtors")
1455 // Otherwise, it it is other metadata, don't print it. This catches things
1456 // like debug information.
1457 if (GV->getSection() == "llvm.metadata")
1464 bool CWriter::doInitialization(Module &M) {
1468 TD = new TargetData(&M);
1469 IL = new IntrinsicLowering(*TD);
1470 IL->AddPrototypes(M);
1472 // Ensure that all structure types have names...
1473 Mang = new Mangler(M);
1474 Mang->markCharUnacceptable('.');
1476 // Keep track of which functions are static ctors/dtors so they can have
1477 // an attribute added to their prototypes.
1478 std::set<Function*> StaticCtors, StaticDtors;
1479 for (Module::global_iterator I = M.global_begin(), E = M.global_end();
1481 switch (getGlobalVariableClass(I)) {
1484 FindStaticTors(I, StaticCtors);
1487 FindStaticTors(I, StaticDtors);
1492 // get declaration for alloca
1493 Out << "/* Provide Declarations */\n";
1494 Out << "#include <stdarg.h>\n"; // Varargs support
1495 Out << "#include <setjmp.h>\n"; // Unwind support
1496 generateCompilerSpecificCode(Out);
1498 // Provide a definition for `bool' if not compiling with a C++ compiler.
1500 << "#ifndef __cplusplus\ntypedef unsigned char bool;\n#endif\n"
1502 << "\n\n/* Support for floating point constants */\n"
1503 << "typedef unsigned long long ConstantDoubleTy;\n"
1504 << "typedef unsigned int ConstantFloatTy;\n"
1505 << "typedef struct { unsigned long long f1; unsigned short f2; "
1506 "unsigned short pad[3]; } ConstantFP80Ty;\n"
1507 << "typedef struct { unsigned long long f1; unsigned long long f2; }"
1508 " ConstantFP128Ty;\n"
1509 << "\n\n/* Global Declarations */\n";
1511 // First output all the declarations for the program, because C requires
1512 // Functions & globals to be declared before they are used.
1515 // Loop over the symbol table, emitting all named constants...
1516 printModuleTypes(M.getTypeSymbolTable());
1518 // Global variable declarations...
1519 if (!M.global_empty()) {
1520 Out << "\n/* External Global Variable Declarations */\n";
1521 for (Module::global_iterator I = M.global_begin(), E = M.global_end();
1524 if (I->hasExternalLinkage() || I->hasExternalWeakLinkage())
1526 else if (I->hasDLLImportLinkage())
1527 Out << "__declspec(dllimport) ";
1529 continue; // Internal Global
1531 // Thread Local Storage
1532 if (I->isThreadLocal())
1535 printType(Out, I->getType()->getElementType(), false, GetValueName(I));
1537 if (I->hasExternalWeakLinkage())
1538 Out << " __EXTERNAL_WEAK__";
1543 // Function declarations
1544 Out << "\n/* Function Declarations */\n";
1545 Out << "double fmod(double, double);\n"; // Support for FP rem
1546 Out << "float fmodf(float, float);\n";
1547 Out << "long double fmodl(long double, long double);\n";
1549 for (Module::iterator I = M.begin(), E = M.end(); I != E; ++I) {
1550 // Don't print declarations for intrinsic functions.
1551 if (!I->getIntrinsicID() && I->getName() != "setjmp" &&
1552 I->getName() != "longjmp" && I->getName() != "_setjmp") {
1553 if (I->hasExternalWeakLinkage())
1555 printFunctionSignature(I, true);
1556 if (I->hasWeakLinkage() || I->hasLinkOnceLinkage())
1557 Out << " __ATTRIBUTE_WEAK__";
1558 if (I->hasExternalWeakLinkage())
1559 Out << " __EXTERNAL_WEAK__";
1560 if (StaticCtors.count(I))
1561 Out << " __ATTRIBUTE_CTOR__";
1562 if (StaticDtors.count(I))
1563 Out << " __ATTRIBUTE_DTOR__";
1564 if (I->hasHiddenVisibility())
1565 Out << " __HIDDEN__";
1567 if (I->hasName() && I->getName()[0] == 1)
1568 Out << " LLVM_ASM(\"" << I->getName().c_str()+1 << "\")";
1574 // Output the global variable declarations
1575 if (!M.global_empty()) {
1576 Out << "\n\n/* Global Variable Declarations */\n";
1577 for (Module::global_iterator I = M.global_begin(), E = M.global_end();
1579 if (!I->isDeclaration()) {
1580 // Ignore special globals, such as debug info.
1581 if (getGlobalVariableClass(I))
1584 if (I->hasInternalLinkage())
1589 // Thread Local Storage
1590 if (I->isThreadLocal())
1593 printType(Out, I->getType()->getElementType(), false,
1596 if (I->hasLinkOnceLinkage())
1597 Out << " __attribute__((common))";
1598 else if (I->hasWeakLinkage())
1599 Out << " __ATTRIBUTE_WEAK__";
1600 else if (I->hasExternalWeakLinkage())
1601 Out << " __EXTERNAL_WEAK__";
1602 if (I->hasHiddenVisibility())
1603 Out << " __HIDDEN__";
1608 // Output the global variable definitions and contents...
1609 if (!M.global_empty()) {
1610 Out << "\n\n/* Global Variable Definitions and Initialization */\n";
1611 for (Module::global_iterator I = M.global_begin(), E = M.global_end();
1613 if (!I->isDeclaration()) {
1614 // Ignore special globals, such as debug info.
1615 if (getGlobalVariableClass(I))
1618 if (I->hasInternalLinkage())
1620 else if (I->hasDLLImportLinkage())
1621 Out << "__declspec(dllimport) ";
1622 else if (I->hasDLLExportLinkage())
1623 Out << "__declspec(dllexport) ";
1625 // Thread Local Storage
1626 if (I->isThreadLocal())
1629 printType(Out, I->getType()->getElementType(), false,
1631 if (I->hasLinkOnceLinkage())
1632 Out << " __attribute__((common))";
1633 else if (I->hasWeakLinkage())
1634 Out << " __ATTRIBUTE_WEAK__";
1636 if (I->hasHiddenVisibility())
1637 Out << " __HIDDEN__";
1639 // If the initializer is not null, emit the initializer. If it is null,
1640 // we try to avoid emitting large amounts of zeros. The problem with
1641 // this, however, occurs when the variable has weak linkage. In this
1642 // case, the assembler will complain about the variable being both weak
1643 // and common, so we disable this optimization.
1644 if (!I->getInitializer()->isNullValue()) {
1646 writeOperand(I->getInitializer());
1647 } else if (I->hasWeakLinkage()) {
1648 // We have to specify an initializer, but it doesn't have to be
1649 // complete. If the value is an aggregate, print out { 0 }, and let
1650 // the compiler figure out the rest of the zeros.
1652 if (isa<StructType>(I->getInitializer()->getType()) ||
1653 isa<ArrayType>(I->getInitializer()->getType()) ||
1654 isa<VectorType>(I->getInitializer()->getType())) {
1657 // Just print it out normally.
1658 writeOperand(I->getInitializer());
1666 Out << "\n\n/* Function Bodies */\n";
1668 // Emit some helper functions for dealing with FCMP instruction's
1670 Out << "static inline int llvm_fcmp_ord(double X, double Y) { ";
1671 Out << "return X == X && Y == Y; }\n";
1672 Out << "static inline int llvm_fcmp_uno(double X, double Y) { ";
1673 Out << "return X != X || Y != Y; }\n";
1674 Out << "static inline int llvm_fcmp_ueq(double X, double Y) { ";
1675 Out << "return X == Y || llvm_fcmp_uno(X, Y); }\n";
1676 Out << "static inline int llvm_fcmp_une(double X, double Y) { ";
1677 Out << "return X != Y; }\n";
1678 Out << "static inline int llvm_fcmp_ult(double X, double Y) { ";
1679 Out << "return X < Y || llvm_fcmp_uno(X, Y); }\n";
1680 Out << "static inline int llvm_fcmp_ugt(double X, double Y) { ";
1681 Out << "return X > Y || llvm_fcmp_uno(X, Y); }\n";
1682 Out << "static inline int llvm_fcmp_ule(double X, double Y) { ";
1683 Out << "return X <= Y || llvm_fcmp_uno(X, Y); }\n";
1684 Out << "static inline int llvm_fcmp_uge(double X, double Y) { ";
1685 Out << "return X >= Y || llvm_fcmp_uno(X, Y); }\n";
1686 Out << "static inline int llvm_fcmp_oeq(double X, double Y) { ";
1687 Out << "return X == Y ; }\n";
1688 Out << "static inline int llvm_fcmp_one(double X, double Y) { ";
1689 Out << "return X != Y && llvm_fcmp_ord(X, Y); }\n";
1690 Out << "static inline int llvm_fcmp_olt(double X, double Y) { ";
1691 Out << "return X < Y ; }\n";
1692 Out << "static inline int llvm_fcmp_ogt(double X, double Y) { ";
1693 Out << "return X > Y ; }\n";
1694 Out << "static inline int llvm_fcmp_ole(double X, double Y) { ";
1695 Out << "return X <= Y ; }\n";
1696 Out << "static inline int llvm_fcmp_oge(double X, double Y) { ";
1697 Out << "return X >= Y ; }\n";
1702 /// Output all floating point constants that cannot be printed accurately...
1703 void CWriter::printFloatingPointConstants(Function &F) {
1704 // Scan the module for floating point constants. If any FP constant is used
1705 // in the function, we want to redirect it here so that we do not depend on
1706 // the precision of the printed form, unless the printed form preserves
1709 static unsigned FPCounter = 0;
1710 for (constant_iterator I = constant_begin(&F), E = constant_end(&F);
1712 if (const ConstantFP *FPC = dyn_cast<ConstantFP>(*I))
1713 if (!isFPCSafeToPrint(FPC) && // Do not put in FPConstantMap if safe.
1714 !FPConstantMap.count(FPC)) {
1715 FPConstantMap[FPC] = FPCounter; // Number the FP constants
1717 if (FPC->getType() == Type::DoubleTy) {
1718 double Val = FPC->getValueAPF().convertToDouble();
1719 uint64_t i = FPC->getValueAPF().convertToAPInt().getZExtValue();
1720 Out << "static const ConstantDoubleTy FPConstant" << FPCounter++
1721 << " = 0x" << std::hex << i << std::dec
1722 << "ULL; /* " << Val << " */\n";
1723 } else if (FPC->getType() == Type::FloatTy) {
1724 float Val = FPC->getValueAPF().convertToFloat();
1725 uint32_t i = (uint32_t)FPC->getValueAPF().convertToAPInt().
1727 Out << "static const ConstantFloatTy FPConstant" << FPCounter++
1728 << " = 0x" << std::hex << i << std::dec
1729 << "U; /* " << Val << " */\n";
1730 } else if (FPC->getType() == Type::X86_FP80Ty) {
1731 const uint64_t *p = FPC->getValueAPF().convertToAPInt().getRawData();
1732 Out << "static const ConstantFP80Ty FPConstant" << FPCounter++
1733 << " = { 0x" << std::hex
1734 << ((uint16_t)p[1] | (p[0] & 0xffffffffffffLL)<<16)
1735 << ", 0x" << (uint16_t)(p[0] >> 48) << ",0,0,0"
1736 << "}; /* Long double constant */\n" << std::dec;
1738 assert(0 && "Unknown float type!");
1745 /// printSymbolTable - Run through symbol table looking for type names. If a
1746 /// type name is found, emit its declaration...
1748 void CWriter::printModuleTypes(const TypeSymbolTable &TST) {
1749 Out << "/* Helper union for bitcasts */\n";
1750 Out << "typedef union {\n";
1751 Out << " unsigned int Int32;\n";
1752 Out << " unsigned long long Int64;\n";
1753 Out << " float Float;\n";
1754 Out << " double Double;\n";
1755 Out << "} llvmBitCastUnion;\n";
1757 // We are only interested in the type plane of the symbol table.
1758 TypeSymbolTable::const_iterator I = TST.begin();
1759 TypeSymbolTable::const_iterator End = TST.end();
1761 // If there are no type names, exit early.
1762 if (I == End) return;
1764 // Print out forward declarations for structure types before anything else!
1765 Out << "/* Structure forward decls */\n";
1766 for (; I != End; ++I) {
1767 std::string Name = "struct l_" + Mang->makeNameProper(I->first);
1768 Out << Name << ";\n";
1769 TypeNames.insert(std::make_pair(I->second, Name));
1774 // Now we can print out typedefs. Above, we guaranteed that this can only be
1775 // for struct or opaque types.
1776 Out << "/* Typedefs */\n";
1777 for (I = TST.begin(); I != End; ++I) {
1778 std::string Name = "l_" + Mang->makeNameProper(I->first);
1780 printType(Out, I->second, false, Name);
1786 // Keep track of which structures have been printed so far...
1787 std::set<const StructType *> StructPrinted;
1789 // Loop over all structures then push them into the stack so they are
1790 // printed in the correct order.
1792 Out << "/* Structure contents */\n";
1793 for (I = TST.begin(); I != End; ++I)
1794 if (const StructType *STy = dyn_cast<StructType>(I->second))
1795 // Only print out used types!
1796 printContainedStructs(STy, StructPrinted);
1799 // Push the struct onto the stack and recursively push all structs
1800 // this one depends on.
1802 // TODO: Make this work properly with vector types
1804 void CWriter::printContainedStructs(const Type *Ty,
1805 std::set<const StructType*> &StructPrinted){
1806 // Don't walk through pointers.
1807 if (isa<PointerType>(Ty) || Ty->isPrimitiveType() || Ty->isInteger()) return;
1809 // Print all contained types first.
1810 for (Type::subtype_iterator I = Ty->subtype_begin(),
1811 E = Ty->subtype_end(); I != E; ++I)
1812 printContainedStructs(*I, StructPrinted);
1814 if (const StructType *STy = dyn_cast<StructType>(Ty)) {
1815 // Check to see if we have already printed this struct.
1816 if (StructPrinted.insert(STy).second) {
1817 // Print structure type out.
1818 std::string Name = TypeNames[STy];
1819 printType(Out, STy, false, Name, true);
1825 void CWriter::printFunctionSignature(const Function *F, bool Prototype) {
1826 /// isStructReturn - Should this function actually return a struct by-value?
1827 bool isStructReturn = F->getFunctionType()->isStructReturn();
1829 if (F->hasInternalLinkage()) Out << "static ";
1830 if (F->hasDLLImportLinkage()) Out << "__declspec(dllimport) ";
1831 if (F->hasDLLExportLinkage()) Out << "__declspec(dllexport) ";
1832 switch (F->getCallingConv()) {
1833 case CallingConv::X86_StdCall:
1834 Out << "__stdcall ";
1836 case CallingConv::X86_FastCall:
1837 Out << "__fastcall ";
1841 // Loop over the arguments, printing them...
1842 const FunctionType *FT = cast<FunctionType>(F->getFunctionType());
1843 const ParamAttrsList *Attrs = FT->getParamAttrs();
1845 std::stringstream FunctionInnards;
1847 // Print out the name...
1848 FunctionInnards << GetValueName(F) << '(';
1850 bool PrintedArg = false;
1851 if (!F->isDeclaration()) {
1852 if (!F->arg_empty()) {
1853 Function::const_arg_iterator I = F->arg_begin(), E = F->arg_end();
1855 // If this is a struct-return function, don't print the hidden
1856 // struct-return argument.
1857 if (isStructReturn) {
1858 assert(I != E && "Invalid struct return function!");
1862 std::string ArgName;
1864 for (; I != E; ++I) {
1865 if (PrintedArg) FunctionInnards << ", ";
1866 if (I->hasName() || !Prototype)
1867 ArgName = GetValueName(I);
1870 printType(FunctionInnards, I->getType(),
1871 /*isSigned=*/Attrs && Attrs->paramHasAttr(Idx, ParamAttr::SExt),
1878 // Loop over the arguments, printing them.
1879 FunctionType::param_iterator I = FT->param_begin(), E = FT->param_end();
1881 // If this is a struct-return function, don't print the hidden
1882 // struct-return argument.
1883 if (isStructReturn) {
1884 assert(I != E && "Invalid struct return function!");
1889 for (; I != E; ++I) {
1890 if (PrintedArg) FunctionInnards << ", ";
1891 printType(FunctionInnards, *I,
1892 /*isSigned=*/Attrs && Attrs->paramHasAttr(Idx, ParamAttr::SExt));
1898 // Finish printing arguments... if this is a vararg function, print the ...,
1899 // unless there are no known types, in which case, we just emit ().
1901 if (FT->isVarArg() && PrintedArg) {
1902 if (PrintedArg) FunctionInnards << ", ";
1903 FunctionInnards << "..."; // Output varargs portion of signature!
1904 } else if (!FT->isVarArg() && !PrintedArg) {
1905 FunctionInnards << "void"; // ret() -> ret(void) in C.
1907 FunctionInnards << ')';
1909 // Get the return tpe for the function.
1911 if (!isStructReturn)
1912 RetTy = F->getReturnType();
1914 // If this is a struct-return function, print the struct-return type.
1915 RetTy = cast<PointerType>(FT->getParamType(0))->getElementType();
1918 // Print out the return type and the signature built above.
1919 printType(Out, RetTy,
1920 /*isSigned=*/ Attrs && Attrs->paramHasAttr(0, ParamAttr::SExt),
1921 FunctionInnards.str());
1924 static inline bool isFPIntBitCast(const Instruction &I) {
1925 if (!isa<BitCastInst>(I))
1927 const Type *SrcTy = I.getOperand(0)->getType();
1928 const Type *DstTy = I.getType();
1929 return (SrcTy->isFloatingPoint() && DstTy->isInteger()) ||
1930 (DstTy->isFloatingPoint() && SrcTy->isInteger());
1933 void CWriter::printFunction(Function &F) {
1934 /// isStructReturn - Should this function actually return a struct by-value?
1935 bool isStructReturn = F.getFunctionType()->isStructReturn();
1937 printFunctionSignature(&F, false);
1940 // If this is a struct return function, handle the result with magic.
1941 if (isStructReturn) {
1942 const Type *StructTy =
1943 cast<PointerType>(F.arg_begin()->getType())->getElementType();
1945 printType(Out, StructTy, false, "StructReturn");
1946 Out << "; /* Struct return temporary */\n";
1949 printType(Out, F.arg_begin()->getType(), false,
1950 GetValueName(F.arg_begin()));
1951 Out << " = &StructReturn;\n";
1954 bool PrintedVar = false;
1956 // print local variable information for the function
1957 for (inst_iterator I = inst_begin(&F), E = inst_end(&F); I != E; ++I) {
1958 if (const AllocaInst *AI = isDirectAlloca(&*I)) {
1960 printType(Out, AI->getAllocatedType(), false, GetValueName(AI));
1961 Out << "; /* Address-exposed local */\n";
1963 } else if (I->getType() != Type::VoidTy && !isInlinableInst(*I)) {
1965 printType(Out, I->getType(), false, GetValueName(&*I));
1968 if (isa<PHINode>(*I)) { // Print out PHI node temporaries as well...
1970 printType(Out, I->getType(), false,
1971 GetValueName(&*I)+"__PHI_TEMPORARY");
1976 // We need a temporary for the BitCast to use so it can pluck a value out
1977 // of a union to do the BitCast. This is separate from the need for a
1978 // variable to hold the result of the BitCast.
1979 if (isFPIntBitCast(*I)) {
1980 Out << " llvmBitCastUnion " << GetValueName(&*I)
1981 << "__BITCAST_TEMPORARY;\n";
1989 if (F.hasExternalLinkage() && F.getName() == "main")
1990 Out << " CODE_FOR_MAIN();\n";
1992 // print the basic blocks
1993 for (Function::iterator BB = F.begin(), E = F.end(); BB != E; ++BB) {
1994 if (Loop *L = LI->getLoopFor(BB)) {
1995 if (L->getHeader() == BB && L->getParentLoop() == 0)
1998 printBasicBlock(BB);
2005 void CWriter::printLoop(Loop *L) {
2006 Out << " do { /* Syntactic loop '" << L->getHeader()->getName()
2007 << "' to make GCC happy */\n";
2008 for (unsigned i = 0, e = L->getBlocks().size(); i != e; ++i) {
2009 BasicBlock *BB = L->getBlocks()[i];
2010 Loop *BBLoop = LI->getLoopFor(BB);
2012 printBasicBlock(BB);
2013 else if (BB == BBLoop->getHeader() && BBLoop->getParentLoop() == L)
2016 Out << " } while (1); /* end of syntactic loop '"
2017 << L->getHeader()->getName() << "' */\n";
2020 void CWriter::printBasicBlock(BasicBlock *BB) {
2022 // Don't print the label for the basic block if there are no uses, or if
2023 // the only terminator use is the predecessor basic block's terminator.
2024 // We have to scan the use list because PHI nodes use basic blocks too but
2025 // do not require a label to be generated.
2027 bool NeedsLabel = false;
2028 for (pred_iterator PI = pred_begin(BB), E = pred_end(BB); PI != E; ++PI)
2029 if (isGotoCodeNecessary(*PI, BB)) {
2034 if (NeedsLabel) Out << GetValueName(BB) << ":\n";
2036 // Output all of the instructions in the basic block...
2037 for (BasicBlock::iterator II = BB->begin(), E = --BB->end(); II != E;
2039 if (!isInlinableInst(*II) && !isDirectAlloca(II)) {
2040 if (II->getType() != Type::VoidTy && !isInlineAsm(*II))
2049 // Don't emit prefix or suffix for the terminator...
2050 visit(*BB->getTerminator());
2054 // Specific Instruction type classes... note that all of the casts are
2055 // necessary because we use the instruction classes as opaque types...
2057 void CWriter::visitReturnInst(ReturnInst &I) {
2058 // If this is a struct return function, return the temporary struct.
2059 bool isStructReturn = I.getParent()->getParent()->
2060 getFunctionType()->isStructReturn();
2062 if (isStructReturn) {
2063 Out << " return StructReturn;\n";
2067 // Don't output a void return if this is the last basic block in the function
2068 if (I.getNumOperands() == 0 &&
2069 &*--I.getParent()->getParent()->end() == I.getParent() &&
2070 !I.getParent()->size() == 1) {
2075 if (I.getNumOperands()) {
2077 writeOperand(I.getOperand(0));
2082 void CWriter::visitSwitchInst(SwitchInst &SI) {
2085 writeOperand(SI.getOperand(0));
2086 Out << ") {\n default:\n";
2087 printPHICopiesForSuccessor (SI.getParent(), SI.getDefaultDest(), 2);
2088 printBranchToBlock(SI.getParent(), SI.getDefaultDest(), 2);
2090 for (unsigned i = 2, e = SI.getNumOperands(); i != e; i += 2) {
2092 writeOperand(SI.getOperand(i));
2094 BasicBlock *Succ = cast<BasicBlock>(SI.getOperand(i+1));
2095 printPHICopiesForSuccessor (SI.getParent(), Succ, 2);
2096 printBranchToBlock(SI.getParent(), Succ, 2);
2097 if (Function::iterator(Succ) == next(Function::iterator(SI.getParent())))
2103 void CWriter::visitUnreachableInst(UnreachableInst &I) {
2104 Out << " /*UNREACHABLE*/;\n";
2107 bool CWriter::isGotoCodeNecessary(BasicBlock *From, BasicBlock *To) {
2108 /// FIXME: This should be reenabled, but loop reordering safe!!
2111 if (next(Function::iterator(From)) != Function::iterator(To))
2112 return true; // Not the direct successor, we need a goto.
2114 //isa<SwitchInst>(From->getTerminator())
2116 if (LI->getLoopFor(From) != LI->getLoopFor(To))
2121 void CWriter::printPHICopiesForSuccessor (BasicBlock *CurBlock,
2122 BasicBlock *Successor,
2124 for (BasicBlock::iterator I = Successor->begin(); isa<PHINode>(I); ++I) {
2125 PHINode *PN = cast<PHINode>(I);
2126 // Now we have to do the printing.
2127 Value *IV = PN->getIncomingValueForBlock(CurBlock);
2128 if (!isa<UndefValue>(IV)) {
2129 Out << std::string(Indent, ' ');
2130 Out << " " << GetValueName(I) << "__PHI_TEMPORARY = ";
2132 Out << "; /* for PHI node */\n";
2137 void CWriter::printBranchToBlock(BasicBlock *CurBB, BasicBlock *Succ,
2139 if (isGotoCodeNecessary(CurBB, Succ)) {
2140 Out << std::string(Indent, ' ') << " goto ";
2146 // Branch instruction printing - Avoid printing out a branch to a basic block
2147 // that immediately succeeds the current one.
2149 void CWriter::visitBranchInst(BranchInst &I) {
2151 if (I.isConditional()) {
2152 if (isGotoCodeNecessary(I.getParent(), I.getSuccessor(0))) {
2154 writeOperand(I.getCondition());
2157 printPHICopiesForSuccessor (I.getParent(), I.getSuccessor(0), 2);
2158 printBranchToBlock(I.getParent(), I.getSuccessor(0), 2);
2160 if (isGotoCodeNecessary(I.getParent(), I.getSuccessor(1))) {
2161 Out << " } else {\n";
2162 printPHICopiesForSuccessor (I.getParent(), I.getSuccessor(1), 2);
2163 printBranchToBlock(I.getParent(), I.getSuccessor(1), 2);
2166 // First goto not necessary, assume second one is...
2168 writeOperand(I.getCondition());
2171 printPHICopiesForSuccessor (I.getParent(), I.getSuccessor(1), 2);
2172 printBranchToBlock(I.getParent(), I.getSuccessor(1), 2);
2177 printPHICopiesForSuccessor (I.getParent(), I.getSuccessor(0), 0);
2178 printBranchToBlock(I.getParent(), I.getSuccessor(0), 0);
2183 // PHI nodes get copied into temporary values at the end of predecessor basic
2184 // blocks. We now need to copy these temporary values into the REAL value for
2186 void CWriter::visitPHINode(PHINode &I) {
2188 Out << "__PHI_TEMPORARY";
2192 void CWriter::visitBinaryOperator(Instruction &I) {
2193 // binary instructions, shift instructions, setCond instructions.
2194 assert(!isa<PointerType>(I.getType()));
2196 // We must cast the results of binary operations which might be promoted.
2197 bool needsCast = false;
2198 if ((I.getType() == Type::Int8Ty) || (I.getType() == Type::Int16Ty)
2199 || (I.getType() == Type::FloatTy)) {
2202 printType(Out, I.getType(), false);
2206 // If this is a negation operation, print it out as such. For FP, we don't
2207 // want to print "-0.0 - X".
2208 if (BinaryOperator::isNeg(&I)) {
2210 writeOperand(BinaryOperator::getNegArgument(cast<BinaryOperator>(&I)));
2212 } else if (I.getOpcode() == Instruction::FRem) {
2213 // Output a call to fmod/fmodf instead of emitting a%b
2214 if (I.getType() == Type::FloatTy)
2216 else if (I.getType() == Type::DoubleTy)
2218 else // all 3 flavors of long double
2220 writeOperand(I.getOperand(0));
2222 writeOperand(I.getOperand(1));
2226 // Write out the cast of the instruction's value back to the proper type
2228 bool NeedsClosingParens = writeInstructionCast(I);
2230 // Certain instructions require the operand to be forced to a specific type
2231 // so we use writeOperandWithCast here instead of writeOperand. Similarly
2232 // below for operand 1
2233 writeOperandWithCast(I.getOperand(0), I.getOpcode());
2235 switch (I.getOpcode()) {
2236 case Instruction::Add: Out << " + "; break;
2237 case Instruction::Sub: Out << " - "; break;
2238 case Instruction::Mul: Out << " * "; break;
2239 case Instruction::URem:
2240 case Instruction::SRem:
2241 case Instruction::FRem: Out << " % "; break;
2242 case Instruction::UDiv:
2243 case Instruction::SDiv:
2244 case Instruction::FDiv: Out << " / "; break;
2245 case Instruction::And: Out << " & "; break;
2246 case Instruction::Or: Out << " | "; break;
2247 case Instruction::Xor: Out << " ^ "; break;
2248 case Instruction::Shl : Out << " << "; break;
2249 case Instruction::LShr:
2250 case Instruction::AShr: Out << " >> "; break;
2251 default: cerr << "Invalid operator type!" << I; abort();
2254 writeOperandWithCast(I.getOperand(1), I.getOpcode());
2255 if (NeedsClosingParens)
2264 void CWriter::visitICmpInst(ICmpInst &I) {
2265 // We must cast the results of icmp which might be promoted.
2266 bool needsCast = false;
2268 // Write out the cast of the instruction's value back to the proper type
2270 bool NeedsClosingParens = writeInstructionCast(I);
2272 // Certain icmp predicate require the operand to be forced to a specific type
2273 // so we use writeOperandWithCast here instead of writeOperand. Similarly
2274 // below for operand 1
2275 writeOperandWithCast(I.getOperand(0), I);
2277 switch (I.getPredicate()) {
2278 case ICmpInst::ICMP_EQ: Out << " == "; break;
2279 case ICmpInst::ICMP_NE: Out << " != "; break;
2280 case ICmpInst::ICMP_ULE:
2281 case ICmpInst::ICMP_SLE: Out << " <= "; break;
2282 case ICmpInst::ICMP_UGE:
2283 case ICmpInst::ICMP_SGE: Out << " >= "; break;
2284 case ICmpInst::ICMP_ULT:
2285 case ICmpInst::ICMP_SLT: Out << " < "; break;
2286 case ICmpInst::ICMP_UGT:
2287 case ICmpInst::ICMP_SGT: Out << " > "; break;
2288 default: cerr << "Invalid icmp predicate!" << I; abort();
2291 writeOperandWithCast(I.getOperand(1), I);
2292 if (NeedsClosingParens)
2300 void CWriter::visitFCmpInst(FCmpInst &I) {
2301 if (I.getPredicate() == FCmpInst::FCMP_FALSE) {
2305 if (I.getPredicate() == FCmpInst::FCMP_TRUE) {
2311 switch (I.getPredicate()) {
2312 default: assert(0 && "Illegal FCmp predicate");
2313 case FCmpInst::FCMP_ORD: op = "ord"; break;
2314 case FCmpInst::FCMP_UNO: op = "uno"; break;
2315 case FCmpInst::FCMP_UEQ: op = "ueq"; break;
2316 case FCmpInst::FCMP_UNE: op = "une"; break;
2317 case FCmpInst::FCMP_ULT: op = "ult"; break;
2318 case FCmpInst::FCMP_ULE: op = "ule"; break;
2319 case FCmpInst::FCMP_UGT: op = "ugt"; break;
2320 case FCmpInst::FCMP_UGE: op = "uge"; break;
2321 case FCmpInst::FCMP_OEQ: op = "oeq"; break;
2322 case FCmpInst::FCMP_ONE: op = "one"; break;
2323 case FCmpInst::FCMP_OLT: op = "olt"; break;
2324 case FCmpInst::FCMP_OLE: op = "ole"; break;
2325 case FCmpInst::FCMP_OGT: op = "ogt"; break;
2326 case FCmpInst::FCMP_OGE: op = "oge"; break;
2329 Out << "llvm_fcmp_" << op << "(";
2330 // Write the first operand
2331 writeOperand(I.getOperand(0));
2333 // Write the second operand
2334 writeOperand(I.getOperand(1));
2338 static const char * getFloatBitCastField(const Type *Ty) {
2339 switch (Ty->getTypeID()) {
2340 default: assert(0 && "Invalid Type");
2341 case Type::FloatTyID: return "Float";
2342 case Type::DoubleTyID: return "Double";
2343 case Type::IntegerTyID: {
2344 unsigned NumBits = cast<IntegerType>(Ty)->getBitWidth();
2353 void CWriter::visitCastInst(CastInst &I) {
2354 const Type *DstTy = I.getType();
2355 const Type *SrcTy = I.getOperand(0)->getType();
2357 if (isFPIntBitCast(I)) {
2358 // These int<->float and long<->double casts need to be handled specially
2359 Out << GetValueName(&I) << "__BITCAST_TEMPORARY."
2360 << getFloatBitCastField(I.getOperand(0)->getType()) << " = ";
2361 writeOperand(I.getOperand(0));
2362 Out << ", " << GetValueName(&I) << "__BITCAST_TEMPORARY."
2363 << getFloatBitCastField(I.getType());
2365 printCast(I.getOpcode(), SrcTy, DstTy);
2366 if (I.getOpcode() == Instruction::SExt && SrcTy == Type::Int1Ty) {
2367 // Make sure we really get a sext from bool by subtracing the bool from 0
2370 writeOperand(I.getOperand(0));
2371 if (DstTy == Type::Int1Ty &&
2372 (I.getOpcode() == Instruction::Trunc ||
2373 I.getOpcode() == Instruction::FPToUI ||
2374 I.getOpcode() == Instruction::FPToSI ||
2375 I.getOpcode() == Instruction::PtrToInt)) {
2376 // Make sure we really get a trunc to bool by anding the operand with 1
2383 void CWriter::visitSelectInst(SelectInst &I) {
2385 writeOperand(I.getCondition());
2387 writeOperand(I.getTrueValue());
2389 writeOperand(I.getFalseValue());
2394 void CWriter::lowerIntrinsics(Function &F) {
2395 // This is used to keep track of intrinsics that get generated to a lowered
2396 // function. We must generate the prototypes before the function body which
2397 // will only be expanded on first use (by the loop below).
2398 std::vector<Function*> prototypesToGen;
2400 // Examine all the instructions in this function to find the intrinsics that
2401 // need to be lowered.
2402 for (Function::iterator BB = F.begin(), EE = F.end(); BB != EE; ++BB)
2403 for (BasicBlock::iterator I = BB->begin(), E = BB->end(); I != E; )
2404 if (CallInst *CI = dyn_cast<CallInst>(I++))
2405 if (Function *F = CI->getCalledFunction())
2406 switch (F->getIntrinsicID()) {
2407 case Intrinsic::not_intrinsic:
2408 case Intrinsic::vastart:
2409 case Intrinsic::vacopy:
2410 case Intrinsic::vaend:
2411 case Intrinsic::returnaddress:
2412 case Intrinsic::frameaddress:
2413 case Intrinsic::setjmp:
2414 case Intrinsic::longjmp:
2415 case Intrinsic::prefetch:
2416 case Intrinsic::dbg_stoppoint:
2417 case Intrinsic::powi_f32:
2418 case Intrinsic::powi_f64:
2419 // We directly implement these intrinsics
2422 // If this is an intrinsic that directly corresponds to a GCC
2423 // builtin, we handle it.
2424 const char *BuiltinName = "";
2425 #define GET_GCC_BUILTIN_NAME
2426 #include "llvm/Intrinsics.gen"
2427 #undef GET_GCC_BUILTIN_NAME
2428 // If we handle it, don't lower it.
2429 if (BuiltinName[0]) break;
2431 // All other intrinsic calls we must lower.
2432 Instruction *Before = 0;
2433 if (CI != &BB->front())
2434 Before = prior(BasicBlock::iterator(CI));
2436 IL->LowerIntrinsicCall(CI);
2437 if (Before) { // Move iterator to instruction after call
2442 // If the intrinsic got lowered to another call, and that call has
2443 // a definition then we need to make sure its prototype is emitted
2444 // before any calls to it.
2445 if (CallInst *Call = dyn_cast<CallInst>(I))
2446 if (Function *NewF = Call->getCalledFunction())
2447 if (!NewF->isDeclaration())
2448 prototypesToGen.push_back(NewF);
2453 // We may have collected some prototypes to emit in the loop above.
2454 // Emit them now, before the function that uses them is emitted. But,
2455 // be careful not to emit them twice.
2456 std::vector<Function*>::iterator I = prototypesToGen.begin();
2457 std::vector<Function*>::iterator E = prototypesToGen.end();
2458 for ( ; I != E; ++I) {
2459 if (intrinsicPrototypesAlreadyGenerated.insert(*I).second) {
2461 printFunctionSignature(*I, true);
2468 void CWriter::visitCallInst(CallInst &I) {
2469 //check if we have inline asm
2470 if (isInlineAsm(I)) {
2475 bool WroteCallee = false;
2477 // Handle intrinsic function calls first...
2478 if (Function *F = I.getCalledFunction())
2479 if (Intrinsic::ID ID = (Intrinsic::ID)F->getIntrinsicID()) {
2482 // If this is an intrinsic that directly corresponds to a GCC
2483 // builtin, we emit it here.
2484 const char *BuiltinName = "";
2485 #define GET_GCC_BUILTIN_NAME
2486 #include "llvm/Intrinsics.gen"
2487 #undef GET_GCC_BUILTIN_NAME
2488 assert(BuiltinName[0] && "Unknown LLVM intrinsic!");
2494 case Intrinsic::vastart:
2497 Out << "va_start(*(va_list*)";
2498 writeOperand(I.getOperand(1));
2500 // Output the last argument to the enclosing function...
2501 if (I.getParent()->getParent()->arg_empty()) {
2502 cerr << "The C backend does not currently support zero "
2503 << "argument varargs functions, such as '"
2504 << I.getParent()->getParent()->getName() << "'!\n";
2507 writeOperand(--I.getParent()->getParent()->arg_end());
2510 case Intrinsic::vaend:
2511 if (!isa<ConstantPointerNull>(I.getOperand(1))) {
2512 Out << "0; va_end(*(va_list*)";
2513 writeOperand(I.getOperand(1));
2516 Out << "va_end(*(va_list*)0)";
2519 case Intrinsic::vacopy:
2521 Out << "va_copy(*(va_list*)";
2522 writeOperand(I.getOperand(1));
2523 Out << ", *(va_list*)";
2524 writeOperand(I.getOperand(2));
2527 case Intrinsic::returnaddress:
2528 Out << "__builtin_return_address(";
2529 writeOperand(I.getOperand(1));
2532 case Intrinsic::frameaddress:
2533 Out << "__builtin_frame_address(";
2534 writeOperand(I.getOperand(1));
2537 case Intrinsic::powi_f32:
2538 case Intrinsic::powi_f64:
2539 Out << "__builtin_powi(";
2540 writeOperand(I.getOperand(1));
2542 writeOperand(I.getOperand(2));
2545 case Intrinsic::setjmp:
2546 Out << "setjmp(*(jmp_buf*)";
2547 writeOperand(I.getOperand(1));
2550 case Intrinsic::longjmp:
2551 Out << "longjmp(*(jmp_buf*)";
2552 writeOperand(I.getOperand(1));
2554 writeOperand(I.getOperand(2));
2557 case Intrinsic::prefetch:
2558 Out << "LLVM_PREFETCH((const void *)";
2559 writeOperand(I.getOperand(1));
2561 writeOperand(I.getOperand(2));
2563 writeOperand(I.getOperand(3));
2566 case Intrinsic::dbg_stoppoint: {
2567 // If we use writeOperand directly we get a "u" suffix which is rejected
2569 DbgStopPointInst &SPI = cast<DbgStopPointInst>(I);
2573 << " \"" << SPI.getDirectory()
2574 << SPI.getFileName() << "\"\n";
2580 Value *Callee = I.getCalledValue();
2582 const PointerType *PTy = cast<PointerType>(Callee->getType());
2583 const FunctionType *FTy = cast<FunctionType>(PTy->getElementType());
2585 // If this is a call to a struct-return function, assign to the first
2586 // parameter instead of passing it to the call.
2587 bool isStructRet = FTy->isStructReturn();
2590 writeOperand(I.getOperand(1));
2594 if (I.isTailCall()) Out << " /*tail*/ ";
2597 // If this is an indirect call to a struct return function, we need to cast
2599 bool NeedsCast = isStructRet && !isa<Function>(Callee);
2601 // GCC is a real PITA. It does not permit codegening casts of functions to
2602 // function pointers if they are in a call (it generates a trap instruction
2603 // instead!). We work around this by inserting a cast to void* in between
2604 // the function and the function pointer cast. Unfortunately, we can't just
2605 // form the constant expression here, because the folder will immediately
2608 // Note finally, that this is completely unsafe. ANSI C does not guarantee
2609 // that void* and function pointers have the same size. :( To deal with this
2610 // in the common case, we handle casts where the number of arguments passed
2613 if (ConstantExpr *CE = dyn_cast<ConstantExpr>(Callee))
2615 if (Function *RF = dyn_cast<Function>(CE->getOperand(0))) {
2621 // Ok, just cast the pointer type.
2624 printType(Out, I.getCalledValue()->getType());
2626 printStructReturnPointerFunctionType(Out,
2627 cast<PointerType>(I.getCalledValue()->getType()));
2630 writeOperand(Callee);
2631 if (NeedsCast) Out << ')';
2636 unsigned NumDeclaredParams = FTy->getNumParams();
2638 CallSite::arg_iterator AI = I.op_begin()+1, AE = I.op_end();
2640 if (isStructRet) { // Skip struct return argument.
2645 const ParamAttrsList *Attrs = FTy->getParamAttrs();
2646 bool PrintedArg = false;
2648 for (; AI != AE; ++AI, ++ArgNo, ++Idx) {
2649 if (PrintedArg) Out << ", ";
2650 if (ArgNo < NumDeclaredParams &&
2651 (*AI)->getType() != FTy->getParamType(ArgNo)) {
2653 printType(Out, FTy->getParamType(ArgNo),
2654 /*isSigned=*/Attrs && Attrs->paramHasAttr(Idx, ParamAttr::SExt));
2664 //This converts the llvm constraint string to something gcc is expecting.
2665 //TODO: work out platform independent constraints and factor those out
2666 // of the per target tables
2667 // handle multiple constraint codes
2668 std::string CWriter::InterpretASMConstraint(InlineAsm::ConstraintInfo& c) {
2670 assert(c.Codes.size() == 1 && "Too many asm constraint codes to handle");
2672 const char** table = 0;
2674 //Grab the translation table from TargetAsmInfo if it exists
2677 const TargetMachineRegistry::Entry* Match =
2678 TargetMachineRegistry::getClosestStaticTargetForModule(*TheModule, E);
2680 //Per platform Target Machines don't exist, so create it
2681 // this must be done only once
2682 const TargetMachine* TM = Match->CtorFn(*TheModule, "");
2683 TAsm = TM->getTargetAsmInfo();
2687 table = TAsm->getAsmCBE();
2689 //Search the translation table if it exists
2690 for (int i = 0; table && table[i]; i += 2)
2691 if (c.Codes[0] == table[i])
2694 //default is identity
2698 //TODO: import logic from AsmPrinter.cpp
2699 static std::string gccifyAsm(std::string asmstr) {
2700 for (std::string::size_type i = 0; i != asmstr.size(); ++i)
2701 if (asmstr[i] == '\n')
2702 asmstr.replace(i, 1, "\\n");
2703 else if (asmstr[i] == '\t')
2704 asmstr.replace(i, 1, "\\t");
2705 else if (asmstr[i] == '$') {
2706 if (asmstr[i + 1] == '{') {
2707 std::string::size_type a = asmstr.find_first_of(':', i + 1);
2708 std::string::size_type b = asmstr.find_first_of('}', i + 1);
2709 std::string n = "%" +
2710 asmstr.substr(a + 1, b - a - 1) +
2711 asmstr.substr(i + 2, a - i - 2);
2712 asmstr.replace(i, b - i + 1, n);
2715 asmstr.replace(i, 1, "%");
2717 else if (asmstr[i] == '%')//grr
2718 { asmstr.replace(i, 1, "%%"); ++i;}
2723 //TODO: assumptions about what consume arguments from the call are likely wrong
2724 // handle communitivity
2725 void CWriter::visitInlineAsm(CallInst &CI) {
2726 InlineAsm* as = cast<InlineAsm>(CI.getOperand(0));
2727 std::vector<InlineAsm::ConstraintInfo> Constraints = as->ParseConstraints();
2728 std::vector<std::pair<std::string, Value*> > Input;
2729 std::vector<std::pair<std::string, Value*> > Output;
2730 std::string Clobber;
2731 int count = CI.getType() == Type::VoidTy ? 1 : 0;
2732 for (std::vector<InlineAsm::ConstraintInfo>::iterator I = Constraints.begin(),
2733 E = Constraints.end(); I != E; ++I) {
2734 assert(I->Codes.size() == 1 && "Too many asm constraint codes to handle");
2736 InterpretASMConstraint(*I);
2739 assert(0 && "Unknown asm constraint");
2741 case InlineAsm::isInput: {
2743 Input.push_back(std::make_pair(c, count ? CI.getOperand(count) : &CI));
2744 ++count; //consume arg
2748 case InlineAsm::isOutput: {
2750 Output.push_back(std::make_pair("="+((I->isEarlyClobber ? "&" : "")+c),
2751 count ? CI.getOperand(count) : &CI));
2752 ++count; //consume arg
2756 case InlineAsm::isClobber: {
2758 Clobber += ",\"" + c + "\"";
2764 //fix up the asm string for gcc
2765 std::string asmstr = gccifyAsm(as->getAsmString());
2767 Out << "__asm__ volatile (\"" << asmstr << "\"\n";
2769 for (std::vector<std::pair<std::string, Value*> >::iterator I = Output.begin(),
2770 E = Output.end(); I != E; ++I) {
2771 Out << "\"" << I->first << "\"(";
2772 writeOperandRaw(I->second);
2778 for (std::vector<std::pair<std::string, Value*> >::iterator I = Input.begin(),
2779 E = Input.end(); I != E; ++I) {
2780 Out << "\"" << I->first << "\"(";
2781 writeOperandRaw(I->second);
2787 Out << "\n :" << Clobber.substr(1);
2791 void CWriter::visitMallocInst(MallocInst &I) {
2792 assert(0 && "lowerallocations pass didn't work!");
2795 void CWriter::visitAllocaInst(AllocaInst &I) {
2797 printType(Out, I.getType());
2798 Out << ") alloca(sizeof(";
2799 printType(Out, I.getType()->getElementType());
2801 if (I.isArrayAllocation()) {
2803 writeOperand(I.getOperand(0));
2808 void CWriter::visitFreeInst(FreeInst &I) {
2809 assert(0 && "lowerallocations pass didn't work!");
2812 void CWriter::printIndexingExpression(Value *Ptr, gep_type_iterator I,
2813 gep_type_iterator E) {
2814 bool HasImplicitAddress = false;
2815 // If accessing a global value with no indexing, avoid *(&GV) syndrome
2816 if (isa<GlobalValue>(Ptr)) {
2817 HasImplicitAddress = true;
2818 } else if (isDirectAlloca(Ptr)) {
2819 HasImplicitAddress = true;
2823 if (!HasImplicitAddress)
2824 Out << '*'; // Implicit zero first argument: '*x' is equivalent to 'x[0]'
2826 writeOperandInternal(Ptr);
2830 const Constant *CI = dyn_cast<Constant>(I.getOperand());
2831 if (HasImplicitAddress && (!CI || !CI->isNullValue()))
2834 writeOperandInternal(Ptr);
2836 if (HasImplicitAddress && (!CI || !CI->isNullValue())) {
2838 HasImplicitAddress = false; // HIA is only true if we haven't addressed yet
2841 assert(!HasImplicitAddress || (CI && CI->isNullValue()) &&
2842 "Can only have implicit address with direct accessing");
2844 if (HasImplicitAddress) {
2846 } else if (CI && CI->isNullValue()) {
2847 gep_type_iterator TmpI = I; ++TmpI;
2849 // Print out the -> operator if possible...
2850 if (TmpI != E && isa<StructType>(*TmpI)) {
2851 Out << (HasImplicitAddress ? "." : "->");
2852 Out << "field" << cast<ConstantInt>(TmpI.getOperand())->getZExtValue();
2858 if (isa<StructType>(*I)) {
2859 Out << ".field" << cast<ConstantInt>(I.getOperand())->getZExtValue();
2862 writeOperand(I.getOperand());
2867 void CWriter::visitLoadInst(LoadInst &I) {
2869 if (I.isVolatile()) {
2871 printType(Out, I.getType(), false, "volatile*");
2875 writeOperand(I.getOperand(0));
2881 void CWriter::visitStoreInst(StoreInst &I) {
2883 if (I.isVolatile()) {
2885 printType(Out, I.getOperand(0)->getType(), false, " volatile*");
2888 writeOperand(I.getPointerOperand());
2889 if (I.isVolatile()) Out << ')';
2891 Value *Operand = I.getOperand(0);
2892 Constant *BitMask = 0;
2893 if (const IntegerType* ITy = dyn_cast<IntegerType>(Operand->getType()))
2894 if (!ITy->isPowerOf2ByteWidth())
2895 // We have a bit width that doesn't match an even power-of-2 byte
2896 // size. Consequently we must & the value with the type's bit mask
2897 BitMask = ConstantInt::get(ITy, ITy->getBitMask());
2900 writeOperand(Operand);
2903 printConstant(BitMask);
2908 void CWriter::visitGetElementPtrInst(GetElementPtrInst &I) {
2910 printIndexingExpression(I.getPointerOperand(), gep_type_begin(I),
2914 void CWriter::visitVAArgInst(VAArgInst &I) {
2915 Out << "va_arg(*(va_list*)";
2916 writeOperand(I.getOperand(0));
2918 printType(Out, I.getType());
2922 //===----------------------------------------------------------------------===//
2923 // External Interface declaration
2924 //===----------------------------------------------------------------------===//
2926 bool CTargetMachine::addPassesToEmitWholeFile(PassManager &PM,
2928 CodeGenFileType FileType,
2930 if (FileType != TargetMachine::AssemblyFile) return true;
2932 PM.add(createLowerGCPass());
2933 PM.add(createLowerAllocationsPass(true));
2934 PM.add(createLowerInvokePass());
2935 PM.add(createCFGSimplificationPass()); // clean up after lower invoke.
2936 PM.add(new CBackendNameAllUsedStructsAndMergeFunctions());
2937 PM.add(new CWriter(o));