1 //===-- CBackend.cpp - Library for converting LLVM code to C --------------===//
3 // The LLVM Compiler Infrastructure
5 // This file is distributed under the University of Illinois Open Source
6 // 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/Passes.h"
32 #include "llvm/CodeGen/IntrinsicLowering.h"
33 #include "llvm/Transforms/Scalar.h"
34 #include "llvm/Target/TargetMachineRegistry.h"
35 #include "llvm/Target/TargetAsmInfo.h"
36 #include "llvm/Target/TargetData.h"
37 #include "llvm/Support/CallSite.h"
38 #include "llvm/Support/CFG.h"
39 #include "llvm/Support/GetElementPtrTypeIterator.h"
40 #include "llvm/Support/InstVisitor.h"
41 #include "llvm/Support/Mangler.h"
42 #include "llvm/Support/MathExtras.h"
43 #include "llvm/ADT/StringExtras.h"
44 #include "llvm/ADT/STLExtras.h"
45 #include "llvm/Support/MathExtras.h"
46 #include "llvm/Config/config.h"
52 // Register the target.
53 RegisterTarget<CTargetMachine> X("c", " C backend");
55 /// CBackendNameAllUsedStructsAndMergeFunctions - This pass inserts names for
56 /// any unnamed structure types that are used by the program, and merges
57 /// external functions with the same name.
59 class CBackendNameAllUsedStructsAndMergeFunctions : public ModulePass {
62 CBackendNameAllUsedStructsAndMergeFunctions()
63 : ModulePass((intptr_t)&ID) {}
64 void getAnalysisUsage(AnalysisUsage &AU) const {
65 AU.addRequired<FindUsedTypes>();
68 virtual const char *getPassName() const {
69 return "C backend type canonicalizer";
72 virtual bool runOnModule(Module &M);
75 char CBackendNameAllUsedStructsAndMergeFunctions::ID = 0;
77 /// CWriter - This class is the main chunk of code that converts an LLVM
78 /// module to a C translation unit.
79 class CWriter : public FunctionPass, public InstVisitor<CWriter> {
81 IntrinsicLowering *IL;
84 const Module *TheModule;
85 const TargetAsmInfo* TAsm;
87 std::map<const Type *, std::string> TypeNames;
88 std::map<const ConstantFP *, unsigned> FPConstantMap;
89 std::set<Function*> intrinsicPrototypesAlreadyGenerated;
90 std::set<const Value*> ByValParams;
94 CWriter(std::ostream &o)
95 : FunctionPass((intptr_t)&ID), Out(o), IL(0), Mang(0), LI(0),
96 TheModule(0), TAsm(0), TD(0) {}
98 virtual const char *getPassName() const { return "C backend"; }
100 void getAnalysisUsage(AnalysisUsage &AU) const {
101 AU.addRequired<LoopInfo>();
102 AU.setPreservesAll();
105 virtual bool doInitialization(Module &M);
107 bool runOnFunction(Function &F) {
108 LI = &getAnalysis<LoopInfo>();
110 // Get rid of intrinsics we can't handle.
113 // Output all floating point constants that cannot be printed accurately.
114 printFloatingPointConstants(F);
120 virtual bool doFinalization(Module &M) {
123 FPConstantMap.clear();
125 intrinsicPrototypesAlreadyGenerated.clear();
130 std::ostream &printType(std::ostream &Out, const Type *Ty,
131 bool isSigned = false,
132 const std::string &VariableName = "",
133 bool IgnoreName = false,
134 const ParamAttrsList *PAL = 0);
135 std::ostream &printSimpleType(std::ostream &Out, const Type *Ty,
137 const std::string &NameSoFar = "");
139 void printStructReturnPointerFunctionType(std::ostream &Out,
140 const ParamAttrsList *PAL,
141 const PointerType *Ty);
143 void writeOperand(Value *Operand);
144 void writeOperandRaw(Value *Operand);
145 void writeOperandInternal(Value *Operand);
146 void writeOperandWithCast(Value* Operand, unsigned Opcode);
147 void writeOperandWithCast(Value* Operand, const ICmpInst &I);
148 bool writeInstructionCast(const Instruction &I);
151 std::string InterpretASMConstraint(InlineAsm::ConstraintInfo& c);
153 void lowerIntrinsics(Function &F);
155 void printModule(Module *M);
156 void printModuleTypes(const TypeSymbolTable &ST);
157 void printContainedStructs(const Type *Ty, std::set<const StructType *> &);
158 void printFloatingPointConstants(Function &F);
159 void printFunctionSignature(const Function *F, bool Prototype);
161 void printFunction(Function &);
162 void printBasicBlock(BasicBlock *BB);
163 void printLoop(Loop *L);
165 void printCast(unsigned opcode, const Type *SrcTy, const Type *DstTy);
166 void printConstant(Constant *CPV);
167 void printConstantWithCast(Constant *CPV, unsigned Opcode);
168 bool printConstExprCast(const ConstantExpr *CE);
169 void printConstantArray(ConstantArray *CPA);
170 void printConstantVector(ConstantVector *CP);
172 // isInlinableInst - Attempt to inline instructions into their uses to build
173 // trees as much as possible. To do this, we have to consistently decide
174 // what is acceptable to inline, so that variable declarations don't get
175 // printed and an extra copy of the expr is not emitted.
177 static bool isInlinableInst(const Instruction &I) {
178 // Always inline cmp instructions, even if they are shared by multiple
179 // expressions. GCC generates horrible code if we don't.
183 // Must be an expression, must be used exactly once. If it is dead, we
184 // emit it inline where it would go.
185 if (I.getType() == Type::VoidTy || !I.hasOneUse() ||
186 isa<TerminatorInst>(I) || isa<CallInst>(I) || isa<PHINode>(I) ||
187 isa<LoadInst>(I) || isa<VAArgInst>(I))
188 // Don't inline a load across a store or other bad things!
191 // Must not be used in inline asm
192 if (I.hasOneUse() && isInlineAsm(*I.use_back())) return false;
194 // Only inline instruction it if it's use is in the same BB as the inst.
195 return I.getParent() == cast<Instruction>(I.use_back())->getParent();
198 // isDirectAlloca - Define fixed sized allocas in the entry block as direct
199 // variables which are accessed with the & operator. This causes GCC to
200 // generate significantly better code than to emit alloca calls directly.
202 static const AllocaInst *isDirectAlloca(const Value *V) {
203 const AllocaInst *AI = dyn_cast<AllocaInst>(V);
204 if (!AI) return false;
205 if (AI->isArrayAllocation())
206 return 0; // FIXME: we can also inline fixed size array allocas!
207 if (AI->getParent() != &AI->getParent()->getParent()->getEntryBlock())
212 // isInlineAsm - Check if the instruction is a call to an inline asm chunk
213 static bool isInlineAsm(const Instruction& I) {
214 if (isa<CallInst>(&I) && isa<InlineAsm>(I.getOperand(0)))
219 // Instruction visitation functions
220 friend class InstVisitor<CWriter>;
222 void visitReturnInst(ReturnInst &I);
223 void visitBranchInst(BranchInst &I);
224 void visitSwitchInst(SwitchInst &I);
225 void visitInvokeInst(InvokeInst &I) {
226 assert(0 && "Lowerinvoke pass didn't work!");
229 void visitUnwindInst(UnwindInst &I) {
230 assert(0 && "Lowerinvoke pass didn't work!");
232 void visitUnreachableInst(UnreachableInst &I);
234 void visitPHINode(PHINode &I);
235 void visitBinaryOperator(Instruction &I);
236 void visitICmpInst(ICmpInst &I);
237 void visitFCmpInst(FCmpInst &I);
239 void visitCastInst (CastInst &I);
240 void visitSelectInst(SelectInst &I);
241 void visitCallInst (CallInst &I);
242 void visitInlineAsm(CallInst &I);
244 void visitMallocInst(MallocInst &I);
245 void visitAllocaInst(AllocaInst &I);
246 void visitFreeInst (FreeInst &I);
247 void visitLoadInst (LoadInst &I);
248 void visitStoreInst (StoreInst &I);
249 void visitGetElementPtrInst(GetElementPtrInst &I);
250 void visitVAArgInst (VAArgInst &I);
252 void visitInstruction(Instruction &I) {
253 cerr << "C Writer does not know about " << I;
257 void outputLValue(Instruction *I) {
258 Out << " " << GetValueName(I) << " = ";
261 bool isGotoCodeNecessary(BasicBlock *From, BasicBlock *To);
262 void printPHICopiesForSuccessor(BasicBlock *CurBlock,
263 BasicBlock *Successor, unsigned Indent);
264 void printBranchToBlock(BasicBlock *CurBlock, BasicBlock *SuccBlock,
266 void printIndexingExpression(Value *Ptr, gep_type_iterator I,
267 gep_type_iterator E);
269 std::string GetValueName(const Value *Operand);
273 char CWriter::ID = 0;
275 /// This method inserts names for any unnamed structure types that are used by
276 /// the program, and removes names from structure types that are not used by the
279 bool CBackendNameAllUsedStructsAndMergeFunctions::runOnModule(Module &M) {
280 // Get a set of types that are used by the program...
281 std::set<const Type *> UT = getAnalysis<FindUsedTypes>().getTypes();
283 // Loop over the module symbol table, removing types from UT that are
284 // already named, and removing names for types that are not used.
286 TypeSymbolTable &TST = M.getTypeSymbolTable();
287 for (TypeSymbolTable::iterator TI = TST.begin(), TE = TST.end();
289 TypeSymbolTable::iterator I = TI++;
291 // If this isn't a struct type, remove it from our set of types to name.
292 // This simplifies emission later.
293 if (!isa<StructType>(I->second) && !isa<OpaqueType>(I->second)) {
296 // If this is not used, remove it from the symbol table.
297 std::set<const Type *>::iterator UTI = UT.find(I->second);
301 UT.erase(UTI); // Only keep one name for this type.
305 // UT now contains types that are not named. Loop over it, naming
308 bool Changed = false;
309 unsigned RenameCounter = 0;
310 for (std::set<const Type *>::const_iterator I = UT.begin(), E = UT.end();
312 if (const StructType *ST = dyn_cast<StructType>(*I)) {
313 while (M.addTypeName("unnamed"+utostr(RenameCounter), ST))
319 // Loop over all external functions and globals. If we have two with
320 // identical names, merge them.
321 // FIXME: This code should disappear when we don't allow values with the same
322 // names when they have different types!
323 std::map<std::string, GlobalValue*> ExtSymbols;
324 for (Module::iterator I = M.begin(), E = M.end(); I != E;) {
326 if (GV->isDeclaration() && GV->hasName()) {
327 std::pair<std::map<std::string, GlobalValue*>::iterator, bool> X
328 = ExtSymbols.insert(std::make_pair(GV->getName(), GV));
330 // Found a conflict, replace this global with the previous one.
331 GlobalValue *OldGV = X.first->second;
332 GV->replaceAllUsesWith(ConstantExpr::getBitCast(OldGV, GV->getType()));
333 GV->eraseFromParent();
338 // Do the same for globals.
339 for (Module::global_iterator I = M.global_begin(), E = M.global_end();
341 GlobalVariable *GV = I++;
342 if (GV->isDeclaration() && GV->hasName()) {
343 std::pair<std::map<std::string, GlobalValue*>::iterator, bool> X
344 = ExtSymbols.insert(std::make_pair(GV->getName(), GV));
346 // Found a conflict, replace this global with the previous one.
347 GlobalValue *OldGV = X.first->second;
348 GV->replaceAllUsesWith(ConstantExpr::getBitCast(OldGV, GV->getType()));
349 GV->eraseFromParent();
358 /// printStructReturnPointerFunctionType - This is like printType for a struct
359 /// return type, except, instead of printing the type as void (*)(Struct*, ...)
360 /// print it as "Struct (*)(...)", for struct return functions.
361 void CWriter::printStructReturnPointerFunctionType(std::ostream &Out,
362 const ParamAttrsList *PAL,
363 const PointerType *TheTy) {
364 const FunctionType *FTy = cast<FunctionType>(TheTy->getElementType());
365 std::stringstream FunctionInnards;
366 FunctionInnards << " (*) (";
367 bool PrintedType = false;
369 FunctionType::param_iterator I = FTy->param_begin(), E = FTy->param_end();
370 const Type *RetTy = cast<PointerType>(I->get())->getElementType();
372 for (++I, ++Idx; I != E; ++I, ++Idx) {
374 FunctionInnards << ", ";
375 const Type *ArgTy = *I;
376 if (PAL && PAL->paramHasAttr(Idx, ParamAttr::ByVal)) {
377 assert(isa<PointerType>(ArgTy));
378 ArgTy = cast<PointerType>(ArgTy)->getElementType();
380 printType(FunctionInnards, ArgTy,
381 /*isSigned=*/PAL && PAL->paramHasAttr(Idx, ParamAttr::SExt), "");
384 if (FTy->isVarArg()) {
386 FunctionInnards << ", ...";
387 } else if (!PrintedType) {
388 FunctionInnards << "void";
390 FunctionInnards << ')';
391 std::string tstr = FunctionInnards.str();
392 printType(Out, RetTy,
393 /*isSigned=*/PAL && PAL->paramHasAttr(0, ParamAttr::SExt), tstr);
397 CWriter::printSimpleType(std::ostream &Out, const Type *Ty, bool isSigned,
398 const std::string &NameSoFar) {
399 assert((Ty->isPrimitiveType() || Ty->isInteger()) &&
400 "Invalid type for printSimpleType");
401 switch (Ty->getTypeID()) {
402 case Type::VoidTyID: return Out << "void " << NameSoFar;
403 case Type::IntegerTyID: {
404 unsigned NumBits = cast<IntegerType>(Ty)->getBitWidth();
406 return Out << "bool " << NameSoFar;
407 else if (NumBits <= 8)
408 return Out << (isSigned?"signed":"unsigned") << " char " << NameSoFar;
409 else if (NumBits <= 16)
410 return Out << (isSigned?"signed":"unsigned") << " short " << NameSoFar;
411 else if (NumBits <= 32)
412 return Out << (isSigned?"signed":"unsigned") << " int " << NameSoFar;
414 assert(NumBits <= 64 && "Bit widths > 64 not implemented yet");
415 return Out << (isSigned?"signed":"unsigned") << " long long "<< NameSoFar;
418 case Type::FloatTyID: return Out << "float " << NameSoFar;
419 case Type::DoubleTyID: return Out << "double " << NameSoFar;
420 // Lacking emulation of FP80 on PPC, etc., we assume whichever of these is
421 // present matches host 'long double'.
422 case Type::X86_FP80TyID:
423 case Type::PPC_FP128TyID:
424 case Type::FP128TyID: return Out << "long double " << NameSoFar;
426 cerr << "Unknown primitive type: " << *Ty << "\n";
431 // Pass the Type* and the variable name and this prints out the variable
434 std::ostream &CWriter::printType(std::ostream &Out, const Type *Ty,
435 bool isSigned, const std::string &NameSoFar,
436 bool IgnoreName, const ParamAttrsList* PAL) {
437 if (Ty->isPrimitiveType() || Ty->isInteger()) {
438 printSimpleType(Out, Ty, isSigned, NameSoFar);
442 // Check to see if the type is named.
443 if (!IgnoreName || isa<OpaqueType>(Ty)) {
444 std::map<const Type *, std::string>::iterator I = TypeNames.find(Ty);
445 if (I != TypeNames.end()) return Out << I->second << ' ' << NameSoFar;
448 switch (Ty->getTypeID()) {
449 case Type::FunctionTyID: {
450 const FunctionType *FTy = cast<FunctionType>(Ty);
451 std::stringstream FunctionInnards;
452 FunctionInnards << " (" << NameSoFar << ") (";
454 for (FunctionType::param_iterator I = FTy->param_begin(),
455 E = FTy->param_end(); I != E; ++I) {
456 if (I != FTy->param_begin())
457 FunctionInnards << ", ";
458 printType(FunctionInnards, *I,
459 /*isSigned=*/PAL && PAL->paramHasAttr(Idx, ParamAttr::SExt), "");
462 if (FTy->isVarArg()) {
463 if (FTy->getNumParams())
464 FunctionInnards << ", ...";
465 } else if (!FTy->getNumParams()) {
466 FunctionInnards << "void";
468 FunctionInnards << ')';
469 std::string tstr = FunctionInnards.str();
470 printType(Out, FTy->getReturnType(),
471 /*isSigned=*/PAL && PAL->paramHasAttr(0, ParamAttr::SExt), tstr);
474 case Type::StructTyID: {
475 const StructType *STy = cast<StructType>(Ty);
476 Out << NameSoFar + " {\n";
478 for (StructType::element_iterator I = STy->element_begin(),
479 E = STy->element_end(); I != E; ++I) {
481 printType(Out, *I, false, "field" + utostr(Idx++));
486 Out << " __attribute__ ((packed))";
490 case Type::PointerTyID: {
491 const PointerType *PTy = cast<PointerType>(Ty);
492 std::string ptrName = "*" + NameSoFar;
494 if (isa<ArrayType>(PTy->getElementType()) ||
495 isa<VectorType>(PTy->getElementType()))
496 ptrName = "(" + ptrName + ")";
498 return printType(Out, PTy->getElementType(), false, ptrName);
501 case Type::ArrayTyID: {
502 const ArrayType *ATy = cast<ArrayType>(Ty);
503 unsigned NumElements = ATy->getNumElements();
504 if (NumElements == 0) NumElements = 1;
505 return printType(Out, ATy->getElementType(), false,
506 NameSoFar + "[" + utostr(NumElements) + "]");
509 case Type::VectorTyID: {
510 const VectorType *PTy = cast<VectorType>(Ty);
511 unsigned NumElements = PTy->getNumElements();
512 if (NumElements == 0) NumElements = 1;
513 return printType(Out, PTy->getElementType(), false,
514 NameSoFar + "[" + utostr(NumElements) + "]");
517 case Type::OpaqueTyID: {
518 static int Count = 0;
519 std::string TyName = "struct opaque_" + itostr(Count++);
520 assert(TypeNames.find(Ty) == TypeNames.end());
521 TypeNames[Ty] = TyName;
522 return Out << TyName << ' ' << NameSoFar;
525 assert(0 && "Unhandled case in getTypeProps!");
532 void CWriter::printConstantArray(ConstantArray *CPA) {
534 // As a special case, print the array as a string if it is an array of
535 // ubytes or an array of sbytes with positive values.
537 const Type *ETy = CPA->getType()->getElementType();
538 bool isString = (ETy == Type::Int8Ty || ETy == Type::Int8Ty);
540 // Make sure the last character is a null char, as automatically added by C
541 if (isString && (CPA->getNumOperands() == 0 ||
542 !cast<Constant>(*(CPA->op_end()-1))->isNullValue()))
547 // Keep track of whether the last number was a hexadecimal escape
548 bool LastWasHex = false;
550 // Do not include the last character, which we know is null
551 for (unsigned i = 0, e = CPA->getNumOperands()-1; i != e; ++i) {
552 unsigned char C = cast<ConstantInt>(CPA->getOperand(i))->getZExtValue();
554 // Print it out literally if it is a printable character. The only thing
555 // to be careful about is when the last letter output was a hex escape
556 // code, in which case we have to be careful not to print out hex digits
557 // explicitly (the C compiler thinks it is a continuation of the previous
558 // character, sheesh...)
560 if (isprint(C) && (!LastWasHex || !isxdigit(C))) {
562 if (C == '"' || C == '\\')
569 case '\n': Out << "\\n"; break;
570 case '\t': Out << "\\t"; break;
571 case '\r': Out << "\\r"; break;
572 case '\v': Out << "\\v"; break;
573 case '\a': Out << "\\a"; break;
574 case '\"': Out << "\\\""; break;
575 case '\'': Out << "\\\'"; break;
578 Out << (char)(( C/16 < 10) ? ( C/16 +'0') : ( C/16 -10+'A'));
579 Out << (char)(((C&15) < 10) ? ((C&15)+'0') : ((C&15)-10+'A'));
588 if (CPA->getNumOperands()) {
590 printConstant(cast<Constant>(CPA->getOperand(0)));
591 for (unsigned i = 1, e = CPA->getNumOperands(); i != e; ++i) {
593 printConstant(cast<Constant>(CPA->getOperand(i)));
600 void CWriter::printConstantVector(ConstantVector *CP) {
602 if (CP->getNumOperands()) {
604 printConstant(cast<Constant>(CP->getOperand(0)));
605 for (unsigned i = 1, e = CP->getNumOperands(); i != e; ++i) {
607 printConstant(cast<Constant>(CP->getOperand(i)));
613 // isFPCSafeToPrint - Returns true if we may assume that CFP may be written out
614 // textually as a double (rather than as a reference to a stack-allocated
615 // variable). We decide this by converting CFP to a string and back into a
616 // double, and then checking whether the conversion results in a bit-equal
617 // double to the original value of CFP. This depends on us and the target C
618 // compiler agreeing on the conversion process (which is pretty likely since we
619 // only deal in IEEE FP).
621 static bool isFPCSafeToPrint(const ConstantFP *CFP) {
622 // Do long doubles in hex for now.
623 if (CFP->getType()!=Type::FloatTy && CFP->getType()!=Type::DoubleTy)
625 APFloat APF = APFloat(CFP->getValueAPF()); // copy
626 if (CFP->getType()==Type::FloatTy)
627 APF.convert(APFloat::IEEEdouble, APFloat::rmNearestTiesToEven);
628 #if HAVE_PRINTF_A && ENABLE_CBE_PRINTF_A
630 sprintf(Buffer, "%a", APF.convertToDouble());
631 if (!strncmp(Buffer, "0x", 2) ||
632 !strncmp(Buffer, "-0x", 3) ||
633 !strncmp(Buffer, "+0x", 3))
634 return APF.bitwiseIsEqual(APFloat(atof(Buffer)));
637 std::string StrVal = ftostr(APF);
639 while (StrVal[0] == ' ')
640 StrVal.erase(StrVal.begin());
642 // Check to make sure that the stringized number is not some string like "Inf"
643 // or NaN. Check that the string matches the "[-+]?[0-9]" regex.
644 if ((StrVal[0] >= '0' && StrVal[0] <= '9') ||
645 ((StrVal[0] == '-' || StrVal[0] == '+') &&
646 (StrVal[1] >= '0' && StrVal[1] <= '9')))
647 // Reparse stringized version!
648 return APF.bitwiseIsEqual(APFloat(atof(StrVal.c_str())));
653 /// Print out the casting for a cast operation. This does the double casting
654 /// necessary for conversion to the destination type, if necessary.
655 /// @brief Print a cast
656 void CWriter::printCast(unsigned opc, const Type *SrcTy, const Type *DstTy) {
657 // Print the destination type cast
659 case Instruction::UIToFP:
660 case Instruction::SIToFP:
661 case Instruction::IntToPtr:
662 case Instruction::Trunc:
663 case Instruction::BitCast:
664 case Instruction::FPExt:
665 case Instruction::FPTrunc: // For these the DstTy sign doesn't matter
667 printType(Out, DstTy);
670 case Instruction::ZExt:
671 case Instruction::PtrToInt:
672 case Instruction::FPToUI: // For these, make sure we get an unsigned dest
674 printSimpleType(Out, DstTy, false);
677 case Instruction::SExt:
678 case Instruction::FPToSI: // For these, make sure we get a signed dest
680 printSimpleType(Out, DstTy, true);
684 assert(0 && "Invalid cast opcode");
687 // Print the source type cast
689 case Instruction::UIToFP:
690 case Instruction::ZExt:
692 printSimpleType(Out, SrcTy, false);
695 case Instruction::SIToFP:
696 case Instruction::SExt:
698 printSimpleType(Out, SrcTy, true);
701 case Instruction::IntToPtr:
702 case Instruction::PtrToInt:
703 // Avoid "cast to pointer from integer of different size" warnings
704 Out << "(unsigned long)";
706 case Instruction::Trunc:
707 case Instruction::BitCast:
708 case Instruction::FPExt:
709 case Instruction::FPTrunc:
710 case Instruction::FPToSI:
711 case Instruction::FPToUI:
712 break; // These don't need a source cast.
714 assert(0 && "Invalid cast opcode");
719 // printConstant - The LLVM Constant to C Constant converter.
720 void CWriter::printConstant(Constant *CPV) {
721 if (const ConstantExpr *CE = dyn_cast<ConstantExpr>(CPV)) {
722 switch (CE->getOpcode()) {
723 case Instruction::Trunc:
724 case Instruction::ZExt:
725 case Instruction::SExt:
726 case Instruction::FPTrunc:
727 case Instruction::FPExt:
728 case Instruction::UIToFP:
729 case Instruction::SIToFP:
730 case Instruction::FPToUI:
731 case Instruction::FPToSI:
732 case Instruction::PtrToInt:
733 case Instruction::IntToPtr:
734 case Instruction::BitCast:
736 printCast(CE->getOpcode(), CE->getOperand(0)->getType(), CE->getType());
737 if (CE->getOpcode() == Instruction::SExt &&
738 CE->getOperand(0)->getType() == Type::Int1Ty) {
739 // Make sure we really sext from bool here by subtracting from 0
742 printConstant(CE->getOperand(0));
743 if (CE->getType() == Type::Int1Ty &&
744 (CE->getOpcode() == Instruction::Trunc ||
745 CE->getOpcode() == Instruction::FPToUI ||
746 CE->getOpcode() == Instruction::FPToSI ||
747 CE->getOpcode() == Instruction::PtrToInt)) {
748 // Make sure we really truncate to bool here by anding with 1
754 case Instruction::GetElementPtr:
756 printIndexingExpression(CE->getOperand(0), gep_type_begin(CPV),
760 case Instruction::Select:
762 printConstant(CE->getOperand(0));
764 printConstant(CE->getOperand(1));
766 printConstant(CE->getOperand(2));
769 case Instruction::Add:
770 case Instruction::Sub:
771 case Instruction::Mul:
772 case Instruction::SDiv:
773 case Instruction::UDiv:
774 case Instruction::FDiv:
775 case Instruction::URem:
776 case Instruction::SRem:
777 case Instruction::FRem:
778 case Instruction::And:
779 case Instruction::Or:
780 case Instruction::Xor:
781 case Instruction::ICmp:
782 case Instruction::Shl:
783 case Instruction::LShr:
784 case Instruction::AShr:
787 bool NeedsClosingParens = printConstExprCast(CE);
788 printConstantWithCast(CE->getOperand(0), CE->getOpcode());
789 switch (CE->getOpcode()) {
790 case Instruction::Add: Out << " + "; break;
791 case Instruction::Sub: Out << " - "; break;
792 case Instruction::Mul: Out << " * "; break;
793 case Instruction::URem:
794 case Instruction::SRem:
795 case Instruction::FRem: Out << " % "; break;
796 case Instruction::UDiv:
797 case Instruction::SDiv:
798 case Instruction::FDiv: Out << " / "; break;
799 case Instruction::And: Out << " & "; break;
800 case Instruction::Or: Out << " | "; break;
801 case Instruction::Xor: Out << " ^ "; break;
802 case Instruction::Shl: Out << " << "; break;
803 case Instruction::LShr:
804 case Instruction::AShr: Out << " >> "; break;
805 case Instruction::ICmp:
806 switch (CE->getPredicate()) {
807 case ICmpInst::ICMP_EQ: Out << " == "; break;
808 case ICmpInst::ICMP_NE: Out << " != "; break;
809 case ICmpInst::ICMP_SLT:
810 case ICmpInst::ICMP_ULT: Out << " < "; break;
811 case ICmpInst::ICMP_SLE:
812 case ICmpInst::ICMP_ULE: Out << " <= "; break;
813 case ICmpInst::ICMP_SGT:
814 case ICmpInst::ICMP_UGT: Out << " > "; break;
815 case ICmpInst::ICMP_SGE:
816 case ICmpInst::ICMP_UGE: Out << " >= "; break;
817 default: assert(0 && "Illegal ICmp predicate");
820 default: assert(0 && "Illegal opcode here!");
822 printConstantWithCast(CE->getOperand(1), CE->getOpcode());
823 if (NeedsClosingParens)
828 case Instruction::FCmp: {
830 bool NeedsClosingParens = printConstExprCast(CE);
831 if (CE->getPredicate() == FCmpInst::FCMP_FALSE)
833 else if (CE->getPredicate() == FCmpInst::FCMP_TRUE)
837 switch (CE->getPredicate()) {
838 default: assert(0 && "Illegal FCmp predicate");
839 case FCmpInst::FCMP_ORD: op = "ord"; break;
840 case FCmpInst::FCMP_UNO: op = "uno"; break;
841 case FCmpInst::FCMP_UEQ: op = "ueq"; break;
842 case FCmpInst::FCMP_UNE: op = "une"; break;
843 case FCmpInst::FCMP_ULT: op = "ult"; break;
844 case FCmpInst::FCMP_ULE: op = "ule"; break;
845 case FCmpInst::FCMP_UGT: op = "ugt"; break;
846 case FCmpInst::FCMP_UGE: op = "uge"; break;
847 case FCmpInst::FCMP_OEQ: op = "oeq"; break;
848 case FCmpInst::FCMP_ONE: op = "one"; break;
849 case FCmpInst::FCMP_OLT: op = "olt"; break;
850 case FCmpInst::FCMP_OLE: op = "ole"; break;
851 case FCmpInst::FCMP_OGT: op = "ogt"; break;
852 case FCmpInst::FCMP_OGE: op = "oge"; break;
854 Out << "llvm_fcmp_" << op << "(";
855 printConstantWithCast(CE->getOperand(0), CE->getOpcode());
857 printConstantWithCast(CE->getOperand(1), CE->getOpcode());
860 if (NeedsClosingParens)
866 cerr << "CWriter Error: Unhandled constant expression: "
870 } else if (isa<UndefValue>(CPV) && CPV->getType()->isFirstClassType()) {
872 printType(Out, CPV->getType()); // sign doesn't matter
873 Out << ")/*UNDEF*/0)";
877 if (ConstantInt *CI = dyn_cast<ConstantInt>(CPV)) {
878 const Type* Ty = CI->getType();
879 if (Ty == Type::Int1Ty)
880 Out << (CI->getZExtValue() ? '1' : '0') ;
883 printSimpleType(Out, Ty, false) << ')';
884 if (CI->isMinValue(true))
885 Out << CI->getZExtValue() << 'u';
887 Out << CI->getSExtValue();
888 if (Ty->getPrimitiveSizeInBits() > 32)
895 switch (CPV->getType()->getTypeID()) {
896 case Type::FloatTyID:
897 case Type::DoubleTyID:
898 case Type::X86_FP80TyID:
899 case Type::PPC_FP128TyID:
900 case Type::FP128TyID: {
901 ConstantFP *FPC = cast<ConstantFP>(CPV);
902 std::map<const ConstantFP*, unsigned>::iterator I = FPConstantMap.find(FPC);
903 if (I != FPConstantMap.end()) {
904 // Because of FP precision problems we must load from a stack allocated
905 // value that holds the value in hex.
906 Out << "(*(" << (FPC->getType() == Type::FloatTy ? "float" :
907 FPC->getType() == Type::DoubleTy ? "double" :
909 << "*)&FPConstant" << I->second << ')';
911 assert(FPC->getType() == Type::FloatTy ||
912 FPC->getType() == Type::DoubleTy);
913 double V = FPC->getType() == Type::FloatTy ?
914 FPC->getValueAPF().convertToFloat() :
915 FPC->getValueAPF().convertToDouble();
919 // FIXME the actual NaN bits should be emitted.
920 // The prefix for a quiet NaN is 0x7FF8. For a signalling NaN,
922 const unsigned long QuietNaN = 0x7ff8UL;
923 //const unsigned long SignalNaN = 0x7ff4UL;
925 // We need to grab the first part of the FP #
928 uint64_t ll = DoubleToBits(V);
929 sprintf(Buffer, "0x%llx", static_cast<long long>(ll));
931 std::string Num(&Buffer[0], &Buffer[6]);
932 unsigned long Val = strtoul(Num.c_str(), 0, 16);
934 if (FPC->getType() == Type::FloatTy)
935 Out << "LLVM_NAN" << (Val == QuietNaN ? "" : "S") << "F(\""
936 << Buffer << "\") /*nan*/ ";
938 Out << "LLVM_NAN" << (Val == QuietNaN ? "" : "S") << "(\""
939 << Buffer << "\") /*nan*/ ";
940 } else if (IsInf(V)) {
942 if (V < 0) Out << '-';
943 Out << "LLVM_INF" << (FPC->getType() == Type::FloatTy ? "F" : "")
947 #if HAVE_PRINTF_A && ENABLE_CBE_PRINTF_A
948 // Print out the constant as a floating point number.
950 sprintf(Buffer, "%a", V);
953 Num = ftostr(FPC->getValueAPF());
961 case Type::ArrayTyID:
962 if (isa<ConstantAggregateZero>(CPV) || isa<UndefValue>(CPV)) {
963 const ArrayType *AT = cast<ArrayType>(CPV->getType());
965 if (AT->getNumElements()) {
967 Constant *CZ = Constant::getNullValue(AT->getElementType());
969 for (unsigned i = 1, e = AT->getNumElements(); i != e; ++i) {
976 printConstantArray(cast<ConstantArray>(CPV));
980 case Type::VectorTyID:
981 if (isa<ConstantAggregateZero>(CPV) || isa<UndefValue>(CPV)) {
982 const VectorType *AT = cast<VectorType>(CPV->getType());
984 if (AT->getNumElements()) {
986 Constant *CZ = Constant::getNullValue(AT->getElementType());
988 for (unsigned i = 1, e = AT->getNumElements(); i != e; ++i) {
995 printConstantVector(cast<ConstantVector>(CPV));
999 case Type::StructTyID:
1000 if (isa<ConstantAggregateZero>(CPV) || isa<UndefValue>(CPV)) {
1001 const StructType *ST = cast<StructType>(CPV->getType());
1003 if (ST->getNumElements()) {
1005 printConstant(Constant::getNullValue(ST->getElementType(0)));
1006 for (unsigned i = 1, e = ST->getNumElements(); i != e; ++i) {
1008 printConstant(Constant::getNullValue(ST->getElementType(i)));
1014 if (CPV->getNumOperands()) {
1016 printConstant(cast<Constant>(CPV->getOperand(0)));
1017 for (unsigned i = 1, e = CPV->getNumOperands(); i != e; ++i) {
1019 printConstant(cast<Constant>(CPV->getOperand(i)));
1026 case Type::PointerTyID:
1027 if (isa<ConstantPointerNull>(CPV)) {
1029 printType(Out, CPV->getType()); // sign doesn't matter
1030 Out << ")/*NULL*/0)";
1032 } else if (GlobalValue *GV = dyn_cast<GlobalValue>(CPV)) {
1038 cerr << "Unknown constant type: " << *CPV << "\n";
1043 // Some constant expressions need to be casted back to the original types
1044 // because their operands were casted to the expected type. This function takes
1045 // care of detecting that case and printing the cast for the ConstantExpr.
1046 bool CWriter::printConstExprCast(const ConstantExpr* CE) {
1047 bool NeedsExplicitCast = false;
1048 const Type *Ty = CE->getOperand(0)->getType();
1049 bool TypeIsSigned = false;
1050 switch (CE->getOpcode()) {
1051 case Instruction::LShr:
1052 case Instruction::URem:
1053 case Instruction::UDiv: NeedsExplicitCast = true; break;
1054 case Instruction::AShr:
1055 case Instruction::SRem:
1056 case Instruction::SDiv: NeedsExplicitCast = true; TypeIsSigned = true; break;
1057 case Instruction::SExt:
1059 NeedsExplicitCast = true;
1060 TypeIsSigned = true;
1062 case Instruction::ZExt:
1063 case Instruction::Trunc:
1064 case Instruction::FPTrunc:
1065 case Instruction::FPExt:
1066 case Instruction::UIToFP:
1067 case Instruction::SIToFP:
1068 case Instruction::FPToUI:
1069 case Instruction::FPToSI:
1070 case Instruction::PtrToInt:
1071 case Instruction::IntToPtr:
1072 case Instruction::BitCast:
1074 NeedsExplicitCast = true;
1078 if (NeedsExplicitCast) {
1080 if (Ty->isInteger() && Ty != Type::Int1Ty)
1081 printSimpleType(Out, Ty, TypeIsSigned);
1083 printType(Out, Ty); // not integer, sign doesn't matter
1086 return NeedsExplicitCast;
1089 // Print a constant assuming that it is the operand for a given Opcode. The
1090 // opcodes that care about sign need to cast their operands to the expected
1091 // type before the operation proceeds. This function does the casting.
1092 void CWriter::printConstantWithCast(Constant* CPV, unsigned Opcode) {
1094 // Extract the operand's type, we'll need it.
1095 const Type* OpTy = CPV->getType();
1097 // Indicate whether to do the cast or not.
1098 bool shouldCast = false;
1099 bool typeIsSigned = false;
1101 // Based on the Opcode for which this Constant is being written, determine
1102 // the new type to which the operand should be casted by setting the value
1103 // of OpTy. If we change OpTy, also set shouldCast to true so it gets
1107 // for most instructions, it doesn't matter
1109 case Instruction::LShr:
1110 case Instruction::UDiv:
1111 case Instruction::URem:
1114 case Instruction::AShr:
1115 case Instruction::SDiv:
1116 case Instruction::SRem:
1118 typeIsSigned = true;
1122 // Write out the casted constant if we should, otherwise just write the
1126 printSimpleType(Out, OpTy, typeIsSigned);
1134 std::string CWriter::GetValueName(const Value *Operand) {
1137 if (!isa<GlobalValue>(Operand) && Operand->getName() != "") {
1138 std::string VarName;
1140 Name = Operand->getName();
1141 VarName.reserve(Name.capacity());
1143 for (std::string::iterator I = Name.begin(), E = Name.end();
1147 if (!((ch >= 'a' && ch <= 'z') || (ch >= 'A' && ch <= 'Z') ||
1148 (ch >= '0' && ch <= '9') || ch == '_'))
1154 Name = "llvm_cbe_" + VarName;
1156 Name = Mang->getValueName(Operand);
1162 void CWriter::writeOperandInternal(Value *Operand) {
1163 if (Instruction *I = dyn_cast<Instruction>(Operand))
1164 if (isInlinableInst(*I) && !isDirectAlloca(I)) {
1165 // Should we inline this instruction to build a tree?
1172 Constant* CPV = dyn_cast<Constant>(Operand);
1174 if (CPV && !isa<GlobalValue>(CPV))
1177 Out << GetValueName(Operand);
1180 void CWriter::writeOperandRaw(Value *Operand) {
1181 Constant* CPV = dyn_cast<Constant>(Operand);
1182 if (CPV && !isa<GlobalValue>(CPV)) {
1185 Out << GetValueName(Operand);
1189 void CWriter::writeOperand(Value *Operand) {
1190 if (isa<GlobalVariable>(Operand) || isDirectAlloca(Operand))
1191 Out << "(&"; // Global variables are referenced as their addresses by llvm
1193 writeOperandInternal(Operand);
1195 if (isa<GlobalVariable>(Operand) || isDirectAlloca(Operand))
1199 // Some instructions need to have their result value casted back to the
1200 // original types because their operands were casted to the expected type.
1201 // This function takes care of detecting that case and printing the cast
1202 // for the Instruction.
1203 bool CWriter::writeInstructionCast(const Instruction &I) {
1204 const Type *Ty = I.getOperand(0)->getType();
1205 switch (I.getOpcode()) {
1206 case Instruction::LShr:
1207 case Instruction::URem:
1208 case Instruction::UDiv:
1210 printSimpleType(Out, Ty, false);
1213 case Instruction::AShr:
1214 case Instruction::SRem:
1215 case Instruction::SDiv:
1217 printSimpleType(Out, Ty, true);
1225 // Write the operand with a cast to another type based on the Opcode being used.
1226 // This will be used in cases where an instruction has specific type
1227 // requirements (usually signedness) for its operands.
1228 void CWriter::writeOperandWithCast(Value* Operand, unsigned Opcode) {
1230 // Extract the operand's type, we'll need it.
1231 const Type* OpTy = Operand->getType();
1233 // Indicate whether to do the cast or not.
1234 bool shouldCast = false;
1236 // Indicate whether the cast should be to a signed type or not.
1237 bool castIsSigned = false;
1239 // Based on the Opcode for which this Operand is being written, determine
1240 // the new type to which the operand should be casted by setting the value
1241 // of OpTy. If we change OpTy, also set shouldCast to true.
1244 // for most instructions, it doesn't matter
1246 case Instruction::LShr:
1247 case Instruction::UDiv:
1248 case Instruction::URem: // Cast to unsigned first
1250 castIsSigned = false;
1252 case Instruction::GetElementPtr:
1253 case Instruction::AShr:
1254 case Instruction::SDiv:
1255 case Instruction::SRem: // Cast to signed first
1257 castIsSigned = true;
1261 // Write out the casted operand if we should, otherwise just write the
1265 printSimpleType(Out, OpTy, castIsSigned);
1267 writeOperand(Operand);
1270 writeOperand(Operand);
1273 // Write the operand with a cast to another type based on the icmp predicate
1275 void CWriter::writeOperandWithCast(Value* Operand, const ICmpInst &Cmp) {
1276 // This has to do a cast to ensure the operand has the right signedness.
1277 // Also, if the operand is a pointer, we make sure to cast to an integer when
1278 // doing the comparison both for signedness and so that the C compiler doesn't
1279 // optimize things like "p < NULL" to false (p may contain an integer value
1281 bool shouldCast = Cmp.isRelational();
1283 // Write out the casted operand if we should, otherwise just write the
1286 writeOperand(Operand);
1290 // Should this be a signed comparison? If so, convert to signed.
1291 bool castIsSigned = Cmp.isSignedPredicate();
1293 // If the operand was a pointer, convert to a large integer type.
1294 const Type* OpTy = Operand->getType();
1295 if (isa<PointerType>(OpTy))
1296 OpTy = TD->getIntPtrType();
1299 printSimpleType(Out, OpTy, castIsSigned);
1301 writeOperand(Operand);
1305 // generateCompilerSpecificCode - This is where we add conditional compilation
1306 // directives to cater to specific compilers as need be.
1308 static void generateCompilerSpecificCode(std::ostream& Out) {
1309 // Alloca is hard to get, and we don't want to include stdlib.h here.
1310 Out << "/* get a declaration for alloca */\n"
1311 << "#if defined(__CYGWIN__) || defined(__MINGW32__)\n"
1312 << "#define alloca(x) __builtin_alloca((x))\n"
1313 << "#define _alloca(x) __builtin_alloca((x))\n"
1314 << "#elif defined(__APPLE__)\n"
1315 << "extern void *__builtin_alloca(unsigned long);\n"
1316 << "#define alloca(x) __builtin_alloca(x)\n"
1317 << "#define longjmp _longjmp\n"
1318 << "#define setjmp _setjmp\n"
1319 << "#elif defined(__sun__)\n"
1320 << "#if defined(__sparcv9)\n"
1321 << "extern void *__builtin_alloca(unsigned long);\n"
1323 << "extern void *__builtin_alloca(unsigned int);\n"
1325 << "#define alloca(x) __builtin_alloca(x)\n"
1326 << "#elif defined(__FreeBSD__) || defined(__NetBSD__) || defined(__OpenBSD__)\n"
1327 << "#define alloca(x) __builtin_alloca(x)\n"
1328 << "#elif defined(_MSC_VER)\n"
1329 << "#define inline _inline\n"
1330 << "#define alloca(x) _alloca(x)\n"
1332 << "#include <alloca.h>\n"
1335 // We output GCC specific attributes to preserve 'linkonce'ness on globals.
1336 // If we aren't being compiled with GCC, just drop these attributes.
1337 Out << "#ifndef __GNUC__ /* Can only support \"linkonce\" vars with GCC */\n"
1338 << "#define __attribute__(X)\n"
1341 // On Mac OS X, "external weak" is spelled "__attribute__((weak_import))".
1342 Out << "#if defined(__GNUC__) && defined(__APPLE_CC__)\n"
1343 << "#define __EXTERNAL_WEAK__ __attribute__((weak_import))\n"
1344 << "#elif defined(__GNUC__)\n"
1345 << "#define __EXTERNAL_WEAK__ __attribute__((weak))\n"
1347 << "#define __EXTERNAL_WEAK__\n"
1350 // For now, turn off the weak linkage attribute on Mac OS X. (See above.)
1351 Out << "#if defined(__GNUC__) && defined(__APPLE_CC__)\n"
1352 << "#define __ATTRIBUTE_WEAK__\n"
1353 << "#elif defined(__GNUC__)\n"
1354 << "#define __ATTRIBUTE_WEAK__ __attribute__((weak))\n"
1356 << "#define __ATTRIBUTE_WEAK__\n"
1359 // Add hidden visibility support. FIXME: APPLE_CC?
1360 Out << "#if defined(__GNUC__)\n"
1361 << "#define __HIDDEN__ __attribute__((visibility(\"hidden\")))\n"
1364 // Define NaN and Inf as GCC builtins if using GCC, as 0 otherwise
1365 // From the GCC documentation:
1367 // double __builtin_nan (const char *str)
1369 // This is an implementation of the ISO C99 function nan.
1371 // Since ISO C99 defines this function in terms of strtod, which we do
1372 // not implement, a description of the parsing is in order. The string is
1373 // parsed as by strtol; that is, the base is recognized by leading 0 or
1374 // 0x prefixes. The number parsed is placed in the significand such that
1375 // the least significant bit of the number is at the least significant
1376 // bit of the significand. The number is truncated to fit the significand
1377 // field provided. The significand is forced to be a quiet NaN.
1379 // This function, if given a string literal, is evaluated early enough
1380 // that it is considered a compile-time constant.
1382 // float __builtin_nanf (const char *str)
1384 // Similar to __builtin_nan, except the return type is float.
1386 // double __builtin_inf (void)
1388 // Similar to __builtin_huge_val, except a warning is generated if the
1389 // target floating-point format does not support infinities. This
1390 // function is suitable for implementing the ISO C99 macro INFINITY.
1392 // float __builtin_inff (void)
1394 // Similar to __builtin_inf, except the return type is float.
1395 Out << "#ifdef __GNUC__\n"
1396 << "#define LLVM_NAN(NanStr) __builtin_nan(NanStr) /* Double */\n"
1397 << "#define LLVM_NANF(NanStr) __builtin_nanf(NanStr) /* Float */\n"
1398 << "#define LLVM_NANS(NanStr) __builtin_nans(NanStr) /* Double */\n"
1399 << "#define LLVM_NANSF(NanStr) __builtin_nansf(NanStr) /* Float */\n"
1400 << "#define LLVM_INF __builtin_inf() /* Double */\n"
1401 << "#define LLVM_INFF __builtin_inff() /* Float */\n"
1402 << "#define LLVM_PREFETCH(addr,rw,locality) "
1403 "__builtin_prefetch(addr,rw,locality)\n"
1404 << "#define __ATTRIBUTE_CTOR__ __attribute__((constructor))\n"
1405 << "#define __ATTRIBUTE_DTOR__ __attribute__((destructor))\n"
1406 << "#define LLVM_ASM __asm__\n"
1408 << "#define LLVM_NAN(NanStr) ((double)0.0) /* Double */\n"
1409 << "#define LLVM_NANF(NanStr) 0.0F /* Float */\n"
1410 << "#define LLVM_NANS(NanStr) ((double)0.0) /* Double */\n"
1411 << "#define LLVM_NANSF(NanStr) 0.0F /* Float */\n"
1412 << "#define LLVM_INF ((double)0.0) /* Double */\n"
1413 << "#define LLVM_INFF 0.0F /* Float */\n"
1414 << "#define LLVM_PREFETCH(addr,rw,locality) /* PREFETCH */\n"
1415 << "#define __ATTRIBUTE_CTOR__\n"
1416 << "#define __ATTRIBUTE_DTOR__\n"
1417 << "#define LLVM_ASM(X)\n"
1420 Out << "#if __GNUC__ < 4 /* Old GCC's, or compilers not GCC */ \n"
1421 << "#define __builtin_stack_save() 0 /* not implemented */\n"
1422 << "#define __builtin_stack_restore(X) /* noop */\n"
1425 // Output target-specific code that should be inserted into main.
1426 Out << "#define CODE_FOR_MAIN() /* Any target-specific code for main()*/\n";
1429 /// FindStaticTors - Given a static ctor/dtor list, unpack its contents into
1430 /// the StaticTors set.
1431 static void FindStaticTors(GlobalVariable *GV, std::set<Function*> &StaticTors){
1432 ConstantArray *InitList = dyn_cast<ConstantArray>(GV->getInitializer());
1433 if (!InitList) return;
1435 for (unsigned i = 0, e = InitList->getNumOperands(); i != e; ++i)
1436 if (ConstantStruct *CS = dyn_cast<ConstantStruct>(InitList->getOperand(i))){
1437 if (CS->getNumOperands() != 2) return; // Not array of 2-element structs.
1439 if (CS->getOperand(1)->isNullValue())
1440 return; // Found a null terminator, exit printing.
1441 Constant *FP = CS->getOperand(1);
1442 if (ConstantExpr *CE = dyn_cast<ConstantExpr>(FP))
1444 FP = CE->getOperand(0);
1445 if (Function *F = dyn_cast<Function>(FP))
1446 StaticTors.insert(F);
1450 enum SpecialGlobalClass {
1452 GlobalCtors, GlobalDtors,
1456 /// getGlobalVariableClass - If this is a global that is specially recognized
1457 /// by LLVM, return a code that indicates how we should handle it.
1458 static SpecialGlobalClass getGlobalVariableClass(const GlobalVariable *GV) {
1459 // If this is a global ctors/dtors list, handle it now.
1460 if (GV->hasAppendingLinkage() && GV->use_empty()) {
1461 if (GV->getName() == "llvm.global_ctors")
1463 else if (GV->getName() == "llvm.global_dtors")
1467 // Otherwise, it it is other metadata, don't print it. This catches things
1468 // like debug information.
1469 if (GV->getSection() == "llvm.metadata")
1476 bool CWriter::doInitialization(Module &M) {
1480 TD = new TargetData(&M);
1481 IL = new IntrinsicLowering(*TD);
1482 IL->AddPrototypes(M);
1484 // Ensure that all structure types have names...
1485 Mang = new Mangler(M);
1486 Mang->markCharUnacceptable('.');
1488 // Keep track of which functions are static ctors/dtors so they can have
1489 // an attribute added to their prototypes.
1490 std::set<Function*> StaticCtors, StaticDtors;
1491 for (Module::global_iterator I = M.global_begin(), E = M.global_end();
1493 switch (getGlobalVariableClass(I)) {
1496 FindStaticTors(I, StaticCtors);
1499 FindStaticTors(I, StaticDtors);
1504 // get declaration for alloca
1505 Out << "/* Provide Declarations */\n";
1506 Out << "#include <stdarg.h>\n"; // Varargs support
1507 Out << "#include <setjmp.h>\n"; // Unwind support
1508 generateCompilerSpecificCode(Out);
1510 // Provide a definition for `bool' if not compiling with a C++ compiler.
1512 << "#ifndef __cplusplus\ntypedef unsigned char bool;\n#endif\n"
1514 << "\n\n/* Support for floating point constants */\n"
1515 << "typedef unsigned long long ConstantDoubleTy;\n"
1516 << "typedef unsigned int ConstantFloatTy;\n"
1517 << "typedef struct { unsigned long long f1; unsigned short f2; "
1518 "unsigned short pad[3]; } ConstantFP80Ty;\n"
1519 // This is used for both kinds of 128-bit long double; meaning differs.
1520 << "typedef struct { unsigned long long f1; unsigned long long f2; }"
1521 " ConstantFP128Ty;\n"
1522 << "\n\n/* Global Declarations */\n";
1524 // First output all the declarations for the program, because C requires
1525 // Functions & globals to be declared before they are used.
1528 // Loop over the symbol table, emitting all named constants...
1529 printModuleTypes(M.getTypeSymbolTable());
1531 // Global variable declarations...
1532 if (!M.global_empty()) {
1533 Out << "\n/* External Global Variable Declarations */\n";
1534 for (Module::global_iterator I = M.global_begin(), E = M.global_end();
1537 if (I->hasExternalLinkage() || I->hasExternalWeakLinkage())
1539 else if (I->hasDLLImportLinkage())
1540 Out << "__declspec(dllimport) ";
1542 continue; // Internal Global
1544 // Thread Local Storage
1545 if (I->isThreadLocal())
1548 printType(Out, I->getType()->getElementType(), false, GetValueName(I));
1550 if (I->hasExternalWeakLinkage())
1551 Out << " __EXTERNAL_WEAK__";
1556 // Function declarations
1557 Out << "\n/* Function Declarations */\n";
1558 Out << "double fmod(double, double);\n"; // Support for FP rem
1559 Out << "float fmodf(float, float);\n";
1560 Out << "long double fmodl(long double, long double);\n";
1562 for (Module::iterator I = M.begin(), E = M.end(); I != E; ++I) {
1563 // Don't print declarations for intrinsic functions.
1564 if (!I->isIntrinsic() && I->getName() != "setjmp" &&
1565 I->getName() != "longjmp" && I->getName() != "_setjmp") {
1566 if (I->hasExternalWeakLinkage())
1568 printFunctionSignature(I, true);
1569 if (I->hasWeakLinkage() || I->hasLinkOnceLinkage())
1570 Out << " __ATTRIBUTE_WEAK__";
1571 if (I->hasExternalWeakLinkage())
1572 Out << " __EXTERNAL_WEAK__";
1573 if (StaticCtors.count(I))
1574 Out << " __ATTRIBUTE_CTOR__";
1575 if (StaticDtors.count(I))
1576 Out << " __ATTRIBUTE_DTOR__";
1577 if (I->hasHiddenVisibility())
1578 Out << " __HIDDEN__";
1580 if (I->hasName() && I->getName()[0] == 1)
1581 Out << " LLVM_ASM(\"" << I->getName().c_str()+1 << "\")";
1587 // Output the global variable declarations
1588 if (!M.global_empty()) {
1589 Out << "\n\n/* Global Variable Declarations */\n";
1590 for (Module::global_iterator I = M.global_begin(), E = M.global_end();
1592 if (!I->isDeclaration()) {
1593 // Ignore special globals, such as debug info.
1594 if (getGlobalVariableClass(I))
1597 if (I->hasInternalLinkage())
1602 // Thread Local Storage
1603 if (I->isThreadLocal())
1606 printType(Out, I->getType()->getElementType(), false,
1609 if (I->hasLinkOnceLinkage())
1610 Out << " __attribute__((common))";
1611 else if (I->hasWeakLinkage())
1612 Out << " __ATTRIBUTE_WEAK__";
1613 else if (I->hasExternalWeakLinkage())
1614 Out << " __EXTERNAL_WEAK__";
1615 if (I->hasHiddenVisibility())
1616 Out << " __HIDDEN__";
1621 // Output the global variable definitions and contents...
1622 if (!M.global_empty()) {
1623 Out << "\n\n/* Global Variable Definitions and Initialization */\n";
1624 for (Module::global_iterator I = M.global_begin(), E = M.global_end();
1626 if (!I->isDeclaration()) {
1627 // Ignore special globals, such as debug info.
1628 if (getGlobalVariableClass(I))
1631 if (I->hasInternalLinkage())
1633 else if (I->hasDLLImportLinkage())
1634 Out << "__declspec(dllimport) ";
1635 else if (I->hasDLLExportLinkage())
1636 Out << "__declspec(dllexport) ";
1638 // Thread Local Storage
1639 if (I->isThreadLocal())
1642 printType(Out, I->getType()->getElementType(), false,
1644 if (I->hasLinkOnceLinkage())
1645 Out << " __attribute__((common))";
1646 else if (I->hasWeakLinkage())
1647 Out << " __ATTRIBUTE_WEAK__";
1649 if (I->hasHiddenVisibility())
1650 Out << " __HIDDEN__";
1652 // If the initializer is not null, emit the initializer. If it is null,
1653 // we try to avoid emitting large amounts of zeros. The problem with
1654 // this, however, occurs when the variable has weak linkage. In this
1655 // case, the assembler will complain about the variable being both weak
1656 // and common, so we disable this optimization.
1657 if (!I->getInitializer()->isNullValue()) {
1659 writeOperand(I->getInitializer());
1660 } else if (I->hasWeakLinkage()) {
1661 // We have to specify an initializer, but it doesn't have to be
1662 // complete. If the value is an aggregate, print out { 0 }, and let
1663 // the compiler figure out the rest of the zeros.
1665 if (isa<StructType>(I->getInitializer()->getType()) ||
1666 isa<ArrayType>(I->getInitializer()->getType()) ||
1667 isa<VectorType>(I->getInitializer()->getType())) {
1670 // Just print it out normally.
1671 writeOperand(I->getInitializer());
1679 Out << "\n\n/* Function Bodies */\n";
1681 // Emit some helper functions for dealing with FCMP instruction's
1683 Out << "static inline int llvm_fcmp_ord(double X, double Y) { ";
1684 Out << "return X == X && Y == Y; }\n";
1685 Out << "static inline int llvm_fcmp_uno(double X, double Y) { ";
1686 Out << "return X != X || Y != Y; }\n";
1687 Out << "static inline int llvm_fcmp_ueq(double X, double Y) { ";
1688 Out << "return X == Y || llvm_fcmp_uno(X, Y); }\n";
1689 Out << "static inline int llvm_fcmp_une(double X, double Y) { ";
1690 Out << "return X != Y; }\n";
1691 Out << "static inline int llvm_fcmp_ult(double X, double Y) { ";
1692 Out << "return X < Y || llvm_fcmp_uno(X, Y); }\n";
1693 Out << "static inline int llvm_fcmp_ugt(double X, double Y) { ";
1694 Out << "return X > Y || llvm_fcmp_uno(X, Y); }\n";
1695 Out << "static inline int llvm_fcmp_ule(double X, double Y) { ";
1696 Out << "return X <= Y || llvm_fcmp_uno(X, Y); }\n";
1697 Out << "static inline int llvm_fcmp_uge(double X, double Y) { ";
1698 Out << "return X >= Y || llvm_fcmp_uno(X, Y); }\n";
1699 Out << "static inline int llvm_fcmp_oeq(double X, double Y) { ";
1700 Out << "return X == Y ; }\n";
1701 Out << "static inline int llvm_fcmp_one(double X, double Y) { ";
1702 Out << "return X != Y && llvm_fcmp_ord(X, Y); }\n";
1703 Out << "static inline int llvm_fcmp_olt(double X, double Y) { ";
1704 Out << "return X < Y ; }\n";
1705 Out << "static inline int llvm_fcmp_ogt(double X, double Y) { ";
1706 Out << "return X > Y ; }\n";
1707 Out << "static inline int llvm_fcmp_ole(double X, double Y) { ";
1708 Out << "return X <= Y ; }\n";
1709 Out << "static inline int llvm_fcmp_oge(double X, double Y) { ";
1710 Out << "return X >= Y ; }\n";
1715 /// Output all floating point constants that cannot be printed accurately...
1716 void CWriter::printFloatingPointConstants(Function &F) {
1717 // Scan the module for floating point constants. If any FP constant is used
1718 // in the function, we want to redirect it here so that we do not depend on
1719 // the precision of the printed form, unless the printed form preserves
1722 static unsigned FPCounter = 0;
1723 for (constant_iterator I = constant_begin(&F), E = constant_end(&F);
1725 if (const ConstantFP *FPC = dyn_cast<ConstantFP>(*I))
1726 if (!isFPCSafeToPrint(FPC) && // Do not put in FPConstantMap if safe.
1727 !FPConstantMap.count(FPC)) {
1728 FPConstantMap[FPC] = FPCounter; // Number the FP constants
1730 if (FPC->getType() == Type::DoubleTy) {
1731 double Val = FPC->getValueAPF().convertToDouble();
1732 uint64_t i = FPC->getValueAPF().convertToAPInt().getZExtValue();
1733 Out << "static const ConstantDoubleTy FPConstant" << FPCounter++
1734 << " = 0x" << std::hex << i << std::dec
1735 << "ULL; /* " << Val << " */\n";
1736 } else if (FPC->getType() == Type::FloatTy) {
1737 float Val = FPC->getValueAPF().convertToFloat();
1738 uint32_t i = (uint32_t)FPC->getValueAPF().convertToAPInt().
1740 Out << "static const ConstantFloatTy FPConstant" << FPCounter++
1741 << " = 0x" << std::hex << i << std::dec
1742 << "U; /* " << Val << " */\n";
1743 } else if (FPC->getType() == Type::X86_FP80Ty) {
1744 // api needed to prevent premature destruction
1745 APInt api = FPC->getValueAPF().convertToAPInt();
1746 const uint64_t *p = api.getRawData();
1747 Out << "static const ConstantFP80Ty FPConstant" << FPCounter++
1748 << " = { 0x" << std::hex
1749 << ((uint16_t)p[1] | (p[0] & 0xffffffffffffLL)<<16)
1750 << ", 0x" << (uint16_t)(p[0] >> 48) << ",0,0,0"
1751 << "}; /* Long double constant */\n" << std::dec;
1752 } else if (FPC->getType() == Type::PPC_FP128Ty) {
1753 APInt api = FPC->getValueAPF().convertToAPInt();
1754 const uint64_t *p = api.getRawData();
1755 Out << "static const ConstantFP128Ty FPConstant" << FPCounter++
1756 << " = { 0x" << std::hex
1757 << p[0] << ", 0x" << p[1]
1758 << "}; /* Long double constant */\n" << std::dec;
1761 assert(0 && "Unknown float type!");
1768 /// printSymbolTable - Run through symbol table looking for type names. If a
1769 /// type name is found, emit its declaration...
1771 void CWriter::printModuleTypes(const TypeSymbolTable &TST) {
1772 Out << "/* Helper union for bitcasts */\n";
1773 Out << "typedef union {\n";
1774 Out << " unsigned int Int32;\n";
1775 Out << " unsigned long long Int64;\n";
1776 Out << " float Float;\n";
1777 Out << " double Double;\n";
1778 Out << "} llvmBitCastUnion;\n";
1780 // We are only interested in the type plane of the symbol table.
1781 TypeSymbolTable::const_iterator I = TST.begin();
1782 TypeSymbolTable::const_iterator End = TST.end();
1784 // If there are no type names, exit early.
1785 if (I == End) return;
1787 // Print out forward declarations for structure types before anything else!
1788 Out << "/* Structure forward decls */\n";
1789 for (; I != End; ++I) {
1790 std::string Name = "struct l_" + Mang->makeNameProper(I->first);
1791 Out << Name << ";\n";
1792 TypeNames.insert(std::make_pair(I->second, Name));
1797 // Now we can print out typedefs. Above, we guaranteed that this can only be
1798 // for struct or opaque types.
1799 Out << "/* Typedefs */\n";
1800 for (I = TST.begin(); I != End; ++I) {
1801 std::string Name = "l_" + Mang->makeNameProper(I->first);
1803 printType(Out, I->second, false, Name);
1809 // Keep track of which structures have been printed so far...
1810 std::set<const StructType *> StructPrinted;
1812 // Loop over all structures then push them into the stack so they are
1813 // printed in the correct order.
1815 Out << "/* Structure contents */\n";
1816 for (I = TST.begin(); I != End; ++I)
1817 if (const StructType *STy = dyn_cast<StructType>(I->second))
1818 // Only print out used types!
1819 printContainedStructs(STy, StructPrinted);
1822 // Push the struct onto the stack and recursively push all structs
1823 // this one depends on.
1825 // TODO: Make this work properly with vector types
1827 void CWriter::printContainedStructs(const Type *Ty,
1828 std::set<const StructType*> &StructPrinted){
1829 // Don't walk through pointers.
1830 if (isa<PointerType>(Ty) || Ty->isPrimitiveType() || Ty->isInteger()) return;
1832 // Print all contained types first.
1833 for (Type::subtype_iterator I = Ty->subtype_begin(),
1834 E = Ty->subtype_end(); I != E; ++I)
1835 printContainedStructs(*I, StructPrinted);
1837 if (const StructType *STy = dyn_cast<StructType>(Ty)) {
1838 // Check to see if we have already printed this struct.
1839 if (StructPrinted.insert(STy).second) {
1840 // Print structure type out.
1841 std::string Name = TypeNames[STy];
1842 printType(Out, STy, false, Name, true);
1848 void CWriter::printFunctionSignature(const Function *F, bool Prototype) {
1849 /// isStructReturn - Should this function actually return a struct by-value?
1850 bool isStructReturn = F->isStructReturn();
1852 if (F->hasInternalLinkage()) Out << "static ";
1853 if (F->hasDLLImportLinkage()) Out << "__declspec(dllimport) ";
1854 if (F->hasDLLExportLinkage()) Out << "__declspec(dllexport) ";
1855 switch (F->getCallingConv()) {
1856 case CallingConv::X86_StdCall:
1857 Out << "__stdcall ";
1859 case CallingConv::X86_FastCall:
1860 Out << "__fastcall ";
1864 // Loop over the arguments, printing them...
1865 const FunctionType *FT = cast<FunctionType>(F->getFunctionType());
1866 const ParamAttrsList *PAL = F->getParamAttrs();
1868 std::stringstream FunctionInnards;
1870 // Print out the name...
1871 FunctionInnards << GetValueName(F) << '(';
1873 bool PrintedArg = false;
1874 if (!F->isDeclaration()) {
1875 if (!F->arg_empty()) {
1876 Function::const_arg_iterator I = F->arg_begin(), E = F->arg_end();
1879 // If this is a struct-return function, don't print the hidden
1880 // struct-return argument.
1881 if (isStructReturn) {
1882 assert(I != E && "Invalid struct return function!");
1887 std::string ArgName;
1888 for (; I != E; ++I) {
1889 if (PrintedArg) FunctionInnards << ", ";
1890 if (I->hasName() || !Prototype)
1891 ArgName = GetValueName(I);
1894 const Type *ArgTy = I->getType();
1895 if (PAL && PAL->paramHasAttr(Idx, ParamAttr::ByVal)) {
1896 assert(isa<PointerType>(ArgTy));
1897 ArgTy = cast<PointerType>(ArgTy)->getElementType();
1898 const Value *Arg = &(*I);
1899 ByValParams.insert(Arg);
1901 printType(FunctionInnards, ArgTy,
1902 /*isSigned=*/PAL && PAL->paramHasAttr(Idx, ParamAttr::SExt),
1909 // Loop over the arguments, printing them.
1910 FunctionType::param_iterator I = FT->param_begin(), E = FT->param_end();
1913 // If this is a struct-return function, don't print the hidden
1914 // struct-return argument.
1915 if (isStructReturn) {
1916 assert(I != E && "Invalid struct return function!");
1921 for (; I != E; ++I) {
1922 if (PrintedArg) FunctionInnards << ", ";
1923 const Type *ArgTy = *I;
1924 if (PAL && PAL->paramHasAttr(Idx, ParamAttr::ByVal)) {
1925 assert(isa<PointerType>(ArgTy));
1926 ArgTy = cast<PointerType>(ArgTy)->getElementType();
1928 printType(FunctionInnards, ArgTy,
1929 /*isSigned=*/PAL && PAL->paramHasAttr(Idx, ParamAttr::SExt));
1935 // Finish printing arguments... if this is a vararg function, print the ...,
1936 // unless there are no known types, in which case, we just emit ().
1938 if (FT->isVarArg() && PrintedArg) {
1939 if (PrintedArg) FunctionInnards << ", ";
1940 FunctionInnards << "..."; // Output varargs portion of signature!
1941 } else if (!FT->isVarArg() && !PrintedArg) {
1942 FunctionInnards << "void"; // ret() -> ret(void) in C.
1944 FunctionInnards << ')';
1946 // Get the return tpe for the function.
1948 if (!isStructReturn)
1949 RetTy = F->getReturnType();
1951 // If this is a struct-return function, print the struct-return type.
1952 RetTy = cast<PointerType>(FT->getParamType(0))->getElementType();
1955 // Print out the return type and the signature built above.
1956 printType(Out, RetTy,
1957 /*isSigned=*/ PAL && PAL->paramHasAttr(0, ParamAttr::SExt),
1958 FunctionInnards.str());
1961 static inline bool isFPIntBitCast(const Instruction &I) {
1962 if (!isa<BitCastInst>(I))
1964 const Type *SrcTy = I.getOperand(0)->getType();
1965 const Type *DstTy = I.getType();
1966 return (SrcTy->isFloatingPoint() && DstTy->isInteger()) ||
1967 (DstTy->isFloatingPoint() && SrcTy->isInteger());
1970 void CWriter::printFunction(Function &F) {
1971 /// isStructReturn - Should this function actually return a struct by-value?
1972 bool isStructReturn = F.isStructReturn();
1974 printFunctionSignature(&F, false);
1977 // If this is a struct return function, handle the result with magic.
1978 if (isStructReturn) {
1979 const Type *StructTy =
1980 cast<PointerType>(F.arg_begin()->getType())->getElementType();
1982 printType(Out, StructTy, false, "StructReturn");
1983 Out << "; /* Struct return temporary */\n";
1986 printType(Out, F.arg_begin()->getType(), false,
1987 GetValueName(F.arg_begin()));
1988 Out << " = &StructReturn;\n";
1991 bool PrintedVar = false;
1993 // print local variable information for the function
1994 for (inst_iterator I = inst_begin(&F), E = inst_end(&F); I != E; ++I) {
1995 if (const AllocaInst *AI = isDirectAlloca(&*I)) {
1997 printType(Out, AI->getAllocatedType(), false, GetValueName(AI));
1998 Out << "; /* Address-exposed local */\n";
2000 } else if (I->getType() != Type::VoidTy && !isInlinableInst(*I)) {
2002 printType(Out, I->getType(), false, GetValueName(&*I));
2005 if (isa<PHINode>(*I)) { // Print out PHI node temporaries as well...
2007 printType(Out, I->getType(), false,
2008 GetValueName(&*I)+"__PHI_TEMPORARY");
2013 // We need a temporary for the BitCast to use so it can pluck a value out
2014 // of a union to do the BitCast. This is separate from the need for a
2015 // variable to hold the result of the BitCast.
2016 if (isFPIntBitCast(*I)) {
2017 Out << " llvmBitCastUnion " << GetValueName(&*I)
2018 << "__BITCAST_TEMPORARY;\n";
2026 if (F.hasExternalLinkage() && F.getName() == "main")
2027 Out << " CODE_FOR_MAIN();\n";
2029 // print the basic blocks
2030 for (Function::iterator BB = F.begin(), E = F.end(); BB != E; ++BB) {
2031 if (Loop *L = LI->getLoopFor(BB)) {
2032 if (L->getHeader() == BB && L->getParentLoop() == 0)
2035 printBasicBlock(BB);
2042 void CWriter::printLoop(Loop *L) {
2043 Out << " do { /* Syntactic loop '" << L->getHeader()->getName()
2044 << "' to make GCC happy */\n";
2045 for (unsigned i = 0, e = L->getBlocks().size(); i != e; ++i) {
2046 BasicBlock *BB = L->getBlocks()[i];
2047 Loop *BBLoop = LI->getLoopFor(BB);
2049 printBasicBlock(BB);
2050 else if (BB == BBLoop->getHeader() && BBLoop->getParentLoop() == L)
2053 Out << " } while (1); /* end of syntactic loop '"
2054 << L->getHeader()->getName() << "' */\n";
2057 void CWriter::printBasicBlock(BasicBlock *BB) {
2059 // Don't print the label for the basic block if there are no uses, or if
2060 // the only terminator use is the predecessor basic block's terminator.
2061 // We have to scan the use list because PHI nodes use basic blocks too but
2062 // do not require a label to be generated.
2064 bool NeedsLabel = false;
2065 for (pred_iterator PI = pred_begin(BB), E = pred_end(BB); PI != E; ++PI)
2066 if (isGotoCodeNecessary(*PI, BB)) {
2071 if (NeedsLabel) Out << GetValueName(BB) << ":\n";
2073 // Output all of the instructions in the basic block...
2074 for (BasicBlock::iterator II = BB->begin(), E = --BB->end(); II != E;
2076 if (!isInlinableInst(*II) && !isDirectAlloca(II)) {
2077 if (II->getType() != Type::VoidTy && !isInlineAsm(*II))
2086 // Don't emit prefix or suffix for the terminator...
2087 visit(*BB->getTerminator());
2091 // Specific Instruction type classes... note that all of the casts are
2092 // necessary because we use the instruction classes as opaque types...
2094 void CWriter::visitReturnInst(ReturnInst &I) {
2095 // If this is a struct return function, return the temporary struct.
2096 bool isStructReturn = I.getParent()->getParent()->isStructReturn();
2098 if (isStructReturn) {
2099 Out << " return StructReturn;\n";
2103 // Don't output a void return if this is the last basic block in the function
2104 if (I.getNumOperands() == 0 &&
2105 &*--I.getParent()->getParent()->end() == I.getParent() &&
2106 !I.getParent()->size() == 1) {
2111 if (I.getNumOperands()) {
2113 writeOperand(I.getOperand(0));
2118 void CWriter::visitSwitchInst(SwitchInst &SI) {
2121 writeOperand(SI.getOperand(0));
2122 Out << ") {\n default:\n";
2123 printPHICopiesForSuccessor (SI.getParent(), SI.getDefaultDest(), 2);
2124 printBranchToBlock(SI.getParent(), SI.getDefaultDest(), 2);
2126 for (unsigned i = 2, e = SI.getNumOperands(); i != e; i += 2) {
2128 writeOperand(SI.getOperand(i));
2130 BasicBlock *Succ = cast<BasicBlock>(SI.getOperand(i+1));
2131 printPHICopiesForSuccessor (SI.getParent(), Succ, 2);
2132 printBranchToBlock(SI.getParent(), Succ, 2);
2133 if (Function::iterator(Succ) == next(Function::iterator(SI.getParent())))
2139 void CWriter::visitUnreachableInst(UnreachableInst &I) {
2140 Out << " /*UNREACHABLE*/;\n";
2143 bool CWriter::isGotoCodeNecessary(BasicBlock *From, BasicBlock *To) {
2144 /// FIXME: This should be reenabled, but loop reordering safe!!
2147 if (next(Function::iterator(From)) != Function::iterator(To))
2148 return true; // Not the direct successor, we need a goto.
2150 //isa<SwitchInst>(From->getTerminator())
2152 if (LI->getLoopFor(From) != LI->getLoopFor(To))
2157 void CWriter::printPHICopiesForSuccessor (BasicBlock *CurBlock,
2158 BasicBlock *Successor,
2160 for (BasicBlock::iterator I = Successor->begin(); isa<PHINode>(I); ++I) {
2161 PHINode *PN = cast<PHINode>(I);
2162 // Now we have to do the printing.
2163 Value *IV = PN->getIncomingValueForBlock(CurBlock);
2164 if (!isa<UndefValue>(IV)) {
2165 Out << std::string(Indent, ' ');
2166 Out << " " << GetValueName(I) << "__PHI_TEMPORARY = ";
2168 Out << "; /* for PHI node */\n";
2173 void CWriter::printBranchToBlock(BasicBlock *CurBB, BasicBlock *Succ,
2175 if (isGotoCodeNecessary(CurBB, Succ)) {
2176 Out << std::string(Indent, ' ') << " goto ";
2182 // Branch instruction printing - Avoid printing out a branch to a basic block
2183 // that immediately succeeds the current one.
2185 void CWriter::visitBranchInst(BranchInst &I) {
2187 if (I.isConditional()) {
2188 if (isGotoCodeNecessary(I.getParent(), I.getSuccessor(0))) {
2190 writeOperand(I.getCondition());
2193 printPHICopiesForSuccessor (I.getParent(), I.getSuccessor(0), 2);
2194 printBranchToBlock(I.getParent(), I.getSuccessor(0), 2);
2196 if (isGotoCodeNecessary(I.getParent(), I.getSuccessor(1))) {
2197 Out << " } else {\n";
2198 printPHICopiesForSuccessor (I.getParent(), I.getSuccessor(1), 2);
2199 printBranchToBlock(I.getParent(), I.getSuccessor(1), 2);
2202 // First goto not necessary, assume second one is...
2204 writeOperand(I.getCondition());
2207 printPHICopiesForSuccessor (I.getParent(), I.getSuccessor(1), 2);
2208 printBranchToBlock(I.getParent(), I.getSuccessor(1), 2);
2213 printPHICopiesForSuccessor (I.getParent(), I.getSuccessor(0), 0);
2214 printBranchToBlock(I.getParent(), I.getSuccessor(0), 0);
2219 // PHI nodes get copied into temporary values at the end of predecessor basic
2220 // blocks. We now need to copy these temporary values into the REAL value for
2222 void CWriter::visitPHINode(PHINode &I) {
2224 Out << "__PHI_TEMPORARY";
2228 void CWriter::visitBinaryOperator(Instruction &I) {
2229 // binary instructions, shift instructions, setCond instructions.
2230 assert(!isa<PointerType>(I.getType()));
2232 // We must cast the results of binary operations which might be promoted.
2233 bool needsCast = false;
2234 if ((I.getType() == Type::Int8Ty) || (I.getType() == Type::Int16Ty)
2235 || (I.getType() == Type::FloatTy)) {
2238 printType(Out, I.getType(), false);
2242 // If this is a negation operation, print it out as such. For FP, we don't
2243 // want to print "-0.0 - X".
2244 if (BinaryOperator::isNeg(&I)) {
2246 writeOperand(BinaryOperator::getNegArgument(cast<BinaryOperator>(&I)));
2248 } else if (I.getOpcode() == Instruction::FRem) {
2249 // Output a call to fmod/fmodf instead of emitting a%b
2250 if (I.getType() == Type::FloatTy)
2252 else if (I.getType() == Type::DoubleTy)
2254 else // all 3 flavors of long double
2256 writeOperand(I.getOperand(0));
2258 writeOperand(I.getOperand(1));
2262 // Write out the cast of the instruction's value back to the proper type
2264 bool NeedsClosingParens = writeInstructionCast(I);
2266 // Certain instructions require the operand to be forced to a specific type
2267 // so we use writeOperandWithCast here instead of writeOperand. Similarly
2268 // below for operand 1
2269 writeOperandWithCast(I.getOperand(0), I.getOpcode());
2271 switch (I.getOpcode()) {
2272 case Instruction::Add: Out << " + "; break;
2273 case Instruction::Sub: Out << " - "; break;
2274 case Instruction::Mul: Out << " * "; break;
2275 case Instruction::URem:
2276 case Instruction::SRem:
2277 case Instruction::FRem: Out << " % "; break;
2278 case Instruction::UDiv:
2279 case Instruction::SDiv:
2280 case Instruction::FDiv: Out << " / "; break;
2281 case Instruction::And: Out << " & "; break;
2282 case Instruction::Or: Out << " | "; break;
2283 case Instruction::Xor: Out << " ^ "; break;
2284 case Instruction::Shl : Out << " << "; break;
2285 case Instruction::LShr:
2286 case Instruction::AShr: Out << " >> "; break;
2287 default: cerr << "Invalid operator type!" << I; abort();
2290 writeOperandWithCast(I.getOperand(1), I.getOpcode());
2291 if (NeedsClosingParens)
2300 void CWriter::visitICmpInst(ICmpInst &I) {
2301 // We must cast the results of icmp which might be promoted.
2302 bool needsCast = false;
2304 // Write out the cast of the instruction's value back to the proper type
2306 bool NeedsClosingParens = writeInstructionCast(I);
2308 // Certain icmp predicate require the operand to be forced to a specific type
2309 // so we use writeOperandWithCast here instead of writeOperand. Similarly
2310 // below for operand 1
2311 writeOperandWithCast(I.getOperand(0), I);
2313 switch (I.getPredicate()) {
2314 case ICmpInst::ICMP_EQ: Out << " == "; break;
2315 case ICmpInst::ICMP_NE: Out << " != "; break;
2316 case ICmpInst::ICMP_ULE:
2317 case ICmpInst::ICMP_SLE: Out << " <= "; break;
2318 case ICmpInst::ICMP_UGE:
2319 case ICmpInst::ICMP_SGE: Out << " >= "; break;
2320 case ICmpInst::ICMP_ULT:
2321 case ICmpInst::ICMP_SLT: Out << " < "; break;
2322 case ICmpInst::ICMP_UGT:
2323 case ICmpInst::ICMP_SGT: Out << " > "; break;
2324 default: cerr << "Invalid icmp predicate!" << I; abort();
2327 writeOperandWithCast(I.getOperand(1), I);
2328 if (NeedsClosingParens)
2336 void CWriter::visitFCmpInst(FCmpInst &I) {
2337 if (I.getPredicate() == FCmpInst::FCMP_FALSE) {
2341 if (I.getPredicate() == FCmpInst::FCMP_TRUE) {
2347 switch (I.getPredicate()) {
2348 default: assert(0 && "Illegal FCmp predicate");
2349 case FCmpInst::FCMP_ORD: op = "ord"; break;
2350 case FCmpInst::FCMP_UNO: op = "uno"; break;
2351 case FCmpInst::FCMP_UEQ: op = "ueq"; break;
2352 case FCmpInst::FCMP_UNE: op = "une"; break;
2353 case FCmpInst::FCMP_ULT: op = "ult"; break;
2354 case FCmpInst::FCMP_ULE: op = "ule"; break;
2355 case FCmpInst::FCMP_UGT: op = "ugt"; break;
2356 case FCmpInst::FCMP_UGE: op = "uge"; break;
2357 case FCmpInst::FCMP_OEQ: op = "oeq"; break;
2358 case FCmpInst::FCMP_ONE: op = "one"; break;
2359 case FCmpInst::FCMP_OLT: op = "olt"; break;
2360 case FCmpInst::FCMP_OLE: op = "ole"; break;
2361 case FCmpInst::FCMP_OGT: op = "ogt"; break;
2362 case FCmpInst::FCMP_OGE: op = "oge"; break;
2365 Out << "llvm_fcmp_" << op << "(";
2366 // Write the first operand
2367 writeOperand(I.getOperand(0));
2369 // Write the second operand
2370 writeOperand(I.getOperand(1));
2374 static const char * getFloatBitCastField(const Type *Ty) {
2375 switch (Ty->getTypeID()) {
2376 default: assert(0 && "Invalid Type");
2377 case Type::FloatTyID: return "Float";
2378 case Type::DoubleTyID: return "Double";
2379 case Type::IntegerTyID: {
2380 unsigned NumBits = cast<IntegerType>(Ty)->getBitWidth();
2389 void CWriter::visitCastInst(CastInst &I) {
2390 const Type *DstTy = I.getType();
2391 const Type *SrcTy = I.getOperand(0)->getType();
2393 if (isFPIntBitCast(I)) {
2394 // These int<->float and long<->double casts need to be handled specially
2395 Out << GetValueName(&I) << "__BITCAST_TEMPORARY."
2396 << getFloatBitCastField(I.getOperand(0)->getType()) << " = ";
2397 writeOperand(I.getOperand(0));
2398 Out << ", " << GetValueName(&I) << "__BITCAST_TEMPORARY."
2399 << getFloatBitCastField(I.getType());
2401 printCast(I.getOpcode(), SrcTy, DstTy);
2402 if (I.getOpcode() == Instruction::SExt && SrcTy == Type::Int1Ty) {
2403 // Make sure we really get a sext from bool by subtracing the bool from 0
2406 // If it's a byval parameter being casted, then takes its address.
2407 bool isByVal = ByValParams.count(I.getOperand(0));
2409 assert(I.getOpcode() == Instruction::BitCast &&
2410 "ByVal aggregate parameter must ptr type");
2413 writeOperand(I.getOperand(0));
2414 if (DstTy == Type::Int1Ty &&
2415 (I.getOpcode() == Instruction::Trunc ||
2416 I.getOpcode() == Instruction::FPToUI ||
2417 I.getOpcode() == Instruction::FPToSI ||
2418 I.getOpcode() == Instruction::PtrToInt)) {
2419 // Make sure we really get a trunc to bool by anding the operand with 1
2426 void CWriter::visitSelectInst(SelectInst &I) {
2428 writeOperand(I.getCondition());
2430 writeOperand(I.getTrueValue());
2432 writeOperand(I.getFalseValue());
2437 void CWriter::lowerIntrinsics(Function &F) {
2438 // This is used to keep track of intrinsics that get generated to a lowered
2439 // function. We must generate the prototypes before the function body which
2440 // will only be expanded on first use (by the loop below).
2441 std::vector<Function*> prototypesToGen;
2443 // Examine all the instructions in this function to find the intrinsics that
2444 // need to be lowered.
2445 for (Function::iterator BB = F.begin(), EE = F.end(); BB != EE; ++BB)
2446 for (BasicBlock::iterator I = BB->begin(), E = BB->end(); I != E; )
2447 if (CallInst *CI = dyn_cast<CallInst>(I++))
2448 if (Function *F = CI->getCalledFunction())
2449 switch (F->getIntrinsicID()) {
2450 case Intrinsic::not_intrinsic:
2451 case Intrinsic::vastart:
2452 case Intrinsic::vacopy:
2453 case Intrinsic::vaend:
2454 case Intrinsic::returnaddress:
2455 case Intrinsic::frameaddress:
2456 case Intrinsic::setjmp:
2457 case Intrinsic::longjmp:
2458 case Intrinsic::prefetch:
2459 case Intrinsic::dbg_stoppoint:
2460 case Intrinsic::powi:
2461 // We directly implement these intrinsics
2464 // If this is an intrinsic that directly corresponds to a GCC
2465 // builtin, we handle it.
2466 const char *BuiltinName = "";
2467 #define GET_GCC_BUILTIN_NAME
2468 #include "llvm/Intrinsics.gen"
2469 #undef GET_GCC_BUILTIN_NAME
2470 // If we handle it, don't lower it.
2471 if (BuiltinName[0]) break;
2473 // All other intrinsic calls we must lower.
2474 Instruction *Before = 0;
2475 if (CI != &BB->front())
2476 Before = prior(BasicBlock::iterator(CI));
2478 IL->LowerIntrinsicCall(CI);
2479 if (Before) { // Move iterator to instruction after call
2484 // If the intrinsic got lowered to another call, and that call has
2485 // a definition then we need to make sure its prototype is emitted
2486 // before any calls to it.
2487 if (CallInst *Call = dyn_cast<CallInst>(I))
2488 if (Function *NewF = Call->getCalledFunction())
2489 if (!NewF->isDeclaration())
2490 prototypesToGen.push_back(NewF);
2495 // We may have collected some prototypes to emit in the loop above.
2496 // Emit them now, before the function that uses them is emitted. But,
2497 // be careful not to emit them twice.
2498 std::vector<Function*>::iterator I = prototypesToGen.begin();
2499 std::vector<Function*>::iterator E = prototypesToGen.end();
2500 for ( ; I != E; ++I) {
2501 if (intrinsicPrototypesAlreadyGenerated.insert(*I).second) {
2503 printFunctionSignature(*I, true);
2510 void CWriter::visitCallInst(CallInst &I) {
2511 //check if we have inline asm
2512 if (isInlineAsm(I)) {
2517 bool WroteCallee = false;
2519 // Handle intrinsic function calls first...
2520 if (Function *F = I.getCalledFunction())
2521 if (Intrinsic::ID ID = (Intrinsic::ID)F->getIntrinsicID()) {
2524 // If this is an intrinsic that directly corresponds to a GCC
2525 // builtin, we emit it here.
2526 const char *BuiltinName = "";
2527 #define GET_GCC_BUILTIN_NAME
2528 #include "llvm/Intrinsics.gen"
2529 #undef GET_GCC_BUILTIN_NAME
2530 assert(BuiltinName[0] && "Unknown LLVM intrinsic!");
2536 case Intrinsic::vastart:
2539 Out << "va_start(*(va_list*)";
2540 writeOperand(I.getOperand(1));
2542 // Output the last argument to the enclosing function...
2543 if (I.getParent()->getParent()->arg_empty()) {
2544 cerr << "The C backend does not currently support zero "
2545 << "argument varargs functions, such as '"
2546 << I.getParent()->getParent()->getName() << "'!\n";
2549 writeOperand(--I.getParent()->getParent()->arg_end());
2552 case Intrinsic::vaend:
2553 if (!isa<ConstantPointerNull>(I.getOperand(1))) {
2554 Out << "0; va_end(*(va_list*)";
2555 writeOperand(I.getOperand(1));
2558 Out << "va_end(*(va_list*)0)";
2561 case Intrinsic::vacopy:
2563 Out << "va_copy(*(va_list*)";
2564 writeOperand(I.getOperand(1));
2565 Out << ", *(va_list*)";
2566 writeOperand(I.getOperand(2));
2569 case Intrinsic::returnaddress:
2570 Out << "__builtin_return_address(";
2571 writeOperand(I.getOperand(1));
2574 case Intrinsic::frameaddress:
2575 Out << "__builtin_frame_address(";
2576 writeOperand(I.getOperand(1));
2579 case Intrinsic::powi:
2580 Out << "__builtin_powi(";
2581 writeOperand(I.getOperand(1));
2583 writeOperand(I.getOperand(2));
2586 case Intrinsic::setjmp:
2587 Out << "setjmp(*(jmp_buf*)";
2588 writeOperand(I.getOperand(1));
2591 case Intrinsic::longjmp:
2592 Out << "longjmp(*(jmp_buf*)";
2593 writeOperand(I.getOperand(1));
2595 writeOperand(I.getOperand(2));
2598 case Intrinsic::prefetch:
2599 Out << "LLVM_PREFETCH((const void *)";
2600 writeOperand(I.getOperand(1));
2602 writeOperand(I.getOperand(2));
2604 writeOperand(I.getOperand(3));
2607 case Intrinsic::stacksave:
2608 // Emit this as: Val = 0; *((void**)&Val) = __builtin_stack_save()
2609 // to work around GCC bugs (see PR1809).
2610 Out << "0; *((void**)&" << GetValueName(&I)
2611 << ") = __builtin_stack_save()";
2613 case Intrinsic::dbg_stoppoint: {
2614 // If we use writeOperand directly we get a "u" suffix which is rejected
2616 DbgStopPointInst &SPI = cast<DbgStopPointInst>(I);
2620 << " \"" << SPI.getDirectory()
2621 << SPI.getFileName() << "\"\n";
2627 Value *Callee = I.getCalledValue();
2629 const PointerType *PTy = cast<PointerType>(Callee->getType());
2630 const FunctionType *FTy = cast<FunctionType>(PTy->getElementType());
2632 // If this is a call to a struct-return function, assign to the first
2633 // parameter instead of passing it to the call.
2634 const ParamAttrsList *PAL = I.getParamAttrs();
2635 bool isStructRet = I.isStructReturn();
2637 bool isByVal = ByValParams.count(I.getOperand(1));
2638 if (!isByVal) Out << "*(";
2639 writeOperand(I.getOperand(1));
2640 if (!isByVal) Out << ")";
2644 if (I.isTailCall()) Out << " /*tail*/ ";
2647 // If this is an indirect call to a struct return function, we need to cast
2649 bool NeedsCast = isStructRet && !isa<Function>(Callee);
2651 // GCC is a real PITA. It does not permit codegening casts of functions to
2652 // function pointers if they are in a call (it generates a trap instruction
2653 // instead!). We work around this by inserting a cast to void* in between
2654 // the function and the function pointer cast. Unfortunately, we can't just
2655 // form the constant expression here, because the folder will immediately
2658 // Note finally, that this is completely unsafe. ANSI C does not guarantee
2659 // that void* and function pointers have the same size. :( To deal with this
2660 // in the common case, we handle casts where the number of arguments passed
2663 if (ConstantExpr *CE = dyn_cast<ConstantExpr>(Callee))
2665 if (Function *RF = dyn_cast<Function>(CE->getOperand(0))) {
2671 // Ok, just cast the pointer type.
2674 printType(Out, I.getCalledValue()->getType());
2676 printStructReturnPointerFunctionType(Out, PAL,
2677 cast<PointerType>(I.getCalledValue()->getType()));
2680 writeOperand(Callee);
2681 if (NeedsCast) Out << ')';
2686 unsigned NumDeclaredParams = FTy->getNumParams();
2688 CallSite::arg_iterator AI = I.op_begin()+1, AE = I.op_end();
2690 if (isStructRet) { // Skip struct return argument.
2695 bool PrintedArg = false;
2696 for (; AI != AE; ++AI, ++ArgNo) {
2697 if (PrintedArg) Out << ", ";
2698 if (ArgNo < NumDeclaredParams &&
2699 (*AI)->getType() != FTy->getParamType(ArgNo)) {
2701 printType(Out, FTy->getParamType(ArgNo),
2702 /*isSigned=*/PAL && PAL->paramHasAttr(ArgNo+1, ParamAttr::SExt));
2705 // Check if the argument is expected to be passed by value.
2706 bool isOutByVal = PAL && PAL->paramHasAttr(ArgNo+1, ParamAttr::ByVal);
2707 // Check if this argument itself is passed in by reference.
2708 bool isInByVal = ByValParams.count(*AI);
2709 if (isOutByVal && !isInByVal)
2711 else if (!isOutByVal && isInByVal)
2714 if (isOutByVal ^ isInByVal)
2722 //This converts the llvm constraint string to something gcc is expecting.
2723 //TODO: work out platform independent constraints and factor those out
2724 // of the per target tables
2725 // handle multiple constraint codes
2726 std::string CWriter::InterpretASMConstraint(InlineAsm::ConstraintInfo& c) {
2728 assert(c.Codes.size() == 1 && "Too many asm constraint codes to handle");
2730 const char** table = 0;
2732 //Grab the translation table from TargetAsmInfo if it exists
2735 const TargetMachineRegistry::entry* Match =
2736 TargetMachineRegistry::getClosestStaticTargetForModule(*TheModule, E);
2738 //Per platform Target Machines don't exist, so create it
2739 // this must be done only once
2740 const TargetMachine* TM = Match->CtorFn(*TheModule, "");
2741 TAsm = TM->getTargetAsmInfo();
2745 table = TAsm->getAsmCBE();
2747 //Search the translation table if it exists
2748 for (int i = 0; table && table[i]; i += 2)
2749 if (c.Codes[0] == table[i])
2752 //default is identity
2756 //TODO: import logic from AsmPrinter.cpp
2757 static std::string gccifyAsm(std::string asmstr) {
2758 for (std::string::size_type i = 0; i != asmstr.size(); ++i)
2759 if (asmstr[i] == '\n')
2760 asmstr.replace(i, 1, "\\n");
2761 else if (asmstr[i] == '\t')
2762 asmstr.replace(i, 1, "\\t");
2763 else if (asmstr[i] == '$') {
2764 if (asmstr[i + 1] == '{') {
2765 std::string::size_type a = asmstr.find_first_of(':', i + 1);
2766 std::string::size_type b = asmstr.find_first_of('}', i + 1);
2767 std::string n = "%" +
2768 asmstr.substr(a + 1, b - a - 1) +
2769 asmstr.substr(i + 2, a - i - 2);
2770 asmstr.replace(i, b - i + 1, n);
2773 asmstr.replace(i, 1, "%");
2775 else if (asmstr[i] == '%')//grr
2776 { asmstr.replace(i, 1, "%%"); ++i;}
2781 //TODO: assumptions about what consume arguments from the call are likely wrong
2782 // handle communitivity
2783 void CWriter::visitInlineAsm(CallInst &CI) {
2784 InlineAsm* as = cast<InlineAsm>(CI.getOperand(0));
2785 std::vector<InlineAsm::ConstraintInfo> Constraints = as->ParseConstraints();
2786 std::vector<std::pair<std::string, Value*> > Input;
2787 std::vector<std::pair<std::string, Value*> > Output;
2788 std::string Clobber;
2789 int count = CI.getType() == Type::VoidTy ? 1 : 0;
2790 for (std::vector<InlineAsm::ConstraintInfo>::iterator I = Constraints.begin(),
2791 E = Constraints.end(); I != E; ++I) {
2792 assert(I->Codes.size() == 1 && "Too many asm constraint codes to handle");
2794 InterpretASMConstraint(*I);
2797 assert(0 && "Unknown asm constraint");
2799 case InlineAsm::isInput: {
2801 Input.push_back(std::make_pair(c, count ? CI.getOperand(count) : &CI));
2802 ++count; //consume arg
2806 case InlineAsm::isOutput: {
2808 Output.push_back(std::make_pair("="+((I->isEarlyClobber ? "&" : "")+c),
2809 count ? CI.getOperand(count) : &CI));
2810 ++count; //consume arg
2814 case InlineAsm::isClobber: {
2816 Clobber += ",\"" + c + "\"";
2822 //fix up the asm string for gcc
2823 std::string asmstr = gccifyAsm(as->getAsmString());
2825 Out << "__asm__ volatile (\"" << asmstr << "\"\n";
2827 for (std::vector<std::pair<std::string, Value*> >::iterator I = Output.begin(),
2828 E = Output.end(); I != E; ++I) {
2829 Out << "\"" << I->first << "\"(";
2830 writeOperandRaw(I->second);
2836 for (std::vector<std::pair<std::string, Value*> >::iterator I = Input.begin(),
2837 E = Input.end(); I != E; ++I) {
2838 Out << "\"" << I->first << "\"(";
2839 writeOperandRaw(I->second);
2845 Out << "\n :" << Clobber.substr(1);
2849 void CWriter::visitMallocInst(MallocInst &I) {
2850 assert(0 && "lowerallocations pass didn't work!");
2853 void CWriter::visitAllocaInst(AllocaInst &I) {
2855 printType(Out, I.getType());
2856 Out << ") alloca(sizeof(";
2857 printType(Out, I.getType()->getElementType());
2859 if (I.isArrayAllocation()) {
2861 writeOperand(I.getOperand(0));
2866 void CWriter::visitFreeInst(FreeInst &I) {
2867 assert(0 && "lowerallocations pass didn't work!");
2870 void CWriter::printIndexingExpression(Value *Ptr, gep_type_iterator I,
2871 gep_type_iterator E) {
2872 bool HasImplicitAddress = false;
2873 // If accessing a global value with no indexing, avoid *(&GV) syndrome
2874 if (isa<GlobalValue>(Ptr)) {
2875 HasImplicitAddress = true;
2876 } else if (isDirectAlloca(Ptr)) {
2877 HasImplicitAddress = true;
2881 if (!HasImplicitAddress)
2882 Out << '*'; // Implicit zero first argument: '*x' is equivalent to 'x[0]'
2884 writeOperandInternal(Ptr);
2888 const Constant *CI = dyn_cast<Constant>(I.getOperand());
2889 if (HasImplicitAddress && (!CI || !CI->isNullValue()))
2892 writeOperandInternal(Ptr);
2894 if (HasImplicitAddress && (!CI || !CI->isNullValue())) {
2896 HasImplicitAddress = false; // HIA is only true if we haven't addressed yet
2899 assert(!HasImplicitAddress || (CI && CI->isNullValue()) &&
2900 "Can only have implicit address with direct accessing");
2902 if (HasImplicitAddress) {
2904 } else if (CI && CI->isNullValue()) {
2905 gep_type_iterator TmpI = I; ++TmpI;
2907 // Print out the -> operator if possible...
2908 if (TmpI != E && isa<StructType>(*TmpI)) {
2909 // Check if it's actually an aggregate parameter passed by value.
2910 bool isByVal = ByValParams.count(Ptr);
2911 Out << ((HasImplicitAddress || isByVal) ? "." : "->");
2912 Out << "field" << cast<ConstantInt>(TmpI.getOperand())->getZExtValue();
2918 if (isa<StructType>(*I)) {
2919 Out << ".field" << cast<ConstantInt>(I.getOperand())->getZExtValue();
2922 writeOperandWithCast(I.getOperand(), Instruction::GetElementPtr);
2927 void CWriter::visitLoadInst(LoadInst &I) {
2929 if (I.isVolatile()) {
2931 printType(Out, I.getType(), false, "volatile*");
2935 writeOperand(I.getOperand(0));
2941 void CWriter::visitStoreInst(StoreInst &I) {
2943 if (I.isVolatile()) {
2945 printType(Out, I.getOperand(0)->getType(), false, " volatile*");
2948 writeOperand(I.getPointerOperand());
2949 if (I.isVolatile()) Out << ')';
2951 Value *Operand = I.getOperand(0);
2952 Constant *BitMask = 0;
2953 if (const IntegerType* ITy = dyn_cast<IntegerType>(Operand->getType()))
2954 if (!ITy->isPowerOf2ByteWidth())
2955 // We have a bit width that doesn't match an even power-of-2 byte
2956 // size. Consequently we must & the value with the type's bit mask
2957 BitMask = ConstantInt::get(ITy, ITy->getBitMask());
2960 writeOperand(Operand);
2963 printConstant(BitMask);
2968 void CWriter::visitGetElementPtrInst(GetElementPtrInst &I) {
2970 printIndexingExpression(I.getPointerOperand(), gep_type_begin(I),
2974 void CWriter::visitVAArgInst(VAArgInst &I) {
2975 Out << "va_arg(*(va_list*)";
2976 writeOperand(I.getOperand(0));
2978 printType(Out, I.getType());
2982 //===----------------------------------------------------------------------===//
2983 // External Interface declaration
2984 //===----------------------------------------------------------------------===//
2986 bool CTargetMachine::addPassesToEmitWholeFile(PassManager &PM,
2988 CodeGenFileType FileType,
2990 if (FileType != TargetMachine::AssemblyFile) return true;
2992 PM.add(createGCLoweringPass());
2993 PM.add(createLowerAllocationsPass(true));
2994 PM.add(createLowerInvokePass());
2995 PM.add(createCFGSimplificationPass()); // clean up after lower invoke.
2996 PM.add(new CBackendNameAllUsedStructsAndMergeFunctions());
2997 PM.add(new CWriter(o));
2998 PM.add(createCollectorMetadataDeleter());