1 //===-- Writer.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/Constants.h"
17 #include "llvm/DerivedTypes.h"
18 #include "llvm/Module.h"
19 #include "llvm/Instructions.h"
20 #include "llvm/Pass.h"
21 #include "llvm/PassManager.h"
22 #include "llvm/SymbolTable.h"
23 #include "llvm/Intrinsics.h"
24 #include "llvm/Analysis/ConstantsScanner.h"
25 #include "llvm/Analysis/FindUsedTypes.h"
26 #include "llvm/Analysis/LoopInfo.h"
27 #include "llvm/CodeGen/IntrinsicLowering.h"
28 #include "llvm/Transforms/Scalar.h"
29 #include "llvm/Target/TargetMachineRegistry.h"
30 #include "llvm/Support/CallSite.h"
31 #include "llvm/Support/CFG.h"
32 #include "llvm/Support/GetElementPtrTypeIterator.h"
33 #include "llvm/Support/InstVisitor.h"
34 #include "llvm/Support/Mangler.h"
35 #include "Support/StringExtras.h"
36 #include "Support/MathExtras.h"
37 #include "Config/config.h"
44 // Register the target.
45 RegisterTarget<CTargetMachine> X("c", " C backend");
47 /// NameAllUsedStructs - This pass inserts names for any unnamed structure
48 /// types that are used by the program.
50 class CBackendNameAllUsedStructs : public Pass {
51 void getAnalysisUsage(AnalysisUsage &AU) const {
52 AU.addRequired<FindUsedTypes>();
55 virtual const char *getPassName() const {
56 return "C backend type canonicalizer";
59 virtual bool run(Module &M);
62 /// CWriter - This class is the main chunk of code that converts an LLVM
63 /// module to a C translation unit.
64 class CWriter : public FunctionPass, public InstVisitor<CWriter> {
66 IntrinsicLowering &IL;
69 const Module *TheModule;
70 std::map<const Type *, std::string> TypeNames;
72 std::map<const ConstantFP *, unsigned> FPConstantMap;
74 CWriter(std::ostream &o, IntrinsicLowering &il) : Out(o), IL(il) {}
76 virtual const char *getPassName() const { return "C backend"; }
78 void getAnalysisUsage(AnalysisUsage &AU) const {
79 AU.addRequired<LoopInfo>();
83 virtual bool doInitialization(Module &M);
85 bool runOnFunction(Function &F) {
86 LI = &getAnalysis<LoopInfo>();
88 // Output all floating point constants that cannot be printed accurately.
89 printFloatingPointConstants(F);
93 FPConstantMap.clear();
97 virtual bool doFinalization(Module &M) {
104 std::ostream &printType(std::ostream &Out, const Type *Ty,
105 const std::string &VariableName = "",
106 bool IgnoreName = false);
108 void writeOperand(Value *Operand);
109 void writeOperandInternal(Value *Operand);
112 void lowerIntrinsics(Function &F);
114 bool nameAllUsedStructureTypes(Module &M);
115 void printModule(Module *M);
116 void printModuleTypes(const SymbolTable &ST);
117 void printContainedStructs(const Type *Ty, std::set<const StructType *> &);
118 void printFloatingPointConstants(Function &F);
119 void printFunctionSignature(const Function *F, bool Prototype);
121 void printFunction(Function &);
122 void printBasicBlock(BasicBlock *BB);
123 void printLoop(Loop *L);
125 void printConstant(Constant *CPV);
126 void printConstantArray(ConstantArray *CPA);
128 // isInlinableInst - Attempt to inline instructions into their uses to build
129 // trees as much as possible. To do this, we have to consistently decide
130 // what is acceptable to inline, so that variable declarations don't get
131 // printed and an extra copy of the expr is not emitted.
133 static bool isInlinableInst(const Instruction &I) {
134 // Always inline setcc instructions, even if they are shared by multiple
135 // expressions. GCC generates horrible code if we don't.
136 if (isa<SetCondInst>(I)) return true;
138 // Must be an expression, must be used exactly once. If it is dead, we
139 // emit it inline where it would go.
140 if (I.getType() == Type::VoidTy || !I.hasOneUse() ||
141 isa<TerminatorInst>(I) || isa<CallInst>(I) || isa<PHINode>(I) ||
142 isa<LoadInst>(I) || isa<VAArgInst>(I) || isa<VANextInst>(I))
143 // Don't inline a load across a store or other bad things!
146 // Only inline instruction it it's use is in the same BB as the inst.
147 return I.getParent() == cast<Instruction>(I.use_back())->getParent();
150 // isDirectAlloca - Define fixed sized allocas in the entry block as direct
151 // variables which are accessed with the & operator. This causes GCC to
152 // generate significantly better code than to emit alloca calls directly.
154 static const AllocaInst *isDirectAlloca(const Value *V) {
155 const AllocaInst *AI = dyn_cast<AllocaInst>(V);
156 if (!AI) return false;
157 if (AI->isArrayAllocation())
158 return 0; // FIXME: we can also inline fixed size array allocas!
159 if (AI->getParent() != &AI->getParent()->getParent()->getEntryBlock())
164 // Instruction visitation functions
165 friend class InstVisitor<CWriter>;
167 void visitReturnInst(ReturnInst &I);
168 void visitBranchInst(BranchInst &I);
169 void visitSwitchInst(SwitchInst &I);
170 void visitInvokeInst(InvokeInst &I) {
171 assert(0 && "Lowerinvoke pass didn't work!");
174 void visitUnwindInst(UnwindInst &I) {
175 assert(0 && "Lowerinvoke pass didn't work!");
178 void visitPHINode(PHINode &I);
179 void visitBinaryOperator(Instruction &I);
181 void visitCastInst (CastInst &I);
182 void visitSelectInst(SelectInst &I);
183 void visitCallInst (CallInst &I);
184 void visitCallSite (CallSite CS);
185 void visitShiftInst(ShiftInst &I) { visitBinaryOperator(I); }
187 void visitMallocInst(MallocInst &I);
188 void visitAllocaInst(AllocaInst &I);
189 void visitFreeInst (FreeInst &I);
190 void visitLoadInst (LoadInst &I);
191 void visitStoreInst (StoreInst &I);
192 void visitGetElementPtrInst(GetElementPtrInst &I);
193 void visitVANextInst(VANextInst &I);
194 void visitVAArgInst (VAArgInst &I);
196 void visitInstruction(Instruction &I) {
197 std::cerr << "C Writer does not know about " << I;
201 void outputLValue(Instruction *I) {
202 Out << " " << Mang->getValueName(I) << " = ";
205 bool isGotoCodeNecessary(BasicBlock *From, BasicBlock *To);
206 void printPHICopiesForSuccessors(BasicBlock *CurBlock,
208 void printBranchToBlock(BasicBlock *CurBlock, BasicBlock *SuccBlock,
210 void printIndexingExpression(Value *Ptr, gep_type_iterator I,
211 gep_type_iterator E);
215 /// This method inserts names for any unnamed structure types that are used by
216 /// the program, and removes names from structure types that are not used by the
219 bool CBackendNameAllUsedStructs::run(Module &M) {
220 // Get a set of types that are used by the program...
221 std::set<const Type *> UT = getAnalysis<FindUsedTypes>().getTypes();
223 // Loop over the module symbol table, removing types from UT that are
224 // already named, and removing names for structure types that are not used.
226 SymbolTable &MST = M.getSymbolTable();
227 for (SymbolTable::type_iterator TI = MST.type_begin(), TE = MST.type_end();
229 SymbolTable::type_iterator I = TI++;
230 if (const StructType *STy = dyn_cast<StructType>(I->second)) {
231 // If this is not used, remove it from the symbol table.
232 std::set<const Type *>::iterator UTI = UT.find(STy);
240 // UT now contains types that are not named. Loop over it, naming
243 bool Changed = false;
244 unsigned RenameCounter = 0;
245 for (std::set<const Type *>::const_iterator I = UT.begin(), E = UT.end();
247 if (const StructType *ST = dyn_cast<StructType>(*I)) {
248 while (M.addTypeName("unnamed"+utostr(RenameCounter), ST))
256 // Pass the Type* and the variable name and this prints out the variable
259 std::ostream &CWriter::printType(std::ostream &Out, const Type *Ty,
260 const std::string &NameSoFar,
262 if (Ty->isPrimitiveType())
263 switch (Ty->getTypeID()) {
264 case Type::VoidTyID: return Out << "void " << NameSoFar;
265 case Type::BoolTyID: return Out << "bool " << NameSoFar;
266 case Type::UByteTyID: return Out << "unsigned char " << NameSoFar;
267 case Type::SByteTyID: return Out << "signed char " << NameSoFar;
268 case Type::UShortTyID: return Out << "unsigned short " << NameSoFar;
269 case Type::ShortTyID: return Out << "short " << NameSoFar;
270 case Type::UIntTyID: return Out << "unsigned " << NameSoFar;
271 case Type::IntTyID: return Out << "int " << NameSoFar;
272 case Type::ULongTyID: return Out << "unsigned long long " << NameSoFar;
273 case Type::LongTyID: return Out << "signed long long " << NameSoFar;
274 case Type::FloatTyID: return Out << "float " << NameSoFar;
275 case Type::DoubleTyID: return Out << "double " << NameSoFar;
277 std::cerr << "Unknown primitive type: " << *Ty << "\n";
281 // Check to see if the type is named.
282 if (!IgnoreName || isa<OpaqueType>(Ty)) {
283 std::map<const Type *, std::string>::iterator I = TypeNames.find(Ty);
284 if (I != TypeNames.end()) return Out << I->second << " " << NameSoFar;
287 switch (Ty->getTypeID()) {
288 case Type::FunctionTyID: {
289 const FunctionType *MTy = cast<FunctionType>(Ty);
290 std::stringstream FunctionInnards;
291 FunctionInnards << " (" << NameSoFar << ") (";
292 for (FunctionType::param_iterator I = MTy->param_begin(),
293 E = MTy->param_end(); I != E; ++I) {
294 if (I != MTy->param_begin())
295 FunctionInnards << ", ";
296 printType(FunctionInnards, *I, "");
298 if (MTy->isVarArg()) {
299 if (MTy->getNumParams())
300 FunctionInnards << ", ...";
301 } else if (!MTy->getNumParams()) {
302 FunctionInnards << "void";
304 FunctionInnards << ")";
305 std::string tstr = FunctionInnards.str();
306 printType(Out, MTy->getReturnType(), tstr);
309 case Type::StructTyID: {
310 const StructType *STy = cast<StructType>(Ty);
311 Out << NameSoFar + " {\n";
313 for (StructType::element_iterator I = STy->element_begin(),
314 E = STy->element_end(); I != E; ++I) {
316 printType(Out, *I, "field" + utostr(Idx++));
322 case Type::PointerTyID: {
323 const PointerType *PTy = cast<PointerType>(Ty);
324 std::string ptrName = "*" + NameSoFar;
326 if (isa<ArrayType>(PTy->getElementType()))
327 ptrName = "(" + ptrName + ")";
329 return printType(Out, PTy->getElementType(), ptrName);
332 case Type::ArrayTyID: {
333 const ArrayType *ATy = cast<ArrayType>(Ty);
334 unsigned NumElements = ATy->getNumElements();
335 return printType(Out, ATy->getElementType(),
336 NameSoFar + "[" + utostr(NumElements) + "]");
339 case Type::OpaqueTyID: {
340 static int Count = 0;
341 std::string TyName = "struct opaque_" + itostr(Count++);
342 assert(TypeNames.find(Ty) == TypeNames.end());
343 TypeNames[Ty] = TyName;
344 return Out << TyName << " " << NameSoFar;
347 assert(0 && "Unhandled case in getTypeProps!");
354 void CWriter::printConstantArray(ConstantArray *CPA) {
356 // As a special case, print the array as a string if it is an array of
357 // ubytes or an array of sbytes with positive values.
359 const Type *ETy = CPA->getType()->getElementType();
360 bool isString = (ETy == Type::SByteTy || ETy == Type::UByteTy);
362 // Make sure the last character is a null char, as automatically added by C
363 if (isString && (CPA->getNumOperands() == 0 ||
364 !cast<Constant>(*(CPA->op_end()-1))->isNullValue()))
369 // Keep track of whether the last number was a hexadecimal escape
370 bool LastWasHex = false;
372 // Do not include the last character, which we know is null
373 for (unsigned i = 0, e = CPA->getNumOperands()-1; i != e; ++i) {
374 unsigned char C = cast<ConstantInt>(CPA->getOperand(i))->getRawValue();
376 // Print it out literally if it is a printable character. The only thing
377 // to be careful about is when the last letter output was a hex escape
378 // code, in which case we have to be careful not to print out hex digits
379 // explicitly (the C compiler thinks it is a continuation of the previous
380 // character, sheesh...)
382 if (isprint(C) && (!LastWasHex || !isxdigit(C))) {
384 if (C == '"' || C == '\\')
391 case '\n': Out << "\\n"; break;
392 case '\t': Out << "\\t"; break;
393 case '\r': Out << "\\r"; break;
394 case '\v': Out << "\\v"; break;
395 case '\a': Out << "\\a"; break;
396 case '\"': Out << "\\\""; break;
397 case '\'': Out << "\\\'"; break;
400 Out << (char)(( C/16 < 10) ? ( C/16 +'0') : ( C/16 -10+'A'));
401 Out << (char)(((C&15) < 10) ? ((C&15)+'0') : ((C&15)-10+'A'));
410 if (CPA->getNumOperands()) {
412 printConstant(cast<Constant>(CPA->getOperand(0)));
413 for (unsigned i = 1, e = CPA->getNumOperands(); i != e; ++i) {
415 printConstant(cast<Constant>(CPA->getOperand(i)));
422 // isFPCSafeToPrint - Returns true if we may assume that CFP may be written out
423 // textually as a double (rather than as a reference to a stack-allocated
424 // variable). We decide this by converting CFP to a string and back into a
425 // double, and then checking whether the conversion results in a bit-equal
426 // double to the original value of CFP. This depends on us and the target C
427 // compiler agreeing on the conversion process (which is pretty likely since we
428 // only deal in IEEE FP).
430 static bool isFPCSafeToPrint(const ConstantFP *CFP) {
433 sprintf(Buffer, "%a", CFP->getValue());
435 if (!strncmp(Buffer, "0x", 2) ||
436 !strncmp(Buffer, "-0x", 3) ||
437 !strncmp(Buffer, "+0x", 3))
438 return atof(Buffer) == CFP->getValue();
441 std::string StrVal = ftostr(CFP->getValue());
443 while (StrVal[0] == ' ')
444 StrVal.erase(StrVal.begin());
446 // Check to make sure that the stringized number is not some string like "Inf"
447 // or NaN. Check that the string matches the "[-+]?[0-9]" regex.
448 if ((StrVal[0] >= '0' && StrVal[0] <= '9') ||
449 ((StrVal[0] == '-' || StrVal[0] == '+') &&
450 (StrVal[1] >= '0' && StrVal[1] <= '9')))
451 // Reparse stringized version!
452 return atof(StrVal.c_str()) == CFP->getValue();
457 // printConstant - The LLVM Constant to C Constant converter.
458 void CWriter::printConstant(Constant *CPV) {
459 if (const ConstantExpr *CE = dyn_cast<ConstantExpr>(CPV)) {
460 switch (CE->getOpcode()) {
461 case Instruction::Cast:
463 printType(Out, CPV->getType());
465 printConstant(CE->getOperand(0));
469 case Instruction::GetElementPtr:
471 printIndexingExpression(CE->getOperand(0), gep_type_begin(CPV),
475 case Instruction::Select:
477 printConstant(CE->getOperand(0));
479 printConstant(CE->getOperand(1));
481 printConstant(CE->getOperand(2));
484 case Instruction::Add:
485 case Instruction::Sub:
486 case Instruction::Mul:
487 case Instruction::Div:
488 case Instruction::Rem:
489 case Instruction::SetEQ:
490 case Instruction::SetNE:
491 case Instruction::SetLT:
492 case Instruction::SetLE:
493 case Instruction::SetGT:
494 case Instruction::SetGE:
495 case Instruction::Shl:
496 case Instruction::Shr:
498 printConstant(CE->getOperand(0));
499 switch (CE->getOpcode()) {
500 case Instruction::Add: Out << " + "; break;
501 case Instruction::Sub: Out << " - "; break;
502 case Instruction::Mul: Out << " * "; break;
503 case Instruction::Div: Out << " / "; break;
504 case Instruction::Rem: Out << " % "; break;
505 case Instruction::SetEQ: Out << " == "; break;
506 case Instruction::SetNE: Out << " != "; break;
507 case Instruction::SetLT: Out << " < "; break;
508 case Instruction::SetLE: Out << " <= "; break;
509 case Instruction::SetGT: Out << " > "; break;
510 case Instruction::SetGE: Out << " >= "; break;
511 case Instruction::Shl: Out << " << "; break;
512 case Instruction::Shr: Out << " >> "; break;
513 default: assert(0 && "Illegal opcode here!");
515 printConstant(CE->getOperand(1));
520 std::cerr << "CWriter Error: Unhandled constant expression: "
526 switch (CPV->getType()->getTypeID()) {
528 Out << (CPV == ConstantBool::False ? "0" : "1"); break;
529 case Type::SByteTyID:
530 case Type::ShortTyID:
531 Out << cast<ConstantSInt>(CPV)->getValue(); break;
533 if ((int)cast<ConstantSInt>(CPV)->getValue() == (int)0x80000000)
534 Out << "((int)0x80000000)"; // Handle MININT specially to avoid warning
536 Out << cast<ConstantSInt>(CPV)->getValue();
540 Out << cast<ConstantSInt>(CPV)->getValue() << "ll"; break;
542 case Type::UByteTyID:
543 case Type::UShortTyID:
544 Out << cast<ConstantUInt>(CPV)->getValue(); break;
546 Out << cast<ConstantUInt>(CPV)->getValue() << "u"; break;
547 case Type::ULongTyID:
548 Out << cast<ConstantUInt>(CPV)->getValue() << "ull"; break;
550 case Type::FloatTyID:
551 case Type::DoubleTyID: {
552 ConstantFP *FPC = cast<ConstantFP>(CPV);
553 std::map<const ConstantFP*, unsigned>::iterator I = FPConstantMap.find(FPC);
554 if (I != FPConstantMap.end()) {
555 // Because of FP precision problems we must load from a stack allocated
556 // value that holds the value in hex.
557 Out << "(*(" << (FPC->getType() == Type::FloatTy ? "float" : "double")
558 << "*)&FPConstant" << I->second << ")";
562 // Print out the constant as a floating point number.
564 sprintf(Buffer, "%a", FPC->getValue());
567 Num = ftostr(FPC->getValue());
570 if (IsNAN(FPC->getValue())) {
572 if (FPC->getType() == Type::FloatTy)
573 Out << "LLVM_NANF(\"0\") /*nan*/ ";
575 Out << "LLVM_NAN(\"0\") /*nan*/ ";
576 } else if (IsInf(FPC->getValue())) {
578 if (FPC->getValue() < 0) Out << "-";
579 if (FPC->getType() == Type::FloatTy)
580 Out << "LLVM_INFF /*inf*/ ";
582 Out << "LLVM_INF /*inf*/ ";
590 case Type::ArrayTyID:
591 if (isa<ConstantAggregateZero>(CPV)) {
592 const ArrayType *AT = cast<ArrayType>(CPV->getType());
594 if (AT->getNumElements()) {
596 Constant *CZ = Constant::getNullValue(AT->getElementType());
598 for (unsigned i = 1, e = AT->getNumElements(); i != e; ++i) {
605 printConstantArray(cast<ConstantArray>(CPV));
609 case Type::StructTyID:
610 if (isa<ConstantAggregateZero>(CPV)) {
611 const StructType *ST = cast<StructType>(CPV->getType());
613 if (ST->getNumElements()) {
615 printConstant(Constant::getNullValue(ST->getElementType(0)));
616 for (unsigned i = 1, e = ST->getNumElements(); i != e; ++i) {
618 printConstant(Constant::getNullValue(ST->getElementType(i)));
624 if (CPV->getNumOperands()) {
626 printConstant(cast<Constant>(CPV->getOperand(0)));
627 for (unsigned i = 1, e = CPV->getNumOperands(); i != e; ++i) {
629 printConstant(cast<Constant>(CPV->getOperand(i)));
636 case Type::PointerTyID:
637 if (isa<ConstantPointerNull>(CPV)) {
639 printType(Out, CPV->getType());
640 Out << ")/*NULL*/0)";
642 } else if (GlobalValue *GV = dyn_cast<GlobalValue>(CPV)) {
648 std::cerr << "Unknown constant type: " << *CPV << "\n";
653 void CWriter::writeOperandInternal(Value *Operand) {
654 if (Instruction *I = dyn_cast<Instruction>(Operand))
655 if (isInlinableInst(*I) && !isDirectAlloca(I)) {
656 // Should we inline this instruction to build a tree?
663 Constant* CPV = dyn_cast<Constant>(Operand);
664 if (CPV && !isa<GlobalValue>(CPV)) {
667 Out << Mang->getValueName(Operand);
671 void CWriter::writeOperand(Value *Operand) {
672 if (isa<GlobalVariable>(Operand) || isDirectAlloca(Operand))
673 Out << "(&"; // Global variables are references as their addresses by llvm
675 writeOperandInternal(Operand);
677 if (isa<GlobalVariable>(Operand) || isDirectAlloca(Operand))
681 // generateCompilerSpecificCode - This is where we add conditional compilation
682 // directives to cater to specific compilers as need be.
684 static void generateCompilerSpecificCode(std::ostream& Out) {
685 // Alloca is hard to get, and we don't want to include stdlib.h here...
686 Out << "/* get a declaration for alloca */\n"
687 << "#if defined(sun) || defined(__CYGWIN__) || defined(__APPLE__)\n"
688 << "extern void *__builtin_alloca(unsigned long);\n"
689 << "#define alloca(x) __builtin_alloca(x)\n"
691 << "#ifndef __FreeBSD__\n"
692 << "#include <alloca.h>\n"
696 // We output GCC specific attributes to preserve 'linkonce'ness on globals.
697 // If we aren't being compiled with GCC, just drop these attributes.
698 Out << "#ifndef __GNUC__ /* Can only support \"linkonce\" vars with GCC */\n"
699 << "#define __attribute__(X)\n"
703 // At some point, we should support "external weak" vs. "weak" linkages.
704 // On Mac OS X, "external weak" is spelled "__attribute__((weak_import))".
705 Out << "#if defined(__GNUC__) && defined(__APPLE_CC__)\n"
706 << "#define __EXTERNAL_WEAK__ __attribute__((weak_import))\n"
707 << "#elif defined(__GNUC__)\n"
708 << "#define __EXTERNAL_WEAK__ __attribute__((weak))\n"
710 << "#define __EXTERNAL_WEAK__\n"
714 // For now, turn off the weak linkage attribute on Mac OS X. (See above.)
715 Out << "#if defined(__GNUC__) && defined(__APPLE_CC__)\n"
716 << "#define __ATTRIBUTE_WEAK__\n"
717 << "#elif defined(__GNUC__)\n"
718 << "#define __ATTRIBUTE_WEAK__ __attribute__((weak))\n"
720 << "#define __ATTRIBUTE_WEAK__\n"
723 // Define NaN and Inf as GCC builtins if using GCC, as 0 otherwise
724 // From the GCC documentation:
726 // double __builtin_nan (const char *str)
728 // This is an implementation of the ISO C99 function nan.
730 // Since ISO C99 defines this function in terms of strtod, which we do
731 // not implement, a description of the parsing is in order. The string is
732 // parsed as by strtol; that is, the base is recognized by leading 0 or
733 // 0x prefixes. The number parsed is placed in the significand such that
734 // the least significant bit of the number is at the least significant
735 // bit of the significand. The number is truncated to fit the significand
736 // field provided. The significand is forced to be a quiet NaN.
738 // This function, if given a string literal, is evaluated early enough
739 // that it is considered a compile-time constant.
741 // float __builtin_nanf (const char *str)
743 // Similar to __builtin_nan, except the return type is float.
745 // double __builtin_inf (void)
747 // Similar to __builtin_huge_val, except a warning is generated if the
748 // target floating-point format does not support infinities. This
749 // function is suitable for implementing the ISO C99 macro INFINITY.
751 // float __builtin_inff (void)
753 // Similar to __builtin_inf, except the return type is float.
754 Out << "#ifdef __GNUC__\n"
755 << "#define LLVM_NAN(NanStr) __builtin_nan(NanStr) /* Double */\n"
756 << "#define LLVM_NANF(NanStr) __builtin_nan(NanStr) /* Float */\n"
757 << "#define LLVM_INF __builtin_inf() /* Double */\n"
758 << "#define LLVM_INFF __builtin_inff() /* Float */\n"
760 << "#define LLVM_NAN(NanStr) ((double)0.0) /* Double */\n"
761 << "#define LLVM_NANF(NanStr) 0.0F /* Float */\n"
762 << "#define LLVM_INF ((double)0.0) /* Double */\n"
763 << "#define LLVM_INFF 0.0F /* Float */\n"
767 bool CWriter::doInitialization(Module &M) {
773 // Ensure that all structure types have names...
774 Mang = new Mangler(M);
776 // get declaration for alloca
777 Out << "/* Provide Declarations */\n";
778 Out << "#include <stdarg.h>\n"; // Varargs support
779 Out << "#include <setjmp.h>\n"; // Unwind support
780 generateCompilerSpecificCode(Out);
782 // Provide a definition for `bool' if not compiling with a C++ compiler.
784 << "#ifndef __cplusplus\ntypedef unsigned char bool;\n#endif\n"
786 << "\n\n/* Support for floating point constants */\n"
787 << "typedef unsigned long long ConstantDoubleTy;\n"
788 << "typedef unsigned int ConstantFloatTy;\n"
790 << "\n\n/* Global Declarations */\n";
792 // First output all the declarations for the program, because C requires
793 // Functions & globals to be declared before they are used.
796 // Loop over the symbol table, emitting all named constants...
797 printModuleTypes(M.getSymbolTable());
799 // Global variable declarations...
801 Out << "\n/* External Global Variable Declarations */\n";
802 for (Module::giterator I = M.gbegin(), E = M.gend(); I != E; ++I) {
803 if (I->hasExternalLinkage()) {
805 printType(Out, I->getType()->getElementType(), Mang->getValueName(I));
811 // Function declarations
813 Out << "\n/* Function Declarations */\n";
814 for (Module::iterator I = M.begin(), E = M.end(); I != E; ++I) {
815 // Don't print declarations for intrinsic functions.
816 if (!I->getIntrinsicID() &&
817 I->getName() != "setjmp" && I->getName() != "longjmp") {
818 printFunctionSignature(I, true);
819 if (I->hasWeakLinkage()) Out << " __ATTRIBUTE_WEAK__";
820 if (I->hasLinkOnceLinkage()) Out << " __ATTRIBUTE_WEAK__";
826 // Output the global variable declarations
828 Out << "\n\n/* Global Variable Declarations */\n";
829 for (Module::giterator I = M.gbegin(), E = M.gend(); I != E; ++I)
830 if (!I->isExternal()) {
832 printType(Out, I->getType()->getElementType(), Mang->getValueName(I));
834 if (I->hasLinkOnceLinkage())
835 Out << " __attribute__((common))";
836 else if (I->hasWeakLinkage())
837 Out << " __ATTRIBUTE_WEAK__";
842 // Output the global variable definitions and contents...
844 Out << "\n\n/* Global Variable Definitions and Initialization */\n";
845 for (Module::giterator I = M.gbegin(), E = M.gend(); I != E; ++I)
846 if (!I->isExternal()) {
847 if (I->hasInternalLinkage())
849 printType(Out, I->getType()->getElementType(), Mang->getValueName(I));
850 if (I->hasLinkOnceLinkage())
851 Out << " __attribute__((common))";
852 else if (I->hasWeakLinkage())
853 Out << " __ATTRIBUTE_WEAK__";
855 // If the initializer is not null, emit the initializer. If it is null,
856 // we try to avoid emitting large amounts of zeros. The problem with
857 // this, however, occurs when the variable has weak linkage. In this
858 // case, the assembler will complain about the variable being both weak
859 // and common, so we disable this optimization.
860 if (!I->getInitializer()->isNullValue()) {
862 writeOperand(I->getInitializer());
863 } else if (I->hasWeakLinkage()) {
864 // We have to specify an initializer, but it doesn't have to be
865 // complete. If the value is an aggregate, print out { 0 }, and let
866 // the compiler figure out the rest of the zeros.
868 if (isa<StructType>(I->getInitializer()->getType()) ||
869 isa<ArrayType>(I->getInitializer()->getType())) {
872 // Just print it out normally.
873 writeOperand(I->getInitializer());
881 Out << "\n\n/* Function Bodies */\n";
886 /// Output all floating point constants that cannot be printed accurately...
887 void CWriter::printFloatingPointConstants(Function &F) {
898 // Scan the module for floating point constants. If any FP constant is used
899 // in the function, we want to redirect it here so that we do not depend on
900 // the precision of the printed form, unless the printed form preserves
903 static unsigned FPCounter = 0;
904 for (constant_iterator I = constant_begin(&F), E = constant_end(&F);
906 if (const ConstantFP *FPC = dyn_cast<ConstantFP>(*I))
907 if (!isFPCSafeToPrint(FPC) && // Do not put in FPConstantMap if safe.
908 !FPConstantMap.count(FPC)) {
909 double Val = FPC->getValue();
911 FPConstantMap[FPC] = FPCounter; // Number the FP constants
913 if (FPC->getType() == Type::DoubleTy) {
915 Out << "static const ConstantDoubleTy FPConstant" << FPCounter++
916 << " = 0x" << std::hex << DBLUnion.U << std::dec
917 << "ULL; /* " << Val << " */\n";
918 } else if (FPC->getType() == Type::FloatTy) {
920 Out << "static const ConstantFloatTy FPConstant" << FPCounter++
921 << " = 0x" << std::hex << FLTUnion.U << std::dec
922 << "U; /* " << Val << " */\n";
924 assert(0 && "Unknown float type!");
931 /// printSymbolTable - Run through symbol table looking for type names. If a
932 /// type name is found, emit it's declaration...
934 void CWriter::printModuleTypes(const SymbolTable &ST) {
935 // If there are no type names, exit early.
936 if ( ! ST.hasTypes() )
939 // We are only interested in the type plane of the symbol table...
940 SymbolTable::type_const_iterator I = ST.type_begin();
941 SymbolTable::type_const_iterator End = ST.type_end();
943 // Print out forward declarations for structure types before anything else!
944 Out << "/* Structure forward decls */\n";
945 for (; I != End; ++I)
946 if (const Type *STy = dyn_cast<StructType>(I->second)) {
947 std::string Name = "struct l_" + Mangler::makeNameProper(I->first);
948 Out << Name << ";\n";
949 TypeNames.insert(std::make_pair(STy, Name));
954 // Now we can print out typedefs...
955 Out << "/* Typedefs */\n";
956 for (I = ST.type_begin(); I != End; ++I) {
957 const Type *Ty = cast<Type>(I->second);
958 std::string Name = "l_" + Mangler::makeNameProper(I->first);
960 printType(Out, Ty, Name);
966 // Keep track of which structures have been printed so far...
967 std::set<const StructType *> StructPrinted;
969 // Loop over all structures then push them into the stack so they are
970 // printed in the correct order.
972 Out << "/* Structure contents */\n";
973 for (I = ST.type_begin(); I != End; ++I)
974 if (const StructType *STy = dyn_cast<StructType>(I->second))
975 // Only print out used types!
976 printContainedStructs(STy, StructPrinted);
979 // Push the struct onto the stack and recursively push all structs
980 // this one depends on.
981 void CWriter::printContainedStructs(const Type *Ty,
982 std::set<const StructType*> &StructPrinted){
983 if (const StructType *STy = dyn_cast<StructType>(Ty)) {
984 //Check to see if we have already printed this struct
985 if (StructPrinted.count(STy) == 0) {
986 // Print all contained types first...
987 for (StructType::element_iterator I = STy->element_begin(),
988 E = STy->element_end(); I != E; ++I) {
989 const Type *Ty1 = I->get();
990 if (isa<StructType>(Ty1) || isa<ArrayType>(Ty1))
991 printContainedStructs(*I, StructPrinted);
994 //Print structure type out..
995 StructPrinted.insert(STy);
996 std::string Name = TypeNames[STy];
997 printType(Out, STy, Name, true);
1001 // If it is an array, check contained types and continue
1002 } else if (const ArrayType *ATy = dyn_cast<ArrayType>(Ty)){
1003 const Type *Ty1 = ATy->getElementType();
1004 if (isa<StructType>(Ty1) || isa<ArrayType>(Ty1))
1005 printContainedStructs(Ty1, StructPrinted);
1010 void CWriter::printFunctionSignature(const Function *F, bool Prototype) {
1011 if (F->hasInternalLinkage()) Out << "static ";
1013 // Loop over the arguments, printing them...
1014 const FunctionType *FT = cast<FunctionType>(F->getFunctionType());
1016 std::stringstream FunctionInnards;
1018 // Print out the name...
1019 FunctionInnards << Mang->getValueName(F) << "(";
1021 if (!F->isExternal()) {
1023 std::string ArgName;
1024 if (F->abegin()->hasName() || !Prototype)
1025 ArgName = Mang->getValueName(F->abegin());
1026 printType(FunctionInnards, F->afront().getType(), ArgName);
1027 for (Function::const_aiterator I = ++F->abegin(), E = F->aend();
1029 FunctionInnards << ", ";
1030 if (I->hasName() || !Prototype)
1031 ArgName = Mang->getValueName(I);
1034 printType(FunctionInnards, I->getType(), ArgName);
1038 // Loop over the arguments, printing them...
1039 for (FunctionType::param_iterator I = FT->param_begin(),
1040 E = FT->param_end(); I != E; ++I) {
1041 if (I != FT->param_begin()) FunctionInnards << ", ";
1042 printType(FunctionInnards, *I);
1046 // Finish printing arguments... if this is a vararg function, print the ...,
1047 // unless there are no known types, in which case, we just emit ().
1049 if (FT->isVarArg() && FT->getNumParams()) {
1050 if (FT->getNumParams()) FunctionInnards << ", ";
1051 FunctionInnards << "..."; // Output varargs portion of signature!
1052 } else if (!FT->isVarArg() && FT->getNumParams() == 0) {
1053 FunctionInnards << "void"; // ret() -> ret(void) in C.
1055 FunctionInnards << ")";
1056 // Print out the return type and the entire signature for that matter
1057 printType(Out, F->getReturnType(), FunctionInnards.str());
1060 void CWriter::printFunction(Function &F) {
1061 printFunctionSignature(&F, false);
1064 // print local variable information for the function
1065 for (inst_iterator I = inst_begin(&F), E = inst_end(&F); I != E; ++I)
1066 if (const AllocaInst *AI = isDirectAlloca(&*I)) {
1068 printType(Out, AI->getAllocatedType(), Mang->getValueName(AI));
1069 Out << "; /* Address exposed local */\n";
1070 } else if (I->getType() != Type::VoidTy && !isInlinableInst(*I)) {
1072 printType(Out, I->getType(), Mang->getValueName(&*I));
1075 if (isa<PHINode>(*I)) { // Print out PHI node temporaries as well...
1077 printType(Out, I->getType(),
1078 Mang->getValueName(&*I)+"__PHI_TEMPORARY");
1085 // print the basic blocks
1086 for (Function::iterator BB = F.begin(), E = F.end(); BB != E; ++BB) {
1087 if (Loop *L = LI->getLoopFor(BB)) {
1088 if (L->getHeader() == BB && L->getParentLoop() == 0)
1091 printBasicBlock(BB);
1098 void CWriter::printLoop(Loop *L) {
1099 Out << " do { /* Syntactic loop '" << L->getHeader()->getName()
1100 << "' to make GCC happy */\n";
1101 for (unsigned i = 0, e = L->getBlocks().size(); i != e; ++i) {
1102 BasicBlock *BB = L->getBlocks()[i];
1103 Loop *BBLoop = LI->getLoopFor(BB);
1105 printBasicBlock(BB);
1106 else if (BB == BBLoop->getHeader() && BBLoop->getParentLoop() == L)
1109 Out << " } while (1); /* end of syntactic loop '"
1110 << L->getHeader()->getName() << "' */\n";
1113 void CWriter::printBasicBlock(BasicBlock *BB) {
1115 // Don't print the label for the basic block if there are no uses, or if
1116 // the only terminator use is the predecessor basic block's terminator.
1117 // We have to scan the use list because PHI nodes use basic blocks too but
1118 // do not require a label to be generated.
1120 bool NeedsLabel = false;
1121 for (pred_iterator PI = pred_begin(BB), E = pred_end(BB); PI != E; ++PI)
1122 if (isGotoCodeNecessary(*PI, BB)) {
1127 if (NeedsLabel) Out << Mang->getValueName(BB) << ":\n";
1129 // Output all of the instructions in the basic block...
1130 for (BasicBlock::iterator II = BB->begin(), E = --BB->end(); II != E;
1132 if (!isInlinableInst(*II) && !isDirectAlloca(II)) {
1133 if (II->getType() != Type::VoidTy)
1142 // Don't emit prefix or suffix for the terminator...
1143 visit(*BB->getTerminator());
1147 // Specific Instruction type classes... note that all of the casts are
1148 // necessary because we use the instruction classes as opaque types...
1150 void CWriter::visitReturnInst(ReturnInst &I) {
1151 // Don't output a void return if this is the last basic block in the function
1152 if (I.getNumOperands() == 0 &&
1153 &*--I.getParent()->getParent()->end() == I.getParent() &&
1154 !I.getParent()->size() == 1) {
1159 if (I.getNumOperands()) {
1161 writeOperand(I.getOperand(0));
1166 void CWriter::visitSwitchInst(SwitchInst &SI) {
1167 printPHICopiesForSuccessors(SI.getParent(), 0);
1170 writeOperand(SI.getOperand(0));
1171 Out << ") {\n default:\n";
1172 printBranchToBlock(SI.getParent(), SI.getDefaultDest(), 2);
1174 for (unsigned i = 2, e = SI.getNumOperands(); i != e; i += 2) {
1176 writeOperand(SI.getOperand(i));
1178 BasicBlock *Succ = cast<BasicBlock>(SI.getOperand(i+1));
1179 printBranchToBlock(SI.getParent(), Succ, 2);
1180 if (Succ == SI.getParent()->getNext())
1186 bool CWriter::isGotoCodeNecessary(BasicBlock *From, BasicBlock *To) {
1187 /// FIXME: This should be reenabled, but loop reordering safe!!
1190 if (From->getNext() != To) // Not the direct successor, we need a goto
1193 //isa<SwitchInst>(From->getTerminator())
1196 if (LI->getLoopFor(From) != LI->getLoopFor(To))
1201 void CWriter::printPHICopiesForSuccessors(BasicBlock *CurBlock,
1203 for (succ_iterator SI = succ_begin(CurBlock), E = succ_end(CurBlock);
1205 for (BasicBlock::iterator I = SI->begin();
1206 PHINode *PN = dyn_cast<PHINode>(I); ++I) {
1207 // now we have to do the printing
1208 Out << std::string(Indent, ' ');
1209 Out << " " << Mang->getValueName(I) << "__PHI_TEMPORARY = ";
1210 writeOperand(PN->getIncomingValue(PN->getBasicBlockIndex(CurBlock)));
1211 Out << "; /* for PHI node */\n";
1216 void CWriter::printBranchToBlock(BasicBlock *CurBB, BasicBlock *Succ,
1218 if (isGotoCodeNecessary(CurBB, Succ)) {
1219 Out << std::string(Indent, ' ') << " goto ";
1225 // Branch instruction printing - Avoid printing out a branch to a basic block
1226 // that immediately succeeds the current one.
1228 void CWriter::visitBranchInst(BranchInst &I) {
1229 printPHICopiesForSuccessors(I.getParent(), 0);
1231 if (I.isConditional()) {
1232 if (isGotoCodeNecessary(I.getParent(), I.getSuccessor(0))) {
1234 writeOperand(I.getCondition());
1237 printBranchToBlock(I.getParent(), I.getSuccessor(0), 2);
1239 if (isGotoCodeNecessary(I.getParent(), I.getSuccessor(1))) {
1240 Out << " } else {\n";
1241 printBranchToBlock(I.getParent(), I.getSuccessor(1), 2);
1244 // First goto not necessary, assume second one is...
1246 writeOperand(I.getCondition());
1249 printBranchToBlock(I.getParent(), I.getSuccessor(1), 2);
1254 printBranchToBlock(I.getParent(), I.getSuccessor(0), 0);
1259 // PHI nodes get copied into temporary values at the end of predecessor basic
1260 // blocks. We now need to copy these temporary values into the REAL value for
1262 void CWriter::visitPHINode(PHINode &I) {
1264 Out << "__PHI_TEMPORARY";
1268 void CWriter::visitBinaryOperator(Instruction &I) {
1269 // binary instructions, shift instructions, setCond instructions.
1270 assert(!isa<PointerType>(I.getType()));
1272 // We must cast the results of binary operations which might be promoted.
1273 bool needsCast = false;
1274 if ((I.getType() == Type::UByteTy) || (I.getType() == Type::SByteTy)
1275 || (I.getType() == Type::UShortTy) || (I.getType() == Type::ShortTy)
1276 || (I.getType() == Type::FloatTy)) {
1279 printType(Out, I.getType());
1283 writeOperand(I.getOperand(0));
1285 switch (I.getOpcode()) {
1286 case Instruction::Add: Out << " + "; break;
1287 case Instruction::Sub: Out << " - "; break;
1288 case Instruction::Mul: Out << "*"; break;
1289 case Instruction::Div: Out << "/"; break;
1290 case Instruction::Rem: Out << "%"; break;
1291 case Instruction::And: Out << " & "; break;
1292 case Instruction::Or: Out << " | "; break;
1293 case Instruction::Xor: Out << " ^ "; break;
1294 case Instruction::SetEQ: Out << " == "; break;
1295 case Instruction::SetNE: Out << " != "; break;
1296 case Instruction::SetLE: Out << " <= "; break;
1297 case Instruction::SetGE: Out << " >= "; break;
1298 case Instruction::SetLT: Out << " < "; break;
1299 case Instruction::SetGT: Out << " > "; break;
1300 case Instruction::Shl : Out << " << "; break;
1301 case Instruction::Shr : Out << " >> "; break;
1302 default: std::cerr << "Invalid operator type!" << I; abort();
1305 writeOperand(I.getOperand(1));
1312 void CWriter::visitCastInst(CastInst &I) {
1313 if (I.getType() == Type::BoolTy) {
1315 writeOperand(I.getOperand(0));
1320 printType(Out, I.getType());
1322 if (isa<PointerType>(I.getType())&&I.getOperand(0)->getType()->isIntegral() ||
1323 isa<PointerType>(I.getOperand(0)->getType())&&I.getType()->isIntegral()) {
1324 // Avoid "cast to pointer from integer of different size" warnings
1328 writeOperand(I.getOperand(0));
1331 void CWriter::visitSelectInst(SelectInst &I) {
1333 writeOperand(I.getCondition());
1335 writeOperand(I.getTrueValue());
1337 writeOperand(I.getFalseValue());
1342 void CWriter::lowerIntrinsics(Function &F) {
1343 for (Function::iterator BB = F.begin(), E = F.end(); BB != E; ++BB)
1344 for (BasicBlock::iterator I = BB->begin(), E = BB->end(); I != E; )
1345 if (CallInst *CI = dyn_cast<CallInst>(I++))
1346 if (Function *F = CI->getCalledFunction())
1347 switch (F->getIntrinsicID()) {
1348 case Intrinsic::not_intrinsic:
1349 case Intrinsic::vastart:
1350 case Intrinsic::vacopy:
1351 case Intrinsic::vaend:
1352 case Intrinsic::returnaddress:
1353 case Intrinsic::frameaddress:
1354 case Intrinsic::setjmp:
1355 case Intrinsic::longjmp:
1356 // We directly implement these intrinsics
1359 // All other intrinsic calls we must lower.
1360 Instruction *Before = CI->getPrev();
1361 IL.LowerIntrinsicCall(CI);
1362 if (Before) { // Move iterator to instruction after call
1372 void CWriter::visitCallInst(CallInst &I) {
1373 // Handle intrinsic function calls first...
1374 if (Function *F = I.getCalledFunction())
1375 if (Intrinsic::ID ID = (Intrinsic::ID)F->getIntrinsicID()) {
1377 default: assert(0 && "Unknown LLVM intrinsic!");
1378 case Intrinsic::vastart:
1381 Out << "va_start(*(va_list*)&" << Mang->getValueName(&I) << ", ";
1382 // Output the last argument to the enclosing function...
1383 if (I.getParent()->getParent()->aempty()) {
1384 std::cerr << "The C backend does not currently support zero "
1385 << "argument varargs functions, such as '"
1386 << I.getParent()->getParent()->getName() << "'!\n";
1389 writeOperand(&I.getParent()->getParent()->aback());
1392 case Intrinsic::vaend:
1393 Out << "va_end(*(va_list*)&";
1394 writeOperand(I.getOperand(1));
1397 case Intrinsic::vacopy:
1399 Out << "va_copy(*(va_list*)&" << Mang->getValueName(&I) << ", ";
1400 Out << "*(va_list*)&";
1401 writeOperand(I.getOperand(1));
1404 case Intrinsic::returnaddress:
1405 Out << "__builtin_return_address(";
1406 writeOperand(I.getOperand(1));
1409 case Intrinsic::frameaddress:
1410 Out << "__builtin_frame_address(";
1411 writeOperand(I.getOperand(1));
1414 case Intrinsic::setjmp:
1415 Out << "setjmp(*(jmp_buf*)";
1416 writeOperand(I.getOperand(1));
1419 case Intrinsic::longjmp:
1420 Out << "longjmp(*(jmp_buf*)";
1421 writeOperand(I.getOperand(1));
1423 writeOperand(I.getOperand(2));
1431 void CWriter::visitCallSite(CallSite CS) {
1432 const PointerType *PTy = cast<PointerType>(CS.getCalledValue()->getType());
1433 const FunctionType *FTy = cast<FunctionType>(PTy->getElementType());
1434 const Type *RetTy = FTy->getReturnType();
1436 writeOperand(CS.getCalledValue());
1439 if (CS.arg_begin() != CS.arg_end()) {
1440 CallSite::arg_iterator AI = CS.arg_begin(), AE = CS.arg_end();
1443 for (++AI; AI != AE; ++AI) {
1451 void CWriter::visitMallocInst(MallocInst &I) {
1452 assert(0 && "lowerallocations pass didn't work!");
1455 void CWriter::visitAllocaInst(AllocaInst &I) {
1457 printType(Out, I.getType());
1458 Out << ") alloca(sizeof(";
1459 printType(Out, I.getType()->getElementType());
1461 if (I.isArrayAllocation()) {
1463 writeOperand(I.getOperand(0));
1468 void CWriter::visitFreeInst(FreeInst &I) {
1469 assert(0 && "lowerallocations pass didn't work!");
1472 void CWriter::printIndexingExpression(Value *Ptr, gep_type_iterator I,
1473 gep_type_iterator E) {
1474 bool HasImplicitAddress = false;
1475 // If accessing a global value with no indexing, avoid *(&GV) syndrome
1476 if (GlobalValue *V = dyn_cast<GlobalValue>(Ptr)) {
1477 HasImplicitAddress = true;
1478 } else if (isDirectAlloca(Ptr)) {
1479 HasImplicitAddress = true;
1483 if (!HasImplicitAddress)
1484 Out << "*"; // Implicit zero first argument: '*x' is equivalent to 'x[0]'
1486 writeOperandInternal(Ptr);
1490 const Constant *CI = dyn_cast<Constant>(I.getOperand());
1491 if (HasImplicitAddress && (!CI || !CI->isNullValue()))
1494 writeOperandInternal(Ptr);
1496 if (HasImplicitAddress && (!CI || !CI->isNullValue())) {
1498 HasImplicitAddress = false; // HIA is only true if we haven't addressed yet
1501 assert(!HasImplicitAddress || (CI && CI->isNullValue()) &&
1502 "Can only have implicit address with direct accessing");
1504 if (HasImplicitAddress) {
1506 } else if (CI && CI->isNullValue()) {
1507 gep_type_iterator TmpI = I; ++TmpI;
1509 // Print out the -> operator if possible...
1510 if (TmpI != E && isa<StructType>(*TmpI)) {
1511 Out << (HasImplicitAddress ? "." : "->");
1512 Out << "field" << cast<ConstantUInt>(TmpI.getOperand())->getValue();
1518 if (isa<StructType>(*I)) {
1519 Out << ".field" << cast<ConstantUInt>(I.getOperand())->getValue();
1522 writeOperand(I.getOperand());
1527 void CWriter::visitLoadInst(LoadInst &I) {
1529 writeOperand(I.getOperand(0));
1532 void CWriter::visitStoreInst(StoreInst &I) {
1534 writeOperand(I.getPointerOperand());
1536 writeOperand(I.getOperand(0));
1539 void CWriter::visitGetElementPtrInst(GetElementPtrInst &I) {
1541 printIndexingExpression(I.getPointerOperand(), gep_type_begin(I),
1545 void CWriter::visitVANextInst(VANextInst &I) {
1546 Out << Mang->getValueName(I.getOperand(0));
1547 Out << "; va_arg(*(va_list*)&" << Mang->getValueName(&I) << ", ";
1548 printType(Out, I.getArgType());
1552 void CWriter::visitVAArgInst(VAArgInst &I) {
1554 Out << "{ va_list Tmp; va_copy(Tmp, *(va_list*)&";
1555 writeOperand(I.getOperand(0));
1556 Out << ");\n " << Mang->getValueName(&I) << " = va_arg(Tmp, ";
1557 printType(Out, I.getType());
1558 Out << ");\n va_end(Tmp); }";
1561 //===----------------------------------------------------------------------===//
1562 // External Interface declaration
1563 //===----------------------------------------------------------------------===//
1565 bool CTargetMachine::addPassesToEmitAssembly(PassManager &PM, std::ostream &o) {
1566 PM.add(createLowerGCPass());
1567 PM.add(createLowerAllocationsPass());
1568 PM.add(createLowerInvokePass());
1569 PM.add(new CBackendNameAllUsedStructs());
1570 PM.add(new CWriter(o, getIntrinsicLowering()));