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 // Register the target.
52 static RegisterTarget<CTargetMachine> X("c", "C backend");
55 /// CBackendNameAllUsedStructsAndMergeFunctions - This pass inserts names for
56 /// any unnamed structure types that are used by the program, and merges
57 /// external functions with the same name.
59 class CBackendNameAllUsedStructsAndMergeFunctions : public ModulePass {
62 CBackendNameAllUsedStructsAndMergeFunctions()
64 void getAnalysisUsage(AnalysisUsage &AU) const {
65 AU.addRequired<FindUsedTypes>();
68 virtual const char *getPassName() const {
69 return "C backend type canonicalizer";
72 virtual bool runOnModule(Module &M);
75 char CBackendNameAllUsedStructsAndMergeFunctions::ID = 0;
77 /// CWriter - This class is the main chunk of code that converts an LLVM
78 /// module to a C translation unit.
79 class CWriter : public FunctionPass, public InstVisitor<CWriter> {
81 IntrinsicLowering *IL;
84 const Module *TheModule;
85 const TargetAsmInfo* TAsm;
87 std::map<const Type *, std::string> TypeNames;
88 std::map<const ConstantFP *, unsigned> FPConstantMap;
89 std::set<Function*> intrinsicPrototypesAlreadyGenerated;
90 std::set<const Argument*> ByValParams;
95 explicit CWriter(raw_ostream &o)
96 : FunctionPass(&ID), Out(o), IL(0), Mang(0), LI(0),
97 TheModule(0), TAsm(0), TD(0) {
101 virtual const char *getPassName() const { return "C backend"; }
103 void getAnalysisUsage(AnalysisUsage &AU) const {
104 AU.addRequired<LoopInfo>();
105 AU.setPreservesAll();
108 virtual bool doInitialization(Module &M);
110 bool runOnFunction(Function &F) {
111 LI = &getAnalysis<LoopInfo>();
113 // Get rid of intrinsics we can't handle.
116 // Output all floating point constants that cannot be printed accurately.
117 printFloatingPointConstants(F);
123 virtual bool doFinalization(Module &M) {
126 FPConstantMap.clear();
129 intrinsicPrototypesAlreadyGenerated.clear();
133 raw_ostream &printType(raw_ostream &Out, const Type *Ty,
134 bool isSigned = false,
135 const std::string &VariableName = "",
136 bool IgnoreName = false,
137 const AttrListPtr &PAL = AttrListPtr());
138 std::ostream &printType(std::ostream &Out, const Type *Ty,
139 bool isSigned = false,
140 const std::string &VariableName = "",
141 bool IgnoreName = false,
142 const AttrListPtr &PAL = AttrListPtr());
143 raw_ostream &printSimpleType(raw_ostream &Out, const Type *Ty,
145 const std::string &NameSoFar = "");
146 std::ostream &printSimpleType(std::ostream &Out, const Type *Ty,
148 const std::string &NameSoFar = "");
150 void printStructReturnPointerFunctionType(raw_ostream &Out,
151 const AttrListPtr &PAL,
152 const PointerType *Ty);
154 /// writeOperandDeref - Print the result of dereferencing the specified
155 /// operand with '*'. This is equivalent to printing '*' then using
156 /// writeOperand, but avoids excess syntax in some cases.
157 void writeOperandDeref(Value *Operand) {
158 if (isAddressExposed(Operand)) {
159 // Already something with an address exposed.
160 writeOperandInternal(Operand);
163 writeOperand(Operand);
168 void writeOperand(Value *Operand, bool Static = false);
169 void writeInstComputationInline(Instruction &I);
170 void writeOperandInternal(Value *Operand, bool Static = false);
171 void writeOperandWithCast(Value* Operand, unsigned Opcode);
172 void writeOperandWithCast(Value* Operand, const ICmpInst &I);
173 bool writeInstructionCast(const Instruction &I);
175 void writeMemoryAccess(Value *Operand, const Type *OperandType,
176 bool IsVolatile, unsigned Alignment);
179 std::string InterpretASMConstraint(InlineAsm::ConstraintInfo& c);
181 void lowerIntrinsics(Function &F);
183 void printModule(Module *M);
184 void printModuleTypes(const TypeSymbolTable &ST);
185 void printContainedStructs(const Type *Ty, std::set<const Type *> &);
186 void printFloatingPointConstants(Function &F);
187 void printFloatingPointConstants(const Constant *C);
188 void printFunctionSignature(const Function *F, bool Prototype);
190 void printFunction(Function &);
191 void printBasicBlock(BasicBlock *BB);
192 void printLoop(Loop *L);
194 void printCast(unsigned opcode, const Type *SrcTy, const Type *DstTy);
195 void printConstant(Constant *CPV, bool Static);
196 void printConstantWithCast(Constant *CPV, unsigned Opcode);
197 bool printConstExprCast(const ConstantExpr *CE, bool Static);
198 void printConstantArray(ConstantArray *CPA, bool Static);
199 void printConstantVector(ConstantVector *CV, bool Static);
201 /// isAddressExposed - Return true if the specified value's name needs to
202 /// have its address taken in order to get a C value of the correct type.
203 /// This happens for global variables, byval parameters, and direct allocas.
204 bool isAddressExposed(const Value *V) const {
205 if (const Argument *A = dyn_cast<Argument>(V))
206 return ByValParams.count(A);
207 return isa<GlobalVariable>(V) || isDirectAlloca(V);
210 // isInlinableInst - Attempt to inline instructions into their uses to build
211 // trees as much as possible. To do this, we have to consistently decide
212 // what is acceptable to inline, so that variable declarations don't get
213 // printed and an extra copy of the expr is not emitted.
215 static bool isInlinableInst(const Instruction &I) {
216 // Always inline cmp instructions, even if they are shared by multiple
217 // expressions. GCC generates horrible code if we don't.
221 // Must be an expression, must be used exactly once. If it is dead, we
222 // emit it inline where it would go.
223 if (I.getType() == Type::VoidTy || !I.hasOneUse() ||
224 isa<TerminatorInst>(I) || isa<CallInst>(I) || isa<PHINode>(I) ||
225 isa<LoadInst>(I) || isa<VAArgInst>(I) || isa<InsertElementInst>(I) ||
226 isa<InsertValueInst>(I))
227 // Don't inline a load across a store or other bad things!
230 // Must not be used in inline asm, extractelement, or shufflevector.
232 const Instruction &User = cast<Instruction>(*I.use_back());
233 if (isInlineAsm(User) || isa<ExtractElementInst>(User) ||
234 isa<ShuffleVectorInst>(User))
238 // Only inline instruction it if it's use is in the same BB as the inst.
239 return I.getParent() == cast<Instruction>(I.use_back())->getParent();
242 // isDirectAlloca - Define fixed sized allocas in the entry block as direct
243 // variables which are accessed with the & operator. This causes GCC to
244 // generate significantly better code than to emit alloca calls directly.
246 static const AllocaInst *isDirectAlloca(const Value *V) {
247 const AllocaInst *AI = dyn_cast<AllocaInst>(V);
248 if (!AI) return false;
249 if (AI->isArrayAllocation())
250 return 0; // FIXME: we can also inline fixed size array allocas!
251 if (AI->getParent() != &AI->getParent()->getParent()->getEntryBlock())
256 // isInlineAsm - Check if the instruction is a call to an inline asm chunk
257 static bool isInlineAsm(const Instruction& I) {
258 if (isa<CallInst>(&I) && isa<InlineAsm>(I.getOperand(0)))
263 // Instruction visitation functions
264 friend class InstVisitor<CWriter>;
266 void visitReturnInst(ReturnInst &I);
267 void visitBranchInst(BranchInst &I);
268 void visitSwitchInst(SwitchInst &I);
269 void visitInvokeInst(InvokeInst &I) {
270 assert(0 && "Lowerinvoke pass didn't work!");
273 void visitUnwindInst(UnwindInst &I) {
274 assert(0 && "Lowerinvoke pass didn't work!");
276 void visitUnreachableInst(UnreachableInst &I);
278 void visitPHINode(PHINode &I);
279 void visitBinaryOperator(Instruction &I);
280 void visitICmpInst(ICmpInst &I);
281 void visitFCmpInst(FCmpInst &I);
283 void visitCastInst (CastInst &I);
284 void visitSelectInst(SelectInst &I);
285 void visitCallInst (CallInst &I);
286 void visitInlineAsm(CallInst &I);
287 bool visitBuiltinCall(CallInst &I, Intrinsic::ID ID, bool &WroteCallee);
289 void visitMallocInst(MallocInst &I);
290 void visitAllocaInst(AllocaInst &I);
291 void visitFreeInst (FreeInst &I);
292 void visitLoadInst (LoadInst &I);
293 void visitStoreInst (StoreInst &I);
294 void visitGetElementPtrInst(GetElementPtrInst &I);
295 void visitVAArgInst (VAArgInst &I);
297 void visitInsertElementInst(InsertElementInst &I);
298 void visitExtractElementInst(ExtractElementInst &I);
299 void visitShuffleVectorInst(ShuffleVectorInst &SVI);
301 void visitInsertValueInst(InsertValueInst &I);
302 void visitExtractValueInst(ExtractValueInst &I);
304 void visitInstruction(Instruction &I) {
305 cerr << "C Writer does not know about " << I;
309 void outputLValue(Instruction *I) {
310 Out << " " << GetValueName(I) << " = ";
313 bool isGotoCodeNecessary(BasicBlock *From, BasicBlock *To);
314 void printPHICopiesForSuccessor(BasicBlock *CurBlock,
315 BasicBlock *Successor, unsigned Indent);
316 void printBranchToBlock(BasicBlock *CurBlock, BasicBlock *SuccBlock,
318 void printGEPExpression(Value *Ptr, gep_type_iterator I,
319 gep_type_iterator E, bool Static);
321 std::string GetValueName(const Value *Operand);
325 char CWriter::ID = 0;
327 /// This method inserts names for any unnamed structure types that are used by
328 /// the program, and removes names from structure types that are not used by the
331 bool CBackendNameAllUsedStructsAndMergeFunctions::runOnModule(Module &M) {
332 // Get a set of types that are used by the program...
333 std::set<const Type *> UT = getAnalysis<FindUsedTypes>().getTypes();
335 // Loop over the module symbol table, removing types from UT that are
336 // already named, and removing names for types that are not used.
338 TypeSymbolTable &TST = M.getTypeSymbolTable();
339 for (TypeSymbolTable::iterator TI = TST.begin(), TE = TST.end();
341 TypeSymbolTable::iterator I = TI++;
343 // If this isn't a struct or array type, remove it from our set of types
344 // to name. This simplifies emission later.
345 if (!isa<StructType>(I->second) && !isa<OpaqueType>(I->second) &&
346 !isa<ArrayType>(I->second)) {
349 // If this is not used, remove it from the symbol table.
350 std::set<const Type *>::iterator UTI = UT.find(I->second);
354 UT.erase(UTI); // Only keep one name for this type.
358 // UT now contains types that are not named. Loop over it, naming
361 bool Changed = false;
362 unsigned RenameCounter = 0;
363 for (std::set<const Type *>::const_iterator I = UT.begin(), E = UT.end();
365 if (isa<StructType>(*I) || isa<ArrayType>(*I)) {
366 while (M.addTypeName("unnamed"+utostr(RenameCounter), *I))
372 // Loop over all external functions and globals. If we have two with
373 // identical names, merge them.
374 // FIXME: This code should disappear when we don't allow values with the same
375 // names when they have different types!
376 std::map<std::string, GlobalValue*> ExtSymbols;
377 for (Module::iterator I = M.begin(), E = M.end(); I != E;) {
379 if (GV->isDeclaration() && GV->hasName()) {
380 std::pair<std::map<std::string, GlobalValue*>::iterator, bool> X
381 = ExtSymbols.insert(std::make_pair(GV->getName(), GV));
383 // Found a conflict, replace this global with the previous one.
384 GlobalValue *OldGV = X.first->second;
385 GV->replaceAllUsesWith(ConstantExpr::getBitCast(OldGV, GV->getType()));
386 GV->eraseFromParent();
391 // Do the same for globals.
392 for (Module::global_iterator I = M.global_begin(), E = M.global_end();
394 GlobalVariable *GV = I++;
395 if (GV->isDeclaration() && GV->hasName()) {
396 std::pair<std::map<std::string, GlobalValue*>::iterator, bool> X
397 = ExtSymbols.insert(std::make_pair(GV->getName(), GV));
399 // Found a conflict, replace this global with the previous one.
400 GlobalValue *OldGV = X.first->second;
401 GV->replaceAllUsesWith(ConstantExpr::getBitCast(OldGV, GV->getType()));
402 GV->eraseFromParent();
411 /// printStructReturnPointerFunctionType - This is like printType for a struct
412 /// return type, except, instead of printing the type as void (*)(Struct*, ...)
413 /// print it as "Struct (*)(...)", for struct return functions.
414 void CWriter::printStructReturnPointerFunctionType(raw_ostream &Out,
415 const AttrListPtr &PAL,
416 const PointerType *TheTy) {
417 const FunctionType *FTy = cast<FunctionType>(TheTy->getElementType());
418 std::stringstream FunctionInnards;
419 FunctionInnards << " (*) (";
420 bool PrintedType = false;
422 FunctionType::param_iterator I = FTy->param_begin(), E = FTy->param_end();
423 const Type *RetTy = cast<PointerType>(I->get())->getElementType();
425 for (++I, ++Idx; I != E; ++I, ++Idx) {
427 FunctionInnards << ", ";
428 const Type *ArgTy = *I;
429 if (PAL.paramHasAttr(Idx, Attribute::ByVal)) {
430 assert(isa<PointerType>(ArgTy));
431 ArgTy = cast<PointerType>(ArgTy)->getElementType();
433 printType(FunctionInnards, ArgTy,
434 /*isSigned=*/PAL.paramHasAttr(Idx, Attribute::SExt), "");
437 if (FTy->isVarArg()) {
439 FunctionInnards << ", ...";
440 } else if (!PrintedType) {
441 FunctionInnards << "void";
443 FunctionInnards << ')';
444 std::string tstr = FunctionInnards.str();
445 printType(Out, RetTy,
446 /*isSigned=*/PAL.paramHasAttr(0, Attribute::SExt), tstr);
450 CWriter::printSimpleType(raw_ostream &Out, const Type *Ty, bool isSigned,
451 const std::string &NameSoFar) {
452 assert((Ty->isPrimitiveType() || Ty->isInteger() || isa<VectorType>(Ty)) &&
453 "Invalid type for printSimpleType");
454 switch (Ty->getTypeID()) {
455 case Type::VoidTyID: return Out << "void " << NameSoFar;
456 case Type::IntegerTyID: {
457 unsigned NumBits = cast<IntegerType>(Ty)->getBitWidth();
459 return Out << "bool " << NameSoFar;
460 else if (NumBits <= 8)
461 return Out << (isSigned?"signed":"unsigned") << " char " << NameSoFar;
462 else if (NumBits <= 16)
463 return Out << (isSigned?"signed":"unsigned") << " short " << NameSoFar;
464 else if (NumBits <= 32)
465 return Out << (isSigned?"signed":"unsigned") << " int " << NameSoFar;
466 else if (NumBits <= 64)
467 return Out << (isSigned?"signed":"unsigned") << " long long "<< NameSoFar;
469 assert(NumBits <= 128 && "Bit widths > 128 not implemented yet");
470 return Out << (isSigned?"llvmInt128":"llvmUInt128") << " " << NameSoFar;
473 case Type::FloatTyID: return Out << "float " << NameSoFar;
474 case Type::DoubleTyID: return Out << "double " << NameSoFar;
475 // Lacking emulation of FP80 on PPC, etc., we assume whichever of these is
476 // present matches host 'long double'.
477 case Type::X86_FP80TyID:
478 case Type::PPC_FP128TyID:
479 case Type::FP128TyID: return Out << "long double " << NameSoFar;
481 case Type::VectorTyID: {
482 const VectorType *VTy = cast<VectorType>(Ty);
483 return printSimpleType(Out, VTy->getElementType(), isSigned,
484 " __attribute__((vector_size(" +
485 utostr(TD->getABITypeSize(VTy)) + " ))) " + NameSoFar);
489 cerr << "Unknown primitive type: " << *Ty << "\n";
495 CWriter::printSimpleType(std::ostream &Out, const Type *Ty, bool isSigned,
496 const std::string &NameSoFar) {
497 assert((Ty->isPrimitiveType() || Ty->isInteger() || isa<VectorType>(Ty)) &&
498 "Invalid type for printSimpleType");
499 switch (Ty->getTypeID()) {
500 case Type::VoidTyID: return Out << "void " << NameSoFar;
501 case Type::IntegerTyID: {
502 unsigned NumBits = cast<IntegerType>(Ty)->getBitWidth();
504 return Out << "bool " << NameSoFar;
505 else if (NumBits <= 8)
506 return Out << (isSigned?"signed":"unsigned") << " char " << NameSoFar;
507 else if (NumBits <= 16)
508 return Out << (isSigned?"signed":"unsigned") << " short " << NameSoFar;
509 else if (NumBits <= 32)
510 return Out << (isSigned?"signed":"unsigned") << " int " << NameSoFar;
511 else if (NumBits <= 64)
512 return Out << (isSigned?"signed":"unsigned") << " long long "<< NameSoFar;
514 assert(NumBits <= 128 && "Bit widths > 128 not implemented yet");
515 return Out << (isSigned?"llvmInt128":"llvmUInt128") << " " << NameSoFar;
518 case Type::FloatTyID: return Out << "float " << NameSoFar;
519 case Type::DoubleTyID: return Out << "double " << NameSoFar;
520 // Lacking emulation of FP80 on PPC, etc., we assume whichever of these is
521 // present matches host 'long double'.
522 case Type::X86_FP80TyID:
523 case Type::PPC_FP128TyID:
524 case Type::FP128TyID: return Out << "long double " << NameSoFar;
526 case Type::VectorTyID: {
527 const VectorType *VTy = cast<VectorType>(Ty);
528 return printSimpleType(Out, VTy->getElementType(), isSigned,
529 " __attribute__((vector_size(" +
530 utostr(TD->getABITypeSize(VTy)) + " ))) " + NameSoFar);
534 cerr << "Unknown primitive type: " << *Ty << "\n";
539 // Pass the Type* and the variable name and this prints out the variable
542 raw_ostream &CWriter::printType(raw_ostream &Out, const Type *Ty,
543 bool isSigned, const std::string &NameSoFar,
544 bool IgnoreName, const AttrListPtr &PAL) {
545 if (Ty->isPrimitiveType() || Ty->isInteger() || isa<VectorType>(Ty)) {
546 printSimpleType(Out, Ty, isSigned, NameSoFar);
550 // Check to see if the type is named.
551 if (!IgnoreName || isa<OpaqueType>(Ty)) {
552 std::map<const Type *, std::string>::iterator I = TypeNames.find(Ty);
553 if (I != TypeNames.end()) return Out << I->second << ' ' << NameSoFar;
556 switch (Ty->getTypeID()) {
557 case Type::FunctionTyID: {
558 const FunctionType *FTy = cast<FunctionType>(Ty);
559 std::stringstream FunctionInnards;
560 FunctionInnards << " (" << NameSoFar << ") (";
562 for (FunctionType::param_iterator I = FTy->param_begin(),
563 E = FTy->param_end(); I != E; ++I) {
564 const Type *ArgTy = *I;
565 if (PAL.paramHasAttr(Idx, Attribute::ByVal)) {
566 assert(isa<PointerType>(ArgTy));
567 ArgTy = cast<PointerType>(ArgTy)->getElementType();
569 if (I != FTy->param_begin())
570 FunctionInnards << ", ";
571 printType(FunctionInnards, ArgTy,
572 /*isSigned=*/PAL.paramHasAttr(Idx, Attribute::SExt), "");
575 if (FTy->isVarArg()) {
576 if (FTy->getNumParams())
577 FunctionInnards << ", ...";
578 } else if (!FTy->getNumParams()) {
579 FunctionInnards << "void";
581 FunctionInnards << ')';
582 std::string tstr = FunctionInnards.str();
583 printType(Out, FTy->getReturnType(),
584 /*isSigned=*/PAL.paramHasAttr(0, Attribute::SExt), tstr);
587 case Type::StructTyID: {
588 const StructType *STy = cast<StructType>(Ty);
589 Out << NameSoFar + " {\n";
591 for (StructType::element_iterator I = STy->element_begin(),
592 E = STy->element_end(); I != E; ++I) {
594 printType(Out, *I, false, "field" + utostr(Idx++));
599 Out << " __attribute__ ((packed))";
603 case Type::PointerTyID: {
604 const PointerType *PTy = cast<PointerType>(Ty);
605 std::string ptrName = "*" + NameSoFar;
607 if (isa<ArrayType>(PTy->getElementType()) ||
608 isa<VectorType>(PTy->getElementType()))
609 ptrName = "(" + ptrName + ")";
612 // Must be a function ptr cast!
613 return printType(Out, PTy->getElementType(), false, ptrName, true, PAL);
614 return printType(Out, PTy->getElementType(), false, ptrName);
617 case Type::ArrayTyID: {
618 const ArrayType *ATy = cast<ArrayType>(Ty);
619 unsigned NumElements = ATy->getNumElements();
620 if (NumElements == 0) NumElements = 1;
621 // Arrays are wrapped in structs to allow them to have normal
622 // value semantics (avoiding the array "decay").
623 Out << NameSoFar << " { ";
624 printType(Out, ATy->getElementType(), false,
625 "array[" + utostr(NumElements) + "]");
629 case Type::OpaqueTyID: {
630 static int Count = 0;
631 std::string TyName = "struct opaque_" + itostr(Count++);
632 assert(TypeNames.find(Ty) == TypeNames.end());
633 TypeNames[Ty] = TyName;
634 return Out << TyName << ' ' << NameSoFar;
637 assert(0 && "Unhandled case in getTypeProps!");
644 // Pass the Type* and the variable name and this prints out the variable
647 std::ostream &CWriter::printType(std::ostream &Out, const Type *Ty,
648 bool isSigned, const std::string &NameSoFar,
649 bool IgnoreName, const AttrListPtr &PAL) {
650 if (Ty->isPrimitiveType() || Ty->isInteger() || isa<VectorType>(Ty)) {
651 printSimpleType(Out, Ty, isSigned, NameSoFar);
655 // Check to see if the type is named.
656 if (!IgnoreName || isa<OpaqueType>(Ty)) {
657 std::map<const Type *, std::string>::iterator I = TypeNames.find(Ty);
658 if (I != TypeNames.end()) return Out << I->second << ' ' << NameSoFar;
661 switch (Ty->getTypeID()) {
662 case Type::FunctionTyID: {
663 const FunctionType *FTy = cast<FunctionType>(Ty);
664 std::stringstream FunctionInnards;
665 FunctionInnards << " (" << NameSoFar << ") (";
667 for (FunctionType::param_iterator I = FTy->param_begin(),
668 E = FTy->param_end(); I != E; ++I) {
669 const Type *ArgTy = *I;
670 if (PAL.paramHasAttr(Idx, Attribute::ByVal)) {
671 assert(isa<PointerType>(ArgTy));
672 ArgTy = cast<PointerType>(ArgTy)->getElementType();
674 if (I != FTy->param_begin())
675 FunctionInnards << ", ";
676 printType(FunctionInnards, ArgTy,
677 /*isSigned=*/PAL.paramHasAttr(Idx, Attribute::SExt), "");
680 if (FTy->isVarArg()) {
681 if (FTy->getNumParams())
682 FunctionInnards << ", ...";
683 } else if (!FTy->getNumParams()) {
684 FunctionInnards << "void";
686 FunctionInnards << ')';
687 std::string tstr = FunctionInnards.str();
688 printType(Out, FTy->getReturnType(),
689 /*isSigned=*/PAL.paramHasAttr(0, Attribute::SExt), tstr);
692 case Type::StructTyID: {
693 const StructType *STy = cast<StructType>(Ty);
694 Out << NameSoFar + " {\n";
696 for (StructType::element_iterator I = STy->element_begin(),
697 E = STy->element_end(); I != E; ++I) {
699 printType(Out, *I, false, "field" + utostr(Idx++));
704 Out << " __attribute__ ((packed))";
708 case Type::PointerTyID: {
709 const PointerType *PTy = cast<PointerType>(Ty);
710 std::string ptrName = "*" + NameSoFar;
712 if (isa<ArrayType>(PTy->getElementType()) ||
713 isa<VectorType>(PTy->getElementType()))
714 ptrName = "(" + ptrName + ")";
717 // Must be a function ptr cast!
718 return printType(Out, PTy->getElementType(), false, ptrName, true, PAL);
719 return printType(Out, PTy->getElementType(), false, ptrName);
722 case Type::ArrayTyID: {
723 const ArrayType *ATy = cast<ArrayType>(Ty);
724 unsigned NumElements = ATy->getNumElements();
725 if (NumElements == 0) NumElements = 1;
726 // Arrays are wrapped in structs to allow them to have normal
727 // value semantics (avoiding the array "decay").
728 Out << NameSoFar << " { ";
729 printType(Out, ATy->getElementType(), false,
730 "array[" + utostr(NumElements) + "]");
734 case Type::OpaqueTyID: {
735 static int Count = 0;
736 std::string TyName = "struct opaque_" + itostr(Count++);
737 assert(TypeNames.find(Ty) == TypeNames.end());
738 TypeNames[Ty] = TyName;
739 return Out << TyName << ' ' << NameSoFar;
742 assert(0 && "Unhandled case in getTypeProps!");
749 void CWriter::printConstantArray(ConstantArray *CPA, bool Static) {
751 // As a special case, print the array as a string if it is an array of
752 // ubytes or an array of sbytes with positive values.
754 const Type *ETy = CPA->getType()->getElementType();
755 bool isString = (ETy == Type::Int8Ty || ETy == Type::Int8Ty);
757 // Make sure the last character is a null char, as automatically added by C
758 if (isString && (CPA->getNumOperands() == 0 ||
759 !cast<Constant>(*(CPA->op_end()-1))->isNullValue()))
764 // Keep track of whether the last number was a hexadecimal escape
765 bool LastWasHex = false;
767 // Do not include the last character, which we know is null
768 for (unsigned i = 0, e = CPA->getNumOperands()-1; i != e; ++i) {
769 unsigned char C = cast<ConstantInt>(CPA->getOperand(i))->getZExtValue();
771 // Print it out literally if it is a printable character. The only thing
772 // to be careful about is when the last letter output was a hex escape
773 // code, in which case we have to be careful not to print out hex digits
774 // explicitly (the C compiler thinks it is a continuation of the previous
775 // character, sheesh...)
777 if (isprint(C) && (!LastWasHex || !isxdigit(C))) {
779 if (C == '"' || C == '\\')
780 Out << "\\" << (char)C;
786 case '\n': Out << "\\n"; break;
787 case '\t': Out << "\\t"; break;
788 case '\r': Out << "\\r"; break;
789 case '\v': Out << "\\v"; break;
790 case '\a': Out << "\\a"; break;
791 case '\"': Out << "\\\""; break;
792 case '\'': Out << "\\\'"; break;
795 Out << (char)(( C/16 < 10) ? ( C/16 +'0') : ( C/16 -10+'A'));
796 Out << (char)(((C&15) < 10) ? ((C&15)+'0') : ((C&15)-10+'A'));
805 if (CPA->getNumOperands()) {
807 printConstant(cast<Constant>(CPA->getOperand(0)), Static);
808 for (unsigned i = 1, e = CPA->getNumOperands(); i != e; ++i) {
810 printConstant(cast<Constant>(CPA->getOperand(i)), Static);
817 void CWriter::printConstantVector(ConstantVector *CP, bool Static) {
819 if (CP->getNumOperands()) {
821 printConstant(cast<Constant>(CP->getOperand(0)), Static);
822 for (unsigned i = 1, e = CP->getNumOperands(); i != e; ++i) {
824 printConstant(cast<Constant>(CP->getOperand(i)), Static);
830 // isFPCSafeToPrint - Returns true if we may assume that CFP may be written out
831 // textually as a double (rather than as a reference to a stack-allocated
832 // variable). We decide this by converting CFP to a string and back into a
833 // double, and then checking whether the conversion results in a bit-equal
834 // double to the original value of CFP. This depends on us and the target C
835 // compiler agreeing on the conversion process (which is pretty likely since we
836 // only deal in IEEE FP).
838 static bool isFPCSafeToPrint(const ConstantFP *CFP) {
840 // Do long doubles in hex for now.
841 if (CFP->getType() != Type::FloatTy && CFP->getType() != Type::DoubleTy)
843 APFloat APF = APFloat(CFP->getValueAPF()); // copy
844 if (CFP->getType() == Type::FloatTy)
845 APF.convert(APFloat::IEEEdouble, APFloat::rmNearestTiesToEven, &ignored);
846 #if HAVE_PRINTF_A && ENABLE_CBE_PRINTF_A
848 sprintf(Buffer, "%a", APF.convertToDouble());
849 if (!strncmp(Buffer, "0x", 2) ||
850 !strncmp(Buffer, "-0x", 3) ||
851 !strncmp(Buffer, "+0x", 3))
852 return APF.bitwiseIsEqual(APFloat(atof(Buffer)));
855 std::string StrVal = ftostr(APF);
857 while (StrVal[0] == ' ')
858 StrVal.erase(StrVal.begin());
860 // Check to make sure that the stringized number is not some string like "Inf"
861 // or NaN. Check that the string matches the "[-+]?[0-9]" regex.
862 if ((StrVal[0] >= '0' && StrVal[0] <= '9') ||
863 ((StrVal[0] == '-' || StrVal[0] == '+') &&
864 (StrVal[1] >= '0' && StrVal[1] <= '9')))
865 // Reparse stringized version!
866 return APF.bitwiseIsEqual(APFloat(atof(StrVal.c_str())));
871 /// Print out the casting for a cast operation. This does the double casting
872 /// necessary for conversion to the destination type, if necessary.
873 /// @brief Print a cast
874 void CWriter::printCast(unsigned opc, const Type *SrcTy, const Type *DstTy) {
875 // Print the destination type cast
877 case Instruction::UIToFP:
878 case Instruction::SIToFP:
879 case Instruction::IntToPtr:
880 case Instruction::Trunc:
881 case Instruction::BitCast:
882 case Instruction::FPExt:
883 case Instruction::FPTrunc: // For these the DstTy sign doesn't matter
885 printType(Out, DstTy);
888 case Instruction::ZExt:
889 case Instruction::PtrToInt:
890 case Instruction::FPToUI: // For these, make sure we get an unsigned dest
892 printSimpleType(Out, DstTy, false);
895 case Instruction::SExt:
896 case Instruction::FPToSI: // For these, make sure we get a signed dest
898 printSimpleType(Out, DstTy, true);
902 assert(0 && "Invalid cast opcode");
905 // Print the source type cast
907 case Instruction::UIToFP:
908 case Instruction::ZExt:
910 printSimpleType(Out, SrcTy, false);
913 case Instruction::SIToFP:
914 case Instruction::SExt:
916 printSimpleType(Out, SrcTy, true);
919 case Instruction::IntToPtr:
920 case Instruction::PtrToInt:
921 // Avoid "cast to pointer from integer of different size" warnings
922 Out << "(unsigned long)";
924 case Instruction::Trunc:
925 case Instruction::BitCast:
926 case Instruction::FPExt:
927 case Instruction::FPTrunc:
928 case Instruction::FPToSI:
929 case Instruction::FPToUI:
930 break; // These don't need a source cast.
932 assert(0 && "Invalid cast opcode");
937 // printConstant - The LLVM Constant to C Constant converter.
938 void CWriter::printConstant(Constant *CPV, bool Static) {
939 if (const ConstantExpr *CE = dyn_cast<ConstantExpr>(CPV)) {
940 switch (CE->getOpcode()) {
941 case Instruction::Trunc:
942 case Instruction::ZExt:
943 case Instruction::SExt:
944 case Instruction::FPTrunc:
945 case Instruction::FPExt:
946 case Instruction::UIToFP:
947 case Instruction::SIToFP:
948 case Instruction::FPToUI:
949 case Instruction::FPToSI:
950 case Instruction::PtrToInt:
951 case Instruction::IntToPtr:
952 case Instruction::BitCast:
954 printCast(CE->getOpcode(), CE->getOperand(0)->getType(), CE->getType());
955 if (CE->getOpcode() == Instruction::SExt &&
956 CE->getOperand(0)->getType() == Type::Int1Ty) {
957 // Make sure we really sext from bool here by subtracting from 0
960 printConstant(CE->getOperand(0), Static);
961 if (CE->getType() == Type::Int1Ty &&
962 (CE->getOpcode() == Instruction::Trunc ||
963 CE->getOpcode() == Instruction::FPToUI ||
964 CE->getOpcode() == Instruction::FPToSI ||
965 CE->getOpcode() == Instruction::PtrToInt)) {
966 // Make sure we really truncate to bool here by anding with 1
972 case Instruction::GetElementPtr:
974 printGEPExpression(CE->getOperand(0), gep_type_begin(CPV),
975 gep_type_end(CPV), Static);
978 case Instruction::Select:
980 printConstant(CE->getOperand(0), Static);
982 printConstant(CE->getOperand(1), Static);
984 printConstant(CE->getOperand(2), Static);
987 case Instruction::Add:
988 case Instruction::Sub:
989 case Instruction::Mul:
990 case Instruction::SDiv:
991 case Instruction::UDiv:
992 case Instruction::FDiv:
993 case Instruction::URem:
994 case Instruction::SRem:
995 case Instruction::FRem:
996 case Instruction::And:
997 case Instruction::Or:
998 case Instruction::Xor:
999 case Instruction::ICmp:
1000 case Instruction::Shl:
1001 case Instruction::LShr:
1002 case Instruction::AShr:
1005 bool NeedsClosingParens = printConstExprCast(CE, Static);
1006 printConstantWithCast(CE->getOperand(0), CE->getOpcode());
1007 switch (CE->getOpcode()) {
1008 case Instruction::Add: Out << " + "; break;
1009 case Instruction::Sub: Out << " - "; break;
1010 case Instruction::Mul: Out << " * "; break;
1011 case Instruction::URem:
1012 case Instruction::SRem:
1013 case Instruction::FRem: Out << " % "; break;
1014 case Instruction::UDiv:
1015 case Instruction::SDiv:
1016 case Instruction::FDiv: Out << " / "; break;
1017 case Instruction::And: Out << " & "; break;
1018 case Instruction::Or: Out << " | "; break;
1019 case Instruction::Xor: Out << " ^ "; break;
1020 case Instruction::Shl: Out << " << "; break;
1021 case Instruction::LShr:
1022 case Instruction::AShr: Out << " >> "; break;
1023 case Instruction::ICmp:
1024 switch (CE->getPredicate()) {
1025 case ICmpInst::ICMP_EQ: Out << " == "; break;
1026 case ICmpInst::ICMP_NE: Out << " != "; break;
1027 case ICmpInst::ICMP_SLT:
1028 case ICmpInst::ICMP_ULT: Out << " < "; break;
1029 case ICmpInst::ICMP_SLE:
1030 case ICmpInst::ICMP_ULE: Out << " <= "; break;
1031 case ICmpInst::ICMP_SGT:
1032 case ICmpInst::ICMP_UGT: Out << " > "; break;
1033 case ICmpInst::ICMP_SGE:
1034 case ICmpInst::ICMP_UGE: Out << " >= "; break;
1035 default: assert(0 && "Illegal ICmp predicate");
1038 default: assert(0 && "Illegal opcode here!");
1040 printConstantWithCast(CE->getOperand(1), CE->getOpcode());
1041 if (NeedsClosingParens)
1046 case Instruction::FCmp: {
1048 bool NeedsClosingParens = printConstExprCast(CE, Static);
1049 if (CE->getPredicate() == FCmpInst::FCMP_FALSE)
1051 else if (CE->getPredicate() == FCmpInst::FCMP_TRUE)
1055 switch (CE->getPredicate()) {
1056 default: assert(0 && "Illegal FCmp predicate");
1057 case FCmpInst::FCMP_ORD: op = "ord"; break;
1058 case FCmpInst::FCMP_UNO: op = "uno"; break;
1059 case FCmpInst::FCMP_UEQ: op = "ueq"; break;
1060 case FCmpInst::FCMP_UNE: op = "une"; break;
1061 case FCmpInst::FCMP_ULT: op = "ult"; break;
1062 case FCmpInst::FCMP_ULE: op = "ule"; break;
1063 case FCmpInst::FCMP_UGT: op = "ugt"; break;
1064 case FCmpInst::FCMP_UGE: op = "uge"; break;
1065 case FCmpInst::FCMP_OEQ: op = "oeq"; break;
1066 case FCmpInst::FCMP_ONE: op = "one"; break;
1067 case FCmpInst::FCMP_OLT: op = "olt"; break;
1068 case FCmpInst::FCMP_OLE: op = "ole"; break;
1069 case FCmpInst::FCMP_OGT: op = "ogt"; break;
1070 case FCmpInst::FCMP_OGE: op = "oge"; break;
1072 Out << "llvm_fcmp_" << op << "(";
1073 printConstantWithCast(CE->getOperand(0), CE->getOpcode());
1075 printConstantWithCast(CE->getOperand(1), CE->getOpcode());
1078 if (NeedsClosingParens)
1084 cerr << "CWriter Error: Unhandled constant expression: "
1088 } else if (isa<UndefValue>(CPV) && CPV->getType()->isSingleValueType()) {
1090 printType(Out, CPV->getType()); // sign doesn't matter
1091 Out << ")/*UNDEF*/";
1092 if (!isa<VectorType>(CPV->getType())) {
1100 if (ConstantInt *CI = dyn_cast<ConstantInt>(CPV)) {
1101 const Type* Ty = CI->getType();
1102 if (Ty == Type::Int1Ty)
1103 Out << (CI->getZExtValue() ? '1' : '0');
1104 else if (Ty == Type::Int32Ty)
1105 Out << CI->getZExtValue() << 'u';
1106 else if (Ty->getPrimitiveSizeInBits() > 32)
1107 Out << CI->getZExtValue() << "ull";
1110 printSimpleType(Out, Ty, false) << ')';
1111 if (CI->isMinValue(true))
1112 Out << CI->getZExtValue() << 'u';
1114 Out << CI->getSExtValue();
1120 switch (CPV->getType()->getTypeID()) {
1121 case Type::FloatTyID:
1122 case Type::DoubleTyID:
1123 case Type::X86_FP80TyID:
1124 case Type::PPC_FP128TyID:
1125 case Type::FP128TyID: {
1126 ConstantFP *FPC = cast<ConstantFP>(CPV);
1127 std::map<const ConstantFP*, unsigned>::iterator I = FPConstantMap.find(FPC);
1128 if (I != FPConstantMap.end()) {
1129 // Because of FP precision problems we must load from a stack allocated
1130 // value that holds the value in hex.
1131 Out << "(*(" << (FPC->getType() == Type::FloatTy ? "float" :
1132 FPC->getType() == Type::DoubleTy ? "double" :
1134 << "*)&FPConstant" << I->second << ')';
1137 if (FPC->getType() == Type::FloatTy)
1138 V = FPC->getValueAPF().convertToFloat();
1139 else if (FPC->getType() == Type::DoubleTy)
1140 V = FPC->getValueAPF().convertToDouble();
1142 // Long double. Convert the number to double, discarding precision.
1143 // This is not awesome, but it at least makes the CBE output somewhat
1145 APFloat Tmp = FPC->getValueAPF();
1147 Tmp.convert(APFloat::IEEEdouble, APFloat::rmTowardZero, &LosesInfo);
1148 V = Tmp.convertToDouble();
1154 // FIXME the actual NaN bits should be emitted.
1155 // The prefix for a quiet NaN is 0x7FF8. For a signalling NaN,
1157 const unsigned long QuietNaN = 0x7ff8UL;
1158 //const unsigned long SignalNaN = 0x7ff4UL;
1160 // We need to grab the first part of the FP #
1163 uint64_t ll = DoubleToBits(V);
1164 sprintf(Buffer, "0x%llx", static_cast<long long>(ll));
1166 std::string Num(&Buffer[0], &Buffer[6]);
1167 unsigned long Val = strtoul(Num.c_str(), 0, 16);
1169 if (FPC->getType() == Type::FloatTy)
1170 Out << "LLVM_NAN" << (Val == QuietNaN ? "" : "S") << "F(\""
1171 << Buffer << "\") /*nan*/ ";
1173 Out << "LLVM_NAN" << (Val == QuietNaN ? "" : "S") << "(\""
1174 << Buffer << "\") /*nan*/ ";
1175 } else if (IsInf(V)) {
1177 if (V < 0) Out << '-';
1178 Out << "LLVM_INF" << (FPC->getType() == Type::FloatTy ? "F" : "")
1182 #if HAVE_PRINTF_A && ENABLE_CBE_PRINTF_A
1183 // Print out the constant as a floating point number.
1185 sprintf(Buffer, "%a", V);
1188 Num = ftostr(FPC->getValueAPF());
1196 case Type::ArrayTyID:
1197 // Use C99 compound expression literal initializer syntax.
1200 printType(Out, CPV->getType());
1203 Out << "{ "; // Arrays are wrapped in struct types.
1204 if (ConstantArray *CA = dyn_cast<ConstantArray>(CPV)) {
1205 printConstantArray(CA, Static);
1207 assert(isa<ConstantAggregateZero>(CPV) || isa<UndefValue>(CPV));
1208 const ArrayType *AT = cast<ArrayType>(CPV->getType());
1210 if (AT->getNumElements()) {
1212 Constant *CZ = Constant::getNullValue(AT->getElementType());
1213 printConstant(CZ, Static);
1214 for (unsigned i = 1, e = AT->getNumElements(); i != e; ++i) {
1216 printConstant(CZ, Static);
1221 Out << " }"; // Arrays are wrapped in struct types.
1224 case Type::VectorTyID:
1225 // Use C99 compound expression literal initializer syntax.
1228 printType(Out, CPV->getType());
1231 if (ConstantVector *CV = dyn_cast<ConstantVector>(CPV)) {
1232 printConstantVector(CV, Static);
1234 assert(isa<ConstantAggregateZero>(CPV) || isa<UndefValue>(CPV));
1235 const VectorType *VT = cast<VectorType>(CPV->getType());
1237 Constant *CZ = Constant::getNullValue(VT->getElementType());
1238 printConstant(CZ, Static);
1239 for (unsigned i = 1, e = VT->getNumElements(); i != e; ++i) {
1241 printConstant(CZ, Static);
1247 case Type::StructTyID:
1248 // Use C99 compound expression literal initializer syntax.
1251 printType(Out, CPV->getType());
1254 if (isa<ConstantAggregateZero>(CPV) || isa<UndefValue>(CPV)) {
1255 const StructType *ST = cast<StructType>(CPV->getType());
1257 if (ST->getNumElements()) {
1259 printConstant(Constant::getNullValue(ST->getElementType(0)), Static);
1260 for (unsigned i = 1, e = ST->getNumElements(); i != e; ++i) {
1262 printConstant(Constant::getNullValue(ST->getElementType(i)), Static);
1268 if (CPV->getNumOperands()) {
1270 printConstant(cast<Constant>(CPV->getOperand(0)), Static);
1271 for (unsigned i = 1, e = CPV->getNumOperands(); i != e; ++i) {
1273 printConstant(cast<Constant>(CPV->getOperand(i)), Static);
1280 case Type::PointerTyID:
1281 if (isa<ConstantPointerNull>(CPV)) {
1283 printType(Out, CPV->getType()); // sign doesn't matter
1284 Out << ")/*NULL*/0)";
1286 } else if (GlobalValue *GV = dyn_cast<GlobalValue>(CPV)) {
1287 writeOperand(GV, Static);
1292 cerr << "Unknown constant type: " << *CPV << "\n";
1297 // Some constant expressions need to be casted back to the original types
1298 // because their operands were casted to the expected type. This function takes
1299 // care of detecting that case and printing the cast for the ConstantExpr.
1300 bool CWriter::printConstExprCast(const ConstantExpr* CE, bool Static) {
1301 bool NeedsExplicitCast = false;
1302 const Type *Ty = CE->getOperand(0)->getType();
1303 bool TypeIsSigned = false;
1304 switch (CE->getOpcode()) {
1305 case Instruction::Add:
1306 case Instruction::Sub:
1307 case Instruction::Mul:
1308 // We need to cast integer arithmetic so that it is always performed
1309 // as unsigned, to avoid undefined behavior on overflow.
1310 if (!Ty->isIntOrIntVector()) break;
1312 case Instruction::LShr:
1313 case Instruction::URem:
1314 case Instruction::UDiv: NeedsExplicitCast = true; break;
1315 case Instruction::AShr:
1316 case Instruction::SRem:
1317 case Instruction::SDiv: NeedsExplicitCast = true; TypeIsSigned = true; break;
1318 case Instruction::SExt:
1320 NeedsExplicitCast = true;
1321 TypeIsSigned = true;
1323 case Instruction::ZExt:
1324 case Instruction::Trunc:
1325 case Instruction::FPTrunc:
1326 case Instruction::FPExt:
1327 case Instruction::UIToFP:
1328 case Instruction::SIToFP:
1329 case Instruction::FPToUI:
1330 case Instruction::FPToSI:
1331 case Instruction::PtrToInt:
1332 case Instruction::IntToPtr:
1333 case Instruction::BitCast:
1335 NeedsExplicitCast = true;
1339 if (NeedsExplicitCast) {
1341 if (Ty->isInteger() && Ty != Type::Int1Ty)
1342 printSimpleType(Out, Ty, TypeIsSigned);
1344 printType(Out, Ty); // not integer, sign doesn't matter
1347 return NeedsExplicitCast;
1350 // Print a constant assuming that it is the operand for a given Opcode. The
1351 // opcodes that care about sign need to cast their operands to the expected
1352 // type before the operation proceeds. This function does the casting.
1353 void CWriter::printConstantWithCast(Constant* CPV, unsigned Opcode) {
1355 // Extract the operand's type, we'll need it.
1356 const Type* OpTy = CPV->getType();
1358 // Indicate whether to do the cast or not.
1359 bool shouldCast = false;
1360 bool typeIsSigned = false;
1362 // Based on the Opcode for which this Constant is being written, determine
1363 // the new type to which the operand should be casted by setting the value
1364 // of OpTy. If we change OpTy, also set shouldCast to true so it gets
1368 // for most instructions, it doesn't matter
1370 case Instruction::Add:
1371 case Instruction::Sub:
1372 case Instruction::Mul:
1373 // We need to cast integer arithmetic so that it is always performed
1374 // as unsigned, to avoid undefined behavior on overflow.
1375 if (!OpTy->isIntOrIntVector()) break;
1377 case Instruction::LShr:
1378 case Instruction::UDiv:
1379 case Instruction::URem:
1382 case Instruction::AShr:
1383 case Instruction::SDiv:
1384 case Instruction::SRem:
1386 typeIsSigned = true;
1390 // Write out the casted constant if we should, otherwise just write the
1394 printSimpleType(Out, OpTy, typeIsSigned);
1396 printConstant(CPV, false);
1399 printConstant(CPV, false);
1402 std::string CWriter::GetValueName(const Value *Operand) {
1405 if (!isa<GlobalValue>(Operand) && Operand->getName() != "") {
1406 std::string VarName;
1408 Name = Operand->getName();
1409 VarName.reserve(Name.capacity());
1411 for (std::string::iterator I = Name.begin(), E = Name.end();
1415 if (!((ch >= 'a' && ch <= 'z') || (ch >= 'A' && ch <= 'Z') ||
1416 (ch >= '0' && ch <= '9') || ch == '_')) {
1418 sprintf(buffer, "_%x_", ch);
1424 Name = "llvm_cbe_" + VarName;
1426 Name = Mang->getValueName(Operand);
1432 /// writeInstComputationInline - Emit the computation for the specified
1433 /// instruction inline, with no destination provided.
1434 void CWriter::writeInstComputationInline(Instruction &I) {
1435 // If this is a non-trivial bool computation, make sure to truncate down to
1436 // a 1 bit value. This is important because we want "add i1 x, y" to return
1437 // "0" when x and y are true, not "2" for example.
1438 bool NeedBoolTrunc = false;
1439 if (I.getType() == Type::Int1Ty && !isa<ICmpInst>(I) && !isa<FCmpInst>(I))
1440 NeedBoolTrunc = true;
1452 void CWriter::writeOperandInternal(Value *Operand, bool Static) {
1453 if (Instruction *I = dyn_cast<Instruction>(Operand))
1454 // Should we inline this instruction to build a tree?
1455 if (isInlinableInst(*I) && !isDirectAlloca(I)) {
1457 writeInstComputationInline(*I);
1462 Constant* CPV = dyn_cast<Constant>(Operand);
1464 if (CPV && !isa<GlobalValue>(CPV))
1465 printConstant(CPV, Static);
1467 Out << GetValueName(Operand);
1470 void CWriter::writeOperand(Value *Operand, bool Static) {
1471 bool isAddressImplicit = isAddressExposed(Operand);
1472 if (isAddressImplicit)
1473 Out << "(&"; // Global variables are referenced as their addresses by llvm
1475 writeOperandInternal(Operand, Static);
1477 if (isAddressImplicit)
1481 // Some instructions need to have their result value casted back to the
1482 // original types because their operands were casted to the expected type.
1483 // This function takes care of detecting that case and printing the cast
1484 // for the Instruction.
1485 bool CWriter::writeInstructionCast(const Instruction &I) {
1486 const Type *Ty = I.getOperand(0)->getType();
1487 switch (I.getOpcode()) {
1488 case Instruction::Add:
1489 case Instruction::Sub:
1490 case Instruction::Mul:
1491 // We need to cast integer arithmetic so that it is always performed
1492 // as unsigned, to avoid undefined behavior on overflow.
1493 if (!Ty->isIntOrIntVector()) break;
1495 case Instruction::LShr:
1496 case Instruction::URem:
1497 case Instruction::UDiv:
1499 printSimpleType(Out, Ty, false);
1502 case Instruction::AShr:
1503 case Instruction::SRem:
1504 case Instruction::SDiv:
1506 printSimpleType(Out, Ty, true);
1514 // Write the operand with a cast to another type based on the Opcode being used.
1515 // This will be used in cases where an instruction has specific type
1516 // requirements (usually signedness) for its operands.
1517 void CWriter::writeOperandWithCast(Value* Operand, unsigned Opcode) {
1519 // Extract the operand's type, we'll need it.
1520 const Type* OpTy = Operand->getType();
1522 // Indicate whether to do the cast or not.
1523 bool shouldCast = false;
1525 // Indicate whether the cast should be to a signed type or not.
1526 bool castIsSigned = false;
1528 // Based on the Opcode for which this Operand is being written, determine
1529 // the new type to which the operand should be casted by setting the value
1530 // of OpTy. If we change OpTy, also set shouldCast to true.
1533 // for most instructions, it doesn't matter
1535 case Instruction::Add:
1536 case Instruction::Sub:
1537 case Instruction::Mul:
1538 // We need to cast integer arithmetic so that it is always performed
1539 // as unsigned, to avoid undefined behavior on overflow.
1540 if (!OpTy->isIntOrIntVector()) break;
1542 case Instruction::LShr:
1543 case Instruction::UDiv:
1544 case Instruction::URem: // Cast to unsigned first
1546 castIsSigned = false;
1548 case Instruction::GetElementPtr:
1549 case Instruction::AShr:
1550 case Instruction::SDiv:
1551 case Instruction::SRem: // Cast to signed first
1553 castIsSigned = true;
1557 // Write out the casted operand if we should, otherwise just write the
1561 printSimpleType(Out, OpTy, castIsSigned);
1563 writeOperand(Operand);
1566 writeOperand(Operand);
1569 // Write the operand with a cast to another type based on the icmp predicate
1571 void CWriter::writeOperandWithCast(Value* Operand, const ICmpInst &Cmp) {
1572 // This has to do a cast to ensure the operand has the right signedness.
1573 // Also, if the operand is a pointer, we make sure to cast to an integer when
1574 // doing the comparison both for signedness and so that the C compiler doesn't
1575 // optimize things like "p < NULL" to false (p may contain an integer value
1577 bool shouldCast = Cmp.isRelational();
1579 // Write out the casted operand if we should, otherwise just write the
1582 writeOperand(Operand);
1586 // Should this be a signed comparison? If so, convert to signed.
1587 bool castIsSigned = Cmp.isSignedPredicate();
1589 // If the operand was a pointer, convert to a large integer type.
1590 const Type* OpTy = Operand->getType();
1591 if (isa<PointerType>(OpTy))
1592 OpTy = TD->getIntPtrType();
1595 printSimpleType(Out, OpTy, castIsSigned);
1597 writeOperand(Operand);
1601 // generateCompilerSpecificCode - This is where we add conditional compilation
1602 // directives to cater to specific compilers as need be.
1604 static void generateCompilerSpecificCode(raw_ostream& Out,
1605 const TargetData *TD) {
1606 // Alloca is hard to get, and we don't want to include stdlib.h here.
1607 Out << "/* get a declaration for alloca */\n"
1608 << "#if defined(__CYGWIN__) || defined(__MINGW32__)\n"
1609 << "#define alloca(x) __builtin_alloca((x))\n"
1610 << "#define _alloca(x) __builtin_alloca((x))\n"
1611 << "#elif defined(__APPLE__)\n"
1612 << "extern void *__builtin_alloca(unsigned long);\n"
1613 << "#define alloca(x) __builtin_alloca(x)\n"
1614 << "#define longjmp _longjmp\n"
1615 << "#define setjmp _setjmp\n"
1616 << "#elif defined(__sun__)\n"
1617 << "#if defined(__sparcv9)\n"
1618 << "extern void *__builtin_alloca(unsigned long);\n"
1620 << "extern void *__builtin_alloca(unsigned int);\n"
1622 << "#define alloca(x) __builtin_alloca(x)\n"
1623 << "#elif defined(__FreeBSD__) || defined(__NetBSD__) || defined(__OpenBSD__) || defined(__DragonFly__)\n"
1624 << "#define alloca(x) __builtin_alloca(x)\n"
1625 << "#elif defined(_MSC_VER)\n"
1626 << "#define inline _inline\n"
1627 << "#define alloca(x) _alloca(x)\n"
1629 << "#include <alloca.h>\n"
1632 // We output GCC specific attributes to preserve 'linkonce'ness on globals.
1633 // If we aren't being compiled with GCC, just drop these attributes.
1634 Out << "#ifndef __GNUC__ /* Can only support \"linkonce\" vars with GCC */\n"
1635 << "#define __attribute__(X)\n"
1638 // On Mac OS X, "external weak" is spelled "__attribute__((weak_import))".
1639 Out << "#if defined(__GNUC__) && defined(__APPLE_CC__)\n"
1640 << "#define __EXTERNAL_WEAK__ __attribute__((weak_import))\n"
1641 << "#elif defined(__GNUC__)\n"
1642 << "#define __EXTERNAL_WEAK__ __attribute__((weak))\n"
1644 << "#define __EXTERNAL_WEAK__\n"
1647 // For now, turn off the weak linkage attribute on Mac OS X. (See above.)
1648 Out << "#if defined(__GNUC__) && defined(__APPLE_CC__)\n"
1649 << "#define __ATTRIBUTE_WEAK__\n"
1650 << "#elif defined(__GNUC__)\n"
1651 << "#define __ATTRIBUTE_WEAK__ __attribute__((weak))\n"
1653 << "#define __ATTRIBUTE_WEAK__\n"
1656 // Add hidden visibility support. FIXME: APPLE_CC?
1657 Out << "#if defined(__GNUC__)\n"
1658 << "#define __HIDDEN__ __attribute__((visibility(\"hidden\")))\n"
1661 // Define NaN and Inf as GCC builtins if using GCC, as 0 otherwise
1662 // From the GCC documentation:
1664 // double __builtin_nan (const char *str)
1666 // This is an implementation of the ISO C99 function nan.
1668 // Since ISO C99 defines this function in terms of strtod, which we do
1669 // not implement, a description of the parsing is in order. The string is
1670 // parsed as by strtol; that is, the base is recognized by leading 0 or
1671 // 0x prefixes. The number parsed is placed in the significand such that
1672 // the least significant bit of the number is at the least significant
1673 // bit of the significand. The number is truncated to fit the significand
1674 // field provided. The significand is forced to be a quiet NaN.
1676 // This function, if given a string literal, is evaluated early enough
1677 // that it is considered a compile-time constant.
1679 // float __builtin_nanf (const char *str)
1681 // Similar to __builtin_nan, except the return type is float.
1683 // double __builtin_inf (void)
1685 // Similar to __builtin_huge_val, except a warning is generated if the
1686 // target floating-point format does not support infinities. This
1687 // function is suitable for implementing the ISO C99 macro INFINITY.
1689 // float __builtin_inff (void)
1691 // Similar to __builtin_inf, except the return type is float.
1692 Out << "#ifdef __GNUC__\n"
1693 << "#define LLVM_NAN(NanStr) __builtin_nan(NanStr) /* Double */\n"
1694 << "#define LLVM_NANF(NanStr) __builtin_nanf(NanStr) /* Float */\n"
1695 << "#define LLVM_NANS(NanStr) __builtin_nans(NanStr) /* Double */\n"
1696 << "#define LLVM_NANSF(NanStr) __builtin_nansf(NanStr) /* Float */\n"
1697 << "#define LLVM_INF __builtin_inf() /* Double */\n"
1698 << "#define LLVM_INFF __builtin_inff() /* Float */\n"
1699 << "#define LLVM_PREFETCH(addr,rw,locality) "
1700 "__builtin_prefetch(addr,rw,locality)\n"
1701 << "#define __ATTRIBUTE_CTOR__ __attribute__((constructor))\n"
1702 << "#define __ATTRIBUTE_DTOR__ __attribute__((destructor))\n"
1703 << "#define LLVM_ASM __asm__\n"
1705 << "#define LLVM_NAN(NanStr) ((double)0.0) /* Double */\n"
1706 << "#define LLVM_NANF(NanStr) 0.0F /* Float */\n"
1707 << "#define LLVM_NANS(NanStr) ((double)0.0) /* Double */\n"
1708 << "#define LLVM_NANSF(NanStr) 0.0F /* Float */\n"
1709 << "#define LLVM_INF ((double)0.0) /* Double */\n"
1710 << "#define LLVM_INFF 0.0F /* Float */\n"
1711 << "#define LLVM_PREFETCH(addr,rw,locality) /* PREFETCH */\n"
1712 << "#define __ATTRIBUTE_CTOR__\n"
1713 << "#define __ATTRIBUTE_DTOR__\n"
1714 << "#define LLVM_ASM(X)\n"
1717 Out << "#if __GNUC__ < 4 /* Old GCC's, or compilers not GCC */ \n"
1718 << "#define __builtin_stack_save() 0 /* not implemented */\n"
1719 << "#define __builtin_stack_restore(X) /* noop */\n"
1722 // Output typedefs for 128-bit integers. If these are needed with a
1723 // 32-bit target or with a C compiler that doesn't support mode(TI),
1724 // more drastic measures will be needed.
1725 Out << "#if __GNUC__ && __LP64__ /* 128-bit integer types */\n"
1726 << "typedef int __attribute__((mode(TI))) llvmInt128;\n"
1727 << "typedef unsigned __attribute__((mode(TI))) llvmUInt128;\n"
1730 // Output target-specific code that should be inserted into main.
1731 Out << "#define CODE_FOR_MAIN() /* Any target-specific code for main()*/\n";
1734 /// FindStaticTors - Given a static ctor/dtor list, unpack its contents into
1735 /// the StaticTors set.
1736 static void FindStaticTors(GlobalVariable *GV, std::set<Function*> &StaticTors){
1737 ConstantArray *InitList = dyn_cast<ConstantArray>(GV->getInitializer());
1738 if (!InitList) return;
1740 for (unsigned i = 0, e = InitList->getNumOperands(); i != e; ++i)
1741 if (ConstantStruct *CS = dyn_cast<ConstantStruct>(InitList->getOperand(i))){
1742 if (CS->getNumOperands() != 2) return; // Not array of 2-element structs.
1744 if (CS->getOperand(1)->isNullValue())
1745 return; // Found a null terminator, exit printing.
1746 Constant *FP = CS->getOperand(1);
1747 if (ConstantExpr *CE = dyn_cast<ConstantExpr>(FP))
1749 FP = CE->getOperand(0);
1750 if (Function *F = dyn_cast<Function>(FP))
1751 StaticTors.insert(F);
1755 enum SpecialGlobalClass {
1757 GlobalCtors, GlobalDtors,
1761 /// getGlobalVariableClass - If this is a global that is specially recognized
1762 /// by LLVM, return a code that indicates how we should handle it.
1763 static SpecialGlobalClass getGlobalVariableClass(const GlobalVariable *GV) {
1764 // If this is a global ctors/dtors list, handle it now.
1765 if (GV->hasAppendingLinkage() && GV->use_empty()) {
1766 if (GV->getName() == "llvm.global_ctors")
1768 else if (GV->getName() == "llvm.global_dtors")
1772 // Otherwise, it it is other metadata, don't print it. This catches things
1773 // like debug information.
1774 if (GV->getSection() == "llvm.metadata")
1781 bool CWriter::doInitialization(Module &M) {
1785 TD = new TargetData(&M);
1786 IL = new IntrinsicLowering(*TD);
1787 IL->AddPrototypes(M);
1789 // Ensure that all structure types have names...
1790 Mang = new Mangler(M);
1791 Mang->markCharUnacceptable('.');
1793 // Keep track of which functions are static ctors/dtors so they can have
1794 // an attribute added to their prototypes.
1795 std::set<Function*> StaticCtors, StaticDtors;
1796 for (Module::global_iterator I = M.global_begin(), E = M.global_end();
1798 switch (getGlobalVariableClass(I)) {
1801 FindStaticTors(I, StaticCtors);
1804 FindStaticTors(I, StaticDtors);
1809 // get declaration for alloca
1810 Out << "/* Provide Declarations */\n";
1811 Out << "#include <stdarg.h>\n"; // Varargs support
1812 Out << "#include <setjmp.h>\n"; // Unwind support
1813 generateCompilerSpecificCode(Out, TD);
1815 // Provide a definition for `bool' if not compiling with a C++ compiler.
1817 << "#ifndef __cplusplus\ntypedef unsigned char bool;\n#endif\n"
1819 << "\n\n/* Support for floating point constants */\n"
1820 << "typedef unsigned long long ConstantDoubleTy;\n"
1821 << "typedef unsigned int ConstantFloatTy;\n"
1822 << "typedef struct { unsigned long long f1; unsigned short f2; "
1823 "unsigned short pad[3]; } ConstantFP80Ty;\n"
1824 // This is used for both kinds of 128-bit long double; meaning differs.
1825 << "typedef struct { unsigned long long f1; unsigned long long f2; }"
1826 " ConstantFP128Ty;\n"
1827 << "\n\n/* Global Declarations */\n";
1829 // First output all the declarations for the program, because C requires
1830 // Functions & globals to be declared before they are used.
1833 // Loop over the symbol table, emitting all named constants...
1834 printModuleTypes(M.getTypeSymbolTable());
1836 // Global variable declarations...
1837 if (!M.global_empty()) {
1838 Out << "\n/* External Global Variable Declarations */\n";
1839 for (Module::global_iterator I = M.global_begin(), E = M.global_end();
1842 if (I->hasExternalLinkage() || I->hasExternalWeakLinkage() ||
1843 I->hasCommonLinkage())
1845 else if (I->hasDLLImportLinkage())
1846 Out << "__declspec(dllimport) ";
1848 continue; // Internal Global
1850 // Thread Local Storage
1851 if (I->isThreadLocal())
1854 printType(Out, I->getType()->getElementType(), false, GetValueName(I));
1856 if (I->hasExternalWeakLinkage())
1857 Out << " __EXTERNAL_WEAK__";
1862 // Function declarations
1863 Out << "\n/* Function Declarations */\n";
1864 Out << "double fmod(double, double);\n"; // Support for FP rem
1865 Out << "float fmodf(float, float);\n";
1866 Out << "long double fmodl(long double, long double);\n";
1868 for (Module::iterator I = M.begin(), E = M.end(); I != E; ++I) {
1869 // Don't print declarations for intrinsic functions.
1870 if (!I->isIntrinsic() && I->getName() != "setjmp" &&
1871 I->getName() != "longjmp" && I->getName() != "_setjmp") {
1872 if (I->hasExternalWeakLinkage())
1874 printFunctionSignature(I, true);
1875 if (I->hasWeakLinkage() || I->hasLinkOnceLinkage())
1876 Out << " __ATTRIBUTE_WEAK__";
1877 if (I->hasExternalWeakLinkage())
1878 Out << " __EXTERNAL_WEAK__";
1879 if (StaticCtors.count(I))
1880 Out << " __ATTRIBUTE_CTOR__";
1881 if (StaticDtors.count(I))
1882 Out << " __ATTRIBUTE_DTOR__";
1883 if (I->hasHiddenVisibility())
1884 Out << " __HIDDEN__";
1886 if (I->hasName() && I->getName()[0] == 1)
1887 Out << " LLVM_ASM(\"" << I->getName().c_str()+1 << "\")";
1893 // Output the global variable declarations
1894 if (!M.global_empty()) {
1895 Out << "\n\n/* Global Variable Declarations */\n";
1896 for (Module::global_iterator I = M.global_begin(), E = M.global_end();
1898 if (!I->isDeclaration()) {
1899 // Ignore special globals, such as debug info.
1900 if (getGlobalVariableClass(I))
1903 if (I->hasInternalLinkage())
1908 // Thread Local Storage
1909 if (I->isThreadLocal())
1912 printType(Out, I->getType()->getElementType(), false,
1915 if (I->hasLinkOnceLinkage())
1916 Out << " __attribute__((common))";
1917 else if (I->hasCommonLinkage()) // FIXME is this right?
1918 Out << " __ATTRIBUTE_WEAK__";
1919 else if (I->hasWeakLinkage())
1920 Out << " __ATTRIBUTE_WEAK__";
1921 else if (I->hasExternalWeakLinkage())
1922 Out << " __EXTERNAL_WEAK__";
1923 if (I->hasHiddenVisibility())
1924 Out << " __HIDDEN__";
1929 // Output the global variable definitions and contents...
1930 if (!M.global_empty()) {
1931 Out << "\n\n/* Global Variable Definitions and Initialization */\n";
1932 for (Module::global_iterator I = M.global_begin(), E = M.global_end();
1934 if (!I->isDeclaration()) {
1935 // Ignore special globals, such as debug info.
1936 if (getGlobalVariableClass(I))
1939 if (I->hasInternalLinkage())
1941 else if (I->hasDLLImportLinkage())
1942 Out << "__declspec(dllimport) ";
1943 else if (I->hasDLLExportLinkage())
1944 Out << "__declspec(dllexport) ";
1946 // Thread Local Storage
1947 if (I->isThreadLocal())
1950 printType(Out, I->getType()->getElementType(), false,
1952 if (I->hasLinkOnceLinkage())
1953 Out << " __attribute__((common))";
1954 else if (I->hasWeakLinkage())
1955 Out << " __ATTRIBUTE_WEAK__";
1956 else if (I->hasCommonLinkage())
1957 Out << " __ATTRIBUTE_WEAK__";
1959 if (I->hasHiddenVisibility())
1960 Out << " __HIDDEN__";
1962 // If the initializer is not null, emit the initializer. If it is null,
1963 // we try to avoid emitting large amounts of zeros. The problem with
1964 // this, however, occurs when the variable has weak linkage. In this
1965 // case, the assembler will complain about the variable being both weak
1966 // and common, so we disable this optimization.
1967 // FIXME common linkage should avoid this problem.
1968 if (!I->getInitializer()->isNullValue()) {
1970 writeOperand(I->getInitializer(), true);
1971 } else if (I->hasWeakLinkage()) {
1972 // We have to specify an initializer, but it doesn't have to be
1973 // complete. If the value is an aggregate, print out { 0 }, and let
1974 // the compiler figure out the rest of the zeros.
1976 if (isa<StructType>(I->getInitializer()->getType()) ||
1977 isa<VectorType>(I->getInitializer()->getType())) {
1979 } else if (isa<ArrayType>(I->getInitializer()->getType())) {
1980 // As with structs and vectors, but with an extra set of braces
1981 // because arrays are wrapped in structs.
1984 // Just print it out normally.
1985 writeOperand(I->getInitializer(), true);
1993 Out << "\n\n/* Function Bodies */\n";
1995 // Emit some helper functions for dealing with FCMP instruction's
1997 Out << "static inline int llvm_fcmp_ord(double X, double Y) { ";
1998 Out << "return X == X && Y == Y; }\n";
1999 Out << "static inline int llvm_fcmp_uno(double X, double Y) { ";
2000 Out << "return X != X || Y != Y; }\n";
2001 Out << "static inline int llvm_fcmp_ueq(double X, double Y) { ";
2002 Out << "return X == Y || llvm_fcmp_uno(X, Y); }\n";
2003 Out << "static inline int llvm_fcmp_une(double X, double Y) { ";
2004 Out << "return X != Y; }\n";
2005 Out << "static inline int llvm_fcmp_ult(double X, double Y) { ";
2006 Out << "return X < Y || llvm_fcmp_uno(X, Y); }\n";
2007 Out << "static inline int llvm_fcmp_ugt(double X, double Y) { ";
2008 Out << "return X > Y || llvm_fcmp_uno(X, Y); }\n";
2009 Out << "static inline int llvm_fcmp_ule(double X, double Y) { ";
2010 Out << "return X <= Y || llvm_fcmp_uno(X, Y); }\n";
2011 Out << "static inline int llvm_fcmp_uge(double X, double Y) { ";
2012 Out << "return X >= Y || llvm_fcmp_uno(X, Y); }\n";
2013 Out << "static inline int llvm_fcmp_oeq(double X, double Y) { ";
2014 Out << "return X == Y ; }\n";
2015 Out << "static inline int llvm_fcmp_one(double X, double Y) { ";
2016 Out << "return X != Y && llvm_fcmp_ord(X, Y); }\n";
2017 Out << "static inline int llvm_fcmp_olt(double X, double Y) { ";
2018 Out << "return X < Y ; }\n";
2019 Out << "static inline int llvm_fcmp_ogt(double X, double Y) { ";
2020 Out << "return X > Y ; }\n";
2021 Out << "static inline int llvm_fcmp_ole(double X, double Y) { ";
2022 Out << "return X <= Y ; }\n";
2023 Out << "static inline int llvm_fcmp_oge(double X, double Y) { ";
2024 Out << "return X >= Y ; }\n";
2029 /// Output all floating point constants that cannot be printed accurately...
2030 void CWriter::printFloatingPointConstants(Function &F) {
2031 // Scan the module for floating point constants. If any FP constant is used
2032 // in the function, we want to redirect it here so that we do not depend on
2033 // the precision of the printed form, unless the printed form preserves
2036 for (constant_iterator I = constant_begin(&F), E = constant_end(&F);
2038 printFloatingPointConstants(*I);
2043 void CWriter::printFloatingPointConstants(const Constant *C) {
2044 // If this is a constant expression, recursively check for constant fp values.
2045 if (const ConstantExpr *CE = dyn_cast<ConstantExpr>(C)) {
2046 for (unsigned i = 0, e = CE->getNumOperands(); i != e; ++i)
2047 printFloatingPointConstants(CE->getOperand(i));
2051 // Otherwise, check for a FP constant that we need to print.
2052 const ConstantFP *FPC = dyn_cast<ConstantFP>(C);
2054 // Do not put in FPConstantMap if safe.
2055 isFPCSafeToPrint(FPC) ||
2056 // Already printed this constant?
2057 FPConstantMap.count(FPC))
2060 FPConstantMap[FPC] = FPCounter; // Number the FP constants
2062 if (FPC->getType() == Type::DoubleTy) {
2063 double Val = FPC->getValueAPF().convertToDouble();
2064 uint64_t i = FPC->getValueAPF().bitcastToAPInt().getZExtValue();
2065 Out << "static const ConstantDoubleTy FPConstant" << FPCounter++
2066 << " = 0x" << utohexstr(i)
2067 << "ULL; /* " << Val << " */\n";
2068 } else if (FPC->getType() == Type::FloatTy) {
2069 float Val = FPC->getValueAPF().convertToFloat();
2070 uint32_t i = (uint32_t)FPC->getValueAPF().bitcastToAPInt().
2072 Out << "static const ConstantFloatTy FPConstant" << FPCounter++
2073 << " = 0x" << utohexstr(i)
2074 << "U; /* " << Val << " */\n";
2075 } else if (FPC->getType() == Type::X86_FP80Ty) {
2076 // api needed to prevent premature destruction
2077 APInt api = FPC->getValueAPF().bitcastToAPInt();
2078 const uint64_t *p = api.getRawData();
2079 Out << "static const ConstantFP80Ty FPConstant" << FPCounter++
2081 << utohexstr((uint16_t)p[1] | (p[0] & 0xffffffffffffLL)<<16)
2082 << "ULL, 0x" << utohexstr((uint16_t)(p[0] >> 48)) << ",{0,0,0}"
2083 << "}; /* Long double constant */\n";
2084 } else if (FPC->getType() == Type::PPC_FP128Ty) {
2085 APInt api = FPC->getValueAPF().bitcastToAPInt();
2086 const uint64_t *p = api.getRawData();
2087 Out << "static const ConstantFP128Ty FPConstant" << FPCounter++
2089 << utohexstr(p[0]) << ", 0x" << utohexstr(p[1])
2090 << "}; /* Long double constant */\n";
2093 assert(0 && "Unknown float type!");
2099 /// printSymbolTable - Run through symbol table looking for type names. If a
2100 /// type name is found, emit its declaration...
2102 void CWriter::printModuleTypes(const TypeSymbolTable &TST) {
2103 Out << "/* Helper union for bitcasts */\n";
2104 Out << "typedef union {\n";
2105 Out << " unsigned int Int32;\n";
2106 Out << " unsigned long long Int64;\n";
2107 Out << " float Float;\n";
2108 Out << " double Double;\n";
2109 Out << "} llvmBitCastUnion;\n";
2111 // We are only interested in the type plane of the symbol table.
2112 TypeSymbolTable::const_iterator I = TST.begin();
2113 TypeSymbolTable::const_iterator End = TST.end();
2115 // If there are no type names, exit early.
2116 if (I == End) return;
2118 // Print out forward declarations for structure types before anything else!
2119 Out << "/* Structure forward decls */\n";
2120 for (; I != End; ++I) {
2121 std::string Name = "struct l_" + Mang->makeNameProper(I->first);
2122 Out << Name << ";\n";
2123 TypeNames.insert(std::make_pair(I->second, Name));
2128 // Now we can print out typedefs. Above, we guaranteed that this can only be
2129 // for struct or opaque types.
2130 Out << "/* Typedefs */\n";
2131 for (I = TST.begin(); I != End; ++I) {
2132 std::string Name = "l_" + Mang->makeNameProper(I->first);
2134 printType(Out, I->second, false, Name);
2140 // Keep track of which structures have been printed so far...
2141 std::set<const Type *> StructPrinted;
2143 // Loop over all structures then push them into the stack so they are
2144 // printed in the correct order.
2146 Out << "/* Structure contents */\n";
2147 for (I = TST.begin(); I != End; ++I)
2148 if (isa<StructType>(I->second) || isa<ArrayType>(I->second))
2149 // Only print out used types!
2150 printContainedStructs(I->second, StructPrinted);
2153 // Push the struct onto the stack and recursively push all structs
2154 // this one depends on.
2156 // TODO: Make this work properly with vector types
2158 void CWriter::printContainedStructs(const Type *Ty,
2159 std::set<const Type*> &StructPrinted) {
2160 // Don't walk through pointers.
2161 if (isa<PointerType>(Ty) || Ty->isPrimitiveType() || Ty->isInteger()) return;
2163 // Print all contained types first.
2164 for (Type::subtype_iterator I = Ty->subtype_begin(),
2165 E = Ty->subtype_end(); I != E; ++I)
2166 printContainedStructs(*I, StructPrinted);
2168 if (isa<StructType>(Ty) || isa<ArrayType>(Ty)) {
2169 // Check to see if we have already printed this struct.
2170 if (StructPrinted.insert(Ty).second) {
2171 // Print structure type out.
2172 std::string Name = TypeNames[Ty];
2173 printType(Out, Ty, false, Name, true);
2179 void CWriter::printFunctionSignature(const Function *F, bool Prototype) {
2180 /// isStructReturn - Should this function actually return a struct by-value?
2181 bool isStructReturn = F->hasStructRetAttr();
2183 if (F->hasInternalLinkage()) Out << "static ";
2184 if (F->hasDLLImportLinkage()) Out << "__declspec(dllimport) ";
2185 if (F->hasDLLExportLinkage()) Out << "__declspec(dllexport) ";
2186 switch (F->getCallingConv()) {
2187 case CallingConv::X86_StdCall:
2188 Out << "__stdcall ";
2190 case CallingConv::X86_FastCall:
2191 Out << "__fastcall ";
2195 // Loop over the arguments, printing them...
2196 const FunctionType *FT = cast<FunctionType>(F->getFunctionType());
2197 const AttrListPtr &PAL = F->getAttributes();
2199 std::stringstream FunctionInnards;
2201 // Print out the name...
2202 FunctionInnards << GetValueName(F) << '(';
2204 bool PrintedArg = false;
2205 if (!F->isDeclaration()) {
2206 if (!F->arg_empty()) {
2207 Function::const_arg_iterator I = F->arg_begin(), E = F->arg_end();
2210 // If this is a struct-return function, don't print the hidden
2211 // struct-return argument.
2212 if (isStructReturn) {
2213 assert(I != E && "Invalid struct return function!");
2218 std::string ArgName;
2219 for (; I != E; ++I) {
2220 if (PrintedArg) FunctionInnards << ", ";
2221 if (I->hasName() || !Prototype)
2222 ArgName = GetValueName(I);
2225 const Type *ArgTy = I->getType();
2226 if (PAL.paramHasAttr(Idx, Attribute::ByVal)) {
2227 ArgTy = cast<PointerType>(ArgTy)->getElementType();
2228 ByValParams.insert(I);
2230 printType(FunctionInnards, ArgTy,
2231 /*isSigned=*/PAL.paramHasAttr(Idx, Attribute::SExt),
2238 // Loop over the arguments, printing them.
2239 FunctionType::param_iterator I = FT->param_begin(), E = FT->param_end();
2242 // If this is a struct-return function, don't print the hidden
2243 // struct-return argument.
2244 if (isStructReturn) {
2245 assert(I != E && "Invalid struct return function!");
2250 for (; I != E; ++I) {
2251 if (PrintedArg) FunctionInnards << ", ";
2252 const Type *ArgTy = *I;
2253 if (PAL.paramHasAttr(Idx, Attribute::ByVal)) {
2254 assert(isa<PointerType>(ArgTy));
2255 ArgTy = cast<PointerType>(ArgTy)->getElementType();
2257 printType(FunctionInnards, ArgTy,
2258 /*isSigned=*/PAL.paramHasAttr(Idx, Attribute::SExt));
2264 // Finish printing arguments... if this is a vararg function, print the ...,
2265 // unless there are no known types, in which case, we just emit ().
2267 if (FT->isVarArg() && PrintedArg) {
2268 if (PrintedArg) FunctionInnards << ", ";
2269 FunctionInnards << "..."; // Output varargs portion of signature!
2270 } else if (!FT->isVarArg() && !PrintedArg) {
2271 FunctionInnards << "void"; // ret() -> ret(void) in C.
2273 FunctionInnards << ')';
2275 // Get the return tpe for the function.
2277 if (!isStructReturn)
2278 RetTy = F->getReturnType();
2280 // If this is a struct-return function, print the struct-return type.
2281 RetTy = cast<PointerType>(FT->getParamType(0))->getElementType();
2284 // Print out the return type and the signature built above.
2285 printType(Out, RetTy,
2286 /*isSigned=*/PAL.paramHasAttr(0, Attribute::SExt),
2287 FunctionInnards.str());
2290 static inline bool isFPIntBitCast(const Instruction &I) {
2291 if (!isa<BitCastInst>(I))
2293 const Type *SrcTy = I.getOperand(0)->getType();
2294 const Type *DstTy = I.getType();
2295 return (SrcTy->isFloatingPoint() && DstTy->isInteger()) ||
2296 (DstTy->isFloatingPoint() && SrcTy->isInteger());
2299 void CWriter::printFunction(Function &F) {
2300 /// isStructReturn - Should this function actually return a struct by-value?
2301 bool isStructReturn = F.hasStructRetAttr();
2303 printFunctionSignature(&F, false);
2306 // If this is a struct return function, handle the result with magic.
2307 if (isStructReturn) {
2308 const Type *StructTy =
2309 cast<PointerType>(F.arg_begin()->getType())->getElementType();
2311 printType(Out, StructTy, false, "StructReturn");
2312 Out << "; /* Struct return temporary */\n";
2315 printType(Out, F.arg_begin()->getType(), false,
2316 GetValueName(F.arg_begin()));
2317 Out << " = &StructReturn;\n";
2320 bool PrintedVar = false;
2322 // print local variable information for the function
2323 for (inst_iterator I = inst_begin(&F), E = inst_end(&F); I != E; ++I) {
2324 if (const AllocaInst *AI = isDirectAlloca(&*I)) {
2326 printType(Out, AI->getAllocatedType(), false, GetValueName(AI));
2327 Out << "; /* Address-exposed local */\n";
2329 } else if (I->getType() != Type::VoidTy && !isInlinableInst(*I)) {
2331 printType(Out, I->getType(), false, GetValueName(&*I));
2334 if (isa<PHINode>(*I)) { // Print out PHI node temporaries as well...
2336 printType(Out, I->getType(), false,
2337 GetValueName(&*I)+"__PHI_TEMPORARY");
2342 // We need a temporary for the BitCast to use so it can pluck a value out
2343 // of a union to do the BitCast. This is separate from the need for a
2344 // variable to hold the result of the BitCast.
2345 if (isFPIntBitCast(*I)) {
2346 Out << " llvmBitCastUnion " << GetValueName(&*I)
2347 << "__BITCAST_TEMPORARY;\n";
2355 if (F.hasExternalLinkage() && F.getName() == "main")
2356 Out << " CODE_FOR_MAIN();\n";
2358 // print the basic blocks
2359 for (Function::iterator BB = F.begin(), E = F.end(); BB != E; ++BB) {
2360 if (Loop *L = LI->getLoopFor(BB)) {
2361 if (L->getHeader() == BB && L->getParentLoop() == 0)
2364 printBasicBlock(BB);
2371 void CWriter::printLoop(Loop *L) {
2372 Out << " do { /* Syntactic loop '" << L->getHeader()->getName()
2373 << "' to make GCC happy */\n";
2374 for (unsigned i = 0, e = L->getBlocks().size(); i != e; ++i) {
2375 BasicBlock *BB = L->getBlocks()[i];
2376 Loop *BBLoop = LI->getLoopFor(BB);
2378 printBasicBlock(BB);
2379 else if (BB == BBLoop->getHeader() && BBLoop->getParentLoop() == L)
2382 Out << " } while (1); /* end of syntactic loop '"
2383 << L->getHeader()->getName() << "' */\n";
2386 void CWriter::printBasicBlock(BasicBlock *BB) {
2388 // Don't print the label for the basic block if there are no uses, or if
2389 // the only terminator use is the predecessor basic block's terminator.
2390 // We have to scan the use list because PHI nodes use basic blocks too but
2391 // do not require a label to be generated.
2393 bool NeedsLabel = false;
2394 for (pred_iterator PI = pred_begin(BB), E = pred_end(BB); PI != E; ++PI)
2395 if (isGotoCodeNecessary(*PI, BB)) {
2400 if (NeedsLabel) Out << GetValueName(BB) << ":\n";
2402 // Output all of the instructions in the basic block...
2403 for (BasicBlock::iterator II = BB->begin(), E = --BB->end(); II != E;
2405 if (!isInlinableInst(*II) && !isDirectAlloca(II)) {
2406 if (II->getType() != Type::VoidTy && !isInlineAsm(*II))
2410 writeInstComputationInline(*II);
2415 // Don't emit prefix or suffix for the terminator.
2416 visit(*BB->getTerminator());
2420 // Specific Instruction type classes... note that all of the casts are
2421 // necessary because we use the instruction classes as opaque types...
2423 void CWriter::visitReturnInst(ReturnInst &I) {
2424 // If this is a struct return function, return the temporary struct.
2425 bool isStructReturn = I.getParent()->getParent()->hasStructRetAttr();
2427 if (isStructReturn) {
2428 Out << " return StructReturn;\n";
2432 // Don't output a void return if this is the last basic block in the function
2433 if (I.getNumOperands() == 0 &&
2434 &*--I.getParent()->getParent()->end() == I.getParent() &&
2435 !I.getParent()->size() == 1) {
2439 if (I.getNumOperands() > 1) {
2442 printType(Out, I.getParent()->getParent()->getReturnType());
2443 Out << " llvm_cbe_mrv_temp = {\n";
2444 for (unsigned i = 0, e = I.getNumOperands(); i != e; ++i) {
2446 writeOperand(I.getOperand(i));
2452 Out << " return llvm_cbe_mrv_temp;\n";
2458 if (I.getNumOperands()) {
2460 writeOperand(I.getOperand(0));
2465 void CWriter::visitSwitchInst(SwitchInst &SI) {
2468 writeOperand(SI.getOperand(0));
2469 Out << ") {\n default:\n";
2470 printPHICopiesForSuccessor (SI.getParent(), SI.getDefaultDest(), 2);
2471 printBranchToBlock(SI.getParent(), SI.getDefaultDest(), 2);
2473 for (unsigned i = 2, e = SI.getNumOperands(); i != e; i += 2) {
2475 writeOperand(SI.getOperand(i));
2477 BasicBlock *Succ = cast<BasicBlock>(SI.getOperand(i+1));
2478 printPHICopiesForSuccessor (SI.getParent(), Succ, 2);
2479 printBranchToBlock(SI.getParent(), Succ, 2);
2480 if (Function::iterator(Succ) == next(Function::iterator(SI.getParent())))
2486 void CWriter::visitUnreachableInst(UnreachableInst &I) {
2487 Out << " /*UNREACHABLE*/;\n";
2490 bool CWriter::isGotoCodeNecessary(BasicBlock *From, BasicBlock *To) {
2491 /// FIXME: This should be reenabled, but loop reordering safe!!
2494 if (next(Function::iterator(From)) != Function::iterator(To))
2495 return true; // Not the direct successor, we need a goto.
2497 //isa<SwitchInst>(From->getTerminator())
2499 if (LI->getLoopFor(From) != LI->getLoopFor(To))
2504 void CWriter::printPHICopiesForSuccessor (BasicBlock *CurBlock,
2505 BasicBlock *Successor,
2507 for (BasicBlock::iterator I = Successor->begin(); isa<PHINode>(I); ++I) {
2508 PHINode *PN = cast<PHINode>(I);
2509 // Now we have to do the printing.
2510 Value *IV = PN->getIncomingValueForBlock(CurBlock);
2511 if (!isa<UndefValue>(IV)) {
2512 Out << std::string(Indent, ' ');
2513 Out << " " << GetValueName(I) << "__PHI_TEMPORARY = ";
2515 Out << "; /* for PHI node */\n";
2520 void CWriter::printBranchToBlock(BasicBlock *CurBB, BasicBlock *Succ,
2522 if (isGotoCodeNecessary(CurBB, Succ)) {
2523 Out << std::string(Indent, ' ') << " goto ";
2529 // Branch instruction printing - Avoid printing out a branch to a basic block
2530 // that immediately succeeds the current one.
2532 void CWriter::visitBranchInst(BranchInst &I) {
2534 if (I.isConditional()) {
2535 if (isGotoCodeNecessary(I.getParent(), I.getSuccessor(0))) {
2537 writeOperand(I.getCondition());
2540 printPHICopiesForSuccessor (I.getParent(), I.getSuccessor(0), 2);
2541 printBranchToBlock(I.getParent(), I.getSuccessor(0), 2);
2543 if (isGotoCodeNecessary(I.getParent(), I.getSuccessor(1))) {
2544 Out << " } else {\n";
2545 printPHICopiesForSuccessor (I.getParent(), I.getSuccessor(1), 2);
2546 printBranchToBlock(I.getParent(), I.getSuccessor(1), 2);
2549 // First goto not necessary, assume second one is...
2551 writeOperand(I.getCondition());
2554 printPHICopiesForSuccessor (I.getParent(), I.getSuccessor(1), 2);
2555 printBranchToBlock(I.getParent(), I.getSuccessor(1), 2);
2560 printPHICopiesForSuccessor (I.getParent(), I.getSuccessor(0), 0);
2561 printBranchToBlock(I.getParent(), I.getSuccessor(0), 0);
2566 // PHI nodes get copied into temporary values at the end of predecessor basic
2567 // blocks. We now need to copy these temporary values into the REAL value for
2569 void CWriter::visitPHINode(PHINode &I) {
2571 Out << "__PHI_TEMPORARY";
2575 void CWriter::visitBinaryOperator(Instruction &I) {
2576 // binary instructions, shift instructions, setCond instructions.
2577 assert(!isa<PointerType>(I.getType()));
2579 // We must cast the results of binary operations which might be promoted.
2580 bool needsCast = false;
2581 if ((I.getType() == Type::Int8Ty) || (I.getType() == Type::Int16Ty)
2582 || (I.getType() == Type::FloatTy)) {
2585 printType(Out, I.getType(), false);
2589 // If this is a negation operation, print it out as such. For FP, we don't
2590 // want to print "-0.0 - X".
2591 if (BinaryOperator::isNeg(&I)) {
2593 writeOperand(BinaryOperator::getNegArgument(cast<BinaryOperator>(&I)));
2595 } else if (I.getOpcode() == Instruction::FRem) {
2596 // Output a call to fmod/fmodf instead of emitting a%b
2597 if (I.getType() == Type::FloatTy)
2599 else if (I.getType() == Type::DoubleTy)
2601 else // all 3 flavors of long double
2603 writeOperand(I.getOperand(0));
2605 writeOperand(I.getOperand(1));
2609 // Write out the cast of the instruction's value back to the proper type
2611 bool NeedsClosingParens = writeInstructionCast(I);
2613 // Certain instructions require the operand to be forced to a specific type
2614 // so we use writeOperandWithCast here instead of writeOperand. Similarly
2615 // below for operand 1
2616 writeOperandWithCast(I.getOperand(0), I.getOpcode());
2618 switch (I.getOpcode()) {
2619 case Instruction::Add: Out << " + "; break;
2620 case Instruction::Sub: Out << " - "; break;
2621 case Instruction::Mul: Out << " * "; break;
2622 case Instruction::URem:
2623 case Instruction::SRem:
2624 case Instruction::FRem: Out << " % "; break;
2625 case Instruction::UDiv:
2626 case Instruction::SDiv:
2627 case Instruction::FDiv: Out << " / "; break;
2628 case Instruction::And: Out << " & "; break;
2629 case Instruction::Or: Out << " | "; break;
2630 case Instruction::Xor: Out << " ^ "; break;
2631 case Instruction::Shl : Out << " << "; break;
2632 case Instruction::LShr:
2633 case Instruction::AShr: Out << " >> "; break;
2634 default: cerr << "Invalid operator type!" << I; abort();
2637 writeOperandWithCast(I.getOperand(1), I.getOpcode());
2638 if (NeedsClosingParens)
2647 void CWriter::visitICmpInst(ICmpInst &I) {
2648 // We must cast the results of icmp which might be promoted.
2649 bool needsCast = false;
2651 // Write out the cast of the instruction's value back to the proper type
2653 bool NeedsClosingParens = writeInstructionCast(I);
2655 // Certain icmp predicate require the operand to be forced to a specific type
2656 // so we use writeOperandWithCast here instead of writeOperand. Similarly
2657 // below for operand 1
2658 writeOperandWithCast(I.getOperand(0), I);
2660 switch (I.getPredicate()) {
2661 case ICmpInst::ICMP_EQ: Out << " == "; break;
2662 case ICmpInst::ICMP_NE: Out << " != "; break;
2663 case ICmpInst::ICMP_ULE:
2664 case ICmpInst::ICMP_SLE: Out << " <= "; break;
2665 case ICmpInst::ICMP_UGE:
2666 case ICmpInst::ICMP_SGE: Out << " >= "; break;
2667 case ICmpInst::ICMP_ULT:
2668 case ICmpInst::ICMP_SLT: Out << " < "; break;
2669 case ICmpInst::ICMP_UGT:
2670 case ICmpInst::ICMP_SGT: Out << " > "; break;
2671 default: cerr << "Invalid icmp predicate!" << I; abort();
2674 writeOperandWithCast(I.getOperand(1), I);
2675 if (NeedsClosingParens)
2683 void CWriter::visitFCmpInst(FCmpInst &I) {
2684 if (I.getPredicate() == FCmpInst::FCMP_FALSE) {
2688 if (I.getPredicate() == FCmpInst::FCMP_TRUE) {
2694 switch (I.getPredicate()) {
2695 default: assert(0 && "Illegal FCmp predicate");
2696 case FCmpInst::FCMP_ORD: op = "ord"; break;
2697 case FCmpInst::FCMP_UNO: op = "uno"; break;
2698 case FCmpInst::FCMP_UEQ: op = "ueq"; break;
2699 case FCmpInst::FCMP_UNE: op = "une"; break;
2700 case FCmpInst::FCMP_ULT: op = "ult"; break;
2701 case FCmpInst::FCMP_ULE: op = "ule"; break;
2702 case FCmpInst::FCMP_UGT: op = "ugt"; break;
2703 case FCmpInst::FCMP_UGE: op = "uge"; break;
2704 case FCmpInst::FCMP_OEQ: op = "oeq"; break;
2705 case FCmpInst::FCMP_ONE: op = "one"; break;
2706 case FCmpInst::FCMP_OLT: op = "olt"; break;
2707 case FCmpInst::FCMP_OLE: op = "ole"; break;
2708 case FCmpInst::FCMP_OGT: op = "ogt"; break;
2709 case FCmpInst::FCMP_OGE: op = "oge"; break;
2712 Out << "llvm_fcmp_" << op << "(";
2713 // Write the first operand
2714 writeOperand(I.getOperand(0));
2716 // Write the second operand
2717 writeOperand(I.getOperand(1));
2721 static const char * getFloatBitCastField(const Type *Ty) {
2722 switch (Ty->getTypeID()) {
2723 default: assert(0 && "Invalid Type");
2724 case Type::FloatTyID: return "Float";
2725 case Type::DoubleTyID: return "Double";
2726 case Type::IntegerTyID: {
2727 unsigned NumBits = cast<IntegerType>(Ty)->getBitWidth();
2736 void CWriter::visitCastInst(CastInst &I) {
2737 const Type *DstTy = I.getType();
2738 const Type *SrcTy = I.getOperand(0)->getType();
2739 if (isFPIntBitCast(I)) {
2741 // These int<->float and long<->double casts need to be handled specially
2742 Out << GetValueName(&I) << "__BITCAST_TEMPORARY."
2743 << getFloatBitCastField(I.getOperand(0)->getType()) << " = ";
2744 writeOperand(I.getOperand(0));
2745 Out << ", " << GetValueName(&I) << "__BITCAST_TEMPORARY."
2746 << getFloatBitCastField(I.getType());
2752 printCast(I.getOpcode(), SrcTy, DstTy);
2754 // Make a sext from i1 work by subtracting the i1 from 0 (an int).
2755 if (SrcTy == Type::Int1Ty && I.getOpcode() == Instruction::SExt)
2758 writeOperand(I.getOperand(0));
2760 if (DstTy == Type::Int1Ty &&
2761 (I.getOpcode() == Instruction::Trunc ||
2762 I.getOpcode() == Instruction::FPToUI ||
2763 I.getOpcode() == Instruction::FPToSI ||
2764 I.getOpcode() == Instruction::PtrToInt)) {
2765 // Make sure we really get a trunc to bool by anding the operand with 1
2771 void CWriter::visitSelectInst(SelectInst &I) {
2773 writeOperand(I.getCondition());
2775 writeOperand(I.getTrueValue());
2777 writeOperand(I.getFalseValue());
2782 void CWriter::lowerIntrinsics(Function &F) {
2783 // This is used to keep track of intrinsics that get generated to a lowered
2784 // function. We must generate the prototypes before the function body which
2785 // will only be expanded on first use (by the loop below).
2786 std::vector<Function*> prototypesToGen;
2788 // Examine all the instructions in this function to find the intrinsics that
2789 // need to be lowered.
2790 for (Function::iterator BB = F.begin(), EE = F.end(); BB != EE; ++BB)
2791 for (BasicBlock::iterator I = BB->begin(), E = BB->end(); I != E; )
2792 if (CallInst *CI = dyn_cast<CallInst>(I++))
2793 if (Function *F = CI->getCalledFunction())
2794 switch (F->getIntrinsicID()) {
2795 case Intrinsic::not_intrinsic:
2796 case Intrinsic::memory_barrier:
2797 case Intrinsic::vastart:
2798 case Intrinsic::vacopy:
2799 case Intrinsic::vaend:
2800 case Intrinsic::returnaddress:
2801 case Intrinsic::frameaddress:
2802 case Intrinsic::setjmp:
2803 case Intrinsic::longjmp:
2804 case Intrinsic::prefetch:
2805 case Intrinsic::dbg_stoppoint:
2806 case Intrinsic::powi:
2807 case Intrinsic::x86_sse_cmp_ss:
2808 case Intrinsic::x86_sse_cmp_ps:
2809 case Intrinsic::x86_sse2_cmp_sd:
2810 case Intrinsic::x86_sse2_cmp_pd:
2811 case Intrinsic::ppc_altivec_lvsl:
2812 // We directly implement these intrinsics
2815 // If this is an intrinsic that directly corresponds to a GCC
2816 // builtin, we handle it.
2817 const char *BuiltinName = "";
2818 #define GET_GCC_BUILTIN_NAME
2819 #include "llvm/Intrinsics.gen"
2820 #undef GET_GCC_BUILTIN_NAME
2821 // If we handle it, don't lower it.
2822 if (BuiltinName[0]) break;
2824 // All other intrinsic calls we must lower.
2825 Instruction *Before = 0;
2826 if (CI != &BB->front())
2827 Before = prior(BasicBlock::iterator(CI));
2829 IL->LowerIntrinsicCall(CI);
2830 if (Before) { // Move iterator to instruction after call
2835 // If the intrinsic got lowered to another call, and that call has
2836 // a definition then we need to make sure its prototype is emitted
2837 // before any calls to it.
2838 if (CallInst *Call = dyn_cast<CallInst>(I))
2839 if (Function *NewF = Call->getCalledFunction())
2840 if (!NewF->isDeclaration())
2841 prototypesToGen.push_back(NewF);
2846 // We may have collected some prototypes to emit in the loop above.
2847 // Emit them now, before the function that uses them is emitted. But,
2848 // be careful not to emit them twice.
2849 std::vector<Function*>::iterator I = prototypesToGen.begin();
2850 std::vector<Function*>::iterator E = prototypesToGen.end();
2851 for ( ; I != E; ++I) {
2852 if (intrinsicPrototypesAlreadyGenerated.insert(*I).second) {
2854 printFunctionSignature(*I, true);
2860 void CWriter::visitCallInst(CallInst &I) {
2861 if (isa<InlineAsm>(I.getOperand(0)))
2862 return visitInlineAsm(I);
2864 bool WroteCallee = false;
2866 // Handle intrinsic function calls first...
2867 if (Function *F = I.getCalledFunction())
2868 if (Intrinsic::ID ID = (Intrinsic::ID)F->getIntrinsicID())
2869 if (visitBuiltinCall(I, ID, WroteCallee))
2872 Value *Callee = I.getCalledValue();
2874 const PointerType *PTy = cast<PointerType>(Callee->getType());
2875 const FunctionType *FTy = cast<FunctionType>(PTy->getElementType());
2877 // If this is a call to a struct-return function, assign to the first
2878 // parameter instead of passing it to the call.
2879 const AttrListPtr &PAL = I.getAttributes();
2880 bool hasByVal = I.hasByValArgument();
2881 bool isStructRet = I.hasStructRetAttr();
2883 writeOperandDeref(I.getOperand(1));
2887 if (I.isTailCall()) Out << " /*tail*/ ";
2890 // If this is an indirect call to a struct return function, we need to cast
2891 // the pointer. Ditto for indirect calls with byval arguments.
2892 bool NeedsCast = (hasByVal || isStructRet) && !isa<Function>(Callee);
2894 // GCC is a real PITA. It does not permit codegening casts of functions to
2895 // function pointers if they are in a call (it generates a trap instruction
2896 // instead!). We work around this by inserting a cast to void* in between
2897 // the function and the function pointer cast. Unfortunately, we can't just
2898 // form the constant expression here, because the folder will immediately
2901 // Note finally, that this is completely unsafe. ANSI C does not guarantee
2902 // that void* and function pointers have the same size. :( To deal with this
2903 // in the common case, we handle casts where the number of arguments passed
2906 if (ConstantExpr *CE = dyn_cast<ConstantExpr>(Callee))
2908 if (Function *RF = dyn_cast<Function>(CE->getOperand(0))) {
2914 // Ok, just cast the pointer type.
2917 printStructReturnPointerFunctionType(Out, PAL,
2918 cast<PointerType>(I.getCalledValue()->getType()));
2920 printType(Out, I.getCalledValue()->getType(), false, "", true, PAL);
2922 printType(Out, I.getCalledValue()->getType());
2925 writeOperand(Callee);
2926 if (NeedsCast) Out << ')';
2931 unsigned NumDeclaredParams = FTy->getNumParams();
2933 CallSite::arg_iterator AI = I.op_begin()+1, AE = I.op_end();
2935 if (isStructRet) { // Skip struct return argument.
2940 bool PrintedArg = false;
2941 for (; AI != AE; ++AI, ++ArgNo) {
2942 if (PrintedArg) Out << ", ";
2943 if (ArgNo < NumDeclaredParams &&
2944 (*AI)->getType() != FTy->getParamType(ArgNo)) {
2946 printType(Out, FTy->getParamType(ArgNo),
2947 /*isSigned=*/PAL.paramHasAttr(ArgNo+1, Attribute::SExt));
2950 // Check if the argument is expected to be passed by value.
2951 if (I.paramHasAttr(ArgNo+1, Attribute::ByVal))
2952 writeOperandDeref(*AI);
2960 /// visitBuiltinCall - Handle the call to the specified builtin. Returns true
2961 /// if the entire call is handled, return false it it wasn't handled, and
2962 /// optionally set 'WroteCallee' if the callee has already been printed out.
2963 bool CWriter::visitBuiltinCall(CallInst &I, Intrinsic::ID ID,
2964 bool &WroteCallee) {
2967 // If this is an intrinsic that directly corresponds to a GCC
2968 // builtin, we emit it here.
2969 const char *BuiltinName = "";
2970 Function *F = I.getCalledFunction();
2971 #define GET_GCC_BUILTIN_NAME
2972 #include "llvm/Intrinsics.gen"
2973 #undef GET_GCC_BUILTIN_NAME
2974 assert(BuiltinName[0] && "Unknown LLVM intrinsic!");
2980 case Intrinsic::memory_barrier:
2981 Out << "__sync_synchronize()";
2983 case Intrinsic::vastart:
2986 Out << "va_start(*(va_list*)";
2987 writeOperand(I.getOperand(1));
2989 // Output the last argument to the enclosing function.
2990 if (I.getParent()->getParent()->arg_empty()) {
2991 cerr << "The C backend does not currently support zero "
2992 << "argument varargs functions, such as '"
2993 << I.getParent()->getParent()->getName() << "'!\n";
2996 writeOperand(--I.getParent()->getParent()->arg_end());
2999 case Intrinsic::vaend:
3000 if (!isa<ConstantPointerNull>(I.getOperand(1))) {
3001 Out << "0; va_end(*(va_list*)";
3002 writeOperand(I.getOperand(1));
3005 Out << "va_end(*(va_list*)0)";
3008 case Intrinsic::vacopy:
3010 Out << "va_copy(*(va_list*)";
3011 writeOperand(I.getOperand(1));
3012 Out << ", *(va_list*)";
3013 writeOperand(I.getOperand(2));
3016 case Intrinsic::returnaddress:
3017 Out << "__builtin_return_address(";
3018 writeOperand(I.getOperand(1));
3021 case Intrinsic::frameaddress:
3022 Out << "__builtin_frame_address(";
3023 writeOperand(I.getOperand(1));
3026 case Intrinsic::powi:
3027 Out << "__builtin_powi(";
3028 writeOperand(I.getOperand(1));
3030 writeOperand(I.getOperand(2));
3033 case Intrinsic::setjmp:
3034 Out << "setjmp(*(jmp_buf*)";
3035 writeOperand(I.getOperand(1));
3038 case Intrinsic::longjmp:
3039 Out << "longjmp(*(jmp_buf*)";
3040 writeOperand(I.getOperand(1));
3042 writeOperand(I.getOperand(2));
3045 case Intrinsic::prefetch:
3046 Out << "LLVM_PREFETCH((const void *)";
3047 writeOperand(I.getOperand(1));
3049 writeOperand(I.getOperand(2));
3051 writeOperand(I.getOperand(3));
3054 case Intrinsic::stacksave:
3055 // Emit this as: Val = 0; *((void**)&Val) = __builtin_stack_save()
3056 // to work around GCC bugs (see PR1809).
3057 Out << "0; *((void**)&" << GetValueName(&I)
3058 << ") = __builtin_stack_save()";
3060 case Intrinsic::dbg_stoppoint: {
3061 // If we use writeOperand directly we get a "u" suffix which is rejected
3063 std::stringstream SPIStr;
3064 DbgStopPointInst &SPI = cast<DbgStopPointInst>(I);
3065 SPI.getDirectory()->print(SPIStr);
3069 Out << SPIStr.str();
3071 SPI.getFileName()->print(SPIStr);
3072 Out << SPIStr.str() << "\"\n";
3075 case Intrinsic::x86_sse_cmp_ss:
3076 case Intrinsic::x86_sse_cmp_ps:
3077 case Intrinsic::x86_sse2_cmp_sd:
3078 case Intrinsic::x86_sse2_cmp_pd:
3080 printType(Out, I.getType());
3082 // Multiple GCC builtins multiplex onto this intrinsic.
3083 switch (cast<ConstantInt>(I.getOperand(3))->getZExtValue()) {
3084 default: assert(0 && "Invalid llvm.x86.sse.cmp!");
3085 case 0: Out << "__builtin_ia32_cmpeq"; break;
3086 case 1: Out << "__builtin_ia32_cmplt"; break;
3087 case 2: Out << "__builtin_ia32_cmple"; break;
3088 case 3: Out << "__builtin_ia32_cmpunord"; break;
3089 case 4: Out << "__builtin_ia32_cmpneq"; break;
3090 case 5: Out << "__builtin_ia32_cmpnlt"; break;
3091 case 6: Out << "__builtin_ia32_cmpnle"; break;
3092 case 7: Out << "__builtin_ia32_cmpord"; break;
3094 if (ID == Intrinsic::x86_sse_cmp_ps || ID == Intrinsic::x86_sse2_cmp_pd)
3098 if (ID == Intrinsic::x86_sse_cmp_ss || ID == Intrinsic::x86_sse_cmp_ps)
3104 writeOperand(I.getOperand(1));
3106 writeOperand(I.getOperand(2));
3109 case Intrinsic::ppc_altivec_lvsl:
3111 printType(Out, I.getType());
3113 Out << "__builtin_altivec_lvsl(0, (void*)";
3114 writeOperand(I.getOperand(1));
3120 //This converts the llvm constraint string to something gcc is expecting.
3121 //TODO: work out platform independent constraints and factor those out
3122 // of the per target tables
3123 // handle multiple constraint codes
3124 std::string CWriter::InterpretASMConstraint(InlineAsm::ConstraintInfo& c) {
3126 assert(c.Codes.size() == 1 && "Too many asm constraint codes to handle");
3128 const char *const *table = 0;
3130 //Grab the translation table from TargetAsmInfo if it exists
3133 const TargetMachineRegistry::entry* Match =
3134 TargetMachineRegistry::getClosestStaticTargetForModule(*TheModule, E);
3136 //Per platform Target Machines don't exist, so create it
3137 // this must be done only once
3138 const TargetMachine* TM = Match->CtorFn(*TheModule, "");
3139 TAsm = TM->getTargetAsmInfo();
3143 table = TAsm->getAsmCBE();
3145 //Search the translation table if it exists
3146 for (int i = 0; table && table[i]; i += 2)
3147 if (c.Codes[0] == table[i])
3150 //default is identity
3154 //TODO: import logic from AsmPrinter.cpp
3155 static std::string gccifyAsm(std::string asmstr) {
3156 for (std::string::size_type i = 0; i != asmstr.size(); ++i)
3157 if (asmstr[i] == '\n')
3158 asmstr.replace(i, 1, "\\n");
3159 else if (asmstr[i] == '\t')
3160 asmstr.replace(i, 1, "\\t");
3161 else if (asmstr[i] == '$') {
3162 if (asmstr[i + 1] == '{') {
3163 std::string::size_type a = asmstr.find_first_of(':', i + 1);
3164 std::string::size_type b = asmstr.find_first_of('}', i + 1);
3165 std::string n = "%" +
3166 asmstr.substr(a + 1, b - a - 1) +
3167 asmstr.substr(i + 2, a - i - 2);
3168 asmstr.replace(i, b - i + 1, n);
3171 asmstr.replace(i, 1, "%");
3173 else if (asmstr[i] == '%')//grr
3174 { asmstr.replace(i, 1, "%%"); ++i;}
3179 //TODO: assumptions about what consume arguments from the call are likely wrong
3180 // handle communitivity
3181 void CWriter::visitInlineAsm(CallInst &CI) {
3182 InlineAsm* as = cast<InlineAsm>(CI.getOperand(0));
3183 std::vector<InlineAsm::ConstraintInfo> Constraints = as->ParseConstraints();
3185 std::vector<std::pair<Value*, int> > ResultVals;
3186 if (CI.getType() == Type::VoidTy)
3188 else if (const StructType *ST = dyn_cast<StructType>(CI.getType())) {
3189 for (unsigned i = 0, e = ST->getNumElements(); i != e; ++i)
3190 ResultVals.push_back(std::make_pair(&CI, (int)i));
3192 ResultVals.push_back(std::make_pair(&CI, -1));
3195 // Fix up the asm string for gcc and emit it.
3196 Out << "__asm__ volatile (\"" << gccifyAsm(as->getAsmString()) << "\"\n";
3199 unsigned ValueCount = 0;
3200 bool IsFirst = true;
3202 // Convert over all the output constraints.
3203 for (std::vector<InlineAsm::ConstraintInfo>::iterator I = Constraints.begin(),
3204 E = Constraints.end(); I != E; ++I) {
3206 if (I->Type != InlineAsm::isOutput) {
3208 continue; // Ignore non-output constraints.
3211 assert(I->Codes.size() == 1 && "Too many asm constraint codes to handle");
3212 std::string C = InterpretASMConstraint(*I);
3213 if (C.empty()) continue;
3224 if (ValueCount < ResultVals.size()) {
3225 DestVal = ResultVals[ValueCount].first;
3226 DestValNo = ResultVals[ValueCount].second;
3228 DestVal = CI.getOperand(ValueCount-ResultVals.size()+1);
3230 if (I->isEarlyClobber)
3233 Out << "\"=" << C << "\"(" << GetValueName(DestVal);
3234 if (DestValNo != -1)
3235 Out << ".field" << DestValNo; // Multiple retvals.
3241 // Convert over all the input constraints.
3245 for (std::vector<InlineAsm::ConstraintInfo>::iterator I = Constraints.begin(),
3246 E = Constraints.end(); I != E; ++I) {
3247 if (I->Type != InlineAsm::isInput) {
3249 continue; // Ignore non-input constraints.
3252 assert(I->Codes.size() == 1 && "Too many asm constraint codes to handle");
3253 std::string C = InterpretASMConstraint(*I);
3254 if (C.empty()) continue;
3261 assert(ValueCount >= ResultVals.size() && "Input can't refer to result");
3262 Value *SrcVal = CI.getOperand(ValueCount-ResultVals.size()+1);
3264 Out << "\"" << C << "\"(";
3266 writeOperand(SrcVal);
3268 writeOperandDeref(SrcVal);
3272 // Convert over the clobber constraints.
3275 for (std::vector<InlineAsm::ConstraintInfo>::iterator I = Constraints.begin(),
3276 E = Constraints.end(); I != E; ++I) {
3277 if (I->Type != InlineAsm::isClobber)
3278 continue; // Ignore non-input constraints.
3280 assert(I->Codes.size() == 1 && "Too many asm constraint codes to handle");
3281 std::string C = InterpretASMConstraint(*I);
3282 if (C.empty()) continue;
3289 Out << '\"' << C << '"';
3295 void CWriter::visitMallocInst(MallocInst &I) {
3296 assert(0 && "lowerallocations pass didn't work!");
3299 void CWriter::visitAllocaInst(AllocaInst &I) {
3301 printType(Out, I.getType());
3302 Out << ") alloca(sizeof(";
3303 printType(Out, I.getType()->getElementType());
3305 if (I.isArrayAllocation()) {
3307 writeOperand(I.getOperand(0));
3312 void CWriter::visitFreeInst(FreeInst &I) {
3313 assert(0 && "lowerallocations pass didn't work!");
3316 void CWriter::printGEPExpression(Value *Ptr, gep_type_iterator I,
3317 gep_type_iterator E, bool Static) {
3319 // If there are no indices, just print out the pointer.
3325 // Find out if the last index is into a vector. If so, we have to print this
3326 // specially. Since vectors can't have elements of indexable type, only the
3327 // last index could possibly be of a vector element.
3328 const VectorType *LastIndexIsVector = 0;
3330 for (gep_type_iterator TmpI = I; TmpI != E; ++TmpI)
3331 LastIndexIsVector = dyn_cast<VectorType>(*TmpI);
3336 // If the last index is into a vector, we can't print it as &a[i][j] because
3337 // we can't index into a vector with j in GCC. Instead, emit this as
3338 // (((float*)&a[i])+j)
3339 if (LastIndexIsVector) {
3341 printType(Out, PointerType::getUnqual(LastIndexIsVector->getElementType()));
3347 // If the first index is 0 (very typical) we can do a number of
3348 // simplifications to clean up the code.
3349 Value *FirstOp = I.getOperand();
3350 if (!isa<Constant>(FirstOp) || !cast<Constant>(FirstOp)->isNullValue()) {
3351 // First index isn't simple, print it the hard way.
3354 ++I; // Skip the zero index.
3356 // Okay, emit the first operand. If Ptr is something that is already address
3357 // exposed, like a global, avoid emitting (&foo)[0], just emit foo instead.
3358 if (isAddressExposed(Ptr)) {
3359 writeOperandInternal(Ptr, Static);
3360 } else if (I != E && isa<StructType>(*I)) {
3361 // If we didn't already emit the first operand, see if we can print it as
3362 // P->f instead of "P[0].f"
3364 Out << "->field" << cast<ConstantInt>(I.getOperand())->getZExtValue();
3365 ++I; // eat the struct index as well.
3367 // Instead of emitting P[0][1], emit (*P)[1], which is more idiomatic.
3374 for (; I != E; ++I) {
3375 if (isa<StructType>(*I)) {
3376 Out << ".field" << cast<ConstantInt>(I.getOperand())->getZExtValue();
3377 } else if (isa<ArrayType>(*I)) {
3379 writeOperandWithCast(I.getOperand(), Instruction::GetElementPtr);
3381 } else if (!isa<VectorType>(*I)) {
3383 writeOperandWithCast(I.getOperand(), Instruction::GetElementPtr);
3386 // If the last index is into a vector, then print it out as "+j)". This
3387 // works with the 'LastIndexIsVector' code above.
3388 if (isa<Constant>(I.getOperand()) &&
3389 cast<Constant>(I.getOperand())->isNullValue()) {
3390 Out << "))"; // avoid "+0".
3393 writeOperandWithCast(I.getOperand(), Instruction::GetElementPtr);
3401 void CWriter::writeMemoryAccess(Value *Operand, const Type *OperandType,
3402 bool IsVolatile, unsigned Alignment) {
3404 bool IsUnaligned = Alignment &&
3405 Alignment < TD->getABITypeAlignment(OperandType);
3409 if (IsVolatile || IsUnaligned) {
3412 Out << "struct __attribute__ ((packed, aligned(" << Alignment << "))) {";
3413 printType(Out, OperandType, false, IsUnaligned ? "data" : "volatile*");
3416 if (IsVolatile) Out << "volatile ";
3422 writeOperand(Operand);
3424 if (IsVolatile || IsUnaligned) {
3431 void CWriter::visitLoadInst(LoadInst &I) {
3432 writeMemoryAccess(I.getOperand(0), I.getType(), I.isVolatile(),
3437 void CWriter::visitStoreInst(StoreInst &I) {
3438 writeMemoryAccess(I.getPointerOperand(), I.getOperand(0)->getType(),
3439 I.isVolatile(), I.getAlignment());
3441 Value *Operand = I.getOperand(0);
3442 Constant *BitMask = 0;
3443 if (const IntegerType* ITy = dyn_cast<IntegerType>(Operand->getType()))
3444 if (!ITy->isPowerOf2ByteWidth())
3445 // We have a bit width that doesn't match an even power-of-2 byte
3446 // size. Consequently we must & the value with the type's bit mask
3447 BitMask = ConstantInt::get(ITy, ITy->getBitMask());
3450 writeOperand(Operand);
3453 printConstant(BitMask, false);
3458 void CWriter::visitGetElementPtrInst(GetElementPtrInst &I) {
3459 printGEPExpression(I.getPointerOperand(), gep_type_begin(I),
3460 gep_type_end(I), false);
3463 void CWriter::visitVAArgInst(VAArgInst &I) {
3464 Out << "va_arg(*(va_list*)";
3465 writeOperand(I.getOperand(0));
3467 printType(Out, I.getType());
3471 void CWriter::visitInsertElementInst(InsertElementInst &I) {
3472 const Type *EltTy = I.getType()->getElementType();
3473 writeOperand(I.getOperand(0));
3476 printType(Out, PointerType::getUnqual(EltTy));
3477 Out << ")(&" << GetValueName(&I) << "))[";
3478 writeOperand(I.getOperand(2));
3480 writeOperand(I.getOperand(1));
3484 void CWriter::visitExtractElementInst(ExtractElementInst &I) {
3485 // We know that our operand is not inlined.
3488 cast<VectorType>(I.getOperand(0)->getType())->getElementType();
3489 printType(Out, PointerType::getUnqual(EltTy));
3490 Out << ")(&" << GetValueName(I.getOperand(0)) << "))[";
3491 writeOperand(I.getOperand(1));
3495 void CWriter::visitShuffleVectorInst(ShuffleVectorInst &SVI) {
3497 printType(Out, SVI.getType());
3499 const VectorType *VT = SVI.getType();
3500 unsigned NumElts = VT->getNumElements();
3501 const Type *EltTy = VT->getElementType();
3503 for (unsigned i = 0; i != NumElts; ++i) {
3505 int SrcVal = SVI.getMaskValue(i);
3506 if ((unsigned)SrcVal >= NumElts*2) {
3507 Out << " 0/*undef*/ ";
3509 Value *Op = SVI.getOperand((unsigned)SrcVal >= NumElts);
3510 if (isa<Instruction>(Op)) {
3511 // Do an extractelement of this value from the appropriate input.
3513 printType(Out, PointerType::getUnqual(EltTy));
3514 Out << ")(&" << GetValueName(Op)
3515 << "))[" << (SrcVal & (NumElts-1)) << "]";
3516 } else if (isa<ConstantAggregateZero>(Op) || isa<UndefValue>(Op)) {
3519 printConstant(cast<ConstantVector>(Op)->getOperand(SrcVal &
3528 void CWriter::visitInsertValueInst(InsertValueInst &IVI) {
3529 // Start by copying the entire aggregate value into the result variable.
3530 writeOperand(IVI.getOperand(0));
3533 // Then do the insert to update the field.
3534 Out << GetValueName(&IVI);
3535 for (const unsigned *b = IVI.idx_begin(), *i = b, *e = IVI.idx_end();
3537 const Type *IndexedTy =
3538 ExtractValueInst::getIndexedType(IVI.getOperand(0)->getType(), b, i+1);
3539 if (isa<ArrayType>(IndexedTy))
3540 Out << ".array[" << *i << "]";
3542 Out << ".field" << *i;
3545 writeOperand(IVI.getOperand(1));
3548 void CWriter::visitExtractValueInst(ExtractValueInst &EVI) {
3550 if (isa<UndefValue>(EVI.getOperand(0))) {
3552 printType(Out, EVI.getType());
3553 Out << ") 0/*UNDEF*/";
3555 Out << GetValueName(EVI.getOperand(0));
3556 for (const unsigned *b = EVI.idx_begin(), *i = b, *e = EVI.idx_end();
3558 const Type *IndexedTy =
3559 ExtractValueInst::getIndexedType(EVI.getOperand(0)->getType(), b, i+1);
3560 if (isa<ArrayType>(IndexedTy))
3561 Out << ".array[" << *i << "]";
3563 Out << ".field" << *i;
3569 //===----------------------------------------------------------------------===//
3570 // External Interface declaration
3571 //===----------------------------------------------------------------------===//
3573 bool CTargetMachine::addPassesToEmitWholeFile(PassManager &PM,
3575 CodeGenFileType FileType,
3577 if (FileType != TargetMachine::AssemblyFile) return true;
3579 PM.add(createGCLoweringPass());
3580 PM.add(createLowerAllocationsPass(true));
3581 PM.add(createLowerInvokePass());
3582 PM.add(createCFGSimplificationPass()); // clean up after lower invoke.
3583 PM.add(new CBackendNameAllUsedStructsAndMergeFunctions());
3584 PM.add(new CWriter(o));
3585 PM.add(createGCInfoDeleter());