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/Pass.h"
22 #include "llvm/PassManager.h"
23 #include "llvm/TypeSymbolTable.h"
24 #include "llvm/Intrinsics.h"
25 #include "llvm/IntrinsicInst.h"
26 #include "llvm/InlineAsm.h"
27 #include "llvm/Analysis/ConstantsScanner.h"
28 #include "llvm/Analysis/FindUsedTypes.h"
29 #include "llvm/Analysis/LoopInfo.h"
30 #include "llvm/CodeGen/Passes.h"
31 #include "llvm/CodeGen/IntrinsicLowering.h"
32 #include "llvm/Transforms/Scalar.h"
33 #include "llvm/Target/TargetMachineRegistry.h"
34 #include "llvm/Target/TargetAsmInfo.h"
35 #include "llvm/Target/TargetData.h"
36 #include "llvm/Support/CallSite.h"
37 #include "llvm/Support/CFG.h"
38 #include "llvm/Support/GetElementPtrTypeIterator.h"
39 #include "llvm/Support/InstVisitor.h"
40 #include "llvm/Support/Mangler.h"
41 #include "llvm/Support/MathExtras.h"
42 #include "llvm/Support/raw_ostream.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"
51 /// CBackendTargetMachineModule - Note that this is used on hosts that
52 /// cannot link in a library unless there are references into the
53 /// library. In particular, it seems that it is not possible to get
54 /// things to work on Win32 without this. Though it is unused, do not
56 extern "C" int CBackendTargetMachineModule;
57 int CBackendTargetMachineModule = 0;
59 // Register the target.
60 static RegisterTarget<CTargetMachine> X("c", "C backend");
63 /// CBackendNameAllUsedStructsAndMergeFunctions - This pass inserts names for
64 /// any unnamed structure types that are used by the program, and merges
65 /// external functions with the same name.
67 class CBackendNameAllUsedStructsAndMergeFunctions : public ModulePass {
70 CBackendNameAllUsedStructsAndMergeFunctions()
72 void getAnalysisUsage(AnalysisUsage &AU) const {
73 AU.addRequired<FindUsedTypes>();
76 virtual const char *getPassName() const {
77 return "C backend type canonicalizer";
80 virtual bool runOnModule(Module &M);
83 char CBackendNameAllUsedStructsAndMergeFunctions::ID = 0;
85 /// CWriter - This class is the main chunk of code that converts an LLVM
86 /// module to a C translation unit.
87 class CWriter : public FunctionPass, public InstVisitor<CWriter> {
89 IntrinsicLowering *IL;
92 const Module *TheModule;
93 const TargetAsmInfo* TAsm;
95 std::map<const Type *, std::string> TypeNames;
96 std::map<const ConstantFP *, unsigned> FPConstantMap;
97 std::set<Function*> intrinsicPrototypesAlreadyGenerated;
98 std::set<const Argument*> ByValParams;
103 explicit CWriter(raw_ostream &o)
104 : FunctionPass(&ID), Out(o), IL(0), Mang(0), LI(0),
105 TheModule(0), TAsm(0), TD(0) {
109 virtual const char *getPassName() const { return "C backend"; }
111 void getAnalysisUsage(AnalysisUsage &AU) const {
112 AU.addRequired<LoopInfo>();
113 AU.setPreservesAll();
116 virtual bool doInitialization(Module &M);
118 bool runOnFunction(Function &F) {
119 LI = &getAnalysis<LoopInfo>();
121 // Get rid of intrinsics we can't handle.
124 // Output all floating point constants that cannot be printed accurately.
125 printFloatingPointConstants(F);
131 virtual bool doFinalization(Module &M) {
136 FPConstantMap.clear();
139 intrinsicPrototypesAlreadyGenerated.clear();
143 raw_ostream &printType(raw_ostream &Out, const Type *Ty,
144 bool isSigned = false,
145 const std::string &VariableName = "",
146 bool IgnoreName = false,
147 const AttrListPtr &PAL = AttrListPtr());
148 std::ostream &printType(std::ostream &Out, const Type *Ty,
149 bool isSigned = false,
150 const std::string &VariableName = "",
151 bool IgnoreName = false,
152 const AttrListPtr &PAL = AttrListPtr());
153 raw_ostream &printSimpleType(raw_ostream &Out, const Type *Ty,
155 const std::string &NameSoFar = "");
156 std::ostream &printSimpleType(std::ostream &Out, const Type *Ty,
158 const std::string &NameSoFar = "");
160 void printStructReturnPointerFunctionType(raw_ostream &Out,
161 const AttrListPtr &PAL,
162 const PointerType *Ty);
164 /// writeOperandDeref - Print the result of dereferencing the specified
165 /// operand with '*'. This is equivalent to printing '*' then using
166 /// writeOperand, but avoids excess syntax in some cases.
167 void writeOperandDeref(Value *Operand) {
168 if (isAddressExposed(Operand)) {
169 // Already something with an address exposed.
170 writeOperandInternal(Operand);
173 writeOperand(Operand);
178 void writeOperand(Value *Operand, bool Static = false);
179 void writeInstComputationInline(Instruction &I);
180 void writeOperandInternal(Value *Operand, bool Static = false);
181 void writeOperandWithCast(Value* Operand, unsigned Opcode);
182 void writeOperandWithCast(Value* Operand, const ICmpInst &I);
183 bool writeInstructionCast(const Instruction &I);
185 void writeMemoryAccess(Value *Operand, const Type *OperandType,
186 bool IsVolatile, unsigned Alignment);
189 std::string InterpretASMConstraint(InlineAsm::ConstraintInfo& c);
191 void lowerIntrinsics(Function &F);
193 void printModule(Module *M);
194 void printModuleTypes(const TypeSymbolTable &ST);
195 void printContainedStructs(const Type *Ty, std::set<const Type *> &);
196 void printFloatingPointConstants(Function &F);
197 void printFloatingPointConstants(const Constant *C);
198 void printFunctionSignature(const Function *F, bool Prototype);
200 void printFunction(Function &);
201 void printBasicBlock(BasicBlock *BB);
202 void printLoop(Loop *L);
204 void printCast(unsigned opcode, const Type *SrcTy, const Type *DstTy);
205 void printConstant(Constant *CPV, bool Static);
206 void printConstantWithCast(Constant *CPV, unsigned Opcode);
207 bool printConstExprCast(const ConstantExpr *CE, bool Static);
208 void printConstantArray(ConstantArray *CPA, bool Static);
209 void printConstantVector(ConstantVector *CV, bool Static);
211 /// isAddressExposed - Return true if the specified value's name needs to
212 /// have its address taken in order to get a C value of the correct type.
213 /// This happens for global variables, byval parameters, and direct allocas.
214 bool isAddressExposed(const Value *V) const {
215 if (const Argument *A = dyn_cast<Argument>(V))
216 return ByValParams.count(A);
217 return isa<GlobalVariable>(V) || isDirectAlloca(V);
220 // isInlinableInst - Attempt to inline instructions into their uses to build
221 // trees as much as possible. To do this, we have to consistently decide
222 // what is acceptable to inline, so that variable declarations don't get
223 // printed and an extra copy of the expr is not emitted.
225 static bool isInlinableInst(const Instruction &I) {
226 // Always inline cmp instructions, even if they are shared by multiple
227 // expressions. GCC generates horrible code if we don't.
231 // Must be an expression, must be used exactly once. If it is dead, we
232 // emit it inline where it would go.
233 if (I.getType() == Type::VoidTy || !I.hasOneUse() ||
234 isa<TerminatorInst>(I) || isa<CallInst>(I) || isa<PHINode>(I) ||
235 isa<LoadInst>(I) || isa<VAArgInst>(I) || isa<InsertElementInst>(I) ||
236 isa<InsertValueInst>(I))
237 // Don't inline a load across a store or other bad things!
240 // Must not be used in inline asm, extractelement, or shufflevector.
242 const Instruction &User = cast<Instruction>(*I.use_back());
243 if (isInlineAsm(User) || isa<ExtractElementInst>(User) ||
244 isa<ShuffleVectorInst>(User))
248 // Only inline instruction it if it's use is in the same BB as the inst.
249 return I.getParent() == cast<Instruction>(I.use_back())->getParent();
252 // isDirectAlloca - Define fixed sized allocas in the entry block as direct
253 // variables which are accessed with the & operator. This causes GCC to
254 // generate significantly better code than to emit alloca calls directly.
256 static const AllocaInst *isDirectAlloca(const Value *V) {
257 const AllocaInst *AI = dyn_cast<AllocaInst>(V);
258 if (!AI) return false;
259 if (AI->isArrayAllocation())
260 return 0; // FIXME: we can also inline fixed size array allocas!
261 if (AI->getParent() != &AI->getParent()->getParent()->getEntryBlock())
266 // isInlineAsm - Check if the instruction is a call to an inline asm chunk
267 static bool isInlineAsm(const Instruction& I) {
268 if (isa<CallInst>(&I) && isa<InlineAsm>(I.getOperand(0)))
273 // Instruction visitation functions
274 friend class InstVisitor<CWriter>;
276 void visitReturnInst(ReturnInst &I);
277 void visitBranchInst(BranchInst &I);
278 void visitSwitchInst(SwitchInst &I);
279 void visitInvokeInst(InvokeInst &I) {
280 assert(0 && "Lowerinvoke pass didn't work!");
283 void visitUnwindInst(UnwindInst &I) {
284 assert(0 && "Lowerinvoke pass didn't work!");
286 void visitUnreachableInst(UnreachableInst &I);
288 void visitPHINode(PHINode &I);
289 void visitBinaryOperator(Instruction &I);
290 void visitICmpInst(ICmpInst &I);
291 void visitFCmpInst(FCmpInst &I);
293 void visitCastInst (CastInst &I);
294 void visitSelectInst(SelectInst &I);
295 void visitCallInst (CallInst &I);
296 void visitInlineAsm(CallInst &I);
297 bool visitBuiltinCall(CallInst &I, Intrinsic::ID ID, bool &WroteCallee);
299 void visitMallocInst(MallocInst &I);
300 void visitAllocaInst(AllocaInst &I);
301 void visitFreeInst (FreeInst &I);
302 void visitLoadInst (LoadInst &I);
303 void visitStoreInst (StoreInst &I);
304 void visitGetElementPtrInst(GetElementPtrInst &I);
305 void visitVAArgInst (VAArgInst &I);
307 void visitInsertElementInst(InsertElementInst &I);
308 void visitExtractElementInst(ExtractElementInst &I);
309 void visitShuffleVectorInst(ShuffleVectorInst &SVI);
311 void visitInsertValueInst(InsertValueInst &I);
312 void visitExtractValueInst(ExtractValueInst &I);
314 void visitInstruction(Instruction &I) {
315 cerr << "C Writer does not know about " << I;
319 void outputLValue(Instruction *I) {
320 Out << " " << GetValueName(I) << " = ";
323 bool isGotoCodeNecessary(BasicBlock *From, BasicBlock *To);
324 void printPHICopiesForSuccessor(BasicBlock *CurBlock,
325 BasicBlock *Successor, unsigned Indent);
326 void printBranchToBlock(BasicBlock *CurBlock, BasicBlock *SuccBlock,
328 void printGEPExpression(Value *Ptr, gep_type_iterator I,
329 gep_type_iterator E, bool Static);
331 std::string GetValueName(const Value *Operand);
335 char CWriter::ID = 0;
337 /// This method inserts names for any unnamed structure types that are used by
338 /// the program, and removes names from structure types that are not used by the
341 bool CBackendNameAllUsedStructsAndMergeFunctions::runOnModule(Module &M) {
342 // Get a set of types that are used by the program...
343 std::set<const Type *> UT = getAnalysis<FindUsedTypes>().getTypes();
345 // Loop over the module symbol table, removing types from UT that are
346 // already named, and removing names for types that are not used.
348 TypeSymbolTable &TST = M.getTypeSymbolTable();
349 for (TypeSymbolTable::iterator TI = TST.begin(), TE = TST.end();
351 TypeSymbolTable::iterator I = TI++;
353 // If this isn't a struct or array type, remove it from our set of types
354 // to name. This simplifies emission later.
355 if (!isa<StructType>(I->second) && !isa<OpaqueType>(I->second) &&
356 !isa<ArrayType>(I->second)) {
359 // If this is not used, remove it from the symbol table.
360 std::set<const Type *>::iterator UTI = UT.find(I->second);
364 UT.erase(UTI); // Only keep one name for this type.
368 // UT now contains types that are not named. Loop over it, naming
371 bool Changed = false;
372 unsigned RenameCounter = 0;
373 for (std::set<const Type *>::const_iterator I = UT.begin(), E = UT.end();
375 if (isa<StructType>(*I) || isa<ArrayType>(*I)) {
376 while (M.addTypeName("unnamed"+utostr(RenameCounter), *I))
382 // Loop over all external functions and globals. If we have two with
383 // identical names, merge them.
384 // FIXME: This code should disappear when we don't allow values with the same
385 // names when they have different types!
386 std::map<std::string, GlobalValue*> ExtSymbols;
387 for (Module::iterator I = M.begin(), E = M.end(); I != E;) {
389 if (GV->isDeclaration() && GV->hasName()) {
390 std::pair<std::map<std::string, GlobalValue*>::iterator, bool> X
391 = ExtSymbols.insert(std::make_pair(GV->getName(), GV));
393 // Found a conflict, replace this global with the previous one.
394 GlobalValue *OldGV = X.first->second;
395 GV->replaceAllUsesWith(ConstantExpr::getBitCast(OldGV, GV->getType()));
396 GV->eraseFromParent();
401 // Do the same for globals.
402 for (Module::global_iterator I = M.global_begin(), E = M.global_end();
404 GlobalVariable *GV = I++;
405 if (GV->isDeclaration() && GV->hasName()) {
406 std::pair<std::map<std::string, GlobalValue*>::iterator, bool> X
407 = ExtSymbols.insert(std::make_pair(GV->getName(), GV));
409 // Found a conflict, replace this global with the previous one.
410 GlobalValue *OldGV = X.first->second;
411 GV->replaceAllUsesWith(ConstantExpr::getBitCast(OldGV, GV->getType()));
412 GV->eraseFromParent();
421 /// printStructReturnPointerFunctionType - This is like printType for a struct
422 /// return type, except, instead of printing the type as void (*)(Struct*, ...)
423 /// print it as "Struct (*)(...)", for struct return functions.
424 void CWriter::printStructReturnPointerFunctionType(raw_ostream &Out,
425 const AttrListPtr &PAL,
426 const PointerType *TheTy) {
427 const FunctionType *FTy = cast<FunctionType>(TheTy->getElementType());
428 std::stringstream FunctionInnards;
429 FunctionInnards << " (*) (";
430 bool PrintedType = false;
432 FunctionType::param_iterator I = FTy->param_begin(), E = FTy->param_end();
433 const Type *RetTy = cast<PointerType>(I->get())->getElementType();
435 for (++I, ++Idx; I != E; ++I, ++Idx) {
437 FunctionInnards << ", ";
438 const Type *ArgTy = *I;
439 if (PAL.paramHasAttr(Idx, Attribute::ByVal)) {
440 assert(isa<PointerType>(ArgTy));
441 ArgTy = cast<PointerType>(ArgTy)->getElementType();
443 printType(FunctionInnards, ArgTy,
444 /*isSigned=*/PAL.paramHasAttr(Idx, Attribute::SExt), "");
447 if (FTy->isVarArg()) {
449 FunctionInnards << ", ...";
450 } else if (!PrintedType) {
451 FunctionInnards << "void";
453 FunctionInnards << ')';
454 std::string tstr = FunctionInnards.str();
455 printType(Out, RetTy,
456 /*isSigned=*/PAL.paramHasAttr(0, Attribute::SExt), tstr);
460 CWriter::printSimpleType(raw_ostream &Out, const Type *Ty, bool isSigned,
461 const std::string &NameSoFar) {
462 assert((Ty->isPrimitiveType() || Ty->isInteger() || isa<VectorType>(Ty)) &&
463 "Invalid type for printSimpleType");
464 switch (Ty->getTypeID()) {
465 case Type::VoidTyID: return Out << "void " << NameSoFar;
466 case Type::IntegerTyID: {
467 unsigned NumBits = cast<IntegerType>(Ty)->getBitWidth();
469 return Out << "bool " << NameSoFar;
470 else if (NumBits <= 8)
471 return Out << (isSigned?"signed":"unsigned") << " char " << NameSoFar;
472 else if (NumBits <= 16)
473 return Out << (isSigned?"signed":"unsigned") << " short " << NameSoFar;
474 else if (NumBits <= 32)
475 return Out << (isSigned?"signed":"unsigned") << " int " << NameSoFar;
476 else if (NumBits <= 64)
477 return Out << (isSigned?"signed":"unsigned") << " long long "<< NameSoFar;
479 assert(NumBits <= 128 && "Bit widths > 128 not implemented yet");
480 return Out << (isSigned?"llvmInt128":"llvmUInt128") << " " << NameSoFar;
483 case Type::FloatTyID: return Out << "float " << NameSoFar;
484 case Type::DoubleTyID: return Out << "double " << NameSoFar;
485 // Lacking emulation of FP80 on PPC, etc., we assume whichever of these is
486 // present matches host 'long double'.
487 case Type::X86_FP80TyID:
488 case Type::PPC_FP128TyID:
489 case Type::FP128TyID: return Out << "long double " << NameSoFar;
491 case Type::VectorTyID: {
492 const VectorType *VTy = cast<VectorType>(Ty);
493 return printSimpleType(Out, VTy->getElementType(), isSigned,
494 " __attribute__((vector_size(" +
495 utostr(TD->getTypePaddedSize(VTy)) + " ))) " + NameSoFar);
499 cerr << "Unknown primitive type: " << *Ty << "\n";
505 CWriter::printSimpleType(std::ostream &Out, const Type *Ty, bool isSigned,
506 const std::string &NameSoFar) {
507 assert((Ty->isPrimitiveType() || Ty->isInteger() || isa<VectorType>(Ty)) &&
508 "Invalid type for printSimpleType");
509 switch (Ty->getTypeID()) {
510 case Type::VoidTyID: return Out << "void " << NameSoFar;
511 case Type::IntegerTyID: {
512 unsigned NumBits = cast<IntegerType>(Ty)->getBitWidth();
514 return Out << "bool " << NameSoFar;
515 else if (NumBits <= 8)
516 return Out << (isSigned?"signed":"unsigned") << " char " << NameSoFar;
517 else if (NumBits <= 16)
518 return Out << (isSigned?"signed":"unsigned") << " short " << NameSoFar;
519 else if (NumBits <= 32)
520 return Out << (isSigned?"signed":"unsigned") << " int " << NameSoFar;
521 else if (NumBits <= 64)
522 return Out << (isSigned?"signed":"unsigned") << " long long "<< NameSoFar;
524 assert(NumBits <= 128 && "Bit widths > 128 not implemented yet");
525 return Out << (isSigned?"llvmInt128":"llvmUInt128") << " " << NameSoFar;
528 case Type::FloatTyID: return Out << "float " << NameSoFar;
529 case Type::DoubleTyID: return Out << "double " << NameSoFar;
530 // Lacking emulation of FP80 on PPC, etc., we assume whichever of these is
531 // present matches host 'long double'.
532 case Type::X86_FP80TyID:
533 case Type::PPC_FP128TyID:
534 case Type::FP128TyID: return Out << "long double " << NameSoFar;
536 case Type::VectorTyID: {
537 const VectorType *VTy = cast<VectorType>(Ty);
538 return printSimpleType(Out, VTy->getElementType(), isSigned,
539 " __attribute__((vector_size(" +
540 utostr(TD->getTypePaddedSize(VTy)) + " ))) " + NameSoFar);
544 cerr << "Unknown primitive type: " << *Ty << "\n";
549 // Pass the Type* and the variable name and this prints out the variable
552 raw_ostream &CWriter::printType(raw_ostream &Out, const Type *Ty,
553 bool isSigned, const std::string &NameSoFar,
554 bool IgnoreName, const AttrListPtr &PAL) {
555 if (Ty->isPrimitiveType() || Ty->isInteger() || isa<VectorType>(Ty)) {
556 printSimpleType(Out, Ty, isSigned, NameSoFar);
560 // Check to see if the type is named.
561 if (!IgnoreName || isa<OpaqueType>(Ty)) {
562 std::map<const Type *, std::string>::iterator I = TypeNames.find(Ty);
563 if (I != TypeNames.end()) return Out << I->second << ' ' << NameSoFar;
566 switch (Ty->getTypeID()) {
567 case Type::FunctionTyID: {
568 const FunctionType *FTy = cast<FunctionType>(Ty);
569 std::stringstream FunctionInnards;
570 FunctionInnards << " (" << NameSoFar << ") (";
572 for (FunctionType::param_iterator I = FTy->param_begin(),
573 E = FTy->param_end(); I != E; ++I) {
574 const Type *ArgTy = *I;
575 if (PAL.paramHasAttr(Idx, Attribute::ByVal)) {
576 assert(isa<PointerType>(ArgTy));
577 ArgTy = cast<PointerType>(ArgTy)->getElementType();
579 if (I != FTy->param_begin())
580 FunctionInnards << ", ";
581 printType(FunctionInnards, ArgTy,
582 /*isSigned=*/PAL.paramHasAttr(Idx, Attribute::SExt), "");
585 if (FTy->isVarArg()) {
586 if (FTy->getNumParams())
587 FunctionInnards << ", ...";
588 } else if (!FTy->getNumParams()) {
589 FunctionInnards << "void";
591 FunctionInnards << ')';
592 std::string tstr = FunctionInnards.str();
593 printType(Out, FTy->getReturnType(),
594 /*isSigned=*/PAL.paramHasAttr(0, Attribute::SExt), tstr);
597 case Type::StructTyID: {
598 const StructType *STy = cast<StructType>(Ty);
599 Out << NameSoFar + " {\n";
601 for (StructType::element_iterator I = STy->element_begin(),
602 E = STy->element_end(); I != E; ++I) {
604 printType(Out, *I, false, "field" + utostr(Idx++));
609 Out << " __attribute__ ((packed))";
613 case Type::PointerTyID: {
614 const PointerType *PTy = cast<PointerType>(Ty);
615 std::string ptrName = "*" + NameSoFar;
617 if (isa<ArrayType>(PTy->getElementType()) ||
618 isa<VectorType>(PTy->getElementType()))
619 ptrName = "(" + ptrName + ")";
622 // Must be a function ptr cast!
623 return printType(Out, PTy->getElementType(), false, ptrName, true, PAL);
624 return printType(Out, PTy->getElementType(), false, ptrName);
627 case Type::ArrayTyID: {
628 const ArrayType *ATy = cast<ArrayType>(Ty);
629 unsigned NumElements = ATy->getNumElements();
630 if (NumElements == 0) NumElements = 1;
631 // Arrays are wrapped in structs to allow them to have normal
632 // value semantics (avoiding the array "decay").
633 Out << NameSoFar << " { ";
634 printType(Out, ATy->getElementType(), false,
635 "array[" + utostr(NumElements) + "]");
639 case Type::OpaqueTyID: {
640 static int Count = 0;
641 std::string TyName = "struct opaque_" + itostr(Count++);
642 assert(TypeNames.find(Ty) == TypeNames.end());
643 TypeNames[Ty] = TyName;
644 return Out << TyName << ' ' << NameSoFar;
647 assert(0 && "Unhandled case in getTypeProps!");
654 // Pass the Type* and the variable name and this prints out the variable
657 std::ostream &CWriter::printType(std::ostream &Out, const Type *Ty,
658 bool isSigned, const std::string &NameSoFar,
659 bool IgnoreName, const AttrListPtr &PAL) {
660 if (Ty->isPrimitiveType() || Ty->isInteger() || isa<VectorType>(Ty)) {
661 printSimpleType(Out, Ty, isSigned, NameSoFar);
665 // Check to see if the type is named.
666 if (!IgnoreName || isa<OpaqueType>(Ty)) {
667 std::map<const Type *, std::string>::iterator I = TypeNames.find(Ty);
668 if (I != TypeNames.end()) return Out << I->second << ' ' << NameSoFar;
671 switch (Ty->getTypeID()) {
672 case Type::FunctionTyID: {
673 const FunctionType *FTy = cast<FunctionType>(Ty);
674 std::stringstream FunctionInnards;
675 FunctionInnards << " (" << NameSoFar << ") (";
677 for (FunctionType::param_iterator I = FTy->param_begin(),
678 E = FTy->param_end(); I != E; ++I) {
679 const Type *ArgTy = *I;
680 if (PAL.paramHasAttr(Idx, Attribute::ByVal)) {
681 assert(isa<PointerType>(ArgTy));
682 ArgTy = cast<PointerType>(ArgTy)->getElementType();
684 if (I != FTy->param_begin())
685 FunctionInnards << ", ";
686 printType(FunctionInnards, ArgTy,
687 /*isSigned=*/PAL.paramHasAttr(Idx, Attribute::SExt), "");
690 if (FTy->isVarArg()) {
691 if (FTy->getNumParams())
692 FunctionInnards << ", ...";
693 } else if (!FTy->getNumParams()) {
694 FunctionInnards << "void";
696 FunctionInnards << ')';
697 std::string tstr = FunctionInnards.str();
698 printType(Out, FTy->getReturnType(),
699 /*isSigned=*/PAL.paramHasAttr(0, Attribute::SExt), tstr);
702 case Type::StructTyID: {
703 const StructType *STy = cast<StructType>(Ty);
704 Out << NameSoFar + " {\n";
706 for (StructType::element_iterator I = STy->element_begin(),
707 E = STy->element_end(); I != E; ++I) {
709 printType(Out, *I, false, "field" + utostr(Idx++));
714 Out << " __attribute__ ((packed))";
718 case Type::PointerTyID: {
719 const PointerType *PTy = cast<PointerType>(Ty);
720 std::string ptrName = "*" + NameSoFar;
722 if (isa<ArrayType>(PTy->getElementType()) ||
723 isa<VectorType>(PTy->getElementType()))
724 ptrName = "(" + ptrName + ")";
727 // Must be a function ptr cast!
728 return printType(Out, PTy->getElementType(), false, ptrName, true, PAL);
729 return printType(Out, PTy->getElementType(), false, ptrName);
732 case Type::ArrayTyID: {
733 const ArrayType *ATy = cast<ArrayType>(Ty);
734 unsigned NumElements = ATy->getNumElements();
735 if (NumElements == 0) NumElements = 1;
736 // Arrays are wrapped in structs to allow them to have normal
737 // value semantics (avoiding the array "decay").
738 Out << NameSoFar << " { ";
739 printType(Out, ATy->getElementType(), false,
740 "array[" + utostr(NumElements) + "]");
744 case Type::OpaqueTyID: {
745 static int Count = 0;
746 std::string TyName = "struct opaque_" + itostr(Count++);
747 assert(TypeNames.find(Ty) == TypeNames.end());
748 TypeNames[Ty] = TyName;
749 return Out << TyName << ' ' << NameSoFar;
752 assert(0 && "Unhandled case in getTypeProps!");
759 void CWriter::printConstantArray(ConstantArray *CPA, bool Static) {
761 // As a special case, print the array as a string if it is an array of
762 // ubytes or an array of sbytes with positive values.
764 const Type *ETy = CPA->getType()->getElementType();
765 bool isString = (ETy == Type::Int8Ty || ETy == Type::Int8Ty);
767 // Make sure the last character is a null char, as automatically added by C
768 if (isString && (CPA->getNumOperands() == 0 ||
769 !cast<Constant>(*(CPA->op_end()-1))->isNullValue()))
774 // Keep track of whether the last number was a hexadecimal escape
775 bool LastWasHex = false;
777 // Do not include the last character, which we know is null
778 for (unsigned i = 0, e = CPA->getNumOperands()-1; i != e; ++i) {
779 unsigned char C = cast<ConstantInt>(CPA->getOperand(i))->getZExtValue();
781 // Print it out literally if it is a printable character. The only thing
782 // to be careful about is when the last letter output was a hex escape
783 // code, in which case we have to be careful not to print out hex digits
784 // explicitly (the C compiler thinks it is a continuation of the previous
785 // character, sheesh...)
787 if (isprint(C) && (!LastWasHex || !isxdigit(C))) {
789 if (C == '"' || C == '\\')
790 Out << "\\" << (char)C;
796 case '\n': Out << "\\n"; break;
797 case '\t': Out << "\\t"; break;
798 case '\r': Out << "\\r"; break;
799 case '\v': Out << "\\v"; break;
800 case '\a': Out << "\\a"; break;
801 case '\"': Out << "\\\""; break;
802 case '\'': Out << "\\\'"; break;
805 Out << (char)(( C/16 < 10) ? ( C/16 +'0') : ( C/16 -10+'A'));
806 Out << (char)(((C&15) < 10) ? ((C&15)+'0') : ((C&15)-10+'A'));
815 if (CPA->getNumOperands()) {
817 printConstant(cast<Constant>(CPA->getOperand(0)), Static);
818 for (unsigned i = 1, e = CPA->getNumOperands(); i != e; ++i) {
820 printConstant(cast<Constant>(CPA->getOperand(i)), Static);
827 void CWriter::printConstantVector(ConstantVector *CP, bool Static) {
829 if (CP->getNumOperands()) {
831 printConstant(cast<Constant>(CP->getOperand(0)), Static);
832 for (unsigned i = 1, e = CP->getNumOperands(); i != e; ++i) {
834 printConstant(cast<Constant>(CP->getOperand(i)), Static);
840 // isFPCSafeToPrint - Returns true if we may assume that CFP may be written out
841 // textually as a double (rather than as a reference to a stack-allocated
842 // variable). We decide this by converting CFP to a string and back into a
843 // double, and then checking whether the conversion results in a bit-equal
844 // double to the original value of CFP. This depends on us and the target C
845 // compiler agreeing on the conversion process (which is pretty likely since we
846 // only deal in IEEE FP).
848 static bool isFPCSafeToPrint(const ConstantFP *CFP) {
850 // Do long doubles in hex for now.
851 if (CFP->getType() != Type::FloatTy && CFP->getType() != Type::DoubleTy)
853 APFloat APF = APFloat(CFP->getValueAPF()); // copy
854 if (CFP->getType() == Type::FloatTy)
855 APF.convert(APFloat::IEEEdouble, APFloat::rmNearestTiesToEven, &ignored);
856 #if HAVE_PRINTF_A && ENABLE_CBE_PRINTF_A
858 sprintf(Buffer, "%a", APF.convertToDouble());
859 if (!strncmp(Buffer, "0x", 2) ||
860 !strncmp(Buffer, "-0x", 3) ||
861 !strncmp(Buffer, "+0x", 3))
862 return APF.bitwiseIsEqual(APFloat(atof(Buffer)));
865 std::string StrVal = ftostr(APF);
867 while (StrVal[0] == ' ')
868 StrVal.erase(StrVal.begin());
870 // Check to make sure that the stringized number is not some string like "Inf"
871 // or NaN. Check that the string matches the "[-+]?[0-9]" regex.
872 if ((StrVal[0] >= '0' && StrVal[0] <= '9') ||
873 ((StrVal[0] == '-' || StrVal[0] == '+') &&
874 (StrVal[1] >= '0' && StrVal[1] <= '9')))
875 // Reparse stringized version!
876 return APF.bitwiseIsEqual(APFloat(atof(StrVal.c_str())));
881 /// Print out the casting for a cast operation. This does the double casting
882 /// necessary for conversion to the destination type, if necessary.
883 /// @brief Print a cast
884 void CWriter::printCast(unsigned opc, const Type *SrcTy, const Type *DstTy) {
885 // Print the destination type cast
887 case Instruction::UIToFP:
888 case Instruction::SIToFP:
889 case Instruction::IntToPtr:
890 case Instruction::Trunc:
891 case Instruction::BitCast:
892 case Instruction::FPExt:
893 case Instruction::FPTrunc: // For these the DstTy sign doesn't matter
895 printType(Out, DstTy);
898 case Instruction::ZExt:
899 case Instruction::PtrToInt:
900 case Instruction::FPToUI: // For these, make sure we get an unsigned dest
902 printSimpleType(Out, DstTy, false);
905 case Instruction::SExt:
906 case Instruction::FPToSI: // For these, make sure we get a signed dest
908 printSimpleType(Out, DstTy, true);
912 assert(0 && "Invalid cast opcode");
915 // Print the source type cast
917 case Instruction::UIToFP:
918 case Instruction::ZExt:
920 printSimpleType(Out, SrcTy, false);
923 case Instruction::SIToFP:
924 case Instruction::SExt:
926 printSimpleType(Out, SrcTy, true);
929 case Instruction::IntToPtr:
930 case Instruction::PtrToInt:
931 // Avoid "cast to pointer from integer of different size" warnings
932 Out << "(unsigned long)";
934 case Instruction::Trunc:
935 case Instruction::BitCast:
936 case Instruction::FPExt:
937 case Instruction::FPTrunc:
938 case Instruction::FPToSI:
939 case Instruction::FPToUI:
940 break; // These don't need a source cast.
942 assert(0 && "Invalid cast opcode");
947 // printConstant - The LLVM Constant to C Constant converter.
948 void CWriter::printConstant(Constant *CPV, bool Static) {
949 if (const ConstantExpr *CE = dyn_cast<ConstantExpr>(CPV)) {
950 switch (CE->getOpcode()) {
951 case Instruction::Trunc:
952 case Instruction::ZExt:
953 case Instruction::SExt:
954 case Instruction::FPTrunc:
955 case Instruction::FPExt:
956 case Instruction::UIToFP:
957 case Instruction::SIToFP:
958 case Instruction::FPToUI:
959 case Instruction::FPToSI:
960 case Instruction::PtrToInt:
961 case Instruction::IntToPtr:
962 case Instruction::BitCast:
964 printCast(CE->getOpcode(), CE->getOperand(0)->getType(), CE->getType());
965 if (CE->getOpcode() == Instruction::SExt &&
966 CE->getOperand(0)->getType() == Type::Int1Ty) {
967 // Make sure we really sext from bool here by subtracting from 0
970 printConstant(CE->getOperand(0), Static);
971 if (CE->getType() == Type::Int1Ty &&
972 (CE->getOpcode() == Instruction::Trunc ||
973 CE->getOpcode() == Instruction::FPToUI ||
974 CE->getOpcode() == Instruction::FPToSI ||
975 CE->getOpcode() == Instruction::PtrToInt)) {
976 // Make sure we really truncate to bool here by anding with 1
982 case Instruction::GetElementPtr:
984 printGEPExpression(CE->getOperand(0), gep_type_begin(CPV),
985 gep_type_end(CPV), Static);
988 case Instruction::Select:
990 printConstant(CE->getOperand(0), Static);
992 printConstant(CE->getOperand(1), Static);
994 printConstant(CE->getOperand(2), Static);
997 case Instruction::Add:
998 case Instruction::Sub:
999 case Instruction::Mul:
1000 case Instruction::SDiv:
1001 case Instruction::UDiv:
1002 case Instruction::FDiv:
1003 case Instruction::URem:
1004 case Instruction::SRem:
1005 case Instruction::FRem:
1006 case Instruction::And:
1007 case Instruction::Or:
1008 case Instruction::Xor:
1009 case Instruction::ICmp:
1010 case Instruction::Shl:
1011 case Instruction::LShr:
1012 case Instruction::AShr:
1015 bool NeedsClosingParens = printConstExprCast(CE, Static);
1016 printConstantWithCast(CE->getOperand(0), CE->getOpcode());
1017 switch (CE->getOpcode()) {
1018 case Instruction::Add: Out << " + "; break;
1019 case Instruction::Sub: Out << " - "; break;
1020 case Instruction::Mul: Out << " * "; break;
1021 case Instruction::URem:
1022 case Instruction::SRem:
1023 case Instruction::FRem: Out << " % "; break;
1024 case Instruction::UDiv:
1025 case Instruction::SDiv:
1026 case Instruction::FDiv: Out << " / "; break;
1027 case Instruction::And: Out << " & "; break;
1028 case Instruction::Or: Out << " | "; break;
1029 case Instruction::Xor: Out << " ^ "; break;
1030 case Instruction::Shl: Out << " << "; break;
1031 case Instruction::LShr:
1032 case Instruction::AShr: Out << " >> "; break;
1033 case Instruction::ICmp:
1034 switch (CE->getPredicate()) {
1035 case ICmpInst::ICMP_EQ: Out << " == "; break;
1036 case ICmpInst::ICMP_NE: Out << " != "; break;
1037 case ICmpInst::ICMP_SLT:
1038 case ICmpInst::ICMP_ULT: Out << " < "; break;
1039 case ICmpInst::ICMP_SLE:
1040 case ICmpInst::ICMP_ULE: Out << " <= "; break;
1041 case ICmpInst::ICMP_SGT:
1042 case ICmpInst::ICMP_UGT: Out << " > "; break;
1043 case ICmpInst::ICMP_SGE:
1044 case ICmpInst::ICMP_UGE: Out << " >= "; break;
1045 default: assert(0 && "Illegal ICmp predicate");
1048 default: assert(0 && "Illegal opcode here!");
1050 printConstantWithCast(CE->getOperand(1), CE->getOpcode());
1051 if (NeedsClosingParens)
1056 case Instruction::FCmp: {
1058 bool NeedsClosingParens = printConstExprCast(CE, Static);
1059 if (CE->getPredicate() == FCmpInst::FCMP_FALSE)
1061 else if (CE->getPredicate() == FCmpInst::FCMP_TRUE)
1065 switch (CE->getPredicate()) {
1066 default: assert(0 && "Illegal FCmp predicate");
1067 case FCmpInst::FCMP_ORD: op = "ord"; break;
1068 case FCmpInst::FCMP_UNO: op = "uno"; break;
1069 case FCmpInst::FCMP_UEQ: op = "ueq"; break;
1070 case FCmpInst::FCMP_UNE: op = "une"; break;
1071 case FCmpInst::FCMP_ULT: op = "ult"; break;
1072 case FCmpInst::FCMP_ULE: op = "ule"; break;
1073 case FCmpInst::FCMP_UGT: op = "ugt"; break;
1074 case FCmpInst::FCMP_UGE: op = "uge"; break;
1075 case FCmpInst::FCMP_OEQ: op = "oeq"; break;
1076 case FCmpInst::FCMP_ONE: op = "one"; break;
1077 case FCmpInst::FCMP_OLT: op = "olt"; break;
1078 case FCmpInst::FCMP_OLE: op = "ole"; break;
1079 case FCmpInst::FCMP_OGT: op = "ogt"; break;
1080 case FCmpInst::FCMP_OGE: op = "oge"; break;
1082 Out << "llvm_fcmp_" << op << "(";
1083 printConstantWithCast(CE->getOperand(0), CE->getOpcode());
1085 printConstantWithCast(CE->getOperand(1), CE->getOpcode());
1088 if (NeedsClosingParens)
1094 cerr << "CWriter Error: Unhandled constant expression: "
1098 } else if (isa<UndefValue>(CPV) && CPV->getType()->isSingleValueType()) {
1100 printType(Out, CPV->getType()); // sign doesn't matter
1101 Out << ")/*UNDEF*/";
1102 if (!isa<VectorType>(CPV->getType())) {
1110 if (ConstantInt *CI = dyn_cast<ConstantInt>(CPV)) {
1111 const Type* Ty = CI->getType();
1112 if (Ty == Type::Int1Ty)
1113 Out << (CI->getZExtValue() ? '1' : '0');
1114 else if (Ty == Type::Int32Ty)
1115 Out << CI->getZExtValue() << 'u';
1116 else if (Ty->getPrimitiveSizeInBits() > 32)
1117 Out << CI->getZExtValue() << "ull";
1120 printSimpleType(Out, Ty, false) << ')';
1121 if (CI->isMinValue(true))
1122 Out << CI->getZExtValue() << 'u';
1124 Out << CI->getSExtValue();
1130 switch (CPV->getType()->getTypeID()) {
1131 case Type::FloatTyID:
1132 case Type::DoubleTyID:
1133 case Type::X86_FP80TyID:
1134 case Type::PPC_FP128TyID:
1135 case Type::FP128TyID: {
1136 ConstantFP *FPC = cast<ConstantFP>(CPV);
1137 std::map<const ConstantFP*, unsigned>::iterator I = FPConstantMap.find(FPC);
1138 if (I != FPConstantMap.end()) {
1139 // Because of FP precision problems we must load from a stack allocated
1140 // value that holds the value in hex.
1141 Out << "(*(" << (FPC->getType() == Type::FloatTy ? "float" :
1142 FPC->getType() == Type::DoubleTy ? "double" :
1144 << "*)&FPConstant" << I->second << ')';
1147 if (FPC->getType() == Type::FloatTy)
1148 V = FPC->getValueAPF().convertToFloat();
1149 else if (FPC->getType() == Type::DoubleTy)
1150 V = FPC->getValueAPF().convertToDouble();
1152 // Long double. Convert the number to double, discarding precision.
1153 // This is not awesome, but it at least makes the CBE output somewhat
1155 APFloat Tmp = FPC->getValueAPF();
1157 Tmp.convert(APFloat::IEEEdouble, APFloat::rmTowardZero, &LosesInfo);
1158 V = Tmp.convertToDouble();
1164 // FIXME the actual NaN bits should be emitted.
1165 // The prefix for a quiet NaN is 0x7FF8. For a signalling NaN,
1167 const unsigned long QuietNaN = 0x7ff8UL;
1168 //const unsigned long SignalNaN = 0x7ff4UL;
1170 // We need to grab the first part of the FP #
1173 uint64_t ll = DoubleToBits(V);
1174 sprintf(Buffer, "0x%llx", static_cast<long long>(ll));
1176 std::string Num(&Buffer[0], &Buffer[6]);
1177 unsigned long Val = strtoul(Num.c_str(), 0, 16);
1179 if (FPC->getType() == Type::FloatTy)
1180 Out << "LLVM_NAN" << (Val == QuietNaN ? "" : "S") << "F(\""
1181 << Buffer << "\") /*nan*/ ";
1183 Out << "LLVM_NAN" << (Val == QuietNaN ? "" : "S") << "(\""
1184 << Buffer << "\") /*nan*/ ";
1185 } else if (IsInf(V)) {
1187 if (V < 0) Out << '-';
1188 Out << "LLVM_INF" << (FPC->getType() == Type::FloatTy ? "F" : "")
1192 #if HAVE_PRINTF_A && ENABLE_CBE_PRINTF_A
1193 // Print out the constant as a floating point number.
1195 sprintf(Buffer, "%a", V);
1198 Num = ftostr(FPC->getValueAPF());
1206 case Type::ArrayTyID:
1207 // Use C99 compound expression literal initializer syntax.
1210 printType(Out, CPV->getType());
1213 Out << "{ "; // Arrays are wrapped in struct types.
1214 if (ConstantArray *CA = dyn_cast<ConstantArray>(CPV)) {
1215 printConstantArray(CA, Static);
1217 assert(isa<ConstantAggregateZero>(CPV) || isa<UndefValue>(CPV));
1218 const ArrayType *AT = cast<ArrayType>(CPV->getType());
1220 if (AT->getNumElements()) {
1222 Constant *CZ = Constant::getNullValue(AT->getElementType());
1223 printConstant(CZ, Static);
1224 for (unsigned i = 1, e = AT->getNumElements(); i != e; ++i) {
1226 printConstant(CZ, Static);
1231 Out << " }"; // Arrays are wrapped in struct types.
1234 case Type::VectorTyID:
1235 // Use C99 compound expression literal initializer syntax.
1238 printType(Out, CPV->getType());
1241 if (ConstantVector *CV = dyn_cast<ConstantVector>(CPV)) {
1242 printConstantVector(CV, Static);
1244 assert(isa<ConstantAggregateZero>(CPV) || isa<UndefValue>(CPV));
1245 const VectorType *VT = cast<VectorType>(CPV->getType());
1247 Constant *CZ = Constant::getNullValue(VT->getElementType());
1248 printConstant(CZ, Static);
1249 for (unsigned i = 1, e = VT->getNumElements(); i != e; ++i) {
1251 printConstant(CZ, Static);
1257 case Type::StructTyID:
1258 // Use C99 compound expression literal initializer syntax.
1261 printType(Out, CPV->getType());
1264 if (isa<ConstantAggregateZero>(CPV) || isa<UndefValue>(CPV)) {
1265 const StructType *ST = cast<StructType>(CPV->getType());
1267 if (ST->getNumElements()) {
1269 printConstant(Constant::getNullValue(ST->getElementType(0)), Static);
1270 for (unsigned i = 1, e = ST->getNumElements(); i != e; ++i) {
1272 printConstant(Constant::getNullValue(ST->getElementType(i)), Static);
1278 if (CPV->getNumOperands()) {
1280 printConstant(cast<Constant>(CPV->getOperand(0)), Static);
1281 for (unsigned i = 1, e = CPV->getNumOperands(); i != e; ++i) {
1283 printConstant(cast<Constant>(CPV->getOperand(i)), Static);
1290 case Type::PointerTyID:
1291 if (isa<ConstantPointerNull>(CPV)) {
1293 printType(Out, CPV->getType()); // sign doesn't matter
1294 Out << ")/*NULL*/0)";
1296 } else if (GlobalValue *GV = dyn_cast<GlobalValue>(CPV)) {
1297 writeOperand(GV, Static);
1302 cerr << "Unknown constant type: " << *CPV << "\n";
1307 // Some constant expressions need to be casted back to the original types
1308 // because their operands were casted to the expected type. This function takes
1309 // care of detecting that case and printing the cast for the ConstantExpr.
1310 bool CWriter::printConstExprCast(const ConstantExpr* CE, bool Static) {
1311 bool NeedsExplicitCast = false;
1312 const Type *Ty = CE->getOperand(0)->getType();
1313 bool TypeIsSigned = false;
1314 switch (CE->getOpcode()) {
1315 case Instruction::Add:
1316 case Instruction::Sub:
1317 case Instruction::Mul:
1318 // We need to cast integer arithmetic so that it is always performed
1319 // as unsigned, to avoid undefined behavior on overflow.
1320 if (!Ty->isIntOrIntVector()) break;
1322 case Instruction::LShr:
1323 case Instruction::URem:
1324 case Instruction::UDiv: NeedsExplicitCast = true; break;
1325 case Instruction::AShr:
1326 case Instruction::SRem:
1327 case Instruction::SDiv: NeedsExplicitCast = true; TypeIsSigned = true; break;
1328 case Instruction::SExt:
1330 NeedsExplicitCast = true;
1331 TypeIsSigned = true;
1333 case Instruction::ZExt:
1334 case Instruction::Trunc:
1335 case Instruction::FPTrunc:
1336 case Instruction::FPExt:
1337 case Instruction::UIToFP:
1338 case Instruction::SIToFP:
1339 case Instruction::FPToUI:
1340 case Instruction::FPToSI:
1341 case Instruction::PtrToInt:
1342 case Instruction::IntToPtr:
1343 case Instruction::BitCast:
1345 NeedsExplicitCast = true;
1349 if (NeedsExplicitCast) {
1351 if (Ty->isInteger() && Ty != Type::Int1Ty)
1352 printSimpleType(Out, Ty, TypeIsSigned);
1354 printType(Out, Ty); // not integer, sign doesn't matter
1357 return NeedsExplicitCast;
1360 // Print a constant assuming that it is the operand for a given Opcode. The
1361 // opcodes that care about sign need to cast their operands to the expected
1362 // type before the operation proceeds. This function does the casting.
1363 void CWriter::printConstantWithCast(Constant* CPV, unsigned Opcode) {
1365 // Extract the operand's type, we'll need it.
1366 const Type* OpTy = CPV->getType();
1368 // Indicate whether to do the cast or not.
1369 bool shouldCast = false;
1370 bool typeIsSigned = false;
1372 // Based on the Opcode for which this Constant is being written, determine
1373 // the new type to which the operand should be casted by setting the value
1374 // of OpTy. If we change OpTy, also set shouldCast to true so it gets
1378 // for most instructions, it doesn't matter
1380 case Instruction::Add:
1381 case Instruction::Sub:
1382 case Instruction::Mul:
1383 // We need to cast integer arithmetic so that it is always performed
1384 // as unsigned, to avoid undefined behavior on overflow.
1385 if (!OpTy->isIntOrIntVector()) break;
1387 case Instruction::LShr:
1388 case Instruction::UDiv:
1389 case Instruction::URem:
1392 case Instruction::AShr:
1393 case Instruction::SDiv:
1394 case Instruction::SRem:
1396 typeIsSigned = true;
1400 // Write out the casted constant if we should, otherwise just write the
1404 printSimpleType(Out, OpTy, typeIsSigned);
1406 printConstant(CPV, false);
1409 printConstant(CPV, false);
1412 std::string CWriter::GetValueName(const Value *Operand) {
1415 if (!isa<GlobalValue>(Operand) && Operand->getName() != "") {
1416 std::string VarName;
1418 Name = Operand->getName();
1419 VarName.reserve(Name.capacity());
1421 for (std::string::iterator I = Name.begin(), E = Name.end();
1425 if (!((ch >= 'a' && ch <= 'z') || (ch >= 'A' && ch <= 'Z') ||
1426 (ch >= '0' && ch <= '9') || ch == '_')) {
1428 sprintf(buffer, "_%x_", ch);
1434 Name = "llvm_cbe_" + VarName;
1436 Name = Mang->getValueName(Operand);
1442 /// writeInstComputationInline - Emit the computation for the specified
1443 /// instruction inline, with no destination provided.
1444 void CWriter::writeInstComputationInline(Instruction &I) {
1445 // If this is a non-trivial bool computation, make sure to truncate down to
1446 // a 1 bit value. This is important because we want "add i1 x, y" to return
1447 // "0" when x and y are true, not "2" for example.
1448 bool NeedBoolTrunc = false;
1449 if (I.getType() == Type::Int1Ty && !isa<ICmpInst>(I) && !isa<FCmpInst>(I))
1450 NeedBoolTrunc = true;
1462 void CWriter::writeOperandInternal(Value *Operand, bool Static) {
1463 if (Instruction *I = dyn_cast<Instruction>(Operand))
1464 // Should we inline this instruction to build a tree?
1465 if (isInlinableInst(*I) && !isDirectAlloca(I)) {
1467 writeInstComputationInline(*I);
1472 Constant* CPV = dyn_cast<Constant>(Operand);
1474 if (CPV && !isa<GlobalValue>(CPV))
1475 printConstant(CPV, Static);
1477 Out << GetValueName(Operand);
1480 void CWriter::writeOperand(Value *Operand, bool Static) {
1481 bool isAddressImplicit = isAddressExposed(Operand);
1482 if (isAddressImplicit)
1483 Out << "(&"; // Global variables are referenced as their addresses by llvm
1485 writeOperandInternal(Operand, Static);
1487 if (isAddressImplicit)
1491 // Some instructions need to have their result value casted back to the
1492 // original types because their operands were casted to the expected type.
1493 // This function takes care of detecting that case and printing the cast
1494 // for the Instruction.
1495 bool CWriter::writeInstructionCast(const Instruction &I) {
1496 const Type *Ty = I.getOperand(0)->getType();
1497 switch (I.getOpcode()) {
1498 case Instruction::Add:
1499 case Instruction::Sub:
1500 case Instruction::Mul:
1501 // We need to cast integer arithmetic so that it is always performed
1502 // as unsigned, to avoid undefined behavior on overflow.
1503 if (!Ty->isIntOrIntVector()) break;
1505 case Instruction::LShr:
1506 case Instruction::URem:
1507 case Instruction::UDiv:
1509 printSimpleType(Out, Ty, false);
1512 case Instruction::AShr:
1513 case Instruction::SRem:
1514 case Instruction::SDiv:
1516 printSimpleType(Out, Ty, true);
1524 // Write the operand with a cast to another type based on the Opcode being used.
1525 // This will be used in cases where an instruction has specific type
1526 // requirements (usually signedness) for its operands.
1527 void CWriter::writeOperandWithCast(Value* Operand, unsigned Opcode) {
1529 // Extract the operand's type, we'll need it.
1530 const Type* OpTy = Operand->getType();
1532 // Indicate whether to do the cast or not.
1533 bool shouldCast = false;
1535 // Indicate whether the cast should be to a signed type or not.
1536 bool castIsSigned = false;
1538 // Based on the Opcode for which this Operand is being written, determine
1539 // the new type to which the operand should be casted by setting the value
1540 // of OpTy. If we change OpTy, also set shouldCast to true.
1543 // for most instructions, it doesn't matter
1545 case Instruction::Add:
1546 case Instruction::Sub:
1547 case Instruction::Mul:
1548 // We need to cast integer arithmetic so that it is always performed
1549 // as unsigned, to avoid undefined behavior on overflow.
1550 if (!OpTy->isIntOrIntVector()) break;
1552 case Instruction::LShr:
1553 case Instruction::UDiv:
1554 case Instruction::URem: // Cast to unsigned first
1556 castIsSigned = false;
1558 case Instruction::GetElementPtr:
1559 case Instruction::AShr:
1560 case Instruction::SDiv:
1561 case Instruction::SRem: // Cast to signed first
1563 castIsSigned = true;
1567 // Write out the casted operand if we should, otherwise just write the
1571 printSimpleType(Out, OpTy, castIsSigned);
1573 writeOperand(Operand);
1576 writeOperand(Operand);
1579 // Write the operand with a cast to another type based on the icmp predicate
1581 void CWriter::writeOperandWithCast(Value* Operand, const ICmpInst &Cmp) {
1582 // This has to do a cast to ensure the operand has the right signedness.
1583 // Also, if the operand is a pointer, we make sure to cast to an integer when
1584 // doing the comparison both for signedness and so that the C compiler doesn't
1585 // optimize things like "p < NULL" to false (p may contain an integer value
1587 bool shouldCast = Cmp.isRelational();
1589 // Write out the casted operand if we should, otherwise just write the
1592 writeOperand(Operand);
1596 // Should this be a signed comparison? If so, convert to signed.
1597 bool castIsSigned = Cmp.isSignedPredicate();
1599 // If the operand was a pointer, convert to a large integer type.
1600 const Type* OpTy = Operand->getType();
1601 if (isa<PointerType>(OpTy))
1602 OpTy = TD->getIntPtrType();
1605 printSimpleType(Out, OpTy, castIsSigned);
1607 writeOperand(Operand);
1611 // generateCompilerSpecificCode - This is where we add conditional compilation
1612 // directives to cater to specific compilers as need be.
1614 static void generateCompilerSpecificCode(raw_ostream& Out,
1615 const TargetData *TD) {
1616 // Alloca is hard to get, and we don't want to include stdlib.h here.
1617 Out << "/* get a declaration for alloca */\n"
1618 << "#if defined(__CYGWIN__) || defined(__MINGW32__)\n"
1619 << "#define alloca(x) __builtin_alloca((x))\n"
1620 << "#define _alloca(x) __builtin_alloca((x))\n"
1621 << "#elif defined(__APPLE__)\n"
1622 << "extern void *__builtin_alloca(unsigned long);\n"
1623 << "#define alloca(x) __builtin_alloca(x)\n"
1624 << "#define longjmp _longjmp\n"
1625 << "#define setjmp _setjmp\n"
1626 << "#elif defined(__sun__)\n"
1627 << "#if defined(__sparcv9)\n"
1628 << "extern void *__builtin_alloca(unsigned long);\n"
1630 << "extern void *__builtin_alloca(unsigned int);\n"
1632 << "#define alloca(x) __builtin_alloca(x)\n"
1633 << "#elif defined(__FreeBSD__) || defined(__NetBSD__) || defined(__OpenBSD__) || defined(__DragonFly__)\n"
1634 << "#define alloca(x) __builtin_alloca(x)\n"
1635 << "#elif defined(_MSC_VER)\n"
1636 << "#define inline _inline\n"
1637 << "#define alloca(x) _alloca(x)\n"
1639 << "#include <alloca.h>\n"
1642 // We output GCC specific attributes to preserve 'linkonce'ness on globals.
1643 // If we aren't being compiled with GCC, just drop these attributes.
1644 Out << "#ifndef __GNUC__ /* Can only support \"linkonce\" vars with GCC */\n"
1645 << "#define __attribute__(X)\n"
1648 // On Mac OS X, "external weak" is spelled "__attribute__((weak_import))".
1649 Out << "#if defined(__GNUC__) && defined(__APPLE_CC__)\n"
1650 << "#define __EXTERNAL_WEAK__ __attribute__((weak_import))\n"
1651 << "#elif defined(__GNUC__)\n"
1652 << "#define __EXTERNAL_WEAK__ __attribute__((weak))\n"
1654 << "#define __EXTERNAL_WEAK__\n"
1657 // For now, turn off the weak linkage attribute on Mac OS X. (See above.)
1658 Out << "#if defined(__GNUC__) && defined(__APPLE_CC__)\n"
1659 << "#define __ATTRIBUTE_WEAK__\n"
1660 << "#elif defined(__GNUC__)\n"
1661 << "#define __ATTRIBUTE_WEAK__ __attribute__((weak))\n"
1663 << "#define __ATTRIBUTE_WEAK__\n"
1666 // Add hidden visibility support. FIXME: APPLE_CC?
1667 Out << "#if defined(__GNUC__)\n"
1668 << "#define __HIDDEN__ __attribute__((visibility(\"hidden\")))\n"
1671 // Define NaN and Inf as GCC builtins if using GCC, as 0 otherwise
1672 // From the GCC documentation:
1674 // double __builtin_nan (const char *str)
1676 // This is an implementation of the ISO C99 function nan.
1678 // Since ISO C99 defines this function in terms of strtod, which we do
1679 // not implement, a description of the parsing is in order. The string is
1680 // parsed as by strtol; that is, the base is recognized by leading 0 or
1681 // 0x prefixes. The number parsed is placed in the significand such that
1682 // the least significant bit of the number is at the least significant
1683 // bit of the significand. The number is truncated to fit the significand
1684 // field provided. The significand is forced to be a quiet NaN.
1686 // This function, if given a string literal, is evaluated early enough
1687 // that it is considered a compile-time constant.
1689 // float __builtin_nanf (const char *str)
1691 // Similar to __builtin_nan, except the return type is float.
1693 // double __builtin_inf (void)
1695 // Similar to __builtin_huge_val, except a warning is generated if the
1696 // target floating-point format does not support infinities. This
1697 // function is suitable for implementing the ISO C99 macro INFINITY.
1699 // float __builtin_inff (void)
1701 // Similar to __builtin_inf, except the return type is float.
1702 Out << "#ifdef __GNUC__\n"
1703 << "#define LLVM_NAN(NanStr) __builtin_nan(NanStr) /* Double */\n"
1704 << "#define LLVM_NANF(NanStr) __builtin_nanf(NanStr) /* Float */\n"
1705 << "#define LLVM_NANS(NanStr) __builtin_nans(NanStr) /* Double */\n"
1706 << "#define LLVM_NANSF(NanStr) __builtin_nansf(NanStr) /* Float */\n"
1707 << "#define LLVM_INF __builtin_inf() /* Double */\n"
1708 << "#define LLVM_INFF __builtin_inff() /* Float */\n"
1709 << "#define LLVM_PREFETCH(addr,rw,locality) "
1710 "__builtin_prefetch(addr,rw,locality)\n"
1711 << "#define __ATTRIBUTE_CTOR__ __attribute__((constructor))\n"
1712 << "#define __ATTRIBUTE_DTOR__ __attribute__((destructor))\n"
1713 << "#define LLVM_ASM __asm__\n"
1715 << "#define LLVM_NAN(NanStr) ((double)0.0) /* Double */\n"
1716 << "#define LLVM_NANF(NanStr) 0.0F /* Float */\n"
1717 << "#define LLVM_NANS(NanStr) ((double)0.0) /* Double */\n"
1718 << "#define LLVM_NANSF(NanStr) 0.0F /* Float */\n"
1719 << "#define LLVM_INF ((double)0.0) /* Double */\n"
1720 << "#define LLVM_INFF 0.0F /* Float */\n"
1721 << "#define LLVM_PREFETCH(addr,rw,locality) /* PREFETCH */\n"
1722 << "#define __ATTRIBUTE_CTOR__\n"
1723 << "#define __ATTRIBUTE_DTOR__\n"
1724 << "#define LLVM_ASM(X)\n"
1727 Out << "#if __GNUC__ < 4 /* Old GCC's, or compilers not GCC */ \n"
1728 << "#define __builtin_stack_save() 0 /* not implemented */\n"
1729 << "#define __builtin_stack_restore(X) /* noop */\n"
1732 // Output typedefs for 128-bit integers. If these are needed with a
1733 // 32-bit target or with a C compiler that doesn't support mode(TI),
1734 // more drastic measures will be needed.
1735 Out << "#if __GNUC__ && __LP64__ /* 128-bit integer types */\n"
1736 << "typedef int __attribute__((mode(TI))) llvmInt128;\n"
1737 << "typedef unsigned __attribute__((mode(TI))) llvmUInt128;\n"
1740 // Output target-specific code that should be inserted into main.
1741 Out << "#define CODE_FOR_MAIN() /* Any target-specific code for main()*/\n";
1744 /// FindStaticTors - Given a static ctor/dtor list, unpack its contents into
1745 /// the StaticTors set.
1746 static void FindStaticTors(GlobalVariable *GV, std::set<Function*> &StaticTors){
1747 ConstantArray *InitList = dyn_cast<ConstantArray>(GV->getInitializer());
1748 if (!InitList) return;
1750 for (unsigned i = 0, e = InitList->getNumOperands(); i != e; ++i)
1751 if (ConstantStruct *CS = dyn_cast<ConstantStruct>(InitList->getOperand(i))){
1752 if (CS->getNumOperands() != 2) return; // Not array of 2-element structs.
1754 if (CS->getOperand(1)->isNullValue())
1755 return; // Found a null terminator, exit printing.
1756 Constant *FP = CS->getOperand(1);
1757 if (ConstantExpr *CE = dyn_cast<ConstantExpr>(FP))
1759 FP = CE->getOperand(0);
1760 if (Function *F = dyn_cast<Function>(FP))
1761 StaticTors.insert(F);
1765 enum SpecialGlobalClass {
1767 GlobalCtors, GlobalDtors,
1771 /// getGlobalVariableClass - If this is a global that is specially recognized
1772 /// by LLVM, return a code that indicates how we should handle it.
1773 static SpecialGlobalClass getGlobalVariableClass(const GlobalVariable *GV) {
1774 // If this is a global ctors/dtors list, handle it now.
1775 if (GV->hasAppendingLinkage() && GV->use_empty()) {
1776 if (GV->getName() == "llvm.global_ctors")
1778 else if (GV->getName() == "llvm.global_dtors")
1782 // Otherwise, it it is other metadata, don't print it. This catches things
1783 // like debug information.
1784 if (GV->getSection() == "llvm.metadata")
1791 bool CWriter::doInitialization(Module &M) {
1795 TD = new TargetData(&M);
1796 IL = new IntrinsicLowering(*TD);
1797 IL->AddPrototypes(M);
1799 // Ensure that all structure types have names...
1800 Mang = new Mangler(M);
1801 Mang->markCharUnacceptable('.');
1803 // Keep track of which functions are static ctors/dtors so they can have
1804 // an attribute added to their prototypes.
1805 std::set<Function*> StaticCtors, StaticDtors;
1806 for (Module::global_iterator I = M.global_begin(), E = M.global_end();
1808 switch (getGlobalVariableClass(I)) {
1811 FindStaticTors(I, StaticCtors);
1814 FindStaticTors(I, StaticDtors);
1819 // get declaration for alloca
1820 Out << "/* Provide Declarations */\n";
1821 Out << "#include <stdarg.h>\n"; // Varargs support
1822 Out << "#include <setjmp.h>\n"; // Unwind support
1823 generateCompilerSpecificCode(Out, TD);
1825 // Provide a definition for `bool' if not compiling with a C++ compiler.
1827 << "#ifndef __cplusplus\ntypedef unsigned char bool;\n#endif\n"
1829 << "\n\n/* Support for floating point constants */\n"
1830 << "typedef unsigned long long ConstantDoubleTy;\n"
1831 << "typedef unsigned int ConstantFloatTy;\n"
1832 << "typedef struct { unsigned long long f1; unsigned short f2; "
1833 "unsigned short pad[3]; } ConstantFP80Ty;\n"
1834 // This is used for both kinds of 128-bit long double; meaning differs.
1835 << "typedef struct { unsigned long long f1; unsigned long long f2; }"
1836 " ConstantFP128Ty;\n"
1837 << "\n\n/* Global Declarations */\n";
1839 // First output all the declarations for the program, because C requires
1840 // Functions & globals to be declared before they are used.
1843 // Loop over the symbol table, emitting all named constants...
1844 printModuleTypes(M.getTypeSymbolTable());
1846 // Global variable declarations...
1847 if (!M.global_empty()) {
1848 Out << "\n/* External Global Variable Declarations */\n";
1849 for (Module::global_iterator I = M.global_begin(), E = M.global_end();
1852 if (I->hasExternalLinkage() || I->hasExternalWeakLinkage() ||
1853 I->hasCommonLinkage())
1855 else if (I->hasDLLImportLinkage())
1856 Out << "__declspec(dllimport) ";
1858 continue; // Internal Global
1860 // Thread Local Storage
1861 if (I->isThreadLocal())
1864 printType(Out, I->getType()->getElementType(), false, GetValueName(I));
1866 if (I->hasExternalWeakLinkage())
1867 Out << " __EXTERNAL_WEAK__";
1872 // Function declarations
1873 Out << "\n/* Function Declarations */\n";
1874 Out << "double fmod(double, double);\n"; // Support for FP rem
1875 Out << "float fmodf(float, float);\n";
1876 Out << "long double fmodl(long double, long double);\n";
1878 for (Module::iterator I = M.begin(), E = M.end(); I != E; ++I) {
1879 // Don't print declarations for intrinsic functions.
1880 if (!I->isIntrinsic() && I->getName() != "setjmp" &&
1881 I->getName() != "longjmp" && I->getName() != "_setjmp") {
1882 if (I->hasExternalWeakLinkage())
1884 printFunctionSignature(I, true);
1885 if (I->hasWeakLinkage() || I->hasLinkOnceLinkage())
1886 Out << " __ATTRIBUTE_WEAK__";
1887 if (I->hasExternalWeakLinkage())
1888 Out << " __EXTERNAL_WEAK__";
1889 if (StaticCtors.count(I))
1890 Out << " __ATTRIBUTE_CTOR__";
1891 if (StaticDtors.count(I))
1892 Out << " __ATTRIBUTE_DTOR__";
1893 if (I->hasHiddenVisibility())
1894 Out << " __HIDDEN__";
1896 if (I->hasName() && I->getName()[0] == 1)
1897 Out << " LLVM_ASM(\"" << I->getName().c_str()+1 << "\")";
1903 // Output the global variable declarations
1904 if (!M.global_empty()) {
1905 Out << "\n\n/* Global Variable Declarations */\n";
1906 for (Module::global_iterator I = M.global_begin(), E = M.global_end();
1908 if (!I->isDeclaration()) {
1909 // Ignore special globals, such as debug info.
1910 if (getGlobalVariableClass(I))
1913 if (I->hasLocalLinkage())
1918 // Thread Local Storage
1919 if (I->isThreadLocal())
1922 printType(Out, I->getType()->getElementType(), false,
1925 if (I->hasLinkOnceLinkage())
1926 Out << " __attribute__((common))";
1927 else if (I->hasCommonLinkage()) // FIXME is this right?
1928 Out << " __ATTRIBUTE_WEAK__";
1929 else if (I->hasWeakLinkage())
1930 Out << " __ATTRIBUTE_WEAK__";
1931 else if (I->hasExternalWeakLinkage())
1932 Out << " __EXTERNAL_WEAK__";
1933 if (I->hasHiddenVisibility())
1934 Out << " __HIDDEN__";
1939 // Output the global variable definitions and contents...
1940 if (!M.global_empty()) {
1941 Out << "\n\n/* Global Variable Definitions and Initialization */\n";
1942 for (Module::global_iterator I = M.global_begin(), E = M.global_end();
1944 if (!I->isDeclaration()) {
1945 // Ignore special globals, such as debug info.
1946 if (getGlobalVariableClass(I))
1949 if (I->hasLocalLinkage())
1951 else if (I->hasDLLImportLinkage())
1952 Out << "__declspec(dllimport) ";
1953 else if (I->hasDLLExportLinkage())
1954 Out << "__declspec(dllexport) ";
1956 // Thread Local Storage
1957 if (I->isThreadLocal())
1960 printType(Out, I->getType()->getElementType(), false,
1962 if (I->hasLinkOnceLinkage())
1963 Out << " __attribute__((common))";
1964 else if (I->hasWeakLinkage())
1965 Out << " __ATTRIBUTE_WEAK__";
1966 else if (I->hasCommonLinkage())
1967 Out << " __ATTRIBUTE_WEAK__";
1969 if (I->hasHiddenVisibility())
1970 Out << " __HIDDEN__";
1972 // If the initializer is not null, emit the initializer. If it is null,
1973 // we try to avoid emitting large amounts of zeros. The problem with
1974 // this, however, occurs when the variable has weak linkage. In this
1975 // case, the assembler will complain about the variable being both weak
1976 // and common, so we disable this optimization.
1977 // FIXME common linkage should avoid this problem.
1978 if (!I->getInitializer()->isNullValue()) {
1980 writeOperand(I->getInitializer(), true);
1981 } else if (I->hasWeakLinkage()) {
1982 // We have to specify an initializer, but it doesn't have to be
1983 // complete. If the value is an aggregate, print out { 0 }, and let
1984 // the compiler figure out the rest of the zeros.
1986 if (isa<StructType>(I->getInitializer()->getType()) ||
1987 isa<VectorType>(I->getInitializer()->getType())) {
1989 } else if (isa<ArrayType>(I->getInitializer()->getType())) {
1990 // As with structs and vectors, but with an extra set of braces
1991 // because arrays are wrapped in structs.
1994 // Just print it out normally.
1995 writeOperand(I->getInitializer(), true);
2003 Out << "\n\n/* Function Bodies */\n";
2005 // Emit some helper functions for dealing with FCMP instruction's
2007 Out << "static inline int llvm_fcmp_ord(double X, double Y) { ";
2008 Out << "return X == X && Y == Y; }\n";
2009 Out << "static inline int llvm_fcmp_uno(double X, double Y) { ";
2010 Out << "return X != X || Y != Y; }\n";
2011 Out << "static inline int llvm_fcmp_ueq(double X, double Y) { ";
2012 Out << "return X == Y || llvm_fcmp_uno(X, Y); }\n";
2013 Out << "static inline int llvm_fcmp_une(double X, double Y) { ";
2014 Out << "return X != Y; }\n";
2015 Out << "static inline int llvm_fcmp_ult(double X, double Y) { ";
2016 Out << "return X < Y || llvm_fcmp_uno(X, Y); }\n";
2017 Out << "static inline int llvm_fcmp_ugt(double X, double Y) { ";
2018 Out << "return X > Y || llvm_fcmp_uno(X, Y); }\n";
2019 Out << "static inline int llvm_fcmp_ule(double X, double Y) { ";
2020 Out << "return X <= Y || llvm_fcmp_uno(X, Y); }\n";
2021 Out << "static inline int llvm_fcmp_uge(double X, double Y) { ";
2022 Out << "return X >= Y || llvm_fcmp_uno(X, Y); }\n";
2023 Out << "static inline int llvm_fcmp_oeq(double X, double Y) { ";
2024 Out << "return X == Y ; }\n";
2025 Out << "static inline int llvm_fcmp_one(double X, double Y) { ";
2026 Out << "return X != Y && llvm_fcmp_ord(X, Y); }\n";
2027 Out << "static inline int llvm_fcmp_olt(double X, double Y) { ";
2028 Out << "return X < Y ; }\n";
2029 Out << "static inline int llvm_fcmp_ogt(double X, double Y) { ";
2030 Out << "return X > Y ; }\n";
2031 Out << "static inline int llvm_fcmp_ole(double X, double Y) { ";
2032 Out << "return X <= Y ; }\n";
2033 Out << "static inline int llvm_fcmp_oge(double X, double Y) { ";
2034 Out << "return X >= Y ; }\n";
2039 /// Output all floating point constants that cannot be printed accurately...
2040 void CWriter::printFloatingPointConstants(Function &F) {
2041 // Scan the module for floating point constants. If any FP constant is used
2042 // in the function, we want to redirect it here so that we do not depend on
2043 // the precision of the printed form, unless the printed form preserves
2046 for (constant_iterator I = constant_begin(&F), E = constant_end(&F);
2048 printFloatingPointConstants(*I);
2053 void CWriter::printFloatingPointConstants(const Constant *C) {
2054 // If this is a constant expression, recursively check for constant fp values.
2055 if (const ConstantExpr *CE = dyn_cast<ConstantExpr>(C)) {
2056 for (unsigned i = 0, e = CE->getNumOperands(); i != e; ++i)
2057 printFloatingPointConstants(CE->getOperand(i));
2061 // Otherwise, check for a FP constant that we need to print.
2062 const ConstantFP *FPC = dyn_cast<ConstantFP>(C);
2064 // Do not put in FPConstantMap if safe.
2065 isFPCSafeToPrint(FPC) ||
2066 // Already printed this constant?
2067 FPConstantMap.count(FPC))
2070 FPConstantMap[FPC] = FPCounter; // Number the FP constants
2072 if (FPC->getType() == Type::DoubleTy) {
2073 double Val = FPC->getValueAPF().convertToDouble();
2074 uint64_t i = FPC->getValueAPF().bitcastToAPInt().getZExtValue();
2075 Out << "static const ConstantDoubleTy FPConstant" << FPCounter++
2076 << " = 0x" << utohexstr(i)
2077 << "ULL; /* " << Val << " */\n";
2078 } else if (FPC->getType() == Type::FloatTy) {
2079 float Val = FPC->getValueAPF().convertToFloat();
2080 uint32_t i = (uint32_t)FPC->getValueAPF().bitcastToAPInt().
2082 Out << "static const ConstantFloatTy FPConstant" << FPCounter++
2083 << " = 0x" << utohexstr(i)
2084 << "U; /* " << Val << " */\n";
2085 } else if (FPC->getType() == Type::X86_FP80Ty) {
2086 // api needed to prevent premature destruction
2087 APInt api = FPC->getValueAPF().bitcastToAPInt();
2088 const uint64_t *p = api.getRawData();
2089 Out << "static const ConstantFP80Ty FPConstant" << FPCounter++
2091 << utohexstr((uint16_t)p[1] | (p[0] & 0xffffffffffffLL)<<16)
2092 << "ULL, 0x" << utohexstr((uint16_t)(p[0] >> 48)) << ",{0,0,0}"
2093 << "}; /* Long double constant */\n";
2094 } else if (FPC->getType() == Type::PPC_FP128Ty) {
2095 APInt api = FPC->getValueAPF().bitcastToAPInt();
2096 const uint64_t *p = api.getRawData();
2097 Out << "static const ConstantFP128Ty FPConstant" << FPCounter++
2099 << utohexstr(p[0]) << ", 0x" << utohexstr(p[1])
2100 << "}; /* Long double constant */\n";
2103 assert(0 && "Unknown float type!");
2109 /// printSymbolTable - Run through symbol table looking for type names. If a
2110 /// type name is found, emit its declaration...
2112 void CWriter::printModuleTypes(const TypeSymbolTable &TST) {
2113 Out << "/* Helper union for bitcasts */\n";
2114 Out << "typedef union {\n";
2115 Out << " unsigned int Int32;\n";
2116 Out << " unsigned long long Int64;\n";
2117 Out << " float Float;\n";
2118 Out << " double Double;\n";
2119 Out << "} llvmBitCastUnion;\n";
2121 // We are only interested in the type plane of the symbol table.
2122 TypeSymbolTable::const_iterator I = TST.begin();
2123 TypeSymbolTable::const_iterator End = TST.end();
2125 // If there are no type names, exit early.
2126 if (I == End) return;
2128 // Print out forward declarations for structure types before anything else!
2129 Out << "/* Structure forward decls */\n";
2130 for (; I != End; ++I) {
2131 std::string Name = "struct l_" + Mang->makeNameProper(I->first);
2132 Out << Name << ";\n";
2133 TypeNames.insert(std::make_pair(I->second, Name));
2138 // Now we can print out typedefs. Above, we guaranteed that this can only be
2139 // for struct or opaque types.
2140 Out << "/* Typedefs */\n";
2141 for (I = TST.begin(); I != End; ++I) {
2142 std::string Name = "l_" + Mang->makeNameProper(I->first);
2144 printType(Out, I->second, false, Name);
2150 // Keep track of which structures have been printed so far...
2151 std::set<const Type *> StructPrinted;
2153 // Loop over all structures then push them into the stack so they are
2154 // printed in the correct order.
2156 Out << "/* Structure contents */\n";
2157 for (I = TST.begin(); I != End; ++I)
2158 if (isa<StructType>(I->second) || isa<ArrayType>(I->second))
2159 // Only print out used types!
2160 printContainedStructs(I->second, StructPrinted);
2163 // Push the struct onto the stack and recursively push all structs
2164 // this one depends on.
2166 // TODO: Make this work properly with vector types
2168 void CWriter::printContainedStructs(const Type *Ty,
2169 std::set<const Type*> &StructPrinted) {
2170 // Don't walk through pointers.
2171 if (isa<PointerType>(Ty) || Ty->isPrimitiveType() || Ty->isInteger()) return;
2173 // Print all contained types first.
2174 for (Type::subtype_iterator I = Ty->subtype_begin(),
2175 E = Ty->subtype_end(); I != E; ++I)
2176 printContainedStructs(*I, StructPrinted);
2178 if (isa<StructType>(Ty) || isa<ArrayType>(Ty)) {
2179 // Check to see if we have already printed this struct.
2180 if (StructPrinted.insert(Ty).second) {
2181 // Print structure type out.
2182 std::string Name = TypeNames[Ty];
2183 printType(Out, Ty, false, Name, true);
2189 void CWriter::printFunctionSignature(const Function *F, bool Prototype) {
2190 /// isStructReturn - Should this function actually return a struct by-value?
2191 bool isStructReturn = F->hasStructRetAttr();
2193 if (F->hasLocalLinkage()) Out << "static ";
2194 if (F->hasDLLImportLinkage()) Out << "__declspec(dllimport) ";
2195 if (F->hasDLLExportLinkage()) Out << "__declspec(dllexport) ";
2196 switch (F->getCallingConv()) {
2197 case CallingConv::X86_StdCall:
2198 Out << "__attribute__((stdcall)) ";
2200 case CallingConv::X86_FastCall:
2201 Out << "__attribute__((fastcall)) ";
2205 // Loop over the arguments, printing them...
2206 const FunctionType *FT = cast<FunctionType>(F->getFunctionType());
2207 const AttrListPtr &PAL = F->getAttributes();
2209 std::stringstream FunctionInnards;
2211 // Print out the name...
2212 FunctionInnards << GetValueName(F) << '(';
2214 bool PrintedArg = false;
2215 if (!F->isDeclaration()) {
2216 if (!F->arg_empty()) {
2217 Function::const_arg_iterator I = F->arg_begin(), E = F->arg_end();
2220 // If this is a struct-return function, don't print the hidden
2221 // struct-return argument.
2222 if (isStructReturn) {
2223 assert(I != E && "Invalid struct return function!");
2228 std::string ArgName;
2229 for (; I != E; ++I) {
2230 if (PrintedArg) FunctionInnards << ", ";
2231 if (I->hasName() || !Prototype)
2232 ArgName = GetValueName(I);
2235 const Type *ArgTy = I->getType();
2236 if (PAL.paramHasAttr(Idx, Attribute::ByVal)) {
2237 ArgTy = cast<PointerType>(ArgTy)->getElementType();
2238 ByValParams.insert(I);
2240 printType(FunctionInnards, ArgTy,
2241 /*isSigned=*/PAL.paramHasAttr(Idx, Attribute::SExt),
2248 // Loop over the arguments, printing them.
2249 FunctionType::param_iterator I = FT->param_begin(), E = FT->param_end();
2252 // If this is a struct-return function, don't print the hidden
2253 // struct-return argument.
2254 if (isStructReturn) {
2255 assert(I != E && "Invalid struct return function!");
2260 for (; I != E; ++I) {
2261 if (PrintedArg) FunctionInnards << ", ";
2262 const Type *ArgTy = *I;
2263 if (PAL.paramHasAttr(Idx, Attribute::ByVal)) {
2264 assert(isa<PointerType>(ArgTy));
2265 ArgTy = cast<PointerType>(ArgTy)->getElementType();
2267 printType(FunctionInnards, ArgTy,
2268 /*isSigned=*/PAL.paramHasAttr(Idx, Attribute::SExt));
2274 // Finish printing arguments... if this is a vararg function, print the ...,
2275 // unless there are no known types, in which case, we just emit ().
2277 if (FT->isVarArg() && PrintedArg) {
2278 if (PrintedArg) FunctionInnards << ", ";
2279 FunctionInnards << "..."; // Output varargs portion of signature!
2280 } else if (!FT->isVarArg() && !PrintedArg) {
2281 FunctionInnards << "void"; // ret() -> ret(void) in C.
2283 FunctionInnards << ')';
2285 // Get the return tpe for the function.
2287 if (!isStructReturn)
2288 RetTy = F->getReturnType();
2290 // If this is a struct-return function, print the struct-return type.
2291 RetTy = cast<PointerType>(FT->getParamType(0))->getElementType();
2294 // Print out the return type and the signature built above.
2295 printType(Out, RetTy,
2296 /*isSigned=*/PAL.paramHasAttr(0, Attribute::SExt),
2297 FunctionInnards.str());
2300 static inline bool isFPIntBitCast(const Instruction &I) {
2301 if (!isa<BitCastInst>(I))
2303 const Type *SrcTy = I.getOperand(0)->getType();
2304 const Type *DstTy = I.getType();
2305 return (SrcTy->isFloatingPoint() && DstTy->isInteger()) ||
2306 (DstTy->isFloatingPoint() && SrcTy->isInteger());
2309 void CWriter::printFunction(Function &F) {
2310 /// isStructReturn - Should this function actually return a struct by-value?
2311 bool isStructReturn = F.hasStructRetAttr();
2313 printFunctionSignature(&F, false);
2316 // If this is a struct return function, handle the result with magic.
2317 if (isStructReturn) {
2318 const Type *StructTy =
2319 cast<PointerType>(F.arg_begin()->getType())->getElementType();
2321 printType(Out, StructTy, false, "StructReturn");
2322 Out << "; /* Struct return temporary */\n";
2325 printType(Out, F.arg_begin()->getType(), false,
2326 GetValueName(F.arg_begin()));
2327 Out << " = &StructReturn;\n";
2330 bool PrintedVar = false;
2332 // print local variable information for the function
2333 for (inst_iterator I = inst_begin(&F), E = inst_end(&F); I != E; ++I) {
2334 if (const AllocaInst *AI = isDirectAlloca(&*I)) {
2336 printType(Out, AI->getAllocatedType(), false, GetValueName(AI));
2337 Out << "; /* Address-exposed local */\n";
2339 } else if (I->getType() != Type::VoidTy && !isInlinableInst(*I)) {
2341 printType(Out, I->getType(), false, GetValueName(&*I));
2344 if (isa<PHINode>(*I)) { // Print out PHI node temporaries as well...
2346 printType(Out, I->getType(), false,
2347 GetValueName(&*I)+"__PHI_TEMPORARY");
2352 // We need a temporary for the BitCast to use so it can pluck a value out
2353 // of a union to do the BitCast. This is separate from the need for a
2354 // variable to hold the result of the BitCast.
2355 if (isFPIntBitCast(*I)) {
2356 Out << " llvmBitCastUnion " << GetValueName(&*I)
2357 << "__BITCAST_TEMPORARY;\n";
2365 if (F.hasExternalLinkage() && F.getName() == "main")
2366 Out << " CODE_FOR_MAIN();\n";
2368 // print the basic blocks
2369 for (Function::iterator BB = F.begin(), E = F.end(); BB != E; ++BB) {
2370 if (Loop *L = LI->getLoopFor(BB)) {
2371 if (L->getHeader() == BB && L->getParentLoop() == 0)
2374 printBasicBlock(BB);
2381 void CWriter::printLoop(Loop *L) {
2382 Out << " do { /* Syntactic loop '" << L->getHeader()->getName()
2383 << "' to make GCC happy */\n";
2384 for (unsigned i = 0, e = L->getBlocks().size(); i != e; ++i) {
2385 BasicBlock *BB = L->getBlocks()[i];
2386 Loop *BBLoop = LI->getLoopFor(BB);
2388 printBasicBlock(BB);
2389 else if (BB == BBLoop->getHeader() && BBLoop->getParentLoop() == L)
2392 Out << " } while (1); /* end of syntactic loop '"
2393 << L->getHeader()->getName() << "' */\n";
2396 void CWriter::printBasicBlock(BasicBlock *BB) {
2398 // Don't print the label for the basic block if there are no uses, or if
2399 // the only terminator use is the predecessor basic block's terminator.
2400 // We have to scan the use list because PHI nodes use basic blocks too but
2401 // do not require a label to be generated.
2403 bool NeedsLabel = false;
2404 for (pred_iterator PI = pred_begin(BB), E = pred_end(BB); PI != E; ++PI)
2405 if (isGotoCodeNecessary(*PI, BB)) {
2410 if (NeedsLabel) Out << GetValueName(BB) << ":\n";
2412 // Output all of the instructions in the basic block...
2413 for (BasicBlock::iterator II = BB->begin(), E = --BB->end(); II != E;
2415 if (!isInlinableInst(*II) && !isDirectAlloca(II)) {
2416 if (II->getType() != Type::VoidTy && !isInlineAsm(*II))
2420 writeInstComputationInline(*II);
2425 // Don't emit prefix or suffix for the terminator.
2426 visit(*BB->getTerminator());
2430 // Specific Instruction type classes... note that all of the casts are
2431 // necessary because we use the instruction classes as opaque types...
2433 void CWriter::visitReturnInst(ReturnInst &I) {
2434 // If this is a struct return function, return the temporary struct.
2435 bool isStructReturn = I.getParent()->getParent()->hasStructRetAttr();
2437 if (isStructReturn) {
2438 Out << " return StructReturn;\n";
2442 // Don't output a void return if this is the last basic block in the function
2443 if (I.getNumOperands() == 0 &&
2444 &*--I.getParent()->getParent()->end() == I.getParent() &&
2445 !I.getParent()->size() == 1) {
2449 if (I.getNumOperands() > 1) {
2452 printType(Out, I.getParent()->getParent()->getReturnType());
2453 Out << " llvm_cbe_mrv_temp = {\n";
2454 for (unsigned i = 0, e = I.getNumOperands(); i != e; ++i) {
2456 writeOperand(I.getOperand(i));
2462 Out << " return llvm_cbe_mrv_temp;\n";
2468 if (I.getNumOperands()) {
2470 writeOperand(I.getOperand(0));
2475 void CWriter::visitSwitchInst(SwitchInst &SI) {
2478 writeOperand(SI.getOperand(0));
2479 Out << ") {\n default:\n";
2480 printPHICopiesForSuccessor (SI.getParent(), SI.getDefaultDest(), 2);
2481 printBranchToBlock(SI.getParent(), SI.getDefaultDest(), 2);
2483 for (unsigned i = 2, e = SI.getNumOperands(); i != e; i += 2) {
2485 writeOperand(SI.getOperand(i));
2487 BasicBlock *Succ = cast<BasicBlock>(SI.getOperand(i+1));
2488 printPHICopiesForSuccessor (SI.getParent(), Succ, 2);
2489 printBranchToBlock(SI.getParent(), Succ, 2);
2490 if (Function::iterator(Succ) == next(Function::iterator(SI.getParent())))
2496 void CWriter::visitUnreachableInst(UnreachableInst &I) {
2497 Out << " /*UNREACHABLE*/;\n";
2500 bool CWriter::isGotoCodeNecessary(BasicBlock *From, BasicBlock *To) {
2501 /// FIXME: This should be reenabled, but loop reordering safe!!
2504 if (next(Function::iterator(From)) != Function::iterator(To))
2505 return true; // Not the direct successor, we need a goto.
2507 //isa<SwitchInst>(From->getTerminator())
2509 if (LI->getLoopFor(From) != LI->getLoopFor(To))
2514 void CWriter::printPHICopiesForSuccessor (BasicBlock *CurBlock,
2515 BasicBlock *Successor,
2517 for (BasicBlock::iterator I = Successor->begin(); isa<PHINode>(I); ++I) {
2518 PHINode *PN = cast<PHINode>(I);
2519 // Now we have to do the printing.
2520 Value *IV = PN->getIncomingValueForBlock(CurBlock);
2521 if (!isa<UndefValue>(IV)) {
2522 Out << std::string(Indent, ' ');
2523 Out << " " << GetValueName(I) << "__PHI_TEMPORARY = ";
2525 Out << "; /* for PHI node */\n";
2530 void CWriter::printBranchToBlock(BasicBlock *CurBB, BasicBlock *Succ,
2532 if (isGotoCodeNecessary(CurBB, Succ)) {
2533 Out << std::string(Indent, ' ') << " goto ";
2539 // Branch instruction printing - Avoid printing out a branch to a basic block
2540 // that immediately succeeds the current one.
2542 void CWriter::visitBranchInst(BranchInst &I) {
2544 if (I.isConditional()) {
2545 if (isGotoCodeNecessary(I.getParent(), I.getSuccessor(0))) {
2547 writeOperand(I.getCondition());
2550 printPHICopiesForSuccessor (I.getParent(), I.getSuccessor(0), 2);
2551 printBranchToBlock(I.getParent(), I.getSuccessor(0), 2);
2553 if (isGotoCodeNecessary(I.getParent(), I.getSuccessor(1))) {
2554 Out << " } else {\n";
2555 printPHICopiesForSuccessor (I.getParent(), I.getSuccessor(1), 2);
2556 printBranchToBlock(I.getParent(), I.getSuccessor(1), 2);
2559 // First goto not necessary, assume second one is...
2561 writeOperand(I.getCondition());
2564 printPHICopiesForSuccessor (I.getParent(), I.getSuccessor(1), 2);
2565 printBranchToBlock(I.getParent(), I.getSuccessor(1), 2);
2570 printPHICopiesForSuccessor (I.getParent(), I.getSuccessor(0), 0);
2571 printBranchToBlock(I.getParent(), I.getSuccessor(0), 0);
2576 // PHI nodes get copied into temporary values at the end of predecessor basic
2577 // blocks. We now need to copy these temporary values into the REAL value for
2579 void CWriter::visitPHINode(PHINode &I) {
2581 Out << "__PHI_TEMPORARY";
2585 void CWriter::visitBinaryOperator(Instruction &I) {
2586 // binary instructions, shift instructions, setCond instructions.
2587 assert(!isa<PointerType>(I.getType()));
2589 // We must cast the results of binary operations which might be promoted.
2590 bool needsCast = false;
2591 if ((I.getType() == Type::Int8Ty) || (I.getType() == Type::Int16Ty)
2592 || (I.getType() == Type::FloatTy)) {
2595 printType(Out, I.getType(), false);
2599 // If this is a negation operation, print it out as such. For FP, we don't
2600 // want to print "-0.0 - X".
2601 if (BinaryOperator::isNeg(&I)) {
2603 writeOperand(BinaryOperator::getNegArgument(cast<BinaryOperator>(&I)));
2605 } else if (I.getOpcode() == Instruction::FRem) {
2606 // Output a call to fmod/fmodf instead of emitting a%b
2607 if (I.getType() == Type::FloatTy)
2609 else if (I.getType() == Type::DoubleTy)
2611 else // all 3 flavors of long double
2613 writeOperand(I.getOperand(0));
2615 writeOperand(I.getOperand(1));
2619 // Write out the cast of the instruction's value back to the proper type
2621 bool NeedsClosingParens = writeInstructionCast(I);
2623 // Certain instructions require the operand to be forced to a specific type
2624 // so we use writeOperandWithCast here instead of writeOperand. Similarly
2625 // below for operand 1
2626 writeOperandWithCast(I.getOperand(0), I.getOpcode());
2628 switch (I.getOpcode()) {
2629 case Instruction::Add: Out << " + "; break;
2630 case Instruction::Sub: Out << " - "; break;
2631 case Instruction::Mul: Out << " * "; break;
2632 case Instruction::URem:
2633 case Instruction::SRem:
2634 case Instruction::FRem: Out << " % "; break;
2635 case Instruction::UDiv:
2636 case Instruction::SDiv:
2637 case Instruction::FDiv: Out << " / "; break;
2638 case Instruction::And: Out << " & "; break;
2639 case Instruction::Or: Out << " | "; break;
2640 case Instruction::Xor: Out << " ^ "; break;
2641 case Instruction::Shl : Out << " << "; break;
2642 case Instruction::LShr:
2643 case Instruction::AShr: Out << " >> "; break;
2644 default: cerr << "Invalid operator type!" << I; abort();
2647 writeOperandWithCast(I.getOperand(1), I.getOpcode());
2648 if (NeedsClosingParens)
2657 void CWriter::visitICmpInst(ICmpInst &I) {
2658 // We must cast the results of icmp which might be promoted.
2659 bool needsCast = false;
2661 // Write out the cast of the instruction's value back to the proper type
2663 bool NeedsClosingParens = writeInstructionCast(I);
2665 // Certain icmp predicate require the operand to be forced to a specific type
2666 // so we use writeOperandWithCast here instead of writeOperand. Similarly
2667 // below for operand 1
2668 writeOperandWithCast(I.getOperand(0), I);
2670 switch (I.getPredicate()) {
2671 case ICmpInst::ICMP_EQ: Out << " == "; break;
2672 case ICmpInst::ICMP_NE: Out << " != "; break;
2673 case ICmpInst::ICMP_ULE:
2674 case ICmpInst::ICMP_SLE: Out << " <= "; break;
2675 case ICmpInst::ICMP_UGE:
2676 case ICmpInst::ICMP_SGE: Out << " >= "; break;
2677 case ICmpInst::ICMP_ULT:
2678 case ICmpInst::ICMP_SLT: Out << " < "; break;
2679 case ICmpInst::ICMP_UGT:
2680 case ICmpInst::ICMP_SGT: Out << " > "; break;
2681 default: cerr << "Invalid icmp predicate!" << I; abort();
2684 writeOperandWithCast(I.getOperand(1), I);
2685 if (NeedsClosingParens)
2693 void CWriter::visitFCmpInst(FCmpInst &I) {
2694 if (I.getPredicate() == FCmpInst::FCMP_FALSE) {
2698 if (I.getPredicate() == FCmpInst::FCMP_TRUE) {
2704 switch (I.getPredicate()) {
2705 default: assert(0 && "Illegal FCmp predicate");
2706 case FCmpInst::FCMP_ORD: op = "ord"; break;
2707 case FCmpInst::FCMP_UNO: op = "uno"; break;
2708 case FCmpInst::FCMP_UEQ: op = "ueq"; break;
2709 case FCmpInst::FCMP_UNE: op = "une"; break;
2710 case FCmpInst::FCMP_ULT: op = "ult"; break;
2711 case FCmpInst::FCMP_ULE: op = "ule"; break;
2712 case FCmpInst::FCMP_UGT: op = "ugt"; break;
2713 case FCmpInst::FCMP_UGE: op = "uge"; break;
2714 case FCmpInst::FCMP_OEQ: op = "oeq"; break;
2715 case FCmpInst::FCMP_ONE: op = "one"; break;
2716 case FCmpInst::FCMP_OLT: op = "olt"; break;
2717 case FCmpInst::FCMP_OLE: op = "ole"; break;
2718 case FCmpInst::FCMP_OGT: op = "ogt"; break;
2719 case FCmpInst::FCMP_OGE: op = "oge"; break;
2722 Out << "llvm_fcmp_" << op << "(";
2723 // Write the first operand
2724 writeOperand(I.getOperand(0));
2726 // Write the second operand
2727 writeOperand(I.getOperand(1));
2731 static const char * getFloatBitCastField(const Type *Ty) {
2732 switch (Ty->getTypeID()) {
2733 default: assert(0 && "Invalid Type");
2734 case Type::FloatTyID: return "Float";
2735 case Type::DoubleTyID: return "Double";
2736 case Type::IntegerTyID: {
2737 unsigned NumBits = cast<IntegerType>(Ty)->getBitWidth();
2746 void CWriter::visitCastInst(CastInst &I) {
2747 const Type *DstTy = I.getType();
2748 const Type *SrcTy = I.getOperand(0)->getType();
2749 if (isFPIntBitCast(I)) {
2751 // These int<->float and long<->double casts need to be handled specially
2752 Out << GetValueName(&I) << "__BITCAST_TEMPORARY."
2753 << getFloatBitCastField(I.getOperand(0)->getType()) << " = ";
2754 writeOperand(I.getOperand(0));
2755 Out << ", " << GetValueName(&I) << "__BITCAST_TEMPORARY."
2756 << getFloatBitCastField(I.getType());
2762 printCast(I.getOpcode(), SrcTy, DstTy);
2764 // Make a sext from i1 work by subtracting the i1 from 0 (an int).
2765 if (SrcTy == Type::Int1Ty && I.getOpcode() == Instruction::SExt)
2768 writeOperand(I.getOperand(0));
2770 if (DstTy == Type::Int1Ty &&
2771 (I.getOpcode() == Instruction::Trunc ||
2772 I.getOpcode() == Instruction::FPToUI ||
2773 I.getOpcode() == Instruction::FPToSI ||
2774 I.getOpcode() == Instruction::PtrToInt)) {
2775 // Make sure we really get a trunc to bool by anding the operand with 1
2781 void CWriter::visitSelectInst(SelectInst &I) {
2783 writeOperand(I.getCondition());
2785 writeOperand(I.getTrueValue());
2787 writeOperand(I.getFalseValue());
2792 void CWriter::lowerIntrinsics(Function &F) {
2793 // This is used to keep track of intrinsics that get generated to a lowered
2794 // function. We must generate the prototypes before the function body which
2795 // will only be expanded on first use (by the loop below).
2796 std::vector<Function*> prototypesToGen;
2798 // Examine all the instructions in this function to find the intrinsics that
2799 // need to be lowered.
2800 for (Function::iterator BB = F.begin(), EE = F.end(); BB != EE; ++BB)
2801 for (BasicBlock::iterator I = BB->begin(), E = BB->end(); I != E; )
2802 if (CallInst *CI = dyn_cast<CallInst>(I++))
2803 if (Function *F = CI->getCalledFunction())
2804 switch (F->getIntrinsicID()) {
2805 case Intrinsic::not_intrinsic:
2806 case Intrinsic::memory_barrier:
2807 case Intrinsic::vastart:
2808 case Intrinsic::vacopy:
2809 case Intrinsic::vaend:
2810 case Intrinsic::returnaddress:
2811 case Intrinsic::frameaddress:
2812 case Intrinsic::setjmp:
2813 case Intrinsic::longjmp:
2814 case Intrinsic::prefetch:
2815 case Intrinsic::dbg_stoppoint:
2816 case Intrinsic::powi:
2817 case Intrinsic::x86_sse_cmp_ss:
2818 case Intrinsic::x86_sse_cmp_ps:
2819 case Intrinsic::x86_sse2_cmp_sd:
2820 case Intrinsic::x86_sse2_cmp_pd:
2821 case Intrinsic::ppc_altivec_lvsl:
2822 // We directly implement these intrinsics
2825 // If this is an intrinsic that directly corresponds to a GCC
2826 // builtin, we handle it.
2827 const char *BuiltinName = "";
2828 #define GET_GCC_BUILTIN_NAME
2829 #include "llvm/Intrinsics.gen"
2830 #undef GET_GCC_BUILTIN_NAME
2831 // If we handle it, don't lower it.
2832 if (BuiltinName[0]) break;
2834 // All other intrinsic calls we must lower.
2835 Instruction *Before = 0;
2836 if (CI != &BB->front())
2837 Before = prior(BasicBlock::iterator(CI));
2839 IL->LowerIntrinsicCall(CI);
2840 if (Before) { // Move iterator to instruction after call
2845 // If the intrinsic got lowered to another call, and that call has
2846 // a definition then we need to make sure its prototype is emitted
2847 // before any calls to it.
2848 if (CallInst *Call = dyn_cast<CallInst>(I))
2849 if (Function *NewF = Call->getCalledFunction())
2850 if (!NewF->isDeclaration())
2851 prototypesToGen.push_back(NewF);
2856 // We may have collected some prototypes to emit in the loop above.
2857 // Emit them now, before the function that uses them is emitted. But,
2858 // be careful not to emit them twice.
2859 std::vector<Function*>::iterator I = prototypesToGen.begin();
2860 std::vector<Function*>::iterator E = prototypesToGen.end();
2861 for ( ; I != E; ++I) {
2862 if (intrinsicPrototypesAlreadyGenerated.insert(*I).second) {
2864 printFunctionSignature(*I, true);
2870 void CWriter::visitCallInst(CallInst &I) {
2871 if (isa<InlineAsm>(I.getOperand(0)))
2872 return visitInlineAsm(I);
2874 bool WroteCallee = false;
2876 // Handle intrinsic function calls first...
2877 if (Function *F = I.getCalledFunction())
2878 if (Intrinsic::ID ID = (Intrinsic::ID)F->getIntrinsicID())
2879 if (visitBuiltinCall(I, ID, WroteCallee))
2882 Value *Callee = I.getCalledValue();
2884 const PointerType *PTy = cast<PointerType>(Callee->getType());
2885 const FunctionType *FTy = cast<FunctionType>(PTy->getElementType());
2887 // If this is a call to a struct-return function, assign to the first
2888 // parameter instead of passing it to the call.
2889 const AttrListPtr &PAL = I.getAttributes();
2890 bool hasByVal = I.hasByValArgument();
2891 bool isStructRet = I.hasStructRetAttr();
2893 writeOperandDeref(I.getOperand(1));
2897 if (I.isTailCall()) Out << " /*tail*/ ";
2900 // If this is an indirect call to a struct return function, we need to cast
2901 // the pointer. Ditto for indirect calls with byval arguments.
2902 bool NeedsCast = (hasByVal || isStructRet) && !isa<Function>(Callee);
2904 // GCC is a real PITA. It does not permit codegening casts of functions to
2905 // function pointers if they are in a call (it generates a trap instruction
2906 // instead!). We work around this by inserting a cast to void* in between
2907 // the function and the function pointer cast. Unfortunately, we can't just
2908 // form the constant expression here, because the folder will immediately
2911 // Note finally, that this is completely unsafe. ANSI C does not guarantee
2912 // that void* and function pointers have the same size. :( To deal with this
2913 // in the common case, we handle casts where the number of arguments passed
2916 if (ConstantExpr *CE = dyn_cast<ConstantExpr>(Callee))
2918 if (Function *RF = dyn_cast<Function>(CE->getOperand(0))) {
2924 // Ok, just cast the pointer type.
2927 printStructReturnPointerFunctionType(Out, PAL,
2928 cast<PointerType>(I.getCalledValue()->getType()));
2930 printType(Out, I.getCalledValue()->getType(), false, "", true, PAL);
2932 printType(Out, I.getCalledValue()->getType());
2935 writeOperand(Callee);
2936 if (NeedsCast) Out << ')';
2941 unsigned NumDeclaredParams = FTy->getNumParams();
2943 CallSite::arg_iterator AI = I.op_begin()+1, AE = I.op_end();
2945 if (isStructRet) { // Skip struct return argument.
2950 bool PrintedArg = false;
2951 for (; AI != AE; ++AI, ++ArgNo) {
2952 if (PrintedArg) Out << ", ";
2953 if (ArgNo < NumDeclaredParams &&
2954 (*AI)->getType() != FTy->getParamType(ArgNo)) {
2956 printType(Out, FTy->getParamType(ArgNo),
2957 /*isSigned=*/PAL.paramHasAttr(ArgNo+1, Attribute::SExt));
2960 // Check if the argument is expected to be passed by value.
2961 if (I.paramHasAttr(ArgNo+1, Attribute::ByVal))
2962 writeOperandDeref(*AI);
2970 /// visitBuiltinCall - Handle the call to the specified builtin. Returns true
2971 /// if the entire call is handled, return false it it wasn't handled, and
2972 /// optionally set 'WroteCallee' if the callee has already been printed out.
2973 bool CWriter::visitBuiltinCall(CallInst &I, Intrinsic::ID ID,
2974 bool &WroteCallee) {
2977 // If this is an intrinsic that directly corresponds to a GCC
2978 // builtin, we emit it here.
2979 const char *BuiltinName = "";
2980 Function *F = I.getCalledFunction();
2981 #define GET_GCC_BUILTIN_NAME
2982 #include "llvm/Intrinsics.gen"
2983 #undef GET_GCC_BUILTIN_NAME
2984 assert(BuiltinName[0] && "Unknown LLVM intrinsic!");
2990 case Intrinsic::memory_barrier:
2991 Out << "__sync_synchronize()";
2993 case Intrinsic::vastart:
2996 Out << "va_start(*(va_list*)";
2997 writeOperand(I.getOperand(1));
2999 // Output the last argument to the enclosing function.
3000 if (I.getParent()->getParent()->arg_empty()) {
3001 cerr << "The C backend does not currently support zero "
3002 << "argument varargs functions, such as '"
3003 << I.getParent()->getParent()->getName() << "'!\n";
3006 writeOperand(--I.getParent()->getParent()->arg_end());
3009 case Intrinsic::vaend:
3010 if (!isa<ConstantPointerNull>(I.getOperand(1))) {
3011 Out << "0; va_end(*(va_list*)";
3012 writeOperand(I.getOperand(1));
3015 Out << "va_end(*(va_list*)0)";
3018 case Intrinsic::vacopy:
3020 Out << "va_copy(*(va_list*)";
3021 writeOperand(I.getOperand(1));
3022 Out << ", *(va_list*)";
3023 writeOperand(I.getOperand(2));
3026 case Intrinsic::returnaddress:
3027 Out << "__builtin_return_address(";
3028 writeOperand(I.getOperand(1));
3031 case Intrinsic::frameaddress:
3032 Out << "__builtin_frame_address(";
3033 writeOperand(I.getOperand(1));
3036 case Intrinsic::powi:
3037 Out << "__builtin_powi(";
3038 writeOperand(I.getOperand(1));
3040 writeOperand(I.getOperand(2));
3043 case Intrinsic::setjmp:
3044 Out << "setjmp(*(jmp_buf*)";
3045 writeOperand(I.getOperand(1));
3048 case Intrinsic::longjmp:
3049 Out << "longjmp(*(jmp_buf*)";
3050 writeOperand(I.getOperand(1));
3052 writeOperand(I.getOperand(2));
3055 case Intrinsic::prefetch:
3056 Out << "LLVM_PREFETCH((const void *)";
3057 writeOperand(I.getOperand(1));
3059 writeOperand(I.getOperand(2));
3061 writeOperand(I.getOperand(3));
3064 case Intrinsic::stacksave:
3065 // Emit this as: Val = 0; *((void**)&Val) = __builtin_stack_save()
3066 // to work around GCC bugs (see PR1809).
3067 Out << "0; *((void**)&" << GetValueName(&I)
3068 << ") = __builtin_stack_save()";
3070 case Intrinsic::dbg_stoppoint: {
3071 // If we use writeOperand directly we get a "u" suffix which is rejected
3073 std::stringstream SPIStr;
3074 DbgStopPointInst &SPI = cast<DbgStopPointInst>(I);
3075 SPI.getDirectory()->print(SPIStr);
3079 Out << SPIStr.str();
3081 SPI.getFileName()->print(SPIStr);
3082 Out << SPIStr.str() << "\"\n";
3085 case Intrinsic::x86_sse_cmp_ss:
3086 case Intrinsic::x86_sse_cmp_ps:
3087 case Intrinsic::x86_sse2_cmp_sd:
3088 case Intrinsic::x86_sse2_cmp_pd:
3090 printType(Out, I.getType());
3092 // Multiple GCC builtins multiplex onto this intrinsic.
3093 switch (cast<ConstantInt>(I.getOperand(3))->getZExtValue()) {
3094 default: assert(0 && "Invalid llvm.x86.sse.cmp!");
3095 case 0: Out << "__builtin_ia32_cmpeq"; break;
3096 case 1: Out << "__builtin_ia32_cmplt"; break;
3097 case 2: Out << "__builtin_ia32_cmple"; break;
3098 case 3: Out << "__builtin_ia32_cmpunord"; break;
3099 case 4: Out << "__builtin_ia32_cmpneq"; break;
3100 case 5: Out << "__builtin_ia32_cmpnlt"; break;
3101 case 6: Out << "__builtin_ia32_cmpnle"; break;
3102 case 7: Out << "__builtin_ia32_cmpord"; break;
3104 if (ID == Intrinsic::x86_sse_cmp_ps || ID == Intrinsic::x86_sse2_cmp_pd)
3108 if (ID == Intrinsic::x86_sse_cmp_ss || ID == Intrinsic::x86_sse_cmp_ps)
3114 writeOperand(I.getOperand(1));
3116 writeOperand(I.getOperand(2));
3119 case Intrinsic::ppc_altivec_lvsl:
3121 printType(Out, I.getType());
3123 Out << "__builtin_altivec_lvsl(0, (void*)";
3124 writeOperand(I.getOperand(1));
3130 //This converts the llvm constraint string to something gcc is expecting.
3131 //TODO: work out platform independent constraints and factor those out
3132 // of the per target tables
3133 // handle multiple constraint codes
3134 std::string CWriter::InterpretASMConstraint(InlineAsm::ConstraintInfo& c) {
3136 assert(c.Codes.size() == 1 && "Too many asm constraint codes to handle");
3138 const char *const *table = 0;
3140 //Grab the translation table from TargetAsmInfo if it exists
3143 const TargetMachineRegistry::entry* Match =
3144 TargetMachineRegistry::getClosestStaticTargetForModule(*TheModule, E);
3146 //Per platform Target Machines don't exist, so create it
3147 // this must be done only once
3148 const TargetMachine* TM = Match->CtorFn(*TheModule, "");
3149 TAsm = TM->getTargetAsmInfo();
3153 table = TAsm->getAsmCBE();
3155 //Search the translation table if it exists
3156 for (int i = 0; table && table[i]; i += 2)
3157 if (c.Codes[0] == table[i])
3160 //default is identity
3164 //TODO: import logic from AsmPrinter.cpp
3165 static std::string gccifyAsm(std::string asmstr) {
3166 for (std::string::size_type i = 0; i != asmstr.size(); ++i)
3167 if (asmstr[i] == '\n')
3168 asmstr.replace(i, 1, "\\n");
3169 else if (asmstr[i] == '\t')
3170 asmstr.replace(i, 1, "\\t");
3171 else if (asmstr[i] == '$') {
3172 if (asmstr[i + 1] == '{') {
3173 std::string::size_type a = asmstr.find_first_of(':', i + 1);
3174 std::string::size_type b = asmstr.find_first_of('}', i + 1);
3175 std::string n = "%" +
3176 asmstr.substr(a + 1, b - a - 1) +
3177 asmstr.substr(i + 2, a - i - 2);
3178 asmstr.replace(i, b - i + 1, n);
3181 asmstr.replace(i, 1, "%");
3183 else if (asmstr[i] == '%')//grr
3184 { asmstr.replace(i, 1, "%%"); ++i;}
3189 //TODO: assumptions about what consume arguments from the call are likely wrong
3190 // handle communitivity
3191 void CWriter::visitInlineAsm(CallInst &CI) {
3192 InlineAsm* as = cast<InlineAsm>(CI.getOperand(0));
3193 std::vector<InlineAsm::ConstraintInfo> Constraints = as->ParseConstraints();
3195 std::vector<std::pair<Value*, int> > ResultVals;
3196 if (CI.getType() == Type::VoidTy)
3198 else if (const StructType *ST = dyn_cast<StructType>(CI.getType())) {
3199 for (unsigned i = 0, e = ST->getNumElements(); i != e; ++i)
3200 ResultVals.push_back(std::make_pair(&CI, (int)i));
3202 ResultVals.push_back(std::make_pair(&CI, -1));
3205 // Fix up the asm string for gcc and emit it.
3206 Out << "__asm__ volatile (\"" << gccifyAsm(as->getAsmString()) << "\"\n";
3209 unsigned ValueCount = 0;
3210 bool IsFirst = true;
3212 // Convert over all the output constraints.
3213 for (std::vector<InlineAsm::ConstraintInfo>::iterator I = Constraints.begin(),
3214 E = Constraints.end(); I != E; ++I) {
3216 if (I->Type != InlineAsm::isOutput) {
3218 continue; // Ignore non-output constraints.
3221 assert(I->Codes.size() == 1 && "Too many asm constraint codes to handle");
3222 std::string C = InterpretASMConstraint(*I);
3223 if (C.empty()) continue;
3234 if (ValueCount < ResultVals.size()) {
3235 DestVal = ResultVals[ValueCount].first;
3236 DestValNo = ResultVals[ValueCount].second;
3238 DestVal = CI.getOperand(ValueCount-ResultVals.size()+1);
3240 if (I->isEarlyClobber)
3243 Out << "\"=" << C << "\"(" << GetValueName(DestVal);
3244 if (DestValNo != -1)
3245 Out << ".field" << DestValNo; // Multiple retvals.
3251 // Convert over all the input constraints.
3255 for (std::vector<InlineAsm::ConstraintInfo>::iterator I = Constraints.begin(),
3256 E = Constraints.end(); I != E; ++I) {
3257 if (I->Type != InlineAsm::isInput) {
3259 continue; // Ignore non-input constraints.
3262 assert(I->Codes.size() == 1 && "Too many asm constraint codes to handle");
3263 std::string C = InterpretASMConstraint(*I);
3264 if (C.empty()) continue;
3271 assert(ValueCount >= ResultVals.size() && "Input can't refer to result");
3272 Value *SrcVal = CI.getOperand(ValueCount-ResultVals.size()+1);
3274 Out << "\"" << C << "\"(";
3276 writeOperand(SrcVal);
3278 writeOperandDeref(SrcVal);
3282 // Convert over the clobber constraints.
3285 for (std::vector<InlineAsm::ConstraintInfo>::iterator I = Constraints.begin(),
3286 E = Constraints.end(); I != E; ++I) {
3287 if (I->Type != InlineAsm::isClobber)
3288 continue; // Ignore non-input constraints.
3290 assert(I->Codes.size() == 1 && "Too many asm constraint codes to handle");
3291 std::string C = InterpretASMConstraint(*I);
3292 if (C.empty()) continue;
3299 Out << '\"' << C << '"';
3305 void CWriter::visitMallocInst(MallocInst &I) {
3306 assert(0 && "lowerallocations pass didn't work!");
3309 void CWriter::visitAllocaInst(AllocaInst &I) {
3311 printType(Out, I.getType());
3312 Out << ") alloca(sizeof(";
3313 printType(Out, I.getType()->getElementType());
3315 if (I.isArrayAllocation()) {
3317 writeOperand(I.getOperand(0));
3322 void CWriter::visitFreeInst(FreeInst &I) {
3323 assert(0 && "lowerallocations pass didn't work!");
3326 void CWriter::printGEPExpression(Value *Ptr, gep_type_iterator I,
3327 gep_type_iterator E, bool Static) {
3329 // If there are no indices, just print out the pointer.
3335 // Find out if the last index is into a vector. If so, we have to print this
3336 // specially. Since vectors can't have elements of indexable type, only the
3337 // last index could possibly be of a vector element.
3338 const VectorType *LastIndexIsVector = 0;
3340 for (gep_type_iterator TmpI = I; TmpI != E; ++TmpI)
3341 LastIndexIsVector = dyn_cast<VectorType>(*TmpI);
3346 // If the last index is into a vector, we can't print it as &a[i][j] because
3347 // we can't index into a vector with j in GCC. Instead, emit this as
3348 // (((float*)&a[i])+j)
3349 if (LastIndexIsVector) {
3351 printType(Out, PointerType::getUnqual(LastIndexIsVector->getElementType()));
3357 // If the first index is 0 (very typical) we can do a number of
3358 // simplifications to clean up the code.
3359 Value *FirstOp = I.getOperand();
3360 if (!isa<Constant>(FirstOp) || !cast<Constant>(FirstOp)->isNullValue()) {
3361 // First index isn't simple, print it the hard way.
3364 ++I; // Skip the zero index.
3366 // Okay, emit the first operand. If Ptr is something that is already address
3367 // exposed, like a global, avoid emitting (&foo)[0], just emit foo instead.
3368 if (isAddressExposed(Ptr)) {
3369 writeOperandInternal(Ptr, Static);
3370 } else if (I != E && isa<StructType>(*I)) {
3371 // If we didn't already emit the first operand, see if we can print it as
3372 // P->f instead of "P[0].f"
3374 Out << "->field" << cast<ConstantInt>(I.getOperand())->getZExtValue();
3375 ++I; // eat the struct index as well.
3377 // Instead of emitting P[0][1], emit (*P)[1], which is more idiomatic.
3384 for (; I != E; ++I) {
3385 if (isa<StructType>(*I)) {
3386 Out << ".field" << cast<ConstantInt>(I.getOperand())->getZExtValue();
3387 } else if (isa<ArrayType>(*I)) {
3389 writeOperandWithCast(I.getOperand(), Instruction::GetElementPtr);
3391 } else if (!isa<VectorType>(*I)) {
3393 writeOperandWithCast(I.getOperand(), Instruction::GetElementPtr);
3396 // If the last index is into a vector, then print it out as "+j)". This
3397 // works with the 'LastIndexIsVector' code above.
3398 if (isa<Constant>(I.getOperand()) &&
3399 cast<Constant>(I.getOperand())->isNullValue()) {
3400 Out << "))"; // avoid "+0".
3403 writeOperandWithCast(I.getOperand(), Instruction::GetElementPtr);
3411 void CWriter::writeMemoryAccess(Value *Operand, const Type *OperandType,
3412 bool IsVolatile, unsigned Alignment) {
3414 bool IsUnaligned = Alignment &&
3415 Alignment < TD->getABITypeAlignment(OperandType);
3419 if (IsVolatile || IsUnaligned) {
3422 Out << "struct __attribute__ ((packed, aligned(" << Alignment << "))) {";
3423 printType(Out, OperandType, false, IsUnaligned ? "data" : "volatile*");
3426 if (IsVolatile) Out << "volatile ";
3432 writeOperand(Operand);
3434 if (IsVolatile || IsUnaligned) {
3441 void CWriter::visitLoadInst(LoadInst &I) {
3442 writeMemoryAccess(I.getOperand(0), I.getType(), I.isVolatile(),
3447 void CWriter::visitStoreInst(StoreInst &I) {
3448 writeMemoryAccess(I.getPointerOperand(), I.getOperand(0)->getType(),
3449 I.isVolatile(), I.getAlignment());
3451 Value *Operand = I.getOperand(0);
3452 Constant *BitMask = 0;
3453 if (const IntegerType* ITy = dyn_cast<IntegerType>(Operand->getType()))
3454 if (!ITy->isPowerOf2ByteWidth())
3455 // We have a bit width that doesn't match an even power-of-2 byte
3456 // size. Consequently we must & the value with the type's bit mask
3457 BitMask = ConstantInt::get(ITy, ITy->getBitMask());
3460 writeOperand(Operand);
3463 printConstant(BitMask, false);
3468 void CWriter::visitGetElementPtrInst(GetElementPtrInst &I) {
3469 printGEPExpression(I.getPointerOperand(), gep_type_begin(I),
3470 gep_type_end(I), false);
3473 void CWriter::visitVAArgInst(VAArgInst &I) {
3474 Out << "va_arg(*(va_list*)";
3475 writeOperand(I.getOperand(0));
3477 printType(Out, I.getType());
3481 void CWriter::visitInsertElementInst(InsertElementInst &I) {
3482 const Type *EltTy = I.getType()->getElementType();
3483 writeOperand(I.getOperand(0));
3486 printType(Out, PointerType::getUnqual(EltTy));
3487 Out << ")(&" << GetValueName(&I) << "))[";
3488 writeOperand(I.getOperand(2));
3490 writeOperand(I.getOperand(1));
3494 void CWriter::visitExtractElementInst(ExtractElementInst &I) {
3495 // We know that our operand is not inlined.
3498 cast<VectorType>(I.getOperand(0)->getType())->getElementType();
3499 printType(Out, PointerType::getUnqual(EltTy));
3500 Out << ")(&" << GetValueName(I.getOperand(0)) << "))[";
3501 writeOperand(I.getOperand(1));
3505 void CWriter::visitShuffleVectorInst(ShuffleVectorInst &SVI) {
3507 printType(Out, SVI.getType());
3509 const VectorType *VT = SVI.getType();
3510 unsigned NumElts = VT->getNumElements();
3511 const Type *EltTy = VT->getElementType();
3513 for (unsigned i = 0; i != NumElts; ++i) {
3515 int SrcVal = SVI.getMaskValue(i);
3516 if ((unsigned)SrcVal >= NumElts*2) {
3517 Out << " 0/*undef*/ ";
3519 Value *Op = SVI.getOperand((unsigned)SrcVal >= NumElts);
3520 if (isa<Instruction>(Op)) {
3521 // Do an extractelement of this value from the appropriate input.
3523 printType(Out, PointerType::getUnqual(EltTy));
3524 Out << ")(&" << GetValueName(Op)
3525 << "))[" << (SrcVal & (NumElts-1)) << "]";
3526 } else if (isa<ConstantAggregateZero>(Op) || isa<UndefValue>(Op)) {
3529 printConstant(cast<ConstantVector>(Op)->getOperand(SrcVal &
3538 void CWriter::visitInsertValueInst(InsertValueInst &IVI) {
3539 // Start by copying the entire aggregate value into the result variable.
3540 writeOperand(IVI.getOperand(0));
3543 // Then do the insert to update the field.
3544 Out << GetValueName(&IVI);
3545 for (const unsigned *b = IVI.idx_begin(), *i = b, *e = IVI.idx_end();
3547 const Type *IndexedTy =
3548 ExtractValueInst::getIndexedType(IVI.getOperand(0)->getType(), b, i+1);
3549 if (isa<ArrayType>(IndexedTy))
3550 Out << ".array[" << *i << "]";
3552 Out << ".field" << *i;
3555 writeOperand(IVI.getOperand(1));
3558 void CWriter::visitExtractValueInst(ExtractValueInst &EVI) {
3560 if (isa<UndefValue>(EVI.getOperand(0))) {
3562 printType(Out, EVI.getType());
3563 Out << ") 0/*UNDEF*/";
3565 Out << GetValueName(EVI.getOperand(0));
3566 for (const unsigned *b = EVI.idx_begin(), *i = b, *e = EVI.idx_end();
3568 const Type *IndexedTy =
3569 ExtractValueInst::getIndexedType(EVI.getOperand(0)->getType(), b, i+1);
3570 if (isa<ArrayType>(IndexedTy))
3571 Out << ".array[" << *i << "]";
3573 Out << ".field" << *i;
3579 //===----------------------------------------------------------------------===//
3580 // External Interface declaration
3581 //===----------------------------------------------------------------------===//
3583 bool CTargetMachine::addPassesToEmitWholeFile(PassManager &PM,
3585 CodeGenFileType FileType,
3587 if (FileType != TargetMachine::AssemblyFile) return true;
3589 PM.add(createGCLoweringPass());
3590 PM.add(createLowerAllocationsPass(true));
3591 PM.add(createLowerInvokePass());
3592 PM.add(createCFGSimplificationPass()); // clean up after lower invoke.
3593 PM.add(new CBackendNameAllUsedStructsAndMergeFunctions());
3594 PM.add(new CWriter(o));
3595 PM.add(createGCInfoDeleter());