1 //===-- CBackend.cpp - Library for converting LLVM code to C --------------===//
3 // The LLVM Compiler Infrastructure
5 // This file is distributed under the University of Illinois Open Source
6 // License. See LICENSE.TXT for details.
8 //===----------------------------------------------------------------------===//
10 // This library converts LLVM code to C code, compilable by GCC and other C
13 //===----------------------------------------------------------------------===//
15 #include "CTargetMachine.h"
16 #include "llvm/CallingConv.h"
17 #include "llvm/Constants.h"
18 #include "llvm/DerivedTypes.h"
19 #include "llvm/Module.h"
20 #include "llvm/Instructions.h"
21 #include "llvm/Pass.h"
22 #include "llvm/PassManager.h"
23 #include "llvm/TypeSymbolTable.h"
24 #include "llvm/Intrinsics.h"
25 #include "llvm/IntrinsicInst.h"
26 #include "llvm/InlineAsm.h"
27 #include "llvm/Analysis/ConstantsScanner.h"
28 #include "llvm/Analysis/FindUsedTypes.h"
29 #include "llvm/Analysis/LoopInfo.h"
30 #include "llvm/CodeGen/Passes.h"
31 #include "llvm/CodeGen/IntrinsicLowering.h"
32 #include "llvm/Transforms/Scalar.h"
33 #include "llvm/Target/TargetMachineRegistry.h"
34 #include "llvm/Target/TargetAsmInfo.h"
35 #include "llvm/Target/TargetData.h"
36 #include "llvm/Support/CallSite.h"
37 #include "llvm/Support/CFG.h"
38 #include "llvm/Support/GetElementPtrTypeIterator.h"
39 #include "llvm/Support/InstVisitor.h"
40 #include "llvm/Support/Mangler.h"
41 #include "llvm/Support/MathExtras.h"
42 #include "llvm/Support/raw_ostream.h"
43 #include "llvm/ADT/StringExtras.h"
44 #include "llvm/ADT/STLExtras.h"
45 #include "llvm/Support/MathExtras.h"
46 #include "llvm/Config/config.h"
51 /// CBackendTargetMachineModule - Note that this is used on hosts that
52 /// cannot link in a library unless there are references into the
53 /// library. In particular, it seems that it is not possible to get
54 /// things to work on Win32 without this. Though it is unused, do not
56 extern "C" int CBackendTargetMachineModule;
57 int CBackendTargetMachineModule = 0;
59 // Register the target.
60 static RegisterTarget<CTargetMachine> X("c", "C backend");
62 // Force static initialization.
63 extern "C" void LLVMInitializeCBackendTarget() { }
66 /// CBackendNameAllUsedStructsAndMergeFunctions - This pass inserts names for
67 /// any unnamed structure types that are used by the program, and merges
68 /// external functions with the same name.
70 class CBackendNameAllUsedStructsAndMergeFunctions : public ModulePass {
73 CBackendNameAllUsedStructsAndMergeFunctions()
75 void getAnalysisUsage(AnalysisUsage &AU) const {
76 AU.addRequired<FindUsedTypes>();
79 virtual const char *getPassName() const {
80 return "C backend type canonicalizer";
83 virtual bool runOnModule(Module &M);
86 char CBackendNameAllUsedStructsAndMergeFunctions::ID = 0;
88 /// CWriter - This class is the main chunk of code that converts an LLVM
89 /// module to a C translation unit.
90 class CWriter : public FunctionPass, public InstVisitor<CWriter> {
92 IntrinsicLowering *IL;
95 const Module *TheModule;
96 const TargetAsmInfo* TAsm;
98 std::map<const Type *, std::string> TypeNames;
99 std::map<const ConstantFP *, unsigned> FPConstantMap;
100 std::set<Function*> intrinsicPrototypesAlreadyGenerated;
101 std::set<const Argument*> ByValParams;
103 unsigned OpaqueCounter;
107 explicit CWriter(raw_ostream &o)
108 : FunctionPass(&ID), Out(o), IL(0), Mang(0), LI(0),
109 TheModule(0), TAsm(0), TD(0), OpaqueCounter(0) {
113 virtual const char *getPassName() const { return "C backend"; }
115 void getAnalysisUsage(AnalysisUsage &AU) const {
116 AU.addRequired<LoopInfo>();
117 AU.setPreservesAll();
120 virtual bool doInitialization(Module &M);
122 bool runOnFunction(Function &F) {
123 // Do not codegen any 'available_externally' functions at all, they have
124 // definitions outside the translation unit.
125 if (F.hasAvailableExternallyLinkage())
128 LI = &getAnalysis<LoopInfo>();
130 // Get rid of intrinsics we can't handle.
133 // Output all floating point constants that cannot be printed accurately.
134 printFloatingPointConstants(F);
140 virtual bool doFinalization(Module &M) {
145 FPConstantMap.clear();
148 intrinsicPrototypesAlreadyGenerated.clear();
152 raw_ostream &printType(raw_ostream &Out, const Type *Ty,
153 bool isSigned = false,
154 const std::string &VariableName = "",
155 bool IgnoreName = false,
156 const AttrListPtr &PAL = AttrListPtr());
157 std::ostream &printType(std::ostream &Out, const Type *Ty,
158 bool isSigned = false,
159 const std::string &VariableName = "",
160 bool IgnoreName = false,
161 const AttrListPtr &PAL = AttrListPtr());
162 raw_ostream &printSimpleType(raw_ostream &Out, const Type *Ty,
164 const std::string &NameSoFar = "");
165 std::ostream &printSimpleType(std::ostream &Out, const Type *Ty,
167 const std::string &NameSoFar = "");
169 void printStructReturnPointerFunctionType(raw_ostream &Out,
170 const AttrListPtr &PAL,
171 const PointerType *Ty);
173 /// writeOperandDeref - Print the result of dereferencing the specified
174 /// operand with '*'. This is equivalent to printing '*' then using
175 /// writeOperand, but avoids excess syntax in some cases.
176 void writeOperandDeref(Value *Operand) {
177 if (isAddressExposed(Operand)) {
178 // Already something with an address exposed.
179 writeOperandInternal(Operand);
182 writeOperand(Operand);
187 void writeOperand(Value *Operand, bool Static = false);
188 void writeInstComputationInline(Instruction &I);
189 void writeOperandInternal(Value *Operand, bool Static = false);
190 void writeOperandWithCast(Value* Operand, unsigned Opcode);
191 void writeOperandWithCast(Value* Operand, const ICmpInst &I);
192 bool writeInstructionCast(const Instruction &I);
194 void writeMemoryAccess(Value *Operand, const Type *OperandType,
195 bool IsVolatile, unsigned Alignment);
198 std::string InterpretASMConstraint(InlineAsm::ConstraintInfo& c);
200 void lowerIntrinsics(Function &F);
202 void printModule(Module *M);
203 void printModuleTypes(const TypeSymbolTable &ST);
204 void printContainedStructs(const Type *Ty, std::set<const Type *> &);
205 void printFloatingPointConstants(Function &F);
206 void printFloatingPointConstants(const Constant *C);
207 void printFunctionSignature(const Function *F, bool Prototype);
209 void printFunction(Function &);
210 void printBasicBlock(BasicBlock *BB);
211 void printLoop(Loop *L);
213 void printCast(unsigned opcode, const Type *SrcTy, const Type *DstTy);
214 void printConstant(Constant *CPV, bool Static);
215 void printConstantWithCast(Constant *CPV, unsigned Opcode);
216 bool printConstExprCast(const ConstantExpr *CE, bool Static);
217 void printConstantArray(ConstantArray *CPA, bool Static);
218 void printConstantVector(ConstantVector *CV, bool Static);
220 /// isAddressExposed - Return true if the specified value's name needs to
221 /// have its address taken in order to get a C value of the correct type.
222 /// This happens for global variables, byval parameters, and direct allocas.
223 bool isAddressExposed(const Value *V) const {
224 if (const Argument *A = dyn_cast<Argument>(V))
225 return ByValParams.count(A);
226 return isa<GlobalVariable>(V) || isDirectAlloca(V);
229 // isInlinableInst - Attempt to inline instructions into their uses to build
230 // trees as much as possible. To do this, we have to consistently decide
231 // what is acceptable to inline, so that variable declarations don't get
232 // printed and an extra copy of the expr is not emitted.
234 static bool isInlinableInst(const Instruction &I) {
235 // Always inline cmp instructions, even if they are shared by multiple
236 // expressions. GCC generates horrible code if we don't.
240 // Must be an expression, must be used exactly once. If it is dead, we
241 // emit it inline where it would go.
242 if (I.getType() == Type::VoidTy || !I.hasOneUse() ||
243 isa<TerminatorInst>(I) || isa<CallInst>(I) || isa<PHINode>(I) ||
244 isa<LoadInst>(I) || isa<VAArgInst>(I) || isa<InsertElementInst>(I) ||
245 isa<InsertValueInst>(I))
246 // Don't inline a load across a store or other bad things!
249 // Must not be used in inline asm, extractelement, or shufflevector.
251 const Instruction &User = cast<Instruction>(*I.use_back());
252 if (isInlineAsm(User) || isa<ExtractElementInst>(User) ||
253 isa<ShuffleVectorInst>(User))
257 // Only inline instruction it if it's use is in the same BB as the inst.
258 return I.getParent() == cast<Instruction>(I.use_back())->getParent();
261 // isDirectAlloca - Define fixed sized allocas in the entry block as direct
262 // variables which are accessed with the & operator. This causes GCC to
263 // generate significantly better code than to emit alloca calls directly.
265 static const AllocaInst *isDirectAlloca(const Value *V) {
266 const AllocaInst *AI = dyn_cast<AllocaInst>(V);
267 if (!AI) return false;
268 if (AI->isArrayAllocation())
269 return 0; // FIXME: we can also inline fixed size array allocas!
270 if (AI->getParent() != &AI->getParent()->getParent()->getEntryBlock())
275 // isInlineAsm - Check if the instruction is a call to an inline asm chunk
276 static bool isInlineAsm(const Instruction& I) {
277 if (isa<CallInst>(&I) && isa<InlineAsm>(I.getOperand(0)))
282 // Instruction visitation functions
283 friend class InstVisitor<CWriter>;
285 void visitReturnInst(ReturnInst &I);
286 void visitBranchInst(BranchInst &I);
287 void visitSwitchInst(SwitchInst &I);
288 void visitInvokeInst(InvokeInst &I) {
289 assert(0 && "Lowerinvoke pass didn't work!");
292 void visitUnwindInst(UnwindInst &I) {
293 assert(0 && "Lowerinvoke pass didn't work!");
295 void visitUnreachableInst(UnreachableInst &I);
297 void visitPHINode(PHINode &I);
298 void visitBinaryOperator(Instruction &I);
299 void visitICmpInst(ICmpInst &I);
300 void visitFCmpInst(FCmpInst &I);
302 void visitCastInst (CastInst &I);
303 void visitSelectInst(SelectInst &I);
304 void visitCallInst (CallInst &I);
305 void visitInlineAsm(CallInst &I);
306 bool visitBuiltinCall(CallInst &I, Intrinsic::ID ID, bool &WroteCallee);
308 void visitMallocInst(MallocInst &I);
309 void visitAllocaInst(AllocaInst &I);
310 void visitFreeInst (FreeInst &I);
311 void visitLoadInst (LoadInst &I);
312 void visitStoreInst (StoreInst &I);
313 void visitGetElementPtrInst(GetElementPtrInst &I);
314 void visitVAArgInst (VAArgInst &I);
316 void visitInsertElementInst(InsertElementInst &I);
317 void visitExtractElementInst(ExtractElementInst &I);
318 void visitShuffleVectorInst(ShuffleVectorInst &SVI);
320 void visitInsertValueInst(InsertValueInst &I);
321 void visitExtractValueInst(ExtractValueInst &I);
323 void visitInstruction(Instruction &I) {
324 cerr << "C Writer does not know about " << I;
328 void outputLValue(Instruction *I) {
329 Out << " " << GetValueName(I) << " = ";
332 bool isGotoCodeNecessary(BasicBlock *From, BasicBlock *To);
333 void printPHICopiesForSuccessor(BasicBlock *CurBlock,
334 BasicBlock *Successor, unsigned Indent);
335 void printBranchToBlock(BasicBlock *CurBlock, BasicBlock *SuccBlock,
337 void printGEPExpression(Value *Ptr, gep_type_iterator I,
338 gep_type_iterator E, bool Static);
340 std::string GetValueName(const Value *Operand);
344 char CWriter::ID = 0;
346 /// This method inserts names for any unnamed structure types that are used by
347 /// the program, and removes names from structure types that are not used by the
350 bool CBackendNameAllUsedStructsAndMergeFunctions::runOnModule(Module &M) {
351 // Get a set of types that are used by the program...
352 std::set<const Type *> UT = getAnalysis<FindUsedTypes>().getTypes();
354 // Loop over the module symbol table, removing types from UT that are
355 // already named, and removing names for types that are not used.
357 TypeSymbolTable &TST = M.getTypeSymbolTable();
358 for (TypeSymbolTable::iterator TI = TST.begin(), TE = TST.end();
360 TypeSymbolTable::iterator I = TI++;
362 // If this isn't a struct or array type, remove it from our set of types
363 // to name. This simplifies emission later.
364 if (!isa<StructType>(I->second) && !isa<OpaqueType>(I->second) &&
365 !isa<ArrayType>(I->second)) {
368 // If this is not used, remove it from the symbol table.
369 std::set<const Type *>::iterator UTI = UT.find(I->second);
373 UT.erase(UTI); // Only keep one name for this type.
377 // UT now contains types that are not named. Loop over it, naming
380 bool Changed = false;
381 unsigned RenameCounter = 0;
382 for (std::set<const Type *>::const_iterator I = UT.begin(), E = UT.end();
384 if (isa<StructType>(*I) || isa<ArrayType>(*I)) {
385 while (M.addTypeName("unnamed"+utostr(RenameCounter), *I))
391 // Loop over all external functions and globals. If we have two with
392 // identical names, merge them.
393 // FIXME: This code should disappear when we don't allow values with the same
394 // names when they have different types!
395 std::map<std::string, GlobalValue*> ExtSymbols;
396 for (Module::iterator I = M.begin(), E = M.end(); I != E;) {
398 if (GV->isDeclaration() && GV->hasName()) {
399 std::pair<std::map<std::string, GlobalValue*>::iterator, bool> X
400 = ExtSymbols.insert(std::make_pair(GV->getName(), GV));
402 // Found a conflict, replace this global with the previous one.
403 GlobalValue *OldGV = X.first->second;
404 GV->replaceAllUsesWith(ConstantExpr::getBitCast(OldGV, GV->getType()));
405 GV->eraseFromParent();
410 // Do the same for globals.
411 for (Module::global_iterator I = M.global_begin(), E = M.global_end();
413 GlobalVariable *GV = I++;
414 if (GV->isDeclaration() && GV->hasName()) {
415 std::pair<std::map<std::string, GlobalValue*>::iterator, bool> X
416 = ExtSymbols.insert(std::make_pair(GV->getName(), GV));
418 // Found a conflict, replace this global with the previous one.
419 GlobalValue *OldGV = X.first->second;
420 GV->replaceAllUsesWith(ConstantExpr::getBitCast(OldGV, GV->getType()));
421 GV->eraseFromParent();
430 /// printStructReturnPointerFunctionType - This is like printType for a struct
431 /// return type, except, instead of printing the type as void (*)(Struct*, ...)
432 /// print it as "Struct (*)(...)", for struct return functions.
433 void CWriter::printStructReturnPointerFunctionType(raw_ostream &Out,
434 const AttrListPtr &PAL,
435 const PointerType *TheTy) {
436 const FunctionType *FTy = cast<FunctionType>(TheTy->getElementType());
437 std::stringstream FunctionInnards;
438 FunctionInnards << " (*) (";
439 bool PrintedType = false;
441 FunctionType::param_iterator I = FTy->param_begin(), E = FTy->param_end();
442 const Type *RetTy = cast<PointerType>(I->get())->getElementType();
444 for (++I, ++Idx; I != E; ++I, ++Idx) {
446 FunctionInnards << ", ";
447 const Type *ArgTy = *I;
448 if (PAL.paramHasAttr(Idx, Attribute::ByVal)) {
449 assert(isa<PointerType>(ArgTy));
450 ArgTy = cast<PointerType>(ArgTy)->getElementType();
452 printType(FunctionInnards, ArgTy,
453 /*isSigned=*/PAL.paramHasAttr(Idx, Attribute::SExt), "");
456 if (FTy->isVarArg()) {
458 FunctionInnards << ", ...";
459 } else if (!PrintedType) {
460 FunctionInnards << "void";
462 FunctionInnards << ')';
463 std::string tstr = FunctionInnards.str();
464 printType(Out, RetTy,
465 /*isSigned=*/PAL.paramHasAttr(0, Attribute::SExt), tstr);
469 CWriter::printSimpleType(raw_ostream &Out, const Type *Ty, bool isSigned,
470 const std::string &NameSoFar) {
471 assert((Ty->isPrimitiveType() || Ty->isInteger() || isa<VectorType>(Ty)) &&
472 "Invalid type for printSimpleType");
473 switch (Ty->getTypeID()) {
474 case Type::VoidTyID: return Out << "void " << NameSoFar;
475 case Type::IntegerTyID: {
476 unsigned NumBits = cast<IntegerType>(Ty)->getBitWidth();
478 return Out << "bool " << NameSoFar;
479 else if (NumBits <= 8)
480 return Out << (isSigned?"signed":"unsigned") << " char " << NameSoFar;
481 else if (NumBits <= 16)
482 return Out << (isSigned?"signed":"unsigned") << " short " << NameSoFar;
483 else if (NumBits <= 32)
484 return Out << (isSigned?"signed":"unsigned") << " int " << NameSoFar;
485 else if (NumBits <= 64)
486 return Out << (isSigned?"signed":"unsigned") << " long long "<< NameSoFar;
488 assert(NumBits <= 128 && "Bit widths > 128 not implemented yet");
489 return Out << (isSigned?"llvmInt128":"llvmUInt128") << " " << NameSoFar;
492 case Type::FloatTyID: return Out << "float " << NameSoFar;
493 case Type::DoubleTyID: return Out << "double " << NameSoFar;
494 // Lacking emulation of FP80 on PPC, etc., we assume whichever of these is
495 // present matches host 'long double'.
496 case Type::X86_FP80TyID:
497 case Type::PPC_FP128TyID:
498 case Type::FP128TyID: return Out << "long double " << NameSoFar;
500 case Type::VectorTyID: {
501 const VectorType *VTy = cast<VectorType>(Ty);
502 return printSimpleType(Out, VTy->getElementType(), isSigned,
503 " __attribute__((vector_size(" +
504 utostr(TD->getTypeAllocSize(VTy)) + " ))) " + NameSoFar);
508 cerr << "Unknown primitive type: " << *Ty << "\n";
514 CWriter::printSimpleType(std::ostream &Out, const Type *Ty, bool isSigned,
515 const std::string &NameSoFar) {
516 assert((Ty->isPrimitiveType() || Ty->isInteger() || isa<VectorType>(Ty)) &&
517 "Invalid type for printSimpleType");
518 switch (Ty->getTypeID()) {
519 case Type::VoidTyID: return Out << "void " << NameSoFar;
520 case Type::IntegerTyID: {
521 unsigned NumBits = cast<IntegerType>(Ty)->getBitWidth();
523 return Out << "bool " << NameSoFar;
524 else if (NumBits <= 8)
525 return Out << (isSigned?"signed":"unsigned") << " char " << NameSoFar;
526 else if (NumBits <= 16)
527 return Out << (isSigned?"signed":"unsigned") << " short " << NameSoFar;
528 else if (NumBits <= 32)
529 return Out << (isSigned?"signed":"unsigned") << " int " << NameSoFar;
530 else if (NumBits <= 64)
531 return Out << (isSigned?"signed":"unsigned") << " long long "<< NameSoFar;
533 assert(NumBits <= 128 && "Bit widths > 128 not implemented yet");
534 return Out << (isSigned?"llvmInt128":"llvmUInt128") << " " << NameSoFar;
537 case Type::FloatTyID: return Out << "float " << NameSoFar;
538 case Type::DoubleTyID: return Out << "double " << NameSoFar;
539 // Lacking emulation of FP80 on PPC, etc., we assume whichever of these is
540 // present matches host 'long double'.
541 case Type::X86_FP80TyID:
542 case Type::PPC_FP128TyID:
543 case Type::FP128TyID: return Out << "long double " << NameSoFar;
545 case Type::VectorTyID: {
546 const VectorType *VTy = cast<VectorType>(Ty);
547 return printSimpleType(Out, VTy->getElementType(), isSigned,
548 " __attribute__((vector_size(" +
549 utostr(TD->getTypeAllocSize(VTy)) + " ))) " + NameSoFar);
553 cerr << "Unknown primitive type: " << *Ty << "\n";
558 // Pass the Type* and the variable name and this prints out the variable
561 raw_ostream &CWriter::printType(raw_ostream &Out, const Type *Ty,
562 bool isSigned, const std::string &NameSoFar,
563 bool IgnoreName, const AttrListPtr &PAL) {
564 if (Ty->isPrimitiveType() || Ty->isInteger() || isa<VectorType>(Ty)) {
565 printSimpleType(Out, Ty, isSigned, NameSoFar);
569 // Check to see if the type is named.
570 if (!IgnoreName || isa<OpaqueType>(Ty)) {
571 std::map<const Type *, std::string>::iterator I = TypeNames.find(Ty);
572 if (I != TypeNames.end()) return Out << I->second << ' ' << NameSoFar;
575 switch (Ty->getTypeID()) {
576 case Type::FunctionTyID: {
577 const FunctionType *FTy = cast<FunctionType>(Ty);
578 std::stringstream FunctionInnards;
579 FunctionInnards << " (" << NameSoFar << ") (";
581 for (FunctionType::param_iterator I = FTy->param_begin(),
582 E = FTy->param_end(); I != E; ++I) {
583 const Type *ArgTy = *I;
584 if (PAL.paramHasAttr(Idx, Attribute::ByVal)) {
585 assert(isa<PointerType>(ArgTy));
586 ArgTy = cast<PointerType>(ArgTy)->getElementType();
588 if (I != FTy->param_begin())
589 FunctionInnards << ", ";
590 printType(FunctionInnards, ArgTy,
591 /*isSigned=*/PAL.paramHasAttr(Idx, Attribute::SExt), "");
594 if (FTy->isVarArg()) {
595 if (FTy->getNumParams())
596 FunctionInnards << ", ...";
597 } else if (!FTy->getNumParams()) {
598 FunctionInnards << "void";
600 FunctionInnards << ')';
601 std::string tstr = FunctionInnards.str();
602 printType(Out, FTy->getReturnType(),
603 /*isSigned=*/PAL.paramHasAttr(0, Attribute::SExt), tstr);
606 case Type::StructTyID: {
607 const StructType *STy = cast<StructType>(Ty);
608 Out << NameSoFar + " {\n";
610 for (StructType::element_iterator I = STy->element_begin(),
611 E = STy->element_end(); I != E; ++I) {
613 printType(Out, *I, false, "field" + utostr(Idx++));
618 Out << " __attribute__ ((packed))";
622 case Type::PointerTyID: {
623 const PointerType *PTy = cast<PointerType>(Ty);
624 std::string ptrName = "*" + NameSoFar;
626 if (isa<ArrayType>(PTy->getElementType()) ||
627 isa<VectorType>(PTy->getElementType()))
628 ptrName = "(" + ptrName + ")";
631 // Must be a function ptr cast!
632 return printType(Out, PTy->getElementType(), false, ptrName, true, PAL);
633 return printType(Out, PTy->getElementType(), false, ptrName);
636 case Type::ArrayTyID: {
637 const ArrayType *ATy = cast<ArrayType>(Ty);
638 unsigned NumElements = ATy->getNumElements();
639 if (NumElements == 0) NumElements = 1;
640 // Arrays are wrapped in structs to allow them to have normal
641 // value semantics (avoiding the array "decay").
642 Out << NameSoFar << " { ";
643 printType(Out, ATy->getElementType(), false,
644 "array[" + utostr(NumElements) + "]");
648 case Type::OpaqueTyID: {
649 std::string TyName = "struct opaque_" + itostr(OpaqueCounter++);
650 assert(TypeNames.find(Ty) == TypeNames.end());
651 TypeNames[Ty] = TyName;
652 return Out << TyName << ' ' << NameSoFar;
655 assert(0 && "Unhandled case in getTypeProps!");
662 // Pass the Type* and the variable name and this prints out the variable
665 std::ostream &CWriter::printType(std::ostream &Out, const Type *Ty,
666 bool isSigned, const std::string &NameSoFar,
667 bool IgnoreName, const AttrListPtr &PAL) {
668 if (Ty->isPrimitiveType() || Ty->isInteger() || isa<VectorType>(Ty)) {
669 printSimpleType(Out, Ty, isSigned, NameSoFar);
673 // Check to see if the type is named.
674 if (!IgnoreName || isa<OpaqueType>(Ty)) {
675 std::map<const Type *, std::string>::iterator I = TypeNames.find(Ty);
676 if (I != TypeNames.end()) return Out << I->second << ' ' << NameSoFar;
679 switch (Ty->getTypeID()) {
680 case Type::FunctionTyID: {
681 const FunctionType *FTy = cast<FunctionType>(Ty);
682 std::stringstream FunctionInnards;
683 FunctionInnards << " (" << NameSoFar << ") (";
685 for (FunctionType::param_iterator I = FTy->param_begin(),
686 E = FTy->param_end(); I != E; ++I) {
687 const Type *ArgTy = *I;
688 if (PAL.paramHasAttr(Idx, Attribute::ByVal)) {
689 assert(isa<PointerType>(ArgTy));
690 ArgTy = cast<PointerType>(ArgTy)->getElementType();
692 if (I != FTy->param_begin())
693 FunctionInnards << ", ";
694 printType(FunctionInnards, ArgTy,
695 /*isSigned=*/PAL.paramHasAttr(Idx, Attribute::SExt), "");
698 if (FTy->isVarArg()) {
699 if (FTy->getNumParams())
700 FunctionInnards << ", ...";
701 } else if (!FTy->getNumParams()) {
702 FunctionInnards << "void";
704 FunctionInnards << ')';
705 std::string tstr = FunctionInnards.str();
706 printType(Out, FTy->getReturnType(),
707 /*isSigned=*/PAL.paramHasAttr(0, Attribute::SExt), tstr);
710 case Type::StructTyID: {
711 const StructType *STy = cast<StructType>(Ty);
712 Out << NameSoFar + " {\n";
714 for (StructType::element_iterator I = STy->element_begin(),
715 E = STy->element_end(); I != E; ++I) {
717 printType(Out, *I, false, "field" + utostr(Idx++));
722 Out << " __attribute__ ((packed))";
726 case Type::PointerTyID: {
727 const PointerType *PTy = cast<PointerType>(Ty);
728 std::string ptrName = "*" + NameSoFar;
730 if (isa<ArrayType>(PTy->getElementType()) ||
731 isa<VectorType>(PTy->getElementType()))
732 ptrName = "(" + ptrName + ")";
735 // Must be a function ptr cast!
736 return printType(Out, PTy->getElementType(), false, ptrName, true, PAL);
737 return printType(Out, PTy->getElementType(), false, ptrName);
740 case Type::ArrayTyID: {
741 const ArrayType *ATy = cast<ArrayType>(Ty);
742 unsigned NumElements = ATy->getNumElements();
743 if (NumElements == 0) NumElements = 1;
744 // Arrays are wrapped in structs to allow them to have normal
745 // value semantics (avoiding the array "decay").
746 Out << NameSoFar << " { ";
747 printType(Out, ATy->getElementType(), false,
748 "array[" + utostr(NumElements) + "]");
752 case Type::OpaqueTyID: {
753 std::string TyName = "struct opaque_" + itostr(OpaqueCounter++);
754 assert(TypeNames.find(Ty) == TypeNames.end());
755 TypeNames[Ty] = TyName;
756 return Out << TyName << ' ' << NameSoFar;
759 assert(0 && "Unhandled case in getTypeProps!");
766 void CWriter::printConstantArray(ConstantArray *CPA, bool Static) {
768 // As a special case, print the array as a string if it is an array of
769 // ubytes or an array of sbytes with positive values.
771 const Type *ETy = CPA->getType()->getElementType();
772 bool isString = (ETy == Type::Int8Ty || ETy == Type::Int8Ty);
774 // Make sure the last character is a null char, as automatically added by C
775 if (isString && (CPA->getNumOperands() == 0 ||
776 !cast<Constant>(*(CPA->op_end()-1))->isNullValue()))
781 // Keep track of whether the last number was a hexadecimal escape
782 bool LastWasHex = false;
784 // Do not include the last character, which we know is null
785 for (unsigned i = 0, e = CPA->getNumOperands()-1; i != e; ++i) {
786 unsigned char C = cast<ConstantInt>(CPA->getOperand(i))->getZExtValue();
788 // Print it out literally if it is a printable character. The only thing
789 // to be careful about is when the last letter output was a hex escape
790 // code, in which case we have to be careful not to print out hex digits
791 // explicitly (the C compiler thinks it is a continuation of the previous
792 // character, sheesh...)
794 if (isprint(C) && (!LastWasHex || !isxdigit(C))) {
796 if (C == '"' || C == '\\')
797 Out << "\\" << (char)C;
803 case '\n': Out << "\\n"; break;
804 case '\t': Out << "\\t"; break;
805 case '\r': Out << "\\r"; break;
806 case '\v': Out << "\\v"; break;
807 case '\a': Out << "\\a"; break;
808 case '\"': Out << "\\\""; break;
809 case '\'': Out << "\\\'"; break;
812 Out << (char)(( C/16 < 10) ? ( C/16 +'0') : ( C/16 -10+'A'));
813 Out << (char)(((C&15) < 10) ? ((C&15)+'0') : ((C&15)-10+'A'));
822 if (CPA->getNumOperands()) {
824 printConstant(cast<Constant>(CPA->getOperand(0)), Static);
825 for (unsigned i = 1, e = CPA->getNumOperands(); i != e; ++i) {
827 printConstant(cast<Constant>(CPA->getOperand(i)), Static);
834 void CWriter::printConstantVector(ConstantVector *CP, bool Static) {
836 if (CP->getNumOperands()) {
838 printConstant(cast<Constant>(CP->getOperand(0)), Static);
839 for (unsigned i = 1, e = CP->getNumOperands(); i != e; ++i) {
841 printConstant(cast<Constant>(CP->getOperand(i)), Static);
847 // isFPCSafeToPrint - Returns true if we may assume that CFP may be written out
848 // textually as a double (rather than as a reference to a stack-allocated
849 // variable). We decide this by converting CFP to a string and back into a
850 // double, and then checking whether the conversion results in a bit-equal
851 // double to the original value of CFP. This depends on us and the target C
852 // compiler agreeing on the conversion process (which is pretty likely since we
853 // only deal in IEEE FP).
855 static bool isFPCSafeToPrint(const ConstantFP *CFP) {
857 // Do long doubles in hex for now.
858 if (CFP->getType() != Type::FloatTy && CFP->getType() != Type::DoubleTy)
860 APFloat APF = APFloat(CFP->getValueAPF()); // copy
861 if (CFP->getType() == Type::FloatTy)
862 APF.convert(APFloat::IEEEdouble, APFloat::rmNearestTiesToEven, &ignored);
863 #if HAVE_PRINTF_A && ENABLE_CBE_PRINTF_A
865 sprintf(Buffer, "%a", APF.convertToDouble());
866 if (!strncmp(Buffer, "0x", 2) ||
867 !strncmp(Buffer, "-0x", 3) ||
868 !strncmp(Buffer, "+0x", 3))
869 return APF.bitwiseIsEqual(APFloat(atof(Buffer)));
872 std::string StrVal = ftostr(APF);
874 while (StrVal[0] == ' ')
875 StrVal.erase(StrVal.begin());
877 // Check to make sure that the stringized number is not some string like "Inf"
878 // or NaN. Check that the string matches the "[-+]?[0-9]" regex.
879 if ((StrVal[0] >= '0' && StrVal[0] <= '9') ||
880 ((StrVal[0] == '-' || StrVal[0] == '+') &&
881 (StrVal[1] >= '0' && StrVal[1] <= '9')))
882 // Reparse stringized version!
883 return APF.bitwiseIsEqual(APFloat(atof(StrVal.c_str())));
888 /// Print out the casting for a cast operation. This does the double casting
889 /// necessary for conversion to the destination type, if necessary.
890 /// @brief Print a cast
891 void CWriter::printCast(unsigned opc, const Type *SrcTy, const Type *DstTy) {
892 // Print the destination type cast
894 case Instruction::UIToFP:
895 case Instruction::SIToFP:
896 case Instruction::IntToPtr:
897 case Instruction::Trunc:
898 case Instruction::BitCast:
899 case Instruction::FPExt:
900 case Instruction::FPTrunc: // For these the DstTy sign doesn't matter
902 printType(Out, DstTy);
905 case Instruction::ZExt:
906 case Instruction::PtrToInt:
907 case Instruction::FPToUI: // For these, make sure we get an unsigned dest
909 printSimpleType(Out, DstTy, false);
912 case Instruction::SExt:
913 case Instruction::FPToSI: // For these, make sure we get a signed dest
915 printSimpleType(Out, DstTy, true);
919 assert(0 && "Invalid cast opcode");
922 // Print the source type cast
924 case Instruction::UIToFP:
925 case Instruction::ZExt:
927 printSimpleType(Out, SrcTy, false);
930 case Instruction::SIToFP:
931 case Instruction::SExt:
933 printSimpleType(Out, SrcTy, true);
936 case Instruction::IntToPtr:
937 case Instruction::PtrToInt:
938 // Avoid "cast to pointer from integer of different size" warnings
939 Out << "(unsigned long)";
941 case Instruction::Trunc:
942 case Instruction::BitCast:
943 case Instruction::FPExt:
944 case Instruction::FPTrunc:
945 case Instruction::FPToSI:
946 case Instruction::FPToUI:
947 break; // These don't need a source cast.
949 assert(0 && "Invalid cast opcode");
954 // printConstant - The LLVM Constant to C Constant converter.
955 void CWriter::printConstant(Constant *CPV, bool Static) {
956 if (const ConstantExpr *CE = dyn_cast<ConstantExpr>(CPV)) {
957 switch (CE->getOpcode()) {
958 case Instruction::Trunc:
959 case Instruction::ZExt:
960 case Instruction::SExt:
961 case Instruction::FPTrunc:
962 case Instruction::FPExt:
963 case Instruction::UIToFP:
964 case Instruction::SIToFP:
965 case Instruction::FPToUI:
966 case Instruction::FPToSI:
967 case Instruction::PtrToInt:
968 case Instruction::IntToPtr:
969 case Instruction::BitCast:
971 printCast(CE->getOpcode(), CE->getOperand(0)->getType(), CE->getType());
972 if (CE->getOpcode() == Instruction::SExt &&
973 CE->getOperand(0)->getType() == Type::Int1Ty) {
974 // Make sure we really sext from bool here by subtracting from 0
977 printConstant(CE->getOperand(0), Static);
978 if (CE->getType() == Type::Int1Ty &&
979 (CE->getOpcode() == Instruction::Trunc ||
980 CE->getOpcode() == Instruction::FPToUI ||
981 CE->getOpcode() == Instruction::FPToSI ||
982 CE->getOpcode() == Instruction::PtrToInt)) {
983 // Make sure we really truncate to bool here by anding with 1
989 case Instruction::GetElementPtr:
991 printGEPExpression(CE->getOperand(0), gep_type_begin(CPV),
992 gep_type_end(CPV), Static);
995 case Instruction::Select:
997 printConstant(CE->getOperand(0), Static);
999 printConstant(CE->getOperand(1), Static);
1001 printConstant(CE->getOperand(2), Static);
1004 case Instruction::Add:
1005 case Instruction::FAdd:
1006 case Instruction::Sub:
1007 case Instruction::FSub:
1008 case Instruction::Mul:
1009 case Instruction::FMul:
1010 case Instruction::SDiv:
1011 case Instruction::UDiv:
1012 case Instruction::FDiv:
1013 case Instruction::URem:
1014 case Instruction::SRem:
1015 case Instruction::FRem:
1016 case Instruction::And:
1017 case Instruction::Or:
1018 case Instruction::Xor:
1019 case Instruction::ICmp:
1020 case Instruction::Shl:
1021 case Instruction::LShr:
1022 case Instruction::AShr:
1025 bool NeedsClosingParens = printConstExprCast(CE, Static);
1026 printConstantWithCast(CE->getOperand(0), CE->getOpcode());
1027 switch (CE->getOpcode()) {
1028 case Instruction::Add:
1029 case Instruction::FAdd: Out << " + "; break;
1030 case Instruction::Sub:
1031 case Instruction::FSub: Out << " - "; break;
1032 case Instruction::Mul:
1033 case Instruction::FMul: Out << " * "; break;
1034 case Instruction::URem:
1035 case Instruction::SRem:
1036 case Instruction::FRem: Out << " % "; break;
1037 case Instruction::UDiv:
1038 case Instruction::SDiv:
1039 case Instruction::FDiv: Out << " / "; break;
1040 case Instruction::And: Out << " & "; break;
1041 case Instruction::Or: Out << " | "; break;
1042 case Instruction::Xor: Out << " ^ "; break;
1043 case Instruction::Shl: Out << " << "; break;
1044 case Instruction::LShr:
1045 case Instruction::AShr: Out << " >> "; break;
1046 case Instruction::ICmp:
1047 switch (CE->getPredicate()) {
1048 case ICmpInst::ICMP_EQ: Out << " == "; break;
1049 case ICmpInst::ICMP_NE: Out << " != "; break;
1050 case ICmpInst::ICMP_SLT:
1051 case ICmpInst::ICMP_ULT: Out << " < "; break;
1052 case ICmpInst::ICMP_SLE:
1053 case ICmpInst::ICMP_ULE: Out << " <= "; break;
1054 case ICmpInst::ICMP_SGT:
1055 case ICmpInst::ICMP_UGT: Out << " > "; break;
1056 case ICmpInst::ICMP_SGE:
1057 case ICmpInst::ICMP_UGE: Out << " >= "; break;
1058 default: assert(0 && "Illegal ICmp predicate");
1061 default: assert(0 && "Illegal opcode here!");
1063 printConstantWithCast(CE->getOperand(1), CE->getOpcode());
1064 if (NeedsClosingParens)
1069 case Instruction::FCmp: {
1071 bool NeedsClosingParens = printConstExprCast(CE, Static);
1072 if (CE->getPredicate() == FCmpInst::FCMP_FALSE)
1074 else if (CE->getPredicate() == FCmpInst::FCMP_TRUE)
1078 switch (CE->getPredicate()) {
1079 default: assert(0 && "Illegal FCmp predicate");
1080 case FCmpInst::FCMP_ORD: op = "ord"; break;
1081 case FCmpInst::FCMP_UNO: op = "uno"; break;
1082 case FCmpInst::FCMP_UEQ: op = "ueq"; break;
1083 case FCmpInst::FCMP_UNE: op = "une"; break;
1084 case FCmpInst::FCMP_ULT: op = "ult"; break;
1085 case FCmpInst::FCMP_ULE: op = "ule"; break;
1086 case FCmpInst::FCMP_UGT: op = "ugt"; break;
1087 case FCmpInst::FCMP_UGE: op = "uge"; break;
1088 case FCmpInst::FCMP_OEQ: op = "oeq"; break;
1089 case FCmpInst::FCMP_ONE: op = "one"; break;
1090 case FCmpInst::FCMP_OLT: op = "olt"; break;
1091 case FCmpInst::FCMP_OLE: op = "ole"; break;
1092 case FCmpInst::FCMP_OGT: op = "ogt"; break;
1093 case FCmpInst::FCMP_OGE: op = "oge"; break;
1095 Out << "llvm_fcmp_" << op << "(";
1096 printConstantWithCast(CE->getOperand(0), CE->getOpcode());
1098 printConstantWithCast(CE->getOperand(1), CE->getOpcode());
1101 if (NeedsClosingParens)
1107 cerr << "CWriter Error: Unhandled constant expression: "
1111 } else if (isa<UndefValue>(CPV) && CPV->getType()->isSingleValueType()) {
1113 printType(Out, CPV->getType()); // sign doesn't matter
1114 Out << ")/*UNDEF*/";
1115 if (!isa<VectorType>(CPV->getType())) {
1123 if (ConstantInt *CI = dyn_cast<ConstantInt>(CPV)) {
1124 const Type* Ty = CI->getType();
1125 if (Ty == Type::Int1Ty)
1126 Out << (CI->getZExtValue() ? '1' : '0');
1127 else if (Ty == Type::Int32Ty)
1128 Out << CI->getZExtValue() << 'u';
1129 else if (Ty->getPrimitiveSizeInBits() > 32)
1130 Out << CI->getZExtValue() << "ull";
1133 printSimpleType(Out, Ty, false) << ')';
1134 if (CI->isMinValue(true))
1135 Out << CI->getZExtValue() << 'u';
1137 Out << CI->getSExtValue();
1143 switch (CPV->getType()->getTypeID()) {
1144 case Type::FloatTyID:
1145 case Type::DoubleTyID:
1146 case Type::X86_FP80TyID:
1147 case Type::PPC_FP128TyID:
1148 case Type::FP128TyID: {
1149 ConstantFP *FPC = cast<ConstantFP>(CPV);
1150 std::map<const ConstantFP*, unsigned>::iterator I = FPConstantMap.find(FPC);
1151 if (I != FPConstantMap.end()) {
1152 // Because of FP precision problems we must load from a stack allocated
1153 // value that holds the value in hex.
1154 Out << "(*(" << (FPC->getType() == Type::FloatTy ? "float" :
1155 FPC->getType() == Type::DoubleTy ? "double" :
1157 << "*)&FPConstant" << I->second << ')';
1160 if (FPC->getType() == Type::FloatTy)
1161 V = FPC->getValueAPF().convertToFloat();
1162 else if (FPC->getType() == Type::DoubleTy)
1163 V = FPC->getValueAPF().convertToDouble();
1165 // Long double. Convert the number to double, discarding precision.
1166 // This is not awesome, but it at least makes the CBE output somewhat
1168 APFloat Tmp = FPC->getValueAPF();
1170 Tmp.convert(APFloat::IEEEdouble, APFloat::rmTowardZero, &LosesInfo);
1171 V = Tmp.convertToDouble();
1177 // FIXME the actual NaN bits should be emitted.
1178 // The prefix for a quiet NaN is 0x7FF8. For a signalling NaN,
1180 const unsigned long QuietNaN = 0x7ff8UL;
1181 //const unsigned long SignalNaN = 0x7ff4UL;
1183 // We need to grab the first part of the FP #
1186 uint64_t ll = DoubleToBits(V);
1187 sprintf(Buffer, "0x%llx", static_cast<long long>(ll));
1189 std::string Num(&Buffer[0], &Buffer[6]);
1190 unsigned long Val = strtoul(Num.c_str(), 0, 16);
1192 if (FPC->getType() == Type::FloatTy)
1193 Out << "LLVM_NAN" << (Val == QuietNaN ? "" : "S") << "F(\""
1194 << Buffer << "\") /*nan*/ ";
1196 Out << "LLVM_NAN" << (Val == QuietNaN ? "" : "S") << "(\""
1197 << Buffer << "\") /*nan*/ ";
1198 } else if (IsInf(V)) {
1200 if (V < 0) Out << '-';
1201 Out << "LLVM_INF" << (FPC->getType() == Type::FloatTy ? "F" : "")
1205 #if HAVE_PRINTF_A && ENABLE_CBE_PRINTF_A
1206 // Print out the constant as a floating point number.
1208 sprintf(Buffer, "%a", V);
1211 Num = ftostr(FPC->getValueAPF());
1219 case Type::ArrayTyID:
1220 // Use C99 compound expression literal initializer syntax.
1223 printType(Out, CPV->getType());
1226 Out << "{ "; // Arrays are wrapped in struct types.
1227 if (ConstantArray *CA = dyn_cast<ConstantArray>(CPV)) {
1228 printConstantArray(CA, Static);
1230 assert(isa<ConstantAggregateZero>(CPV) || isa<UndefValue>(CPV));
1231 const ArrayType *AT = cast<ArrayType>(CPV->getType());
1233 if (AT->getNumElements()) {
1235 Constant *CZ = Constant::getNullValue(AT->getElementType());
1236 printConstant(CZ, Static);
1237 for (unsigned i = 1, e = AT->getNumElements(); i != e; ++i) {
1239 printConstant(CZ, Static);
1244 Out << " }"; // Arrays are wrapped in struct types.
1247 case Type::VectorTyID:
1248 // Use C99 compound expression literal initializer syntax.
1251 printType(Out, CPV->getType());
1254 if (ConstantVector *CV = dyn_cast<ConstantVector>(CPV)) {
1255 printConstantVector(CV, Static);
1257 assert(isa<ConstantAggregateZero>(CPV) || isa<UndefValue>(CPV));
1258 const VectorType *VT = cast<VectorType>(CPV->getType());
1260 Constant *CZ = Constant::getNullValue(VT->getElementType());
1261 printConstant(CZ, Static);
1262 for (unsigned i = 1, e = VT->getNumElements(); i != e; ++i) {
1264 printConstant(CZ, Static);
1270 case Type::StructTyID:
1271 // Use C99 compound expression literal initializer syntax.
1274 printType(Out, CPV->getType());
1277 if (isa<ConstantAggregateZero>(CPV) || isa<UndefValue>(CPV)) {
1278 const StructType *ST = cast<StructType>(CPV->getType());
1280 if (ST->getNumElements()) {
1282 printConstant(Constant::getNullValue(ST->getElementType(0)), Static);
1283 for (unsigned i = 1, e = ST->getNumElements(); i != e; ++i) {
1285 printConstant(Constant::getNullValue(ST->getElementType(i)), Static);
1291 if (CPV->getNumOperands()) {
1293 printConstant(cast<Constant>(CPV->getOperand(0)), Static);
1294 for (unsigned i = 1, e = CPV->getNumOperands(); i != e; ++i) {
1296 printConstant(cast<Constant>(CPV->getOperand(i)), Static);
1303 case Type::PointerTyID:
1304 if (isa<ConstantPointerNull>(CPV)) {
1306 printType(Out, CPV->getType()); // sign doesn't matter
1307 Out << ")/*NULL*/0)";
1309 } else if (GlobalValue *GV = dyn_cast<GlobalValue>(CPV)) {
1310 writeOperand(GV, Static);
1315 cerr << "Unknown constant type: " << *CPV << "\n";
1320 // Some constant expressions need to be casted back to the original types
1321 // because their operands were casted to the expected type. This function takes
1322 // care of detecting that case and printing the cast for the ConstantExpr.
1323 bool CWriter::printConstExprCast(const ConstantExpr* CE, bool Static) {
1324 bool NeedsExplicitCast = false;
1325 const Type *Ty = CE->getOperand(0)->getType();
1326 bool TypeIsSigned = false;
1327 switch (CE->getOpcode()) {
1328 case Instruction::Add:
1329 case Instruction::Sub:
1330 case Instruction::Mul:
1331 // We need to cast integer arithmetic so that it is always performed
1332 // as unsigned, to avoid undefined behavior on overflow.
1333 case Instruction::LShr:
1334 case Instruction::URem:
1335 case Instruction::UDiv: NeedsExplicitCast = true; break;
1336 case Instruction::AShr:
1337 case Instruction::SRem:
1338 case Instruction::SDiv: NeedsExplicitCast = true; TypeIsSigned = true; break;
1339 case Instruction::SExt:
1341 NeedsExplicitCast = true;
1342 TypeIsSigned = true;
1344 case Instruction::ZExt:
1345 case Instruction::Trunc:
1346 case Instruction::FPTrunc:
1347 case Instruction::FPExt:
1348 case Instruction::UIToFP:
1349 case Instruction::SIToFP:
1350 case Instruction::FPToUI:
1351 case Instruction::FPToSI:
1352 case Instruction::PtrToInt:
1353 case Instruction::IntToPtr:
1354 case Instruction::BitCast:
1356 NeedsExplicitCast = true;
1360 if (NeedsExplicitCast) {
1362 if (Ty->isInteger() && Ty != Type::Int1Ty)
1363 printSimpleType(Out, Ty, TypeIsSigned);
1365 printType(Out, Ty); // not integer, sign doesn't matter
1368 return NeedsExplicitCast;
1371 // Print a constant assuming that it is the operand for a given Opcode. The
1372 // opcodes that care about sign need to cast their operands to the expected
1373 // type before the operation proceeds. This function does the casting.
1374 void CWriter::printConstantWithCast(Constant* CPV, unsigned Opcode) {
1376 // Extract the operand's type, we'll need it.
1377 const Type* OpTy = CPV->getType();
1379 // Indicate whether to do the cast or not.
1380 bool shouldCast = false;
1381 bool typeIsSigned = false;
1383 // Based on the Opcode for which this Constant is being written, determine
1384 // the new type to which the operand should be casted by setting the value
1385 // of OpTy. If we change OpTy, also set shouldCast to true so it gets
1389 // for most instructions, it doesn't matter
1391 case Instruction::Add:
1392 case Instruction::Sub:
1393 case Instruction::Mul:
1394 // We need to cast integer arithmetic so that it is always performed
1395 // as unsigned, to avoid undefined behavior on overflow.
1396 case Instruction::LShr:
1397 case Instruction::UDiv:
1398 case Instruction::URem:
1401 case Instruction::AShr:
1402 case Instruction::SDiv:
1403 case Instruction::SRem:
1405 typeIsSigned = true;
1409 // Write out the casted constant if we should, otherwise just write the
1413 printSimpleType(Out, OpTy, typeIsSigned);
1415 printConstant(CPV, false);
1418 printConstant(CPV, false);
1421 std::string CWriter::GetValueName(const Value *Operand) {
1424 if (!isa<GlobalValue>(Operand) && Operand->getName() != "") {
1425 std::string VarName;
1427 Name = Operand->getName();
1428 VarName.reserve(Name.capacity());
1430 for (std::string::iterator I = Name.begin(), E = Name.end();
1434 if (!((ch >= 'a' && ch <= 'z') || (ch >= 'A' && ch <= 'Z') ||
1435 (ch >= '0' && ch <= '9') || ch == '_')) {
1437 sprintf(buffer, "_%x_", ch);
1443 Name = "llvm_cbe_" + VarName;
1445 Name = Mang->getValueName(Operand);
1451 /// writeInstComputationInline - Emit the computation for the specified
1452 /// instruction inline, with no destination provided.
1453 void CWriter::writeInstComputationInline(Instruction &I) {
1454 // We can't currently support integer types other than 1, 8, 16, 32, 64.
1456 const Type *Ty = I.getType();
1457 if (Ty->isInteger() && (Ty!=Type::Int1Ty && Ty!=Type::Int8Ty &&
1458 Ty!=Type::Int16Ty && Ty!=Type::Int32Ty && Ty!=Type::Int64Ty)) {
1459 cerr << "The C backend does not currently support integer "
1460 << "types of widths other than 1, 8, 16, 32, 64.\n";
1461 cerr << "This is being tracked as PR 4158.\n";
1465 // If this is a non-trivial bool computation, make sure to truncate down to
1466 // a 1 bit value. This is important because we want "add i1 x, y" to return
1467 // "0" when x and y are true, not "2" for example.
1468 bool NeedBoolTrunc = false;
1469 if (I.getType() == Type::Int1Ty && !isa<ICmpInst>(I) && !isa<FCmpInst>(I))
1470 NeedBoolTrunc = true;
1482 void CWriter::writeOperandInternal(Value *Operand, bool Static) {
1483 if (Instruction *I = dyn_cast<Instruction>(Operand))
1484 // Should we inline this instruction to build a tree?
1485 if (isInlinableInst(*I) && !isDirectAlloca(I)) {
1487 writeInstComputationInline(*I);
1492 Constant* CPV = dyn_cast<Constant>(Operand);
1494 if (CPV && !isa<GlobalValue>(CPV))
1495 printConstant(CPV, Static);
1497 Out << GetValueName(Operand);
1500 void CWriter::writeOperand(Value *Operand, bool Static) {
1501 bool isAddressImplicit = isAddressExposed(Operand);
1502 if (isAddressImplicit)
1503 Out << "(&"; // Global variables are referenced as their addresses by llvm
1505 writeOperandInternal(Operand, Static);
1507 if (isAddressImplicit)
1511 // Some instructions need to have their result value casted back to the
1512 // original types because their operands were casted to the expected type.
1513 // This function takes care of detecting that case and printing the cast
1514 // for the Instruction.
1515 bool CWriter::writeInstructionCast(const Instruction &I) {
1516 const Type *Ty = I.getOperand(0)->getType();
1517 switch (I.getOpcode()) {
1518 case Instruction::Add:
1519 case Instruction::Sub:
1520 case Instruction::Mul:
1521 // We need to cast integer arithmetic so that it is always performed
1522 // as unsigned, to avoid undefined behavior on overflow.
1523 case Instruction::LShr:
1524 case Instruction::URem:
1525 case Instruction::UDiv:
1527 printSimpleType(Out, Ty, false);
1530 case Instruction::AShr:
1531 case Instruction::SRem:
1532 case Instruction::SDiv:
1534 printSimpleType(Out, Ty, true);
1542 // Write the operand with a cast to another type based on the Opcode being used.
1543 // This will be used in cases where an instruction has specific type
1544 // requirements (usually signedness) for its operands.
1545 void CWriter::writeOperandWithCast(Value* Operand, unsigned Opcode) {
1547 // Extract the operand's type, we'll need it.
1548 const Type* OpTy = Operand->getType();
1550 // Indicate whether to do the cast or not.
1551 bool shouldCast = false;
1553 // Indicate whether the cast should be to a signed type or not.
1554 bool castIsSigned = false;
1556 // Based on the Opcode for which this Operand is being written, determine
1557 // the new type to which the operand should be casted by setting the value
1558 // of OpTy. If we change OpTy, also set shouldCast to true.
1561 // for most instructions, it doesn't matter
1563 case Instruction::Add:
1564 case Instruction::Sub:
1565 case Instruction::Mul:
1566 // We need to cast integer arithmetic so that it is always performed
1567 // as unsigned, to avoid undefined behavior on overflow.
1568 case Instruction::LShr:
1569 case Instruction::UDiv:
1570 case Instruction::URem: // Cast to unsigned first
1572 castIsSigned = false;
1574 case Instruction::GetElementPtr:
1575 case Instruction::AShr:
1576 case Instruction::SDiv:
1577 case Instruction::SRem: // Cast to signed first
1579 castIsSigned = true;
1583 // Write out the casted operand if we should, otherwise just write the
1587 printSimpleType(Out, OpTy, castIsSigned);
1589 writeOperand(Operand);
1592 writeOperand(Operand);
1595 // Write the operand with a cast to another type based on the icmp predicate
1597 void CWriter::writeOperandWithCast(Value* Operand, const ICmpInst &Cmp) {
1598 // This has to do a cast to ensure the operand has the right signedness.
1599 // Also, if the operand is a pointer, we make sure to cast to an integer when
1600 // doing the comparison both for signedness and so that the C compiler doesn't
1601 // optimize things like "p < NULL" to false (p may contain an integer value
1603 bool shouldCast = Cmp.isRelational();
1605 // Write out the casted operand if we should, otherwise just write the
1608 writeOperand(Operand);
1612 // Should this be a signed comparison? If so, convert to signed.
1613 bool castIsSigned = Cmp.isSignedPredicate();
1615 // If the operand was a pointer, convert to a large integer type.
1616 const Type* OpTy = Operand->getType();
1617 if (isa<PointerType>(OpTy))
1618 OpTy = TD->getIntPtrType();
1621 printSimpleType(Out, OpTy, castIsSigned);
1623 writeOperand(Operand);
1627 // generateCompilerSpecificCode - This is where we add conditional compilation
1628 // directives to cater to specific compilers as need be.
1630 static void generateCompilerSpecificCode(raw_ostream& Out,
1631 const TargetData *TD) {
1632 // Alloca is hard to get, and we don't want to include stdlib.h here.
1633 Out << "/* get a declaration for alloca */\n"
1634 << "#if defined(__CYGWIN__) || defined(__MINGW32__)\n"
1635 << "#define alloca(x) __builtin_alloca((x))\n"
1636 << "#define _alloca(x) __builtin_alloca((x))\n"
1637 << "#elif defined(__APPLE__)\n"
1638 << "extern void *__builtin_alloca(unsigned long);\n"
1639 << "#define alloca(x) __builtin_alloca(x)\n"
1640 << "#define longjmp _longjmp\n"
1641 << "#define setjmp _setjmp\n"
1642 << "#elif defined(__sun__)\n"
1643 << "#if defined(__sparcv9)\n"
1644 << "extern void *__builtin_alloca(unsigned long);\n"
1646 << "extern void *__builtin_alloca(unsigned int);\n"
1648 << "#define alloca(x) __builtin_alloca(x)\n"
1649 << "#elif defined(__FreeBSD__) || defined(__NetBSD__) || defined(__OpenBSD__) || defined(__DragonFly__)\n"
1650 << "#define alloca(x) __builtin_alloca(x)\n"
1651 << "#elif defined(_MSC_VER)\n"
1652 << "#define inline _inline\n"
1653 << "#define alloca(x) _alloca(x)\n"
1655 << "#include <alloca.h>\n"
1658 // We output GCC specific attributes to preserve 'linkonce'ness on globals.
1659 // If we aren't being compiled with GCC, just drop these attributes.
1660 Out << "#ifndef __GNUC__ /* Can only support \"linkonce\" vars with GCC */\n"
1661 << "#define __attribute__(X)\n"
1664 // On Mac OS X, "external weak" is spelled "__attribute__((weak_import))".
1665 Out << "#if defined(__GNUC__) && defined(__APPLE_CC__)\n"
1666 << "#define __EXTERNAL_WEAK__ __attribute__((weak_import))\n"
1667 << "#elif defined(__GNUC__)\n"
1668 << "#define __EXTERNAL_WEAK__ __attribute__((weak))\n"
1670 << "#define __EXTERNAL_WEAK__\n"
1673 // For now, turn off the weak linkage attribute on Mac OS X. (See above.)
1674 Out << "#if defined(__GNUC__) && defined(__APPLE_CC__)\n"
1675 << "#define __ATTRIBUTE_WEAK__\n"
1676 << "#elif defined(__GNUC__)\n"
1677 << "#define __ATTRIBUTE_WEAK__ __attribute__((weak))\n"
1679 << "#define __ATTRIBUTE_WEAK__\n"
1682 // Add hidden visibility support. FIXME: APPLE_CC?
1683 Out << "#if defined(__GNUC__)\n"
1684 << "#define __HIDDEN__ __attribute__((visibility(\"hidden\")))\n"
1687 // Define NaN and Inf as GCC builtins if using GCC, as 0 otherwise
1688 // From the GCC documentation:
1690 // double __builtin_nan (const char *str)
1692 // This is an implementation of the ISO C99 function nan.
1694 // Since ISO C99 defines this function in terms of strtod, which we do
1695 // not implement, a description of the parsing is in order. The string is
1696 // parsed as by strtol; that is, the base is recognized by leading 0 or
1697 // 0x prefixes. The number parsed is placed in the significand such that
1698 // the least significant bit of the number is at the least significant
1699 // bit of the significand. The number is truncated to fit the significand
1700 // field provided. The significand is forced to be a quiet NaN.
1702 // This function, if given a string literal, is evaluated early enough
1703 // that it is considered a compile-time constant.
1705 // float __builtin_nanf (const char *str)
1707 // Similar to __builtin_nan, except the return type is float.
1709 // double __builtin_inf (void)
1711 // Similar to __builtin_huge_val, except a warning is generated if the
1712 // target floating-point format does not support infinities. This
1713 // function is suitable for implementing the ISO C99 macro INFINITY.
1715 // float __builtin_inff (void)
1717 // Similar to __builtin_inf, except the return type is float.
1718 Out << "#ifdef __GNUC__\n"
1719 << "#define LLVM_NAN(NanStr) __builtin_nan(NanStr) /* Double */\n"
1720 << "#define LLVM_NANF(NanStr) __builtin_nanf(NanStr) /* Float */\n"
1721 << "#define LLVM_NANS(NanStr) __builtin_nans(NanStr) /* Double */\n"
1722 << "#define LLVM_NANSF(NanStr) __builtin_nansf(NanStr) /* Float */\n"
1723 << "#define LLVM_INF __builtin_inf() /* Double */\n"
1724 << "#define LLVM_INFF __builtin_inff() /* Float */\n"
1725 << "#define LLVM_PREFETCH(addr,rw,locality) "
1726 "__builtin_prefetch(addr,rw,locality)\n"
1727 << "#define __ATTRIBUTE_CTOR__ __attribute__((constructor))\n"
1728 << "#define __ATTRIBUTE_DTOR__ __attribute__((destructor))\n"
1729 << "#define LLVM_ASM __asm__\n"
1731 << "#define LLVM_NAN(NanStr) ((double)0.0) /* Double */\n"
1732 << "#define LLVM_NANF(NanStr) 0.0F /* Float */\n"
1733 << "#define LLVM_NANS(NanStr) ((double)0.0) /* Double */\n"
1734 << "#define LLVM_NANSF(NanStr) 0.0F /* Float */\n"
1735 << "#define LLVM_INF ((double)0.0) /* Double */\n"
1736 << "#define LLVM_INFF 0.0F /* Float */\n"
1737 << "#define LLVM_PREFETCH(addr,rw,locality) /* PREFETCH */\n"
1738 << "#define __ATTRIBUTE_CTOR__\n"
1739 << "#define __ATTRIBUTE_DTOR__\n"
1740 << "#define LLVM_ASM(X)\n"
1743 Out << "#if __GNUC__ < 4 /* Old GCC's, or compilers not GCC */ \n"
1744 << "#define __builtin_stack_save() 0 /* not implemented */\n"
1745 << "#define __builtin_stack_restore(X) /* noop */\n"
1748 // Output typedefs for 128-bit integers. If these are needed with a
1749 // 32-bit target or with a C compiler that doesn't support mode(TI),
1750 // more drastic measures will be needed.
1751 Out << "#if __GNUC__ && __LP64__ /* 128-bit integer types */\n"
1752 << "typedef int __attribute__((mode(TI))) llvmInt128;\n"
1753 << "typedef unsigned __attribute__((mode(TI))) llvmUInt128;\n"
1756 // Output target-specific code that should be inserted into main.
1757 Out << "#define CODE_FOR_MAIN() /* Any target-specific code for main()*/\n";
1760 /// FindStaticTors - Given a static ctor/dtor list, unpack its contents into
1761 /// the StaticTors set.
1762 static void FindStaticTors(GlobalVariable *GV, std::set<Function*> &StaticTors){
1763 ConstantArray *InitList = dyn_cast<ConstantArray>(GV->getInitializer());
1764 if (!InitList) return;
1766 for (unsigned i = 0, e = InitList->getNumOperands(); i != e; ++i)
1767 if (ConstantStruct *CS = dyn_cast<ConstantStruct>(InitList->getOperand(i))){
1768 if (CS->getNumOperands() != 2) return; // Not array of 2-element structs.
1770 if (CS->getOperand(1)->isNullValue())
1771 return; // Found a null terminator, exit printing.
1772 Constant *FP = CS->getOperand(1);
1773 if (ConstantExpr *CE = dyn_cast<ConstantExpr>(FP))
1775 FP = CE->getOperand(0);
1776 if (Function *F = dyn_cast<Function>(FP))
1777 StaticTors.insert(F);
1781 enum SpecialGlobalClass {
1783 GlobalCtors, GlobalDtors,
1787 /// getGlobalVariableClass - If this is a global that is specially recognized
1788 /// by LLVM, return a code that indicates how we should handle it.
1789 static SpecialGlobalClass getGlobalVariableClass(const GlobalVariable *GV) {
1790 // If this is a global ctors/dtors list, handle it now.
1791 if (GV->hasAppendingLinkage() && GV->use_empty()) {
1792 if (GV->getName() == "llvm.global_ctors")
1794 else if (GV->getName() == "llvm.global_dtors")
1798 // Otherwise, it it is other metadata, don't print it. This catches things
1799 // like debug information.
1800 if (GV->getSection() == "llvm.metadata")
1807 bool CWriter::doInitialization(Module &M) {
1811 TD = new TargetData(&M);
1812 IL = new IntrinsicLowering(*TD);
1813 IL->AddPrototypes(M);
1815 // Ensure that all structure types have names...
1816 Mang = new Mangler(M);
1817 Mang->markCharUnacceptable('.');
1819 // Keep track of which functions are static ctors/dtors so they can have
1820 // an attribute added to their prototypes.
1821 std::set<Function*> StaticCtors, StaticDtors;
1822 for (Module::global_iterator I = M.global_begin(), E = M.global_end();
1824 switch (getGlobalVariableClass(I)) {
1827 FindStaticTors(I, StaticCtors);
1830 FindStaticTors(I, StaticDtors);
1835 // get declaration for alloca
1836 Out << "/* Provide Declarations */\n";
1837 Out << "#include <stdarg.h>\n"; // Varargs support
1838 Out << "#include <setjmp.h>\n"; // Unwind support
1839 generateCompilerSpecificCode(Out, TD);
1841 // Provide a definition for `bool' if not compiling with a C++ compiler.
1843 << "#ifndef __cplusplus\ntypedef unsigned char bool;\n#endif\n"
1845 << "\n\n/* Support for floating point constants */\n"
1846 << "typedef unsigned long long ConstantDoubleTy;\n"
1847 << "typedef unsigned int ConstantFloatTy;\n"
1848 << "typedef struct { unsigned long long f1; unsigned short f2; "
1849 "unsigned short pad[3]; } ConstantFP80Ty;\n"
1850 // This is used for both kinds of 128-bit long double; meaning differs.
1851 << "typedef struct { unsigned long long f1; unsigned long long f2; }"
1852 " ConstantFP128Ty;\n"
1853 << "\n\n/* Global Declarations */\n";
1855 // First output all the declarations for the program, because C requires
1856 // Functions & globals to be declared before they are used.
1859 // Loop over the symbol table, emitting all named constants...
1860 printModuleTypes(M.getTypeSymbolTable());
1862 // Global variable declarations...
1863 if (!M.global_empty()) {
1864 Out << "\n/* External Global Variable Declarations */\n";
1865 for (Module::global_iterator I = M.global_begin(), E = M.global_end();
1868 if (I->hasExternalLinkage() || I->hasExternalWeakLinkage() ||
1869 I->hasCommonLinkage())
1871 else if (I->hasDLLImportLinkage())
1872 Out << "__declspec(dllimport) ";
1874 continue; // Internal Global
1876 // Thread Local Storage
1877 if (I->isThreadLocal())
1880 printType(Out, I->getType()->getElementType(), false, GetValueName(I));
1882 if (I->hasExternalWeakLinkage())
1883 Out << " __EXTERNAL_WEAK__";
1888 // Function declarations
1889 Out << "\n/* Function Declarations */\n";
1890 Out << "double fmod(double, double);\n"; // Support for FP rem
1891 Out << "float fmodf(float, float);\n";
1892 Out << "long double fmodl(long double, long double);\n";
1894 for (Module::iterator I = M.begin(), E = M.end(); I != E; ++I) {
1895 // Don't print declarations for intrinsic functions.
1896 if (!I->isIntrinsic() && I->getName() != "setjmp" &&
1897 I->getName() != "longjmp" && I->getName() != "_setjmp") {
1898 if (I->hasExternalWeakLinkage())
1900 printFunctionSignature(I, true);
1901 if (I->hasWeakLinkage() || I->hasLinkOnceLinkage())
1902 Out << " __ATTRIBUTE_WEAK__";
1903 if (I->hasExternalWeakLinkage())
1904 Out << " __EXTERNAL_WEAK__";
1905 if (StaticCtors.count(I))
1906 Out << " __ATTRIBUTE_CTOR__";
1907 if (StaticDtors.count(I))
1908 Out << " __ATTRIBUTE_DTOR__";
1909 if (I->hasHiddenVisibility())
1910 Out << " __HIDDEN__";
1912 if (I->hasName() && I->getName()[0] == 1)
1913 Out << " LLVM_ASM(\"" << I->getName().c_str()+1 << "\")";
1919 // Output the global variable declarations
1920 if (!M.global_empty()) {
1921 Out << "\n\n/* Global Variable Declarations */\n";
1922 for (Module::global_iterator I = M.global_begin(), E = M.global_end();
1924 if (!I->isDeclaration()) {
1925 // Ignore special globals, such as debug info.
1926 if (getGlobalVariableClass(I))
1929 if (I->hasLocalLinkage())
1934 // Thread Local Storage
1935 if (I->isThreadLocal())
1938 printType(Out, I->getType()->getElementType(), false,
1941 if (I->hasLinkOnceLinkage())
1942 Out << " __attribute__((common))";
1943 else if (I->hasCommonLinkage()) // FIXME is this right?
1944 Out << " __ATTRIBUTE_WEAK__";
1945 else if (I->hasWeakLinkage())
1946 Out << " __ATTRIBUTE_WEAK__";
1947 else if (I->hasExternalWeakLinkage())
1948 Out << " __EXTERNAL_WEAK__";
1949 if (I->hasHiddenVisibility())
1950 Out << " __HIDDEN__";
1955 // Output the global variable definitions and contents...
1956 if (!M.global_empty()) {
1957 Out << "\n\n/* Global Variable Definitions and Initialization */\n";
1958 for (Module::global_iterator I = M.global_begin(), E = M.global_end();
1960 if (!I->isDeclaration()) {
1961 // Ignore special globals, such as debug info.
1962 if (getGlobalVariableClass(I))
1965 if (I->hasLocalLinkage())
1967 else if (I->hasDLLImportLinkage())
1968 Out << "__declspec(dllimport) ";
1969 else if (I->hasDLLExportLinkage())
1970 Out << "__declspec(dllexport) ";
1972 // Thread Local Storage
1973 if (I->isThreadLocal())
1976 printType(Out, I->getType()->getElementType(), false,
1978 if (I->hasLinkOnceLinkage())
1979 Out << " __attribute__((common))";
1980 else if (I->hasWeakLinkage())
1981 Out << " __ATTRIBUTE_WEAK__";
1982 else if (I->hasCommonLinkage())
1983 Out << " __ATTRIBUTE_WEAK__";
1985 if (I->hasHiddenVisibility())
1986 Out << " __HIDDEN__";
1988 // If the initializer is not null, emit the initializer. If it is null,
1989 // we try to avoid emitting large amounts of zeros. The problem with
1990 // this, however, occurs when the variable has weak linkage. In this
1991 // case, the assembler will complain about the variable being both weak
1992 // and common, so we disable this optimization.
1993 // FIXME common linkage should avoid this problem.
1994 if (!I->getInitializer()->isNullValue()) {
1996 writeOperand(I->getInitializer(), true);
1997 } else if (I->hasWeakLinkage()) {
1998 // We have to specify an initializer, but it doesn't have to be
1999 // complete. If the value is an aggregate, print out { 0 }, and let
2000 // the compiler figure out the rest of the zeros.
2002 if (isa<StructType>(I->getInitializer()->getType()) ||
2003 isa<VectorType>(I->getInitializer()->getType())) {
2005 } else if (isa<ArrayType>(I->getInitializer()->getType())) {
2006 // As with structs and vectors, but with an extra set of braces
2007 // because arrays are wrapped in structs.
2010 // Just print it out normally.
2011 writeOperand(I->getInitializer(), true);
2019 Out << "\n\n/* Function Bodies */\n";
2021 // Emit some helper functions for dealing with FCMP instruction's
2023 Out << "static inline int llvm_fcmp_ord(double X, double Y) { ";
2024 Out << "return X == X && Y == Y; }\n";
2025 Out << "static inline int llvm_fcmp_uno(double X, double Y) { ";
2026 Out << "return X != X || Y != Y; }\n";
2027 Out << "static inline int llvm_fcmp_ueq(double X, double Y) { ";
2028 Out << "return X == Y || llvm_fcmp_uno(X, Y); }\n";
2029 Out << "static inline int llvm_fcmp_une(double X, double Y) { ";
2030 Out << "return X != Y; }\n";
2031 Out << "static inline int llvm_fcmp_ult(double X, double Y) { ";
2032 Out << "return X < Y || llvm_fcmp_uno(X, Y); }\n";
2033 Out << "static inline int llvm_fcmp_ugt(double X, double Y) { ";
2034 Out << "return X > Y || llvm_fcmp_uno(X, Y); }\n";
2035 Out << "static inline int llvm_fcmp_ule(double X, double Y) { ";
2036 Out << "return X <= Y || llvm_fcmp_uno(X, Y); }\n";
2037 Out << "static inline int llvm_fcmp_uge(double X, double Y) { ";
2038 Out << "return X >= Y || llvm_fcmp_uno(X, Y); }\n";
2039 Out << "static inline int llvm_fcmp_oeq(double X, double Y) { ";
2040 Out << "return X == Y ; }\n";
2041 Out << "static inline int llvm_fcmp_one(double X, double Y) { ";
2042 Out << "return X != Y && llvm_fcmp_ord(X, Y); }\n";
2043 Out << "static inline int llvm_fcmp_olt(double X, double Y) { ";
2044 Out << "return X < Y ; }\n";
2045 Out << "static inline int llvm_fcmp_ogt(double X, double Y) { ";
2046 Out << "return X > Y ; }\n";
2047 Out << "static inline int llvm_fcmp_ole(double X, double Y) { ";
2048 Out << "return X <= Y ; }\n";
2049 Out << "static inline int llvm_fcmp_oge(double X, double Y) { ";
2050 Out << "return X >= Y ; }\n";
2055 /// Output all floating point constants that cannot be printed accurately...
2056 void CWriter::printFloatingPointConstants(Function &F) {
2057 // Scan the module for floating point constants. If any FP constant is used
2058 // in the function, we want to redirect it here so that we do not depend on
2059 // the precision of the printed form, unless the printed form preserves
2062 for (constant_iterator I = constant_begin(&F), E = constant_end(&F);
2064 printFloatingPointConstants(*I);
2069 void CWriter::printFloatingPointConstants(const Constant *C) {
2070 // If this is a constant expression, recursively check for constant fp values.
2071 if (const ConstantExpr *CE = dyn_cast<ConstantExpr>(C)) {
2072 for (unsigned i = 0, e = CE->getNumOperands(); i != e; ++i)
2073 printFloatingPointConstants(CE->getOperand(i));
2077 // Otherwise, check for a FP constant that we need to print.
2078 const ConstantFP *FPC = dyn_cast<ConstantFP>(C);
2080 // Do not put in FPConstantMap if safe.
2081 isFPCSafeToPrint(FPC) ||
2082 // Already printed this constant?
2083 FPConstantMap.count(FPC))
2086 FPConstantMap[FPC] = FPCounter; // Number the FP constants
2088 if (FPC->getType() == Type::DoubleTy) {
2089 double Val = FPC->getValueAPF().convertToDouble();
2090 uint64_t i = FPC->getValueAPF().bitcastToAPInt().getZExtValue();
2091 Out << "static const ConstantDoubleTy FPConstant" << FPCounter++
2092 << " = 0x" << utohexstr(i)
2093 << "ULL; /* " << Val << " */\n";
2094 } else if (FPC->getType() == Type::FloatTy) {
2095 float Val = FPC->getValueAPF().convertToFloat();
2096 uint32_t i = (uint32_t)FPC->getValueAPF().bitcastToAPInt().
2098 Out << "static const ConstantFloatTy FPConstant" << FPCounter++
2099 << " = 0x" << utohexstr(i)
2100 << "U; /* " << Val << " */\n";
2101 } else if (FPC->getType() == Type::X86_FP80Ty) {
2102 // api needed to prevent premature destruction
2103 APInt api = FPC->getValueAPF().bitcastToAPInt();
2104 const uint64_t *p = api.getRawData();
2105 Out << "static const ConstantFP80Ty FPConstant" << FPCounter++
2106 << " = { 0x" << utohexstr(p[0])
2107 << "ULL, 0x" << utohexstr((uint16_t)p[1]) << ",{0,0,0}"
2108 << "}; /* Long double constant */\n";
2109 } else if (FPC->getType() == Type::PPC_FP128Ty) {
2110 APInt api = FPC->getValueAPF().bitcastToAPInt();
2111 const uint64_t *p = api.getRawData();
2112 Out << "static const ConstantFP128Ty FPConstant" << FPCounter++
2114 << utohexstr(p[0]) << ", 0x" << utohexstr(p[1])
2115 << "}; /* Long double constant */\n";
2118 assert(0 && "Unknown float type!");
2124 /// printSymbolTable - Run through symbol table looking for type names. If a
2125 /// type name is found, emit its declaration...
2127 void CWriter::printModuleTypes(const TypeSymbolTable &TST) {
2128 Out << "/* Helper union for bitcasts */\n";
2129 Out << "typedef union {\n";
2130 Out << " unsigned int Int32;\n";
2131 Out << " unsigned long long Int64;\n";
2132 Out << " float Float;\n";
2133 Out << " double Double;\n";
2134 Out << "} llvmBitCastUnion;\n";
2136 // We are only interested in the type plane of the symbol table.
2137 TypeSymbolTable::const_iterator I = TST.begin();
2138 TypeSymbolTable::const_iterator End = TST.end();
2140 // If there are no type names, exit early.
2141 if (I == End) return;
2143 // Print out forward declarations for structure types before anything else!
2144 Out << "/* Structure forward decls */\n";
2145 for (; I != End; ++I) {
2146 std::string Name = "struct l_" + Mang->makeNameProper(I->first);
2147 Out << Name << ";\n";
2148 TypeNames.insert(std::make_pair(I->second, Name));
2153 // Now we can print out typedefs. Above, we guaranteed that this can only be
2154 // for struct or opaque types.
2155 Out << "/* Typedefs */\n";
2156 for (I = TST.begin(); I != End; ++I) {
2157 std::string Name = "l_" + Mang->makeNameProper(I->first);
2159 printType(Out, I->second, false, Name);
2165 // Keep track of which structures have been printed so far...
2166 std::set<const Type *> StructPrinted;
2168 // Loop over all structures then push them into the stack so they are
2169 // printed in the correct order.
2171 Out << "/* Structure contents */\n";
2172 for (I = TST.begin(); I != End; ++I)
2173 if (isa<StructType>(I->second) || isa<ArrayType>(I->second))
2174 // Only print out used types!
2175 printContainedStructs(I->second, StructPrinted);
2178 // Push the struct onto the stack and recursively push all structs
2179 // this one depends on.
2181 // TODO: Make this work properly with vector types
2183 void CWriter::printContainedStructs(const Type *Ty,
2184 std::set<const Type*> &StructPrinted) {
2185 // Don't walk through pointers.
2186 if (isa<PointerType>(Ty) || Ty->isPrimitiveType() || Ty->isInteger()) return;
2188 // Print all contained types first.
2189 for (Type::subtype_iterator I = Ty->subtype_begin(),
2190 E = Ty->subtype_end(); I != E; ++I)
2191 printContainedStructs(*I, StructPrinted);
2193 if (isa<StructType>(Ty) || isa<ArrayType>(Ty)) {
2194 // Check to see if we have already printed this struct.
2195 if (StructPrinted.insert(Ty).second) {
2196 // Print structure type out.
2197 std::string Name = TypeNames[Ty];
2198 printType(Out, Ty, false, Name, true);
2204 void CWriter::printFunctionSignature(const Function *F, bool Prototype) {
2205 /// isStructReturn - Should this function actually return a struct by-value?
2206 bool isStructReturn = F->hasStructRetAttr();
2208 if (F->hasLocalLinkage()) Out << "static ";
2209 if (F->hasDLLImportLinkage()) Out << "__declspec(dllimport) ";
2210 if (F->hasDLLExportLinkage()) Out << "__declspec(dllexport) ";
2211 switch (F->getCallingConv()) {
2212 case CallingConv::X86_StdCall:
2213 Out << "__attribute__((stdcall)) ";
2215 case CallingConv::X86_FastCall:
2216 Out << "__attribute__((fastcall)) ";
2220 // Loop over the arguments, printing them...
2221 const FunctionType *FT = cast<FunctionType>(F->getFunctionType());
2222 const AttrListPtr &PAL = F->getAttributes();
2224 std::stringstream FunctionInnards;
2226 // Print out the name...
2227 FunctionInnards << GetValueName(F) << '(';
2229 bool PrintedArg = false;
2230 if (!F->isDeclaration()) {
2231 if (!F->arg_empty()) {
2232 Function::const_arg_iterator I = F->arg_begin(), E = F->arg_end();
2235 // If this is a struct-return function, don't print the hidden
2236 // struct-return argument.
2237 if (isStructReturn) {
2238 assert(I != E && "Invalid struct return function!");
2243 std::string ArgName;
2244 for (; I != E; ++I) {
2245 if (PrintedArg) FunctionInnards << ", ";
2246 if (I->hasName() || !Prototype)
2247 ArgName = GetValueName(I);
2250 const Type *ArgTy = I->getType();
2251 if (PAL.paramHasAttr(Idx, Attribute::ByVal)) {
2252 ArgTy = cast<PointerType>(ArgTy)->getElementType();
2253 ByValParams.insert(I);
2255 printType(FunctionInnards, ArgTy,
2256 /*isSigned=*/PAL.paramHasAttr(Idx, Attribute::SExt),
2263 // Loop over the arguments, printing them.
2264 FunctionType::param_iterator I = FT->param_begin(), E = FT->param_end();
2267 // If this is a struct-return function, don't print the hidden
2268 // struct-return argument.
2269 if (isStructReturn) {
2270 assert(I != E && "Invalid struct return function!");
2275 for (; I != E; ++I) {
2276 if (PrintedArg) FunctionInnards << ", ";
2277 const Type *ArgTy = *I;
2278 if (PAL.paramHasAttr(Idx, Attribute::ByVal)) {
2279 assert(isa<PointerType>(ArgTy));
2280 ArgTy = cast<PointerType>(ArgTy)->getElementType();
2282 printType(FunctionInnards, ArgTy,
2283 /*isSigned=*/PAL.paramHasAttr(Idx, Attribute::SExt));
2289 // Finish printing arguments... if this is a vararg function, print the ...,
2290 // unless there are no known types, in which case, we just emit ().
2292 if (FT->isVarArg() && PrintedArg) {
2293 if (PrintedArg) FunctionInnards << ", ";
2294 FunctionInnards << "..."; // Output varargs portion of signature!
2295 } else if (!FT->isVarArg() && !PrintedArg) {
2296 FunctionInnards << "void"; // ret() -> ret(void) in C.
2298 FunctionInnards << ')';
2300 // Get the return tpe for the function.
2302 if (!isStructReturn)
2303 RetTy = F->getReturnType();
2305 // If this is a struct-return function, print the struct-return type.
2306 RetTy = cast<PointerType>(FT->getParamType(0))->getElementType();
2309 // Print out the return type and the signature built above.
2310 printType(Out, RetTy,
2311 /*isSigned=*/PAL.paramHasAttr(0, Attribute::SExt),
2312 FunctionInnards.str());
2315 static inline bool isFPIntBitCast(const Instruction &I) {
2316 if (!isa<BitCastInst>(I))
2318 const Type *SrcTy = I.getOperand(0)->getType();
2319 const Type *DstTy = I.getType();
2320 return (SrcTy->isFloatingPoint() && DstTy->isInteger()) ||
2321 (DstTy->isFloatingPoint() && SrcTy->isInteger());
2324 void CWriter::printFunction(Function &F) {
2325 /// isStructReturn - Should this function actually return a struct by-value?
2326 bool isStructReturn = F.hasStructRetAttr();
2328 printFunctionSignature(&F, false);
2331 // If this is a struct return function, handle the result with magic.
2332 if (isStructReturn) {
2333 const Type *StructTy =
2334 cast<PointerType>(F.arg_begin()->getType())->getElementType();
2336 printType(Out, StructTy, false, "StructReturn");
2337 Out << "; /* Struct return temporary */\n";
2340 printType(Out, F.arg_begin()->getType(), false,
2341 GetValueName(F.arg_begin()));
2342 Out << " = &StructReturn;\n";
2345 bool PrintedVar = false;
2347 // print local variable information for the function
2348 for (inst_iterator I = inst_begin(&F), E = inst_end(&F); I != E; ++I) {
2349 if (const AllocaInst *AI = isDirectAlloca(&*I)) {
2351 printType(Out, AI->getAllocatedType(), false, GetValueName(AI));
2352 Out << "; /* Address-exposed local */\n";
2354 } else if (I->getType() != Type::VoidTy && !isInlinableInst(*I)) {
2356 printType(Out, I->getType(), false, GetValueName(&*I));
2359 if (isa<PHINode>(*I)) { // Print out PHI node temporaries as well...
2361 printType(Out, I->getType(), false,
2362 GetValueName(&*I)+"__PHI_TEMPORARY");
2367 // We need a temporary for the BitCast to use so it can pluck a value out
2368 // of a union to do the BitCast. This is separate from the need for a
2369 // variable to hold the result of the BitCast.
2370 if (isFPIntBitCast(*I)) {
2371 Out << " llvmBitCastUnion " << GetValueName(&*I)
2372 << "__BITCAST_TEMPORARY;\n";
2380 if (F.hasExternalLinkage() && F.getName() == "main")
2381 Out << " CODE_FOR_MAIN();\n";
2383 // print the basic blocks
2384 for (Function::iterator BB = F.begin(), E = F.end(); BB != E; ++BB) {
2385 if (Loop *L = LI->getLoopFor(BB)) {
2386 if (L->getHeader() == BB && L->getParentLoop() == 0)
2389 printBasicBlock(BB);
2396 void CWriter::printLoop(Loop *L) {
2397 Out << " do { /* Syntactic loop '" << L->getHeader()->getName()
2398 << "' to make GCC happy */\n";
2399 for (unsigned i = 0, e = L->getBlocks().size(); i != e; ++i) {
2400 BasicBlock *BB = L->getBlocks()[i];
2401 Loop *BBLoop = LI->getLoopFor(BB);
2403 printBasicBlock(BB);
2404 else if (BB == BBLoop->getHeader() && BBLoop->getParentLoop() == L)
2407 Out << " } while (1); /* end of syntactic loop '"
2408 << L->getHeader()->getName() << "' */\n";
2411 void CWriter::printBasicBlock(BasicBlock *BB) {
2413 // Don't print the label for the basic block if there are no uses, or if
2414 // the only terminator use is the predecessor basic block's terminator.
2415 // We have to scan the use list because PHI nodes use basic blocks too but
2416 // do not require a label to be generated.
2418 bool NeedsLabel = false;
2419 for (pred_iterator PI = pred_begin(BB), E = pred_end(BB); PI != E; ++PI)
2420 if (isGotoCodeNecessary(*PI, BB)) {
2425 if (NeedsLabel) Out << GetValueName(BB) << ":\n";
2427 // Output all of the instructions in the basic block...
2428 for (BasicBlock::iterator II = BB->begin(), E = --BB->end(); II != E;
2430 if (!isInlinableInst(*II) && !isDirectAlloca(II)) {
2431 if (II->getType() != Type::VoidTy && !isInlineAsm(*II))
2435 writeInstComputationInline(*II);
2440 // Don't emit prefix or suffix for the terminator.
2441 visit(*BB->getTerminator());
2445 // Specific Instruction type classes... note that all of the casts are
2446 // necessary because we use the instruction classes as opaque types...
2448 void CWriter::visitReturnInst(ReturnInst &I) {
2449 // If this is a struct return function, return the temporary struct.
2450 bool isStructReturn = I.getParent()->getParent()->hasStructRetAttr();
2452 if (isStructReturn) {
2453 Out << " return StructReturn;\n";
2457 // Don't output a void return if this is the last basic block in the function
2458 if (I.getNumOperands() == 0 &&
2459 &*--I.getParent()->getParent()->end() == I.getParent() &&
2460 !I.getParent()->size() == 1) {
2464 if (I.getNumOperands() > 1) {
2467 printType(Out, I.getParent()->getParent()->getReturnType());
2468 Out << " llvm_cbe_mrv_temp = {\n";
2469 for (unsigned i = 0, e = I.getNumOperands(); i != e; ++i) {
2471 writeOperand(I.getOperand(i));
2477 Out << " return llvm_cbe_mrv_temp;\n";
2483 if (I.getNumOperands()) {
2485 writeOperand(I.getOperand(0));
2490 void CWriter::visitSwitchInst(SwitchInst &SI) {
2493 writeOperand(SI.getOperand(0));
2494 Out << ") {\n default:\n";
2495 printPHICopiesForSuccessor (SI.getParent(), SI.getDefaultDest(), 2);
2496 printBranchToBlock(SI.getParent(), SI.getDefaultDest(), 2);
2498 for (unsigned i = 2, e = SI.getNumOperands(); i != e; i += 2) {
2500 writeOperand(SI.getOperand(i));
2502 BasicBlock *Succ = cast<BasicBlock>(SI.getOperand(i+1));
2503 printPHICopiesForSuccessor (SI.getParent(), Succ, 2);
2504 printBranchToBlock(SI.getParent(), Succ, 2);
2505 if (Function::iterator(Succ) == next(Function::iterator(SI.getParent())))
2511 void CWriter::visitUnreachableInst(UnreachableInst &I) {
2512 Out << " /*UNREACHABLE*/;\n";
2515 bool CWriter::isGotoCodeNecessary(BasicBlock *From, BasicBlock *To) {
2516 /// FIXME: This should be reenabled, but loop reordering safe!!
2519 if (next(Function::iterator(From)) != Function::iterator(To))
2520 return true; // Not the direct successor, we need a goto.
2522 //isa<SwitchInst>(From->getTerminator())
2524 if (LI->getLoopFor(From) != LI->getLoopFor(To))
2529 void CWriter::printPHICopiesForSuccessor (BasicBlock *CurBlock,
2530 BasicBlock *Successor,
2532 for (BasicBlock::iterator I = Successor->begin(); isa<PHINode>(I); ++I) {
2533 PHINode *PN = cast<PHINode>(I);
2534 // Now we have to do the printing.
2535 Value *IV = PN->getIncomingValueForBlock(CurBlock);
2536 if (!isa<UndefValue>(IV)) {
2537 Out << std::string(Indent, ' ');
2538 Out << " " << GetValueName(I) << "__PHI_TEMPORARY = ";
2540 Out << "; /* for PHI node */\n";
2545 void CWriter::printBranchToBlock(BasicBlock *CurBB, BasicBlock *Succ,
2547 if (isGotoCodeNecessary(CurBB, Succ)) {
2548 Out << std::string(Indent, ' ') << " goto ";
2554 // Branch instruction printing - Avoid printing out a branch to a basic block
2555 // that immediately succeeds the current one.
2557 void CWriter::visitBranchInst(BranchInst &I) {
2559 if (I.isConditional()) {
2560 if (isGotoCodeNecessary(I.getParent(), I.getSuccessor(0))) {
2562 writeOperand(I.getCondition());
2565 printPHICopiesForSuccessor (I.getParent(), I.getSuccessor(0), 2);
2566 printBranchToBlock(I.getParent(), I.getSuccessor(0), 2);
2568 if (isGotoCodeNecessary(I.getParent(), I.getSuccessor(1))) {
2569 Out << " } else {\n";
2570 printPHICopiesForSuccessor (I.getParent(), I.getSuccessor(1), 2);
2571 printBranchToBlock(I.getParent(), I.getSuccessor(1), 2);
2574 // First goto not necessary, assume second one is...
2576 writeOperand(I.getCondition());
2579 printPHICopiesForSuccessor (I.getParent(), I.getSuccessor(1), 2);
2580 printBranchToBlock(I.getParent(), I.getSuccessor(1), 2);
2585 printPHICopiesForSuccessor (I.getParent(), I.getSuccessor(0), 0);
2586 printBranchToBlock(I.getParent(), I.getSuccessor(0), 0);
2591 // PHI nodes get copied into temporary values at the end of predecessor basic
2592 // blocks. We now need to copy these temporary values into the REAL value for
2594 void CWriter::visitPHINode(PHINode &I) {
2596 Out << "__PHI_TEMPORARY";
2600 void CWriter::visitBinaryOperator(Instruction &I) {
2601 // binary instructions, shift instructions, setCond instructions.
2602 assert(!isa<PointerType>(I.getType()));
2604 // We must cast the results of binary operations which might be promoted.
2605 bool needsCast = false;
2606 if ((I.getType() == Type::Int8Ty) || (I.getType() == Type::Int16Ty)
2607 || (I.getType() == Type::FloatTy)) {
2610 printType(Out, I.getType(), false);
2614 // If this is a negation operation, print it out as such. For FP, we don't
2615 // want to print "-0.0 - X".
2616 if (BinaryOperator::isNeg(&I)) {
2618 writeOperand(BinaryOperator::getNegArgument(cast<BinaryOperator>(&I)));
2620 } else if (BinaryOperator::isFNeg(&I)) {
2622 writeOperand(BinaryOperator::getFNegArgument(cast<BinaryOperator>(&I)));
2624 } else if (I.getOpcode() == Instruction::FRem) {
2625 // Output a call to fmod/fmodf instead of emitting a%b
2626 if (I.getType() == Type::FloatTy)
2628 else if (I.getType() == Type::DoubleTy)
2630 else // all 3 flavors of long double
2632 writeOperand(I.getOperand(0));
2634 writeOperand(I.getOperand(1));
2638 // Write out the cast of the instruction's value back to the proper type
2640 bool NeedsClosingParens = writeInstructionCast(I);
2642 // Certain instructions require the operand to be forced to a specific type
2643 // so we use writeOperandWithCast here instead of writeOperand. Similarly
2644 // below for operand 1
2645 writeOperandWithCast(I.getOperand(0), I.getOpcode());
2647 switch (I.getOpcode()) {
2648 case Instruction::Add:
2649 case Instruction::FAdd: Out << " + "; break;
2650 case Instruction::Sub:
2651 case Instruction::FSub: Out << " - "; break;
2652 case Instruction::Mul:
2653 case Instruction::FMul: Out << " * "; break;
2654 case Instruction::URem:
2655 case Instruction::SRem:
2656 case Instruction::FRem: Out << " % "; break;
2657 case Instruction::UDiv:
2658 case Instruction::SDiv:
2659 case Instruction::FDiv: Out << " / "; break;
2660 case Instruction::And: Out << " & "; break;
2661 case Instruction::Or: Out << " | "; break;
2662 case Instruction::Xor: Out << " ^ "; break;
2663 case Instruction::Shl : Out << " << "; break;
2664 case Instruction::LShr:
2665 case Instruction::AShr: Out << " >> "; break;
2666 default: cerr << "Invalid operator type!" << I; abort();
2669 writeOperandWithCast(I.getOperand(1), I.getOpcode());
2670 if (NeedsClosingParens)
2679 void CWriter::visitICmpInst(ICmpInst &I) {
2680 // We must cast the results of icmp which might be promoted.
2681 bool needsCast = false;
2683 // Write out the cast of the instruction's value back to the proper type
2685 bool NeedsClosingParens = writeInstructionCast(I);
2687 // Certain icmp predicate require the operand to be forced to a specific type
2688 // so we use writeOperandWithCast here instead of writeOperand. Similarly
2689 // below for operand 1
2690 writeOperandWithCast(I.getOperand(0), I);
2692 switch (I.getPredicate()) {
2693 case ICmpInst::ICMP_EQ: Out << " == "; break;
2694 case ICmpInst::ICMP_NE: Out << " != "; break;
2695 case ICmpInst::ICMP_ULE:
2696 case ICmpInst::ICMP_SLE: Out << " <= "; break;
2697 case ICmpInst::ICMP_UGE:
2698 case ICmpInst::ICMP_SGE: Out << " >= "; break;
2699 case ICmpInst::ICMP_ULT:
2700 case ICmpInst::ICMP_SLT: Out << " < "; break;
2701 case ICmpInst::ICMP_UGT:
2702 case ICmpInst::ICMP_SGT: Out << " > "; break;
2703 default: cerr << "Invalid icmp predicate!" << I; abort();
2706 writeOperandWithCast(I.getOperand(1), I);
2707 if (NeedsClosingParens)
2715 void CWriter::visitFCmpInst(FCmpInst &I) {
2716 if (I.getPredicate() == FCmpInst::FCMP_FALSE) {
2720 if (I.getPredicate() == FCmpInst::FCMP_TRUE) {
2726 switch (I.getPredicate()) {
2727 default: assert(0 && "Illegal FCmp predicate");
2728 case FCmpInst::FCMP_ORD: op = "ord"; break;
2729 case FCmpInst::FCMP_UNO: op = "uno"; break;
2730 case FCmpInst::FCMP_UEQ: op = "ueq"; break;
2731 case FCmpInst::FCMP_UNE: op = "une"; break;
2732 case FCmpInst::FCMP_ULT: op = "ult"; break;
2733 case FCmpInst::FCMP_ULE: op = "ule"; break;
2734 case FCmpInst::FCMP_UGT: op = "ugt"; break;
2735 case FCmpInst::FCMP_UGE: op = "uge"; break;
2736 case FCmpInst::FCMP_OEQ: op = "oeq"; break;
2737 case FCmpInst::FCMP_ONE: op = "one"; break;
2738 case FCmpInst::FCMP_OLT: op = "olt"; break;
2739 case FCmpInst::FCMP_OLE: op = "ole"; break;
2740 case FCmpInst::FCMP_OGT: op = "ogt"; break;
2741 case FCmpInst::FCMP_OGE: op = "oge"; break;
2744 Out << "llvm_fcmp_" << op << "(";
2745 // Write the first operand
2746 writeOperand(I.getOperand(0));
2748 // Write the second operand
2749 writeOperand(I.getOperand(1));
2753 static const char * getFloatBitCastField(const Type *Ty) {
2754 switch (Ty->getTypeID()) {
2755 default: assert(0 && "Invalid Type");
2756 case Type::FloatTyID: return "Float";
2757 case Type::DoubleTyID: return "Double";
2758 case Type::IntegerTyID: {
2759 unsigned NumBits = cast<IntegerType>(Ty)->getBitWidth();
2768 void CWriter::visitCastInst(CastInst &I) {
2769 const Type *DstTy = I.getType();
2770 const Type *SrcTy = I.getOperand(0)->getType();
2771 if (isFPIntBitCast(I)) {
2773 // These int<->float and long<->double casts need to be handled specially
2774 Out << GetValueName(&I) << "__BITCAST_TEMPORARY."
2775 << getFloatBitCastField(I.getOperand(0)->getType()) << " = ";
2776 writeOperand(I.getOperand(0));
2777 Out << ", " << GetValueName(&I) << "__BITCAST_TEMPORARY."
2778 << getFloatBitCastField(I.getType());
2784 printCast(I.getOpcode(), SrcTy, DstTy);
2786 // Make a sext from i1 work by subtracting the i1 from 0 (an int).
2787 if (SrcTy == Type::Int1Ty && I.getOpcode() == Instruction::SExt)
2790 writeOperand(I.getOperand(0));
2792 if (DstTy == Type::Int1Ty &&
2793 (I.getOpcode() == Instruction::Trunc ||
2794 I.getOpcode() == Instruction::FPToUI ||
2795 I.getOpcode() == Instruction::FPToSI ||
2796 I.getOpcode() == Instruction::PtrToInt)) {
2797 // Make sure we really get a trunc to bool by anding the operand with 1
2803 void CWriter::visitSelectInst(SelectInst &I) {
2805 writeOperand(I.getCondition());
2807 writeOperand(I.getTrueValue());
2809 writeOperand(I.getFalseValue());
2814 void CWriter::lowerIntrinsics(Function &F) {
2815 // This is used to keep track of intrinsics that get generated to a lowered
2816 // function. We must generate the prototypes before the function body which
2817 // will only be expanded on first use (by the loop below).
2818 std::vector<Function*> prototypesToGen;
2820 // Examine all the instructions in this function to find the intrinsics that
2821 // need to be lowered.
2822 for (Function::iterator BB = F.begin(), EE = F.end(); BB != EE; ++BB)
2823 for (BasicBlock::iterator I = BB->begin(), E = BB->end(); I != E; )
2824 if (CallInst *CI = dyn_cast<CallInst>(I++))
2825 if (Function *F = CI->getCalledFunction())
2826 switch (F->getIntrinsicID()) {
2827 case Intrinsic::not_intrinsic:
2828 case Intrinsic::memory_barrier:
2829 case Intrinsic::vastart:
2830 case Intrinsic::vacopy:
2831 case Intrinsic::vaend:
2832 case Intrinsic::returnaddress:
2833 case Intrinsic::frameaddress:
2834 case Intrinsic::setjmp:
2835 case Intrinsic::longjmp:
2836 case Intrinsic::prefetch:
2837 case Intrinsic::dbg_stoppoint:
2838 case Intrinsic::powi:
2839 case Intrinsic::x86_sse_cmp_ss:
2840 case Intrinsic::x86_sse_cmp_ps:
2841 case Intrinsic::x86_sse2_cmp_sd:
2842 case Intrinsic::x86_sse2_cmp_pd:
2843 case Intrinsic::ppc_altivec_lvsl:
2844 // We directly implement these intrinsics
2847 // If this is an intrinsic that directly corresponds to a GCC
2848 // builtin, we handle it.
2849 const char *BuiltinName = "";
2850 #define GET_GCC_BUILTIN_NAME
2851 #include "llvm/Intrinsics.gen"
2852 #undef GET_GCC_BUILTIN_NAME
2853 // If we handle it, don't lower it.
2854 if (BuiltinName[0]) break;
2856 // All other intrinsic calls we must lower.
2857 Instruction *Before = 0;
2858 if (CI != &BB->front())
2859 Before = prior(BasicBlock::iterator(CI));
2861 IL->LowerIntrinsicCall(CI);
2862 if (Before) { // Move iterator to instruction after call
2867 // If the intrinsic got lowered to another call, and that call has
2868 // a definition then we need to make sure its prototype is emitted
2869 // before any calls to it.
2870 if (CallInst *Call = dyn_cast<CallInst>(I))
2871 if (Function *NewF = Call->getCalledFunction())
2872 if (!NewF->isDeclaration())
2873 prototypesToGen.push_back(NewF);
2878 // We may have collected some prototypes to emit in the loop above.
2879 // Emit them now, before the function that uses them is emitted. But,
2880 // be careful not to emit them twice.
2881 std::vector<Function*>::iterator I = prototypesToGen.begin();
2882 std::vector<Function*>::iterator E = prototypesToGen.end();
2883 for ( ; I != E; ++I) {
2884 if (intrinsicPrototypesAlreadyGenerated.insert(*I).second) {
2886 printFunctionSignature(*I, true);
2892 void CWriter::visitCallInst(CallInst &I) {
2893 if (isa<InlineAsm>(I.getOperand(0)))
2894 return visitInlineAsm(I);
2896 bool WroteCallee = false;
2898 // Handle intrinsic function calls first...
2899 if (Function *F = I.getCalledFunction())
2900 if (Intrinsic::ID ID = (Intrinsic::ID)F->getIntrinsicID())
2901 if (visitBuiltinCall(I, ID, WroteCallee))
2904 Value *Callee = I.getCalledValue();
2906 const PointerType *PTy = cast<PointerType>(Callee->getType());
2907 const FunctionType *FTy = cast<FunctionType>(PTy->getElementType());
2909 // If this is a call to a struct-return function, assign to the first
2910 // parameter instead of passing it to the call.
2911 const AttrListPtr &PAL = I.getAttributes();
2912 bool hasByVal = I.hasByValArgument();
2913 bool isStructRet = I.hasStructRetAttr();
2915 writeOperandDeref(I.getOperand(1));
2919 if (I.isTailCall()) Out << " /*tail*/ ";
2922 // If this is an indirect call to a struct return function, we need to cast
2923 // the pointer. Ditto for indirect calls with byval arguments.
2924 bool NeedsCast = (hasByVal || isStructRet) && !isa<Function>(Callee);
2926 // GCC is a real PITA. It does not permit codegening casts of functions to
2927 // function pointers if they are in a call (it generates a trap instruction
2928 // instead!). We work around this by inserting a cast to void* in between
2929 // the function and the function pointer cast. Unfortunately, we can't just
2930 // form the constant expression here, because the folder will immediately
2933 // Note finally, that this is completely unsafe. ANSI C does not guarantee
2934 // that void* and function pointers have the same size. :( To deal with this
2935 // in the common case, we handle casts where the number of arguments passed
2938 if (ConstantExpr *CE = dyn_cast<ConstantExpr>(Callee))
2940 if (Function *RF = dyn_cast<Function>(CE->getOperand(0))) {
2946 // Ok, just cast the pointer type.
2949 printStructReturnPointerFunctionType(Out, PAL,
2950 cast<PointerType>(I.getCalledValue()->getType()));
2952 printType(Out, I.getCalledValue()->getType(), false, "", true, PAL);
2954 printType(Out, I.getCalledValue()->getType());
2957 writeOperand(Callee);
2958 if (NeedsCast) Out << ')';
2963 unsigned NumDeclaredParams = FTy->getNumParams();
2965 CallSite::arg_iterator AI = I.op_begin()+1, AE = I.op_end();
2967 if (isStructRet) { // Skip struct return argument.
2972 bool PrintedArg = false;
2973 for (; AI != AE; ++AI, ++ArgNo) {
2974 if (PrintedArg) Out << ", ";
2975 if (ArgNo < NumDeclaredParams &&
2976 (*AI)->getType() != FTy->getParamType(ArgNo)) {
2978 printType(Out, FTy->getParamType(ArgNo),
2979 /*isSigned=*/PAL.paramHasAttr(ArgNo+1, Attribute::SExt));
2982 // Check if the argument is expected to be passed by value.
2983 if (I.paramHasAttr(ArgNo+1, Attribute::ByVal))
2984 writeOperandDeref(*AI);
2992 /// visitBuiltinCall - Handle the call to the specified builtin. Returns true
2993 /// if the entire call is handled, return false it it wasn't handled, and
2994 /// optionally set 'WroteCallee' if the callee has already been printed out.
2995 bool CWriter::visitBuiltinCall(CallInst &I, Intrinsic::ID ID,
2996 bool &WroteCallee) {
2999 // If this is an intrinsic that directly corresponds to a GCC
3000 // builtin, we emit it here.
3001 const char *BuiltinName = "";
3002 Function *F = I.getCalledFunction();
3003 #define GET_GCC_BUILTIN_NAME
3004 #include "llvm/Intrinsics.gen"
3005 #undef GET_GCC_BUILTIN_NAME
3006 assert(BuiltinName[0] && "Unknown LLVM intrinsic!");
3012 case Intrinsic::memory_barrier:
3013 Out << "__sync_synchronize()";
3015 case Intrinsic::vastart:
3018 Out << "va_start(*(va_list*)";
3019 writeOperand(I.getOperand(1));
3021 // Output the last argument to the enclosing function.
3022 if (I.getParent()->getParent()->arg_empty()) {
3023 cerr << "The C backend does not currently support zero "
3024 << "argument varargs functions, such as '"
3025 << I.getParent()->getParent()->getName() << "'!\n";
3028 writeOperand(--I.getParent()->getParent()->arg_end());
3031 case Intrinsic::vaend:
3032 if (!isa<ConstantPointerNull>(I.getOperand(1))) {
3033 Out << "0; va_end(*(va_list*)";
3034 writeOperand(I.getOperand(1));
3037 Out << "va_end(*(va_list*)0)";
3040 case Intrinsic::vacopy:
3042 Out << "va_copy(*(va_list*)";
3043 writeOperand(I.getOperand(1));
3044 Out << ", *(va_list*)";
3045 writeOperand(I.getOperand(2));
3048 case Intrinsic::returnaddress:
3049 Out << "__builtin_return_address(";
3050 writeOperand(I.getOperand(1));
3053 case Intrinsic::frameaddress:
3054 Out << "__builtin_frame_address(";
3055 writeOperand(I.getOperand(1));
3058 case Intrinsic::powi:
3059 Out << "__builtin_powi(";
3060 writeOperand(I.getOperand(1));
3062 writeOperand(I.getOperand(2));
3065 case Intrinsic::setjmp:
3066 Out << "setjmp(*(jmp_buf*)";
3067 writeOperand(I.getOperand(1));
3070 case Intrinsic::longjmp:
3071 Out << "longjmp(*(jmp_buf*)";
3072 writeOperand(I.getOperand(1));
3074 writeOperand(I.getOperand(2));
3077 case Intrinsic::prefetch:
3078 Out << "LLVM_PREFETCH((const void *)";
3079 writeOperand(I.getOperand(1));
3081 writeOperand(I.getOperand(2));
3083 writeOperand(I.getOperand(3));
3086 case Intrinsic::stacksave:
3087 // Emit this as: Val = 0; *((void**)&Val) = __builtin_stack_save()
3088 // to work around GCC bugs (see PR1809).
3089 Out << "0; *((void**)&" << GetValueName(&I)
3090 << ") = __builtin_stack_save()";
3092 case Intrinsic::dbg_stoppoint: {
3093 // If we use writeOperand directly we get a "u" suffix which is rejected
3095 std::stringstream SPIStr;
3096 DbgStopPointInst &SPI = cast<DbgStopPointInst>(I);
3097 SPI.getDirectory()->print(SPIStr);
3101 Out << SPIStr.str();
3103 SPI.getFileName()->print(SPIStr);
3104 Out << SPIStr.str() << "\"\n";
3107 case Intrinsic::x86_sse_cmp_ss:
3108 case Intrinsic::x86_sse_cmp_ps:
3109 case Intrinsic::x86_sse2_cmp_sd:
3110 case Intrinsic::x86_sse2_cmp_pd:
3112 printType(Out, I.getType());
3114 // Multiple GCC builtins multiplex onto this intrinsic.
3115 switch (cast<ConstantInt>(I.getOperand(3))->getZExtValue()) {
3116 default: assert(0 && "Invalid llvm.x86.sse.cmp!");
3117 case 0: Out << "__builtin_ia32_cmpeq"; break;
3118 case 1: Out << "__builtin_ia32_cmplt"; break;
3119 case 2: Out << "__builtin_ia32_cmple"; break;
3120 case 3: Out << "__builtin_ia32_cmpunord"; break;
3121 case 4: Out << "__builtin_ia32_cmpneq"; break;
3122 case 5: Out << "__builtin_ia32_cmpnlt"; break;
3123 case 6: Out << "__builtin_ia32_cmpnle"; break;
3124 case 7: Out << "__builtin_ia32_cmpord"; break;
3126 if (ID == Intrinsic::x86_sse_cmp_ps || ID == Intrinsic::x86_sse2_cmp_pd)
3130 if (ID == Intrinsic::x86_sse_cmp_ss || ID == Intrinsic::x86_sse_cmp_ps)
3136 writeOperand(I.getOperand(1));
3138 writeOperand(I.getOperand(2));
3141 case Intrinsic::ppc_altivec_lvsl:
3143 printType(Out, I.getType());
3145 Out << "__builtin_altivec_lvsl(0, (void*)";
3146 writeOperand(I.getOperand(1));
3152 //This converts the llvm constraint string to something gcc is expecting.
3153 //TODO: work out platform independent constraints and factor those out
3154 // of the per target tables
3155 // handle multiple constraint codes
3156 std::string CWriter::InterpretASMConstraint(InlineAsm::ConstraintInfo& c) {
3158 assert(c.Codes.size() == 1 && "Too many asm constraint codes to handle");
3160 const char *const *table = 0;
3162 //Grab the translation table from TargetAsmInfo if it exists
3165 const TargetMachineRegistry::entry* Match =
3166 TargetMachineRegistry::getClosestStaticTargetForModule(*TheModule, E);
3168 //Per platform Target Machines don't exist, so create it
3169 // this must be done only once
3170 const TargetMachine* TM = Match->CtorFn(*TheModule, "");
3171 TAsm = TM->getTargetAsmInfo();
3175 table = TAsm->getAsmCBE();
3177 //Search the translation table if it exists
3178 for (int i = 0; table && table[i]; i += 2)
3179 if (c.Codes[0] == table[i])
3182 //default is identity
3186 //TODO: import logic from AsmPrinter.cpp
3187 static std::string gccifyAsm(std::string asmstr) {
3188 for (std::string::size_type i = 0; i != asmstr.size(); ++i)
3189 if (asmstr[i] == '\n')
3190 asmstr.replace(i, 1, "\\n");
3191 else if (asmstr[i] == '\t')
3192 asmstr.replace(i, 1, "\\t");
3193 else if (asmstr[i] == '$') {
3194 if (asmstr[i + 1] == '{') {
3195 std::string::size_type a = asmstr.find_first_of(':', i + 1);
3196 std::string::size_type b = asmstr.find_first_of('}', i + 1);
3197 std::string n = "%" +
3198 asmstr.substr(a + 1, b - a - 1) +
3199 asmstr.substr(i + 2, a - i - 2);
3200 asmstr.replace(i, b - i + 1, n);
3203 asmstr.replace(i, 1, "%");
3205 else if (asmstr[i] == '%')//grr
3206 { asmstr.replace(i, 1, "%%"); ++i;}
3211 //TODO: assumptions about what consume arguments from the call are likely wrong
3212 // handle communitivity
3213 void CWriter::visitInlineAsm(CallInst &CI) {
3214 InlineAsm* as = cast<InlineAsm>(CI.getOperand(0));
3215 std::vector<InlineAsm::ConstraintInfo> Constraints = as->ParseConstraints();
3217 std::vector<std::pair<Value*, int> > ResultVals;
3218 if (CI.getType() == Type::VoidTy)
3220 else if (const StructType *ST = dyn_cast<StructType>(CI.getType())) {
3221 for (unsigned i = 0, e = ST->getNumElements(); i != e; ++i)
3222 ResultVals.push_back(std::make_pair(&CI, (int)i));
3224 ResultVals.push_back(std::make_pair(&CI, -1));
3227 // Fix up the asm string for gcc and emit it.
3228 Out << "__asm__ volatile (\"" << gccifyAsm(as->getAsmString()) << "\"\n";
3231 unsigned ValueCount = 0;
3232 bool IsFirst = true;
3234 // Convert over all the output constraints.
3235 for (std::vector<InlineAsm::ConstraintInfo>::iterator I = Constraints.begin(),
3236 E = Constraints.end(); I != E; ++I) {
3238 if (I->Type != InlineAsm::isOutput) {
3240 continue; // Ignore non-output constraints.
3243 assert(I->Codes.size() == 1 && "Too many asm constraint codes to handle");
3244 std::string C = InterpretASMConstraint(*I);
3245 if (C.empty()) continue;
3256 if (ValueCount < ResultVals.size()) {
3257 DestVal = ResultVals[ValueCount].first;
3258 DestValNo = ResultVals[ValueCount].second;
3260 DestVal = CI.getOperand(ValueCount-ResultVals.size()+1);
3262 if (I->isEarlyClobber)
3265 Out << "\"=" << C << "\"(" << GetValueName(DestVal);
3266 if (DestValNo != -1)
3267 Out << ".field" << DestValNo; // Multiple retvals.
3273 // Convert over all the input constraints.
3277 for (std::vector<InlineAsm::ConstraintInfo>::iterator I = Constraints.begin(),
3278 E = Constraints.end(); I != E; ++I) {
3279 if (I->Type != InlineAsm::isInput) {
3281 continue; // Ignore non-input constraints.
3284 assert(I->Codes.size() == 1 && "Too many asm constraint codes to handle");
3285 std::string C = InterpretASMConstraint(*I);
3286 if (C.empty()) continue;
3293 assert(ValueCount >= ResultVals.size() && "Input can't refer to result");
3294 Value *SrcVal = CI.getOperand(ValueCount-ResultVals.size()+1);
3296 Out << "\"" << C << "\"(";
3298 writeOperand(SrcVal);
3300 writeOperandDeref(SrcVal);
3304 // Convert over the clobber constraints.
3307 for (std::vector<InlineAsm::ConstraintInfo>::iterator I = Constraints.begin(),
3308 E = Constraints.end(); I != E; ++I) {
3309 if (I->Type != InlineAsm::isClobber)
3310 continue; // Ignore non-input constraints.
3312 assert(I->Codes.size() == 1 && "Too many asm constraint codes to handle");
3313 std::string C = InterpretASMConstraint(*I);
3314 if (C.empty()) continue;
3321 Out << '\"' << C << '"';
3327 void CWriter::visitMallocInst(MallocInst &I) {
3328 assert(0 && "lowerallocations pass didn't work!");
3331 void CWriter::visitAllocaInst(AllocaInst &I) {
3333 printType(Out, I.getType());
3334 Out << ") alloca(sizeof(";
3335 printType(Out, I.getType()->getElementType());
3337 if (I.isArrayAllocation()) {
3339 writeOperand(I.getOperand(0));
3344 void CWriter::visitFreeInst(FreeInst &I) {
3345 assert(0 && "lowerallocations pass didn't work!");
3348 void CWriter::printGEPExpression(Value *Ptr, gep_type_iterator I,
3349 gep_type_iterator E, bool Static) {
3351 // If there are no indices, just print out the pointer.
3357 // Find out if the last index is into a vector. If so, we have to print this
3358 // specially. Since vectors can't have elements of indexable type, only the
3359 // last index could possibly be of a vector element.
3360 const VectorType *LastIndexIsVector = 0;
3362 for (gep_type_iterator TmpI = I; TmpI != E; ++TmpI)
3363 LastIndexIsVector = dyn_cast<VectorType>(*TmpI);
3368 // If the last index is into a vector, we can't print it as &a[i][j] because
3369 // we can't index into a vector with j in GCC. Instead, emit this as
3370 // (((float*)&a[i])+j)
3371 if (LastIndexIsVector) {
3373 printType(Out, PointerType::getUnqual(LastIndexIsVector->getElementType()));
3379 // If the first index is 0 (very typical) we can do a number of
3380 // simplifications to clean up the code.
3381 Value *FirstOp = I.getOperand();
3382 if (!isa<Constant>(FirstOp) || !cast<Constant>(FirstOp)->isNullValue()) {
3383 // First index isn't simple, print it the hard way.
3386 ++I; // Skip the zero index.
3388 // Okay, emit the first operand. If Ptr is something that is already address
3389 // exposed, like a global, avoid emitting (&foo)[0], just emit foo instead.
3390 if (isAddressExposed(Ptr)) {
3391 writeOperandInternal(Ptr, Static);
3392 } else if (I != E && isa<StructType>(*I)) {
3393 // If we didn't already emit the first operand, see if we can print it as
3394 // P->f instead of "P[0].f"
3396 Out << "->field" << cast<ConstantInt>(I.getOperand())->getZExtValue();
3397 ++I; // eat the struct index as well.
3399 // Instead of emitting P[0][1], emit (*P)[1], which is more idiomatic.
3406 for (; I != E; ++I) {
3407 if (isa<StructType>(*I)) {
3408 Out << ".field" << cast<ConstantInt>(I.getOperand())->getZExtValue();
3409 } else if (isa<ArrayType>(*I)) {
3411 writeOperandWithCast(I.getOperand(), Instruction::GetElementPtr);
3413 } else if (!isa<VectorType>(*I)) {
3415 writeOperandWithCast(I.getOperand(), Instruction::GetElementPtr);
3418 // If the last index is into a vector, then print it out as "+j)". This
3419 // works with the 'LastIndexIsVector' code above.
3420 if (isa<Constant>(I.getOperand()) &&
3421 cast<Constant>(I.getOperand())->isNullValue()) {
3422 Out << "))"; // avoid "+0".
3425 writeOperandWithCast(I.getOperand(), Instruction::GetElementPtr);
3433 void CWriter::writeMemoryAccess(Value *Operand, const Type *OperandType,
3434 bool IsVolatile, unsigned Alignment) {
3436 bool IsUnaligned = Alignment &&
3437 Alignment < TD->getABITypeAlignment(OperandType);
3441 if (IsVolatile || IsUnaligned) {
3444 Out << "struct __attribute__ ((packed, aligned(" << Alignment << "))) {";
3445 printType(Out, OperandType, false, IsUnaligned ? "data" : "volatile*");
3448 if (IsVolatile) Out << "volatile ";
3454 writeOperand(Operand);
3456 if (IsVolatile || IsUnaligned) {
3463 void CWriter::visitLoadInst(LoadInst &I) {
3464 writeMemoryAccess(I.getOperand(0), I.getType(), I.isVolatile(),
3469 void CWriter::visitStoreInst(StoreInst &I) {
3470 writeMemoryAccess(I.getPointerOperand(), I.getOperand(0)->getType(),
3471 I.isVolatile(), I.getAlignment());
3473 Value *Operand = I.getOperand(0);
3474 Constant *BitMask = 0;
3475 if (const IntegerType* ITy = dyn_cast<IntegerType>(Operand->getType()))
3476 if (!ITy->isPowerOf2ByteWidth())
3477 // We have a bit width that doesn't match an even power-of-2 byte
3478 // size. Consequently we must & the value with the type's bit mask
3479 BitMask = ConstantInt::get(ITy, ITy->getBitMask());
3482 writeOperand(Operand);
3485 printConstant(BitMask, false);
3490 void CWriter::visitGetElementPtrInst(GetElementPtrInst &I) {
3491 printGEPExpression(I.getPointerOperand(), gep_type_begin(I),
3492 gep_type_end(I), false);
3495 void CWriter::visitVAArgInst(VAArgInst &I) {
3496 Out << "va_arg(*(va_list*)";
3497 writeOperand(I.getOperand(0));
3499 printType(Out, I.getType());
3503 void CWriter::visitInsertElementInst(InsertElementInst &I) {
3504 const Type *EltTy = I.getType()->getElementType();
3505 writeOperand(I.getOperand(0));
3508 printType(Out, PointerType::getUnqual(EltTy));
3509 Out << ")(&" << GetValueName(&I) << "))[";
3510 writeOperand(I.getOperand(2));
3512 writeOperand(I.getOperand(1));
3516 void CWriter::visitExtractElementInst(ExtractElementInst &I) {
3517 // We know that our operand is not inlined.
3520 cast<VectorType>(I.getOperand(0)->getType())->getElementType();
3521 printType(Out, PointerType::getUnqual(EltTy));
3522 Out << ")(&" << GetValueName(I.getOperand(0)) << "))[";
3523 writeOperand(I.getOperand(1));
3527 void CWriter::visitShuffleVectorInst(ShuffleVectorInst &SVI) {
3529 printType(Out, SVI.getType());
3531 const VectorType *VT = SVI.getType();
3532 unsigned NumElts = VT->getNumElements();
3533 const Type *EltTy = VT->getElementType();
3535 for (unsigned i = 0; i != NumElts; ++i) {
3537 int SrcVal = SVI.getMaskValue(i);
3538 if ((unsigned)SrcVal >= NumElts*2) {
3539 Out << " 0/*undef*/ ";
3541 Value *Op = SVI.getOperand((unsigned)SrcVal >= NumElts);
3542 if (isa<Instruction>(Op)) {
3543 // Do an extractelement of this value from the appropriate input.
3545 printType(Out, PointerType::getUnqual(EltTy));
3546 Out << ")(&" << GetValueName(Op)
3547 << "))[" << (SrcVal & (NumElts-1)) << "]";
3548 } else if (isa<ConstantAggregateZero>(Op) || isa<UndefValue>(Op)) {
3551 printConstant(cast<ConstantVector>(Op)->getOperand(SrcVal &
3560 void CWriter::visitInsertValueInst(InsertValueInst &IVI) {
3561 // Start by copying the entire aggregate value into the result variable.
3562 writeOperand(IVI.getOperand(0));
3565 // Then do the insert to update the field.
3566 Out << GetValueName(&IVI);
3567 for (const unsigned *b = IVI.idx_begin(), *i = b, *e = IVI.idx_end();
3569 const Type *IndexedTy =
3570 ExtractValueInst::getIndexedType(IVI.getOperand(0)->getType(), b, i+1);
3571 if (isa<ArrayType>(IndexedTy))
3572 Out << ".array[" << *i << "]";
3574 Out << ".field" << *i;
3577 writeOperand(IVI.getOperand(1));
3580 void CWriter::visitExtractValueInst(ExtractValueInst &EVI) {
3582 if (isa<UndefValue>(EVI.getOperand(0))) {
3584 printType(Out, EVI.getType());
3585 Out << ") 0/*UNDEF*/";
3587 Out << GetValueName(EVI.getOperand(0));
3588 for (const unsigned *b = EVI.idx_begin(), *i = b, *e = EVI.idx_end();
3590 const Type *IndexedTy =
3591 ExtractValueInst::getIndexedType(EVI.getOperand(0)->getType(), b, i+1);
3592 if (isa<ArrayType>(IndexedTy))
3593 Out << ".array[" << *i << "]";
3595 Out << ".field" << *i;
3601 //===----------------------------------------------------------------------===//
3602 // External Interface declaration
3603 //===----------------------------------------------------------------------===//
3605 bool CTargetMachine::addPassesToEmitWholeFile(PassManager &PM,
3607 CodeGenFileType FileType,
3608 CodeGenOpt::Level OptLevel) {
3609 if (FileType != TargetMachine::AssemblyFile) return true;
3611 PM.add(createGCLoweringPass());
3612 PM.add(createLowerAllocationsPass(true));
3613 PM.add(createLowerInvokePass());
3614 PM.add(createCFGSimplificationPass()); // clean up after lower invoke.
3615 PM.add(new CBackendNameAllUsedStructsAndMergeFunctions());
3616 PM.add(new CWriter(o));
3617 PM.add(createGCInfoDeleter());