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 when called from llvm/InitializeAllTargets.h
64 void InitializeCBackendTarget() { }
68 /// CBackendNameAllUsedStructsAndMergeFunctions - This pass inserts names for
69 /// any unnamed structure types that are used by the program, and merges
70 /// external functions with the same name.
72 class CBackendNameAllUsedStructsAndMergeFunctions : public ModulePass {
75 CBackendNameAllUsedStructsAndMergeFunctions()
77 void getAnalysisUsage(AnalysisUsage &AU) const {
78 AU.addRequired<FindUsedTypes>();
81 virtual const char *getPassName() const {
82 return "C backend type canonicalizer";
85 virtual bool runOnModule(Module &M);
88 char CBackendNameAllUsedStructsAndMergeFunctions::ID = 0;
90 /// CWriter - This class is the main chunk of code that converts an LLVM
91 /// module to a C translation unit.
92 class CWriter : public FunctionPass, public InstVisitor<CWriter> {
94 IntrinsicLowering *IL;
97 const Module *TheModule;
98 const TargetAsmInfo* TAsm;
100 std::map<const Type *, std::string> TypeNames;
101 std::map<const ConstantFP *, unsigned> FPConstantMap;
102 std::set<Function*> intrinsicPrototypesAlreadyGenerated;
103 std::set<const Argument*> ByValParams;
108 explicit CWriter(raw_ostream &o)
109 : FunctionPass(&ID), Out(o), IL(0), Mang(0), LI(0),
110 TheModule(0), TAsm(0), TD(0) {
114 virtual const char *getPassName() const { return "C backend"; }
116 void getAnalysisUsage(AnalysisUsage &AU) const {
117 AU.addRequired<LoopInfo>();
118 AU.setPreservesAll();
121 virtual bool doInitialization(Module &M);
123 bool runOnFunction(Function &F) {
124 // Do not codegen any 'available_externally' functions at all, they have
125 // definitions outside the translation unit.
126 if (F.hasAvailableExternallyLinkage())
129 LI = &getAnalysis<LoopInfo>();
131 // Get rid of intrinsics we can't handle.
134 // Output all floating point constants that cannot be printed accurately.
135 printFloatingPointConstants(F);
141 virtual bool doFinalization(Module &M) {
146 FPConstantMap.clear();
149 intrinsicPrototypesAlreadyGenerated.clear();
153 raw_ostream &printType(raw_ostream &Out, const Type *Ty,
154 bool isSigned = false,
155 const std::string &VariableName = "",
156 bool IgnoreName = false,
157 const AttrListPtr &PAL = AttrListPtr());
158 std::ostream &printType(std::ostream &Out, const Type *Ty,
159 bool isSigned = false,
160 const std::string &VariableName = "",
161 bool IgnoreName = false,
162 const AttrListPtr &PAL = AttrListPtr());
163 raw_ostream &printSimpleType(raw_ostream &Out, const Type *Ty,
165 const std::string &NameSoFar = "");
166 std::ostream &printSimpleType(std::ostream &Out, const Type *Ty,
168 const std::string &NameSoFar = "");
170 void printStructReturnPointerFunctionType(raw_ostream &Out,
171 const AttrListPtr &PAL,
172 const PointerType *Ty);
174 /// writeOperandDeref - Print the result of dereferencing the specified
175 /// operand with '*'. This is equivalent to printing '*' then using
176 /// writeOperand, but avoids excess syntax in some cases.
177 void writeOperandDeref(Value *Operand) {
178 if (isAddressExposed(Operand)) {
179 // Already something with an address exposed.
180 writeOperandInternal(Operand);
183 writeOperand(Operand);
188 void writeOperand(Value *Operand, bool Static = false);
189 void writeInstComputationInline(Instruction &I);
190 void writeOperandInternal(Value *Operand, bool Static = false);
191 void writeOperandWithCast(Value* Operand, unsigned Opcode);
192 void writeOperandWithCast(Value* Operand, const ICmpInst &I);
193 bool writeInstructionCast(const Instruction &I);
195 void writeMemoryAccess(Value *Operand, const Type *OperandType,
196 bool IsVolatile, unsigned Alignment);
199 std::string InterpretASMConstraint(InlineAsm::ConstraintInfo& c);
201 void lowerIntrinsics(Function &F);
203 void printModule(Module *M);
204 void printModuleTypes(const TypeSymbolTable &ST);
205 void printContainedStructs(const Type *Ty, std::set<const Type *> &);
206 void printFloatingPointConstants(Function &F);
207 void printFloatingPointConstants(const Constant *C);
208 void printFunctionSignature(const Function *F, bool Prototype);
210 void printFunction(Function &);
211 void printBasicBlock(BasicBlock *BB);
212 void printLoop(Loop *L);
214 void printCast(unsigned opcode, const Type *SrcTy, const Type *DstTy);
215 void printConstant(Constant *CPV, bool Static);
216 void printConstantWithCast(Constant *CPV, unsigned Opcode);
217 bool printConstExprCast(const ConstantExpr *CE, bool Static);
218 void printConstantArray(ConstantArray *CPA, bool Static);
219 void printConstantVector(ConstantVector *CV, bool Static);
221 /// isAddressExposed - Return true if the specified value's name needs to
222 /// have its address taken in order to get a C value of the correct type.
223 /// This happens for global variables, byval parameters, and direct allocas.
224 bool isAddressExposed(const Value *V) const {
225 if (const Argument *A = dyn_cast<Argument>(V))
226 return ByValParams.count(A);
227 return isa<GlobalVariable>(V) || isDirectAlloca(V);
230 // isInlinableInst - Attempt to inline instructions into their uses to build
231 // trees as much as possible. To do this, we have to consistently decide
232 // what is acceptable to inline, so that variable declarations don't get
233 // printed and an extra copy of the expr is not emitted.
235 static bool isInlinableInst(const Instruction &I) {
236 // Always inline cmp instructions, even if they are shared by multiple
237 // expressions. GCC generates horrible code if we don't.
241 // Must be an expression, must be used exactly once. If it is dead, we
242 // emit it inline where it would go.
243 if (I.getType() == Type::VoidTy || !I.hasOneUse() ||
244 isa<TerminatorInst>(I) || isa<CallInst>(I) || isa<PHINode>(I) ||
245 isa<LoadInst>(I) || isa<VAArgInst>(I) || isa<InsertElementInst>(I) ||
246 isa<InsertValueInst>(I))
247 // Don't inline a load across a store or other bad things!
250 // Must not be used in inline asm, extractelement, or shufflevector.
252 const Instruction &User = cast<Instruction>(*I.use_back());
253 if (isInlineAsm(User) || isa<ExtractElementInst>(User) ||
254 isa<ShuffleVectorInst>(User))
258 // Only inline instruction it if it's use is in the same BB as the inst.
259 return I.getParent() == cast<Instruction>(I.use_back())->getParent();
262 // isDirectAlloca - Define fixed sized allocas in the entry block as direct
263 // variables which are accessed with the & operator. This causes GCC to
264 // generate significantly better code than to emit alloca calls directly.
266 static const AllocaInst *isDirectAlloca(const Value *V) {
267 const AllocaInst *AI = dyn_cast<AllocaInst>(V);
268 if (!AI) return false;
269 if (AI->isArrayAllocation())
270 return 0; // FIXME: we can also inline fixed size array allocas!
271 if (AI->getParent() != &AI->getParent()->getParent()->getEntryBlock())
276 // isInlineAsm - Check if the instruction is a call to an inline asm chunk
277 static bool isInlineAsm(const Instruction& I) {
278 if (isa<CallInst>(&I) && isa<InlineAsm>(I.getOperand(0)))
283 // Instruction visitation functions
284 friend class InstVisitor<CWriter>;
286 void visitReturnInst(ReturnInst &I);
287 void visitBranchInst(BranchInst &I);
288 void visitSwitchInst(SwitchInst &I);
289 void visitInvokeInst(InvokeInst &I) {
290 assert(0 && "Lowerinvoke pass didn't work!");
293 void visitUnwindInst(UnwindInst &I) {
294 assert(0 && "Lowerinvoke pass didn't work!");
296 void visitUnreachableInst(UnreachableInst &I);
298 void visitPHINode(PHINode &I);
299 void visitBinaryOperator(Instruction &I);
300 void visitICmpInst(ICmpInst &I);
301 void visitFCmpInst(FCmpInst &I);
303 void visitCastInst (CastInst &I);
304 void visitSelectInst(SelectInst &I);
305 void visitCallInst (CallInst &I);
306 void visitInlineAsm(CallInst &I);
307 bool visitBuiltinCall(CallInst &I, Intrinsic::ID ID, bool &WroteCallee);
309 void visitMallocInst(MallocInst &I);
310 void visitAllocaInst(AllocaInst &I);
311 void visitFreeInst (FreeInst &I);
312 void visitLoadInst (LoadInst &I);
313 void visitStoreInst (StoreInst &I);
314 void visitGetElementPtrInst(GetElementPtrInst &I);
315 void visitVAArgInst (VAArgInst &I);
317 void visitInsertElementInst(InsertElementInst &I);
318 void visitExtractElementInst(ExtractElementInst &I);
319 void visitShuffleVectorInst(ShuffleVectorInst &SVI);
321 void visitInsertValueInst(InsertValueInst &I);
322 void visitExtractValueInst(ExtractValueInst &I);
324 void visitInstruction(Instruction &I) {
325 cerr << "C Writer does not know about " << I;
329 void outputLValue(Instruction *I) {
330 Out << " " << GetValueName(I) << " = ";
333 bool isGotoCodeNecessary(BasicBlock *From, BasicBlock *To);
334 void printPHICopiesForSuccessor(BasicBlock *CurBlock,
335 BasicBlock *Successor, unsigned Indent);
336 void printBranchToBlock(BasicBlock *CurBlock, BasicBlock *SuccBlock,
338 void printGEPExpression(Value *Ptr, gep_type_iterator I,
339 gep_type_iterator E, bool Static);
341 std::string GetValueName(const Value *Operand);
345 char CWriter::ID = 0;
347 /// This method inserts names for any unnamed structure types that are used by
348 /// the program, and removes names from structure types that are not used by the
351 bool CBackendNameAllUsedStructsAndMergeFunctions::runOnModule(Module &M) {
352 // Get a set of types that are used by the program...
353 std::set<const Type *> UT = getAnalysis<FindUsedTypes>().getTypes();
355 // Loop over the module symbol table, removing types from UT that are
356 // already named, and removing names for types that are not used.
358 TypeSymbolTable &TST = M.getTypeSymbolTable();
359 for (TypeSymbolTable::iterator TI = TST.begin(), TE = TST.end();
361 TypeSymbolTable::iterator I = TI++;
363 // If this isn't a struct or array type, remove it from our set of types
364 // to name. This simplifies emission later.
365 if (!isa<StructType>(I->second) && !isa<OpaqueType>(I->second) &&
366 !isa<ArrayType>(I->second)) {
369 // If this is not used, remove it from the symbol table.
370 std::set<const Type *>::iterator UTI = UT.find(I->second);
374 UT.erase(UTI); // Only keep one name for this type.
378 // UT now contains types that are not named. Loop over it, naming
381 bool Changed = false;
382 unsigned RenameCounter = 0;
383 for (std::set<const Type *>::const_iterator I = UT.begin(), E = UT.end();
385 if (isa<StructType>(*I) || isa<ArrayType>(*I)) {
386 while (M.addTypeName("unnamed"+utostr(RenameCounter), *I))
392 // Loop over all external functions and globals. If we have two with
393 // identical names, merge them.
394 // FIXME: This code should disappear when we don't allow values with the same
395 // names when they have different types!
396 std::map<std::string, GlobalValue*> ExtSymbols;
397 for (Module::iterator I = M.begin(), E = M.end(); I != E;) {
399 if (GV->isDeclaration() && GV->hasName()) {
400 std::pair<std::map<std::string, GlobalValue*>::iterator, bool> X
401 = ExtSymbols.insert(std::make_pair(GV->getName(), GV));
403 // Found a conflict, replace this global with the previous one.
404 GlobalValue *OldGV = X.first->second;
405 GV->replaceAllUsesWith(ConstantExpr::getBitCast(OldGV, GV->getType()));
406 GV->eraseFromParent();
411 // Do the same for globals.
412 for (Module::global_iterator I = M.global_begin(), E = M.global_end();
414 GlobalVariable *GV = I++;
415 if (GV->isDeclaration() && GV->hasName()) {
416 std::pair<std::map<std::string, GlobalValue*>::iterator, bool> X
417 = ExtSymbols.insert(std::make_pair(GV->getName(), GV));
419 // Found a conflict, replace this global with the previous one.
420 GlobalValue *OldGV = X.first->second;
421 GV->replaceAllUsesWith(ConstantExpr::getBitCast(OldGV, GV->getType()));
422 GV->eraseFromParent();
431 /// printStructReturnPointerFunctionType - This is like printType for a struct
432 /// return type, except, instead of printing the type as void (*)(Struct*, ...)
433 /// print it as "Struct (*)(...)", for struct return functions.
434 void CWriter::printStructReturnPointerFunctionType(raw_ostream &Out,
435 const AttrListPtr &PAL,
436 const PointerType *TheTy) {
437 const FunctionType *FTy = cast<FunctionType>(TheTy->getElementType());
438 std::stringstream FunctionInnards;
439 FunctionInnards << " (*) (";
440 bool PrintedType = false;
442 FunctionType::param_iterator I = FTy->param_begin(), E = FTy->param_end();
443 const Type *RetTy = cast<PointerType>(I->get())->getElementType();
445 for (++I, ++Idx; I != E; ++I, ++Idx) {
447 FunctionInnards << ", ";
448 const Type *ArgTy = *I;
449 if (PAL.paramHasAttr(Idx, Attribute::ByVal)) {
450 assert(isa<PointerType>(ArgTy));
451 ArgTy = cast<PointerType>(ArgTy)->getElementType();
453 printType(FunctionInnards, ArgTy,
454 /*isSigned=*/PAL.paramHasAttr(Idx, Attribute::SExt), "");
457 if (FTy->isVarArg()) {
459 FunctionInnards << ", ...";
460 } else if (!PrintedType) {
461 FunctionInnards << "void";
463 FunctionInnards << ')';
464 std::string tstr = FunctionInnards.str();
465 printType(Out, RetTy,
466 /*isSigned=*/PAL.paramHasAttr(0, Attribute::SExt), tstr);
470 CWriter::printSimpleType(raw_ostream &Out, const Type *Ty, bool isSigned,
471 const std::string &NameSoFar) {
472 assert((Ty->isPrimitiveType() || Ty->isInteger() || isa<VectorType>(Ty)) &&
473 "Invalid type for printSimpleType");
474 switch (Ty->getTypeID()) {
475 case Type::VoidTyID: return Out << "void " << NameSoFar;
476 case Type::IntegerTyID: {
477 unsigned NumBits = cast<IntegerType>(Ty)->getBitWidth();
479 return Out << "bool " << NameSoFar;
480 else if (NumBits <= 8)
481 return Out << (isSigned?"signed":"unsigned") << " char " << NameSoFar;
482 else if (NumBits <= 16)
483 return Out << (isSigned?"signed":"unsigned") << " short " << NameSoFar;
484 else if (NumBits <= 32)
485 return Out << (isSigned?"signed":"unsigned") << " int " << NameSoFar;
486 else if (NumBits <= 64)
487 return Out << (isSigned?"signed":"unsigned") << " long long "<< NameSoFar;
489 assert(NumBits <= 128 && "Bit widths > 128 not implemented yet");
490 return Out << (isSigned?"llvmInt128":"llvmUInt128") << " " << NameSoFar;
493 case Type::FloatTyID: return Out << "float " << NameSoFar;
494 case Type::DoubleTyID: return Out << "double " << NameSoFar;
495 // Lacking emulation of FP80 on PPC, etc., we assume whichever of these is
496 // present matches host 'long double'.
497 case Type::X86_FP80TyID:
498 case Type::PPC_FP128TyID:
499 case Type::FP128TyID: return Out << "long double " << NameSoFar;
501 case Type::VectorTyID: {
502 const VectorType *VTy = cast<VectorType>(Ty);
503 return printSimpleType(Out, VTy->getElementType(), isSigned,
504 " __attribute__((vector_size(" +
505 utostr(TD->getTypeAllocSize(VTy)) + " ))) " + NameSoFar);
509 cerr << "Unknown primitive type: " << *Ty << "\n";
515 CWriter::printSimpleType(std::ostream &Out, const Type *Ty, bool isSigned,
516 const std::string &NameSoFar) {
517 assert((Ty->isPrimitiveType() || Ty->isInteger() || isa<VectorType>(Ty)) &&
518 "Invalid type for printSimpleType");
519 switch (Ty->getTypeID()) {
520 case Type::VoidTyID: return Out << "void " << NameSoFar;
521 case Type::IntegerTyID: {
522 unsigned NumBits = cast<IntegerType>(Ty)->getBitWidth();
524 return Out << "bool " << NameSoFar;
525 else if (NumBits <= 8)
526 return Out << (isSigned?"signed":"unsigned") << " char " << NameSoFar;
527 else if (NumBits <= 16)
528 return Out << (isSigned?"signed":"unsigned") << " short " << NameSoFar;
529 else if (NumBits <= 32)
530 return Out << (isSigned?"signed":"unsigned") << " int " << NameSoFar;
531 else if (NumBits <= 64)
532 return Out << (isSigned?"signed":"unsigned") << " long long "<< NameSoFar;
534 assert(NumBits <= 128 && "Bit widths > 128 not implemented yet");
535 return Out << (isSigned?"llvmInt128":"llvmUInt128") << " " << NameSoFar;
538 case Type::FloatTyID: return Out << "float " << NameSoFar;
539 case Type::DoubleTyID: return Out << "double " << NameSoFar;
540 // Lacking emulation of FP80 on PPC, etc., we assume whichever of these is
541 // present matches host 'long double'.
542 case Type::X86_FP80TyID:
543 case Type::PPC_FP128TyID:
544 case Type::FP128TyID: return Out << "long double " << NameSoFar;
546 case Type::VectorTyID: {
547 const VectorType *VTy = cast<VectorType>(Ty);
548 return printSimpleType(Out, VTy->getElementType(), isSigned,
549 " __attribute__((vector_size(" +
550 utostr(TD->getTypeAllocSize(VTy)) + " ))) " + NameSoFar);
554 cerr << "Unknown primitive type: " << *Ty << "\n";
559 // Pass the Type* and the variable name and this prints out the variable
562 raw_ostream &CWriter::printType(raw_ostream &Out, const Type *Ty,
563 bool isSigned, const std::string &NameSoFar,
564 bool IgnoreName, const AttrListPtr &PAL) {
565 if (Ty->isPrimitiveType() || Ty->isInteger() || isa<VectorType>(Ty)) {
566 printSimpleType(Out, Ty, isSigned, NameSoFar);
570 // Check to see if the type is named.
571 if (!IgnoreName || isa<OpaqueType>(Ty)) {
572 std::map<const Type *, std::string>::iterator I = TypeNames.find(Ty);
573 if (I != TypeNames.end()) return Out << I->second << ' ' << NameSoFar;
576 switch (Ty->getTypeID()) {
577 case Type::FunctionTyID: {
578 const FunctionType *FTy = cast<FunctionType>(Ty);
579 std::stringstream FunctionInnards;
580 FunctionInnards << " (" << NameSoFar << ") (";
582 for (FunctionType::param_iterator I = FTy->param_begin(),
583 E = FTy->param_end(); I != E; ++I) {
584 const Type *ArgTy = *I;
585 if (PAL.paramHasAttr(Idx, Attribute::ByVal)) {
586 assert(isa<PointerType>(ArgTy));
587 ArgTy = cast<PointerType>(ArgTy)->getElementType();
589 if (I != FTy->param_begin())
590 FunctionInnards << ", ";
591 printType(FunctionInnards, ArgTy,
592 /*isSigned=*/PAL.paramHasAttr(Idx, Attribute::SExt), "");
595 if (FTy->isVarArg()) {
596 if (FTy->getNumParams())
597 FunctionInnards << ", ...";
598 } else if (!FTy->getNumParams()) {
599 FunctionInnards << "void";
601 FunctionInnards << ')';
602 std::string tstr = FunctionInnards.str();
603 printType(Out, FTy->getReturnType(),
604 /*isSigned=*/PAL.paramHasAttr(0, Attribute::SExt), tstr);
607 case Type::StructTyID: {
608 const StructType *STy = cast<StructType>(Ty);
609 Out << NameSoFar + " {\n";
611 for (StructType::element_iterator I = STy->element_begin(),
612 E = STy->element_end(); I != E; ++I) {
614 printType(Out, *I, false, "field" + utostr(Idx++));
619 Out << " __attribute__ ((packed))";
623 case Type::PointerTyID: {
624 const PointerType *PTy = cast<PointerType>(Ty);
625 std::string ptrName = "*" + NameSoFar;
627 if (isa<ArrayType>(PTy->getElementType()) ||
628 isa<VectorType>(PTy->getElementType()))
629 ptrName = "(" + ptrName + ")";
632 // Must be a function ptr cast!
633 return printType(Out, PTy->getElementType(), false, ptrName, true, PAL);
634 return printType(Out, PTy->getElementType(), false, ptrName);
637 case Type::ArrayTyID: {
638 const ArrayType *ATy = cast<ArrayType>(Ty);
639 unsigned NumElements = ATy->getNumElements();
640 if (NumElements == 0) NumElements = 1;
641 // Arrays are wrapped in structs to allow them to have normal
642 // value semantics (avoiding the array "decay").
643 Out << NameSoFar << " { ";
644 printType(Out, ATy->getElementType(), false,
645 "array[" + utostr(NumElements) + "]");
649 case Type::OpaqueTyID: {
650 static int Count = 0;
651 std::string TyName = "struct opaque_" + itostr(Count++);
652 assert(TypeNames.find(Ty) == TypeNames.end());
653 TypeNames[Ty] = TyName;
654 return Out << TyName << ' ' << NameSoFar;
657 assert(0 && "Unhandled case in getTypeProps!");
664 // Pass the Type* and the variable name and this prints out the variable
667 std::ostream &CWriter::printType(std::ostream &Out, const Type *Ty,
668 bool isSigned, const std::string &NameSoFar,
669 bool IgnoreName, const AttrListPtr &PAL) {
670 if (Ty->isPrimitiveType() || Ty->isInteger() || isa<VectorType>(Ty)) {
671 printSimpleType(Out, Ty, isSigned, NameSoFar);
675 // Check to see if the type is named.
676 if (!IgnoreName || isa<OpaqueType>(Ty)) {
677 std::map<const Type *, std::string>::iterator I = TypeNames.find(Ty);
678 if (I != TypeNames.end()) return Out << I->second << ' ' << NameSoFar;
681 switch (Ty->getTypeID()) {
682 case Type::FunctionTyID: {
683 const FunctionType *FTy = cast<FunctionType>(Ty);
684 std::stringstream FunctionInnards;
685 FunctionInnards << " (" << NameSoFar << ") (";
687 for (FunctionType::param_iterator I = FTy->param_begin(),
688 E = FTy->param_end(); I != E; ++I) {
689 const Type *ArgTy = *I;
690 if (PAL.paramHasAttr(Idx, Attribute::ByVal)) {
691 assert(isa<PointerType>(ArgTy));
692 ArgTy = cast<PointerType>(ArgTy)->getElementType();
694 if (I != FTy->param_begin())
695 FunctionInnards << ", ";
696 printType(FunctionInnards, ArgTy,
697 /*isSigned=*/PAL.paramHasAttr(Idx, Attribute::SExt), "");
700 if (FTy->isVarArg()) {
701 if (FTy->getNumParams())
702 FunctionInnards << ", ...";
703 } else if (!FTy->getNumParams()) {
704 FunctionInnards << "void";
706 FunctionInnards << ')';
707 std::string tstr = FunctionInnards.str();
708 printType(Out, FTy->getReturnType(),
709 /*isSigned=*/PAL.paramHasAttr(0, Attribute::SExt), tstr);
712 case Type::StructTyID: {
713 const StructType *STy = cast<StructType>(Ty);
714 Out << NameSoFar + " {\n";
716 for (StructType::element_iterator I = STy->element_begin(),
717 E = STy->element_end(); I != E; ++I) {
719 printType(Out, *I, false, "field" + utostr(Idx++));
724 Out << " __attribute__ ((packed))";
728 case Type::PointerTyID: {
729 const PointerType *PTy = cast<PointerType>(Ty);
730 std::string ptrName = "*" + NameSoFar;
732 if (isa<ArrayType>(PTy->getElementType()) ||
733 isa<VectorType>(PTy->getElementType()))
734 ptrName = "(" + ptrName + ")";
737 // Must be a function ptr cast!
738 return printType(Out, PTy->getElementType(), false, ptrName, true, PAL);
739 return printType(Out, PTy->getElementType(), false, ptrName);
742 case Type::ArrayTyID: {
743 const ArrayType *ATy = cast<ArrayType>(Ty);
744 unsigned NumElements = ATy->getNumElements();
745 if (NumElements == 0) NumElements = 1;
746 // Arrays are wrapped in structs to allow them to have normal
747 // value semantics (avoiding the array "decay").
748 Out << NameSoFar << " { ";
749 printType(Out, ATy->getElementType(), false,
750 "array[" + utostr(NumElements) + "]");
754 case Type::OpaqueTyID: {
755 static int Count = 0;
756 std::string TyName = "struct opaque_" + itostr(Count++);
757 assert(TypeNames.find(Ty) == TypeNames.end());
758 TypeNames[Ty] = TyName;
759 return Out << TyName << ' ' << NameSoFar;
762 assert(0 && "Unhandled case in getTypeProps!");
769 void CWriter::printConstantArray(ConstantArray *CPA, bool Static) {
771 // As a special case, print the array as a string if it is an array of
772 // ubytes or an array of sbytes with positive values.
774 const Type *ETy = CPA->getType()->getElementType();
775 bool isString = (ETy == Type::Int8Ty || ETy == Type::Int8Ty);
777 // Make sure the last character is a null char, as automatically added by C
778 if (isString && (CPA->getNumOperands() == 0 ||
779 !cast<Constant>(*(CPA->op_end()-1))->isNullValue()))
784 // Keep track of whether the last number was a hexadecimal escape
785 bool LastWasHex = false;
787 // Do not include the last character, which we know is null
788 for (unsigned i = 0, e = CPA->getNumOperands()-1; i != e; ++i) {
789 unsigned char C = cast<ConstantInt>(CPA->getOperand(i))->getZExtValue();
791 // Print it out literally if it is a printable character. The only thing
792 // to be careful about is when the last letter output was a hex escape
793 // code, in which case we have to be careful not to print out hex digits
794 // explicitly (the C compiler thinks it is a continuation of the previous
795 // character, sheesh...)
797 if (isprint(C) && (!LastWasHex || !isxdigit(C))) {
799 if (C == '"' || C == '\\')
800 Out << "\\" << (char)C;
806 case '\n': Out << "\\n"; break;
807 case '\t': Out << "\\t"; break;
808 case '\r': Out << "\\r"; break;
809 case '\v': Out << "\\v"; break;
810 case '\a': Out << "\\a"; break;
811 case '\"': Out << "\\\""; break;
812 case '\'': Out << "\\\'"; break;
815 Out << (char)(( C/16 < 10) ? ( C/16 +'0') : ( C/16 -10+'A'));
816 Out << (char)(((C&15) < 10) ? ((C&15)+'0') : ((C&15)-10+'A'));
825 if (CPA->getNumOperands()) {
827 printConstant(cast<Constant>(CPA->getOperand(0)), Static);
828 for (unsigned i = 1, e = CPA->getNumOperands(); i != e; ++i) {
830 printConstant(cast<Constant>(CPA->getOperand(i)), Static);
837 void CWriter::printConstantVector(ConstantVector *CP, bool Static) {
839 if (CP->getNumOperands()) {
841 printConstant(cast<Constant>(CP->getOperand(0)), Static);
842 for (unsigned i = 1, e = CP->getNumOperands(); i != e; ++i) {
844 printConstant(cast<Constant>(CP->getOperand(i)), Static);
850 // isFPCSafeToPrint - Returns true if we may assume that CFP may be written out
851 // textually as a double (rather than as a reference to a stack-allocated
852 // variable). We decide this by converting CFP to a string and back into a
853 // double, and then checking whether the conversion results in a bit-equal
854 // double to the original value of CFP. This depends on us and the target C
855 // compiler agreeing on the conversion process (which is pretty likely since we
856 // only deal in IEEE FP).
858 static bool isFPCSafeToPrint(const ConstantFP *CFP) {
860 // Do long doubles in hex for now.
861 if (CFP->getType() != Type::FloatTy && CFP->getType() != Type::DoubleTy)
863 APFloat APF = APFloat(CFP->getValueAPF()); // copy
864 if (CFP->getType() == Type::FloatTy)
865 APF.convert(APFloat::IEEEdouble, APFloat::rmNearestTiesToEven, &ignored);
866 #if HAVE_PRINTF_A && ENABLE_CBE_PRINTF_A
868 sprintf(Buffer, "%a", APF.convertToDouble());
869 if (!strncmp(Buffer, "0x", 2) ||
870 !strncmp(Buffer, "-0x", 3) ||
871 !strncmp(Buffer, "+0x", 3))
872 return APF.bitwiseIsEqual(APFloat(atof(Buffer)));
875 std::string StrVal = ftostr(APF);
877 while (StrVal[0] == ' ')
878 StrVal.erase(StrVal.begin());
880 // Check to make sure that the stringized number is not some string like "Inf"
881 // or NaN. Check that the string matches the "[-+]?[0-9]" regex.
882 if ((StrVal[0] >= '0' && StrVal[0] <= '9') ||
883 ((StrVal[0] == '-' || StrVal[0] == '+') &&
884 (StrVal[1] >= '0' && StrVal[1] <= '9')))
885 // Reparse stringized version!
886 return APF.bitwiseIsEqual(APFloat(atof(StrVal.c_str())));
891 /// Print out the casting for a cast operation. This does the double casting
892 /// necessary for conversion to the destination type, if necessary.
893 /// @brief Print a cast
894 void CWriter::printCast(unsigned opc, const Type *SrcTy, const Type *DstTy) {
895 // Print the destination type cast
897 case Instruction::UIToFP:
898 case Instruction::SIToFP:
899 case Instruction::IntToPtr:
900 case Instruction::Trunc:
901 case Instruction::BitCast:
902 case Instruction::FPExt:
903 case Instruction::FPTrunc: // For these the DstTy sign doesn't matter
905 printType(Out, DstTy);
908 case Instruction::ZExt:
909 case Instruction::PtrToInt:
910 case Instruction::FPToUI: // For these, make sure we get an unsigned dest
912 printSimpleType(Out, DstTy, false);
915 case Instruction::SExt:
916 case Instruction::FPToSI: // For these, make sure we get a signed dest
918 printSimpleType(Out, DstTy, true);
922 assert(0 && "Invalid cast opcode");
925 // Print the source type cast
927 case Instruction::UIToFP:
928 case Instruction::ZExt:
930 printSimpleType(Out, SrcTy, false);
933 case Instruction::SIToFP:
934 case Instruction::SExt:
936 printSimpleType(Out, SrcTy, true);
939 case Instruction::IntToPtr:
940 case Instruction::PtrToInt:
941 // Avoid "cast to pointer from integer of different size" warnings
942 Out << "(unsigned long)";
944 case Instruction::Trunc:
945 case Instruction::BitCast:
946 case Instruction::FPExt:
947 case Instruction::FPTrunc:
948 case Instruction::FPToSI:
949 case Instruction::FPToUI:
950 break; // These don't need a source cast.
952 assert(0 && "Invalid cast opcode");
957 // printConstant - The LLVM Constant to C Constant converter.
958 void CWriter::printConstant(Constant *CPV, bool Static) {
959 if (const ConstantExpr *CE = dyn_cast<ConstantExpr>(CPV)) {
960 switch (CE->getOpcode()) {
961 case Instruction::Trunc:
962 case Instruction::ZExt:
963 case Instruction::SExt:
964 case Instruction::FPTrunc:
965 case Instruction::FPExt:
966 case Instruction::UIToFP:
967 case Instruction::SIToFP:
968 case Instruction::FPToUI:
969 case Instruction::FPToSI:
970 case Instruction::PtrToInt:
971 case Instruction::IntToPtr:
972 case Instruction::BitCast:
974 printCast(CE->getOpcode(), CE->getOperand(0)->getType(), CE->getType());
975 if (CE->getOpcode() == Instruction::SExt &&
976 CE->getOperand(0)->getType() == Type::Int1Ty) {
977 // Make sure we really sext from bool here by subtracting from 0
980 printConstant(CE->getOperand(0), Static);
981 if (CE->getType() == Type::Int1Ty &&
982 (CE->getOpcode() == Instruction::Trunc ||
983 CE->getOpcode() == Instruction::FPToUI ||
984 CE->getOpcode() == Instruction::FPToSI ||
985 CE->getOpcode() == Instruction::PtrToInt)) {
986 // Make sure we really truncate to bool here by anding with 1
992 case Instruction::GetElementPtr:
994 printGEPExpression(CE->getOperand(0), gep_type_begin(CPV),
995 gep_type_end(CPV), Static);
998 case Instruction::Select:
1000 printConstant(CE->getOperand(0), Static);
1002 printConstant(CE->getOperand(1), Static);
1004 printConstant(CE->getOperand(2), Static);
1007 case Instruction::Add:
1008 case Instruction::FAdd:
1009 case Instruction::Sub:
1010 case Instruction::FSub:
1011 case Instruction::Mul:
1012 case Instruction::FMul:
1013 case Instruction::SDiv:
1014 case Instruction::UDiv:
1015 case Instruction::FDiv:
1016 case Instruction::URem:
1017 case Instruction::SRem:
1018 case Instruction::FRem:
1019 case Instruction::And:
1020 case Instruction::Or:
1021 case Instruction::Xor:
1022 case Instruction::ICmp:
1023 case Instruction::Shl:
1024 case Instruction::LShr:
1025 case Instruction::AShr:
1028 bool NeedsClosingParens = printConstExprCast(CE, Static);
1029 printConstantWithCast(CE->getOperand(0), CE->getOpcode());
1030 switch (CE->getOpcode()) {
1031 case Instruction::Add:
1032 case Instruction::FAdd: Out << " + "; break;
1033 case Instruction::Sub:
1034 case Instruction::FSub: Out << " - "; break;
1035 case Instruction::Mul:
1036 case Instruction::FMul: Out << " * "; break;
1037 case Instruction::URem:
1038 case Instruction::SRem:
1039 case Instruction::FRem: Out << " % "; break;
1040 case Instruction::UDiv:
1041 case Instruction::SDiv:
1042 case Instruction::FDiv: Out << " / "; break;
1043 case Instruction::And: Out << " & "; break;
1044 case Instruction::Or: Out << " | "; break;
1045 case Instruction::Xor: Out << " ^ "; break;
1046 case Instruction::Shl: Out << " << "; break;
1047 case Instruction::LShr:
1048 case Instruction::AShr: Out << " >> "; break;
1049 case Instruction::ICmp:
1050 switch (CE->getPredicate()) {
1051 case ICmpInst::ICMP_EQ: Out << " == "; break;
1052 case ICmpInst::ICMP_NE: Out << " != "; break;
1053 case ICmpInst::ICMP_SLT:
1054 case ICmpInst::ICMP_ULT: Out << " < "; break;
1055 case ICmpInst::ICMP_SLE:
1056 case ICmpInst::ICMP_ULE: Out << " <= "; break;
1057 case ICmpInst::ICMP_SGT:
1058 case ICmpInst::ICMP_UGT: Out << " > "; break;
1059 case ICmpInst::ICMP_SGE:
1060 case ICmpInst::ICMP_UGE: Out << " >= "; break;
1061 default: assert(0 && "Illegal ICmp predicate");
1064 default: assert(0 && "Illegal opcode here!");
1066 printConstantWithCast(CE->getOperand(1), CE->getOpcode());
1067 if (NeedsClosingParens)
1072 case Instruction::FCmp: {
1074 bool NeedsClosingParens = printConstExprCast(CE, Static);
1075 if (CE->getPredicate() == FCmpInst::FCMP_FALSE)
1077 else if (CE->getPredicate() == FCmpInst::FCMP_TRUE)
1081 switch (CE->getPredicate()) {
1082 default: assert(0 && "Illegal FCmp predicate");
1083 case FCmpInst::FCMP_ORD: op = "ord"; break;
1084 case FCmpInst::FCMP_UNO: op = "uno"; break;
1085 case FCmpInst::FCMP_UEQ: op = "ueq"; break;
1086 case FCmpInst::FCMP_UNE: op = "une"; break;
1087 case FCmpInst::FCMP_ULT: op = "ult"; break;
1088 case FCmpInst::FCMP_ULE: op = "ule"; break;
1089 case FCmpInst::FCMP_UGT: op = "ugt"; break;
1090 case FCmpInst::FCMP_UGE: op = "uge"; break;
1091 case FCmpInst::FCMP_OEQ: op = "oeq"; break;
1092 case FCmpInst::FCMP_ONE: op = "one"; break;
1093 case FCmpInst::FCMP_OLT: op = "olt"; break;
1094 case FCmpInst::FCMP_OLE: op = "ole"; break;
1095 case FCmpInst::FCMP_OGT: op = "ogt"; break;
1096 case FCmpInst::FCMP_OGE: op = "oge"; break;
1098 Out << "llvm_fcmp_" << op << "(";
1099 printConstantWithCast(CE->getOperand(0), CE->getOpcode());
1101 printConstantWithCast(CE->getOperand(1), CE->getOpcode());
1104 if (NeedsClosingParens)
1110 cerr << "CWriter Error: Unhandled constant expression: "
1114 } else if (isa<UndefValue>(CPV) && CPV->getType()->isSingleValueType()) {
1116 printType(Out, CPV->getType()); // sign doesn't matter
1117 Out << ")/*UNDEF*/";
1118 if (!isa<VectorType>(CPV->getType())) {
1126 if (ConstantInt *CI = dyn_cast<ConstantInt>(CPV)) {
1127 const Type* Ty = CI->getType();
1128 if (Ty == Type::Int1Ty)
1129 Out << (CI->getZExtValue() ? '1' : '0');
1130 else if (Ty == Type::Int32Ty)
1131 Out << CI->getZExtValue() << 'u';
1132 else if (Ty->getPrimitiveSizeInBits() > 32)
1133 Out << CI->getZExtValue() << "ull";
1136 printSimpleType(Out, Ty, false) << ')';
1137 if (CI->isMinValue(true))
1138 Out << CI->getZExtValue() << 'u';
1140 Out << CI->getSExtValue();
1146 switch (CPV->getType()->getTypeID()) {
1147 case Type::FloatTyID:
1148 case Type::DoubleTyID:
1149 case Type::X86_FP80TyID:
1150 case Type::PPC_FP128TyID:
1151 case Type::FP128TyID: {
1152 ConstantFP *FPC = cast<ConstantFP>(CPV);
1153 std::map<const ConstantFP*, unsigned>::iterator I = FPConstantMap.find(FPC);
1154 if (I != FPConstantMap.end()) {
1155 // Because of FP precision problems we must load from a stack allocated
1156 // value that holds the value in hex.
1157 Out << "(*(" << (FPC->getType() == Type::FloatTy ? "float" :
1158 FPC->getType() == Type::DoubleTy ? "double" :
1160 << "*)&FPConstant" << I->second << ')';
1163 if (FPC->getType() == Type::FloatTy)
1164 V = FPC->getValueAPF().convertToFloat();
1165 else if (FPC->getType() == Type::DoubleTy)
1166 V = FPC->getValueAPF().convertToDouble();
1168 // Long double. Convert the number to double, discarding precision.
1169 // This is not awesome, but it at least makes the CBE output somewhat
1171 APFloat Tmp = FPC->getValueAPF();
1173 Tmp.convert(APFloat::IEEEdouble, APFloat::rmTowardZero, &LosesInfo);
1174 V = Tmp.convertToDouble();
1180 // FIXME the actual NaN bits should be emitted.
1181 // The prefix for a quiet NaN is 0x7FF8. For a signalling NaN,
1183 const unsigned long QuietNaN = 0x7ff8UL;
1184 //const unsigned long SignalNaN = 0x7ff4UL;
1186 // We need to grab the first part of the FP #
1189 uint64_t ll = DoubleToBits(V);
1190 sprintf(Buffer, "0x%llx", static_cast<long long>(ll));
1192 std::string Num(&Buffer[0], &Buffer[6]);
1193 unsigned long Val = strtoul(Num.c_str(), 0, 16);
1195 if (FPC->getType() == Type::FloatTy)
1196 Out << "LLVM_NAN" << (Val == QuietNaN ? "" : "S") << "F(\""
1197 << Buffer << "\") /*nan*/ ";
1199 Out << "LLVM_NAN" << (Val == QuietNaN ? "" : "S") << "(\""
1200 << Buffer << "\") /*nan*/ ";
1201 } else if (IsInf(V)) {
1203 if (V < 0) Out << '-';
1204 Out << "LLVM_INF" << (FPC->getType() == Type::FloatTy ? "F" : "")
1208 #if HAVE_PRINTF_A && ENABLE_CBE_PRINTF_A
1209 // Print out the constant as a floating point number.
1211 sprintf(Buffer, "%a", V);
1214 Num = ftostr(FPC->getValueAPF());
1222 case Type::ArrayTyID:
1223 // Use C99 compound expression literal initializer syntax.
1226 printType(Out, CPV->getType());
1229 Out << "{ "; // Arrays are wrapped in struct types.
1230 if (ConstantArray *CA = dyn_cast<ConstantArray>(CPV)) {
1231 printConstantArray(CA, Static);
1233 assert(isa<ConstantAggregateZero>(CPV) || isa<UndefValue>(CPV));
1234 const ArrayType *AT = cast<ArrayType>(CPV->getType());
1236 if (AT->getNumElements()) {
1238 Constant *CZ = Constant::getNullValue(AT->getElementType());
1239 printConstant(CZ, Static);
1240 for (unsigned i = 1, e = AT->getNumElements(); i != e; ++i) {
1242 printConstant(CZ, Static);
1247 Out << " }"; // Arrays are wrapped in struct types.
1250 case Type::VectorTyID:
1251 // Use C99 compound expression literal initializer syntax.
1254 printType(Out, CPV->getType());
1257 if (ConstantVector *CV = dyn_cast<ConstantVector>(CPV)) {
1258 printConstantVector(CV, Static);
1260 assert(isa<ConstantAggregateZero>(CPV) || isa<UndefValue>(CPV));
1261 const VectorType *VT = cast<VectorType>(CPV->getType());
1263 Constant *CZ = Constant::getNullValue(VT->getElementType());
1264 printConstant(CZ, Static);
1265 for (unsigned i = 1, e = VT->getNumElements(); i != e; ++i) {
1267 printConstant(CZ, Static);
1273 case Type::StructTyID:
1274 // Use C99 compound expression literal initializer syntax.
1277 printType(Out, CPV->getType());
1280 if (isa<ConstantAggregateZero>(CPV) || isa<UndefValue>(CPV)) {
1281 const StructType *ST = cast<StructType>(CPV->getType());
1283 if (ST->getNumElements()) {
1285 printConstant(Constant::getNullValue(ST->getElementType(0)), Static);
1286 for (unsigned i = 1, e = ST->getNumElements(); i != e; ++i) {
1288 printConstant(Constant::getNullValue(ST->getElementType(i)), Static);
1294 if (CPV->getNumOperands()) {
1296 printConstant(cast<Constant>(CPV->getOperand(0)), Static);
1297 for (unsigned i = 1, e = CPV->getNumOperands(); i != e; ++i) {
1299 printConstant(cast<Constant>(CPV->getOperand(i)), Static);
1306 case Type::PointerTyID:
1307 if (isa<ConstantPointerNull>(CPV)) {
1309 printType(Out, CPV->getType()); // sign doesn't matter
1310 Out << ")/*NULL*/0)";
1312 } else if (GlobalValue *GV = dyn_cast<GlobalValue>(CPV)) {
1313 writeOperand(GV, Static);
1318 cerr << "Unknown constant type: " << *CPV << "\n";
1323 // Some constant expressions need to be casted back to the original types
1324 // because their operands were casted to the expected type. This function takes
1325 // care of detecting that case and printing the cast for the ConstantExpr.
1326 bool CWriter::printConstExprCast(const ConstantExpr* CE, bool Static) {
1327 bool NeedsExplicitCast = false;
1328 const Type *Ty = CE->getOperand(0)->getType();
1329 bool TypeIsSigned = false;
1330 switch (CE->getOpcode()) {
1331 case Instruction::Add:
1332 case Instruction::Sub:
1333 case Instruction::Mul:
1334 // We need to cast integer arithmetic so that it is always performed
1335 // as unsigned, to avoid undefined behavior on overflow.
1336 case Instruction::LShr:
1337 case Instruction::URem:
1338 case Instruction::UDiv: NeedsExplicitCast = true; break;
1339 case Instruction::AShr:
1340 case Instruction::SRem:
1341 case Instruction::SDiv: NeedsExplicitCast = true; TypeIsSigned = true; break;
1342 case Instruction::SExt:
1344 NeedsExplicitCast = true;
1345 TypeIsSigned = true;
1347 case Instruction::ZExt:
1348 case Instruction::Trunc:
1349 case Instruction::FPTrunc:
1350 case Instruction::FPExt:
1351 case Instruction::UIToFP:
1352 case Instruction::SIToFP:
1353 case Instruction::FPToUI:
1354 case Instruction::FPToSI:
1355 case Instruction::PtrToInt:
1356 case Instruction::IntToPtr:
1357 case Instruction::BitCast:
1359 NeedsExplicitCast = true;
1363 if (NeedsExplicitCast) {
1365 if (Ty->isInteger() && Ty != Type::Int1Ty)
1366 printSimpleType(Out, Ty, TypeIsSigned);
1368 printType(Out, Ty); // not integer, sign doesn't matter
1371 return NeedsExplicitCast;
1374 // Print a constant assuming that it is the operand for a given Opcode. The
1375 // opcodes that care about sign need to cast their operands to the expected
1376 // type before the operation proceeds. This function does the casting.
1377 void CWriter::printConstantWithCast(Constant* CPV, unsigned Opcode) {
1379 // Extract the operand's type, we'll need it.
1380 const Type* OpTy = CPV->getType();
1382 // Indicate whether to do the cast or not.
1383 bool shouldCast = false;
1384 bool typeIsSigned = false;
1386 // Based on the Opcode for which this Constant is being written, determine
1387 // the new type to which the operand should be casted by setting the value
1388 // of OpTy. If we change OpTy, also set shouldCast to true so it gets
1392 // for most instructions, it doesn't matter
1394 case Instruction::Add:
1395 case Instruction::Sub:
1396 case Instruction::Mul:
1397 // We need to cast integer arithmetic so that it is always performed
1398 // as unsigned, to avoid undefined behavior on overflow.
1399 case Instruction::LShr:
1400 case Instruction::UDiv:
1401 case Instruction::URem:
1404 case Instruction::AShr:
1405 case Instruction::SDiv:
1406 case Instruction::SRem:
1408 typeIsSigned = true;
1412 // Write out the casted constant if we should, otherwise just write the
1416 printSimpleType(Out, OpTy, typeIsSigned);
1418 printConstant(CPV, false);
1421 printConstant(CPV, false);
1424 std::string CWriter::GetValueName(const Value *Operand) {
1427 if (!isa<GlobalValue>(Operand) && Operand->getName() != "") {
1428 std::string VarName;
1430 Name = Operand->getName();
1431 VarName.reserve(Name.capacity());
1433 for (std::string::iterator I = Name.begin(), E = Name.end();
1437 if (!((ch >= 'a' && ch <= 'z') || (ch >= 'A' && ch <= 'Z') ||
1438 (ch >= '0' && ch <= '9') || ch == '_')) {
1440 sprintf(buffer, "_%x_", ch);
1446 Name = "llvm_cbe_" + VarName;
1448 Name = Mang->getValueName(Operand);
1454 /// writeInstComputationInline - Emit the computation for the specified
1455 /// instruction inline, with no destination provided.
1456 void CWriter::writeInstComputationInline(Instruction &I) {
1457 // If this is a non-trivial bool computation, make sure to truncate down to
1458 // a 1 bit value. This is important because we want "add i1 x, y" to return
1459 // "0" when x and y are true, not "2" for example.
1460 bool NeedBoolTrunc = false;
1461 if (I.getType() == Type::Int1Ty && !isa<ICmpInst>(I) && !isa<FCmpInst>(I))
1462 NeedBoolTrunc = true;
1474 void CWriter::writeOperandInternal(Value *Operand, bool Static) {
1475 if (Instruction *I = dyn_cast<Instruction>(Operand))
1476 // Should we inline this instruction to build a tree?
1477 if (isInlinableInst(*I) && !isDirectAlloca(I)) {
1479 writeInstComputationInline(*I);
1484 Constant* CPV = dyn_cast<Constant>(Operand);
1486 if (CPV && !isa<GlobalValue>(CPV))
1487 printConstant(CPV, Static);
1489 Out << GetValueName(Operand);
1492 void CWriter::writeOperand(Value *Operand, bool Static) {
1493 bool isAddressImplicit = isAddressExposed(Operand);
1494 if (isAddressImplicit)
1495 Out << "(&"; // Global variables are referenced as their addresses by llvm
1497 writeOperandInternal(Operand, Static);
1499 if (isAddressImplicit)
1503 // Some instructions need to have their result value casted back to the
1504 // original types because their operands were casted to the expected type.
1505 // This function takes care of detecting that case and printing the cast
1506 // for the Instruction.
1507 bool CWriter::writeInstructionCast(const Instruction &I) {
1508 const Type *Ty = I.getOperand(0)->getType();
1509 switch (I.getOpcode()) {
1510 case Instruction::Add:
1511 case Instruction::Sub:
1512 case Instruction::Mul:
1513 // We need to cast integer arithmetic so that it is always performed
1514 // as unsigned, to avoid undefined behavior on overflow.
1515 case Instruction::LShr:
1516 case Instruction::URem:
1517 case Instruction::UDiv:
1519 printSimpleType(Out, Ty, false);
1522 case Instruction::AShr:
1523 case Instruction::SRem:
1524 case Instruction::SDiv:
1526 printSimpleType(Out, Ty, true);
1534 // Write the operand with a cast to another type based on the Opcode being used.
1535 // This will be used in cases where an instruction has specific type
1536 // requirements (usually signedness) for its operands.
1537 void CWriter::writeOperandWithCast(Value* Operand, unsigned Opcode) {
1539 // Extract the operand's type, we'll need it.
1540 const Type* OpTy = Operand->getType();
1542 // Indicate whether to do the cast or not.
1543 bool shouldCast = false;
1545 // Indicate whether the cast should be to a signed type or not.
1546 bool castIsSigned = false;
1548 // Based on the Opcode for which this Operand is being written, determine
1549 // the new type to which the operand should be casted by setting the value
1550 // of OpTy. If we change OpTy, also set shouldCast to true.
1553 // for most instructions, it doesn't matter
1555 case Instruction::Add:
1556 case Instruction::Sub:
1557 case Instruction::Mul:
1558 // We need to cast integer arithmetic so that it is always performed
1559 // as unsigned, to avoid undefined behavior on overflow.
1560 case Instruction::LShr:
1561 case Instruction::UDiv:
1562 case Instruction::URem: // Cast to unsigned first
1564 castIsSigned = false;
1566 case Instruction::GetElementPtr:
1567 case Instruction::AShr:
1568 case Instruction::SDiv:
1569 case Instruction::SRem: // Cast to signed first
1571 castIsSigned = true;
1575 // Write out the casted operand if we should, otherwise just write the
1579 printSimpleType(Out, OpTy, castIsSigned);
1581 writeOperand(Operand);
1584 writeOperand(Operand);
1587 // Write the operand with a cast to another type based on the icmp predicate
1589 void CWriter::writeOperandWithCast(Value* Operand, const ICmpInst &Cmp) {
1590 // This has to do a cast to ensure the operand has the right signedness.
1591 // Also, if the operand is a pointer, we make sure to cast to an integer when
1592 // doing the comparison both for signedness and so that the C compiler doesn't
1593 // optimize things like "p < NULL" to false (p may contain an integer value
1595 bool shouldCast = Cmp.isRelational();
1597 // Write out the casted operand if we should, otherwise just write the
1600 writeOperand(Operand);
1604 // Should this be a signed comparison? If so, convert to signed.
1605 bool castIsSigned = Cmp.isSignedPredicate();
1607 // If the operand was a pointer, convert to a large integer type.
1608 const Type* OpTy = Operand->getType();
1609 if (isa<PointerType>(OpTy))
1610 OpTy = TD->getIntPtrType();
1613 printSimpleType(Out, OpTy, castIsSigned);
1615 writeOperand(Operand);
1619 // generateCompilerSpecificCode - This is where we add conditional compilation
1620 // directives to cater to specific compilers as need be.
1622 static void generateCompilerSpecificCode(raw_ostream& Out,
1623 const TargetData *TD) {
1624 // Alloca is hard to get, and we don't want to include stdlib.h here.
1625 Out << "/* get a declaration for alloca */\n"
1626 << "#if defined(__CYGWIN__) || defined(__MINGW32__)\n"
1627 << "#define alloca(x) __builtin_alloca((x))\n"
1628 << "#define _alloca(x) __builtin_alloca((x))\n"
1629 << "#elif defined(__APPLE__)\n"
1630 << "extern void *__builtin_alloca(unsigned long);\n"
1631 << "#define alloca(x) __builtin_alloca(x)\n"
1632 << "#define longjmp _longjmp\n"
1633 << "#define setjmp _setjmp\n"
1634 << "#elif defined(__sun__)\n"
1635 << "#if defined(__sparcv9)\n"
1636 << "extern void *__builtin_alloca(unsigned long);\n"
1638 << "extern void *__builtin_alloca(unsigned int);\n"
1640 << "#define alloca(x) __builtin_alloca(x)\n"
1641 << "#elif defined(__FreeBSD__) || defined(__NetBSD__) || defined(__OpenBSD__) || defined(__DragonFly__)\n"
1642 << "#define alloca(x) __builtin_alloca(x)\n"
1643 << "#elif defined(_MSC_VER)\n"
1644 << "#define inline _inline\n"
1645 << "#define alloca(x) _alloca(x)\n"
1647 << "#include <alloca.h>\n"
1650 // We output GCC specific attributes to preserve 'linkonce'ness on globals.
1651 // If we aren't being compiled with GCC, just drop these attributes.
1652 Out << "#ifndef __GNUC__ /* Can only support \"linkonce\" vars with GCC */\n"
1653 << "#define __attribute__(X)\n"
1656 // On Mac OS X, "external weak" is spelled "__attribute__((weak_import))".
1657 Out << "#if defined(__GNUC__) && defined(__APPLE_CC__)\n"
1658 << "#define __EXTERNAL_WEAK__ __attribute__((weak_import))\n"
1659 << "#elif defined(__GNUC__)\n"
1660 << "#define __EXTERNAL_WEAK__ __attribute__((weak))\n"
1662 << "#define __EXTERNAL_WEAK__\n"
1665 // For now, turn off the weak linkage attribute on Mac OS X. (See above.)
1666 Out << "#if defined(__GNUC__) && defined(__APPLE_CC__)\n"
1667 << "#define __ATTRIBUTE_WEAK__\n"
1668 << "#elif defined(__GNUC__)\n"
1669 << "#define __ATTRIBUTE_WEAK__ __attribute__((weak))\n"
1671 << "#define __ATTRIBUTE_WEAK__\n"
1674 // Add hidden visibility support. FIXME: APPLE_CC?
1675 Out << "#if defined(__GNUC__)\n"
1676 << "#define __HIDDEN__ __attribute__((visibility(\"hidden\")))\n"
1679 // Define NaN and Inf as GCC builtins if using GCC, as 0 otherwise
1680 // From the GCC documentation:
1682 // double __builtin_nan (const char *str)
1684 // This is an implementation of the ISO C99 function nan.
1686 // Since ISO C99 defines this function in terms of strtod, which we do
1687 // not implement, a description of the parsing is in order. The string is
1688 // parsed as by strtol; that is, the base is recognized by leading 0 or
1689 // 0x prefixes. The number parsed is placed in the significand such that
1690 // the least significant bit of the number is at the least significant
1691 // bit of the significand. The number is truncated to fit the significand
1692 // field provided. The significand is forced to be a quiet NaN.
1694 // This function, if given a string literal, is evaluated early enough
1695 // that it is considered a compile-time constant.
1697 // float __builtin_nanf (const char *str)
1699 // Similar to __builtin_nan, except the return type is float.
1701 // double __builtin_inf (void)
1703 // Similar to __builtin_huge_val, except a warning is generated if the
1704 // target floating-point format does not support infinities. This
1705 // function is suitable for implementing the ISO C99 macro INFINITY.
1707 // float __builtin_inff (void)
1709 // Similar to __builtin_inf, except the return type is float.
1710 Out << "#ifdef __GNUC__\n"
1711 << "#define LLVM_NAN(NanStr) __builtin_nan(NanStr) /* Double */\n"
1712 << "#define LLVM_NANF(NanStr) __builtin_nanf(NanStr) /* Float */\n"
1713 << "#define LLVM_NANS(NanStr) __builtin_nans(NanStr) /* Double */\n"
1714 << "#define LLVM_NANSF(NanStr) __builtin_nansf(NanStr) /* Float */\n"
1715 << "#define LLVM_INF __builtin_inf() /* Double */\n"
1716 << "#define LLVM_INFF __builtin_inff() /* Float */\n"
1717 << "#define LLVM_PREFETCH(addr,rw,locality) "
1718 "__builtin_prefetch(addr,rw,locality)\n"
1719 << "#define __ATTRIBUTE_CTOR__ __attribute__((constructor))\n"
1720 << "#define __ATTRIBUTE_DTOR__ __attribute__((destructor))\n"
1721 << "#define LLVM_ASM __asm__\n"
1723 << "#define LLVM_NAN(NanStr) ((double)0.0) /* Double */\n"
1724 << "#define LLVM_NANF(NanStr) 0.0F /* Float */\n"
1725 << "#define LLVM_NANS(NanStr) ((double)0.0) /* Double */\n"
1726 << "#define LLVM_NANSF(NanStr) 0.0F /* Float */\n"
1727 << "#define LLVM_INF ((double)0.0) /* Double */\n"
1728 << "#define LLVM_INFF 0.0F /* Float */\n"
1729 << "#define LLVM_PREFETCH(addr,rw,locality) /* PREFETCH */\n"
1730 << "#define __ATTRIBUTE_CTOR__\n"
1731 << "#define __ATTRIBUTE_DTOR__\n"
1732 << "#define LLVM_ASM(X)\n"
1735 Out << "#if __GNUC__ < 4 /* Old GCC's, or compilers not GCC */ \n"
1736 << "#define __builtin_stack_save() 0 /* not implemented */\n"
1737 << "#define __builtin_stack_restore(X) /* noop */\n"
1740 // Output typedefs for 128-bit integers. If these are needed with a
1741 // 32-bit target or with a C compiler that doesn't support mode(TI),
1742 // more drastic measures will be needed.
1743 Out << "#if __GNUC__ && __LP64__ /* 128-bit integer types */\n"
1744 << "typedef int __attribute__((mode(TI))) llvmInt128;\n"
1745 << "typedef unsigned __attribute__((mode(TI))) llvmUInt128;\n"
1748 // Output target-specific code that should be inserted into main.
1749 Out << "#define CODE_FOR_MAIN() /* Any target-specific code for main()*/\n";
1752 /// FindStaticTors - Given a static ctor/dtor list, unpack its contents into
1753 /// the StaticTors set.
1754 static void FindStaticTors(GlobalVariable *GV, std::set<Function*> &StaticTors){
1755 ConstantArray *InitList = dyn_cast<ConstantArray>(GV->getInitializer());
1756 if (!InitList) return;
1758 for (unsigned i = 0, e = InitList->getNumOperands(); i != e; ++i)
1759 if (ConstantStruct *CS = dyn_cast<ConstantStruct>(InitList->getOperand(i))){
1760 if (CS->getNumOperands() != 2) return; // Not array of 2-element structs.
1762 if (CS->getOperand(1)->isNullValue())
1763 return; // Found a null terminator, exit printing.
1764 Constant *FP = CS->getOperand(1);
1765 if (ConstantExpr *CE = dyn_cast<ConstantExpr>(FP))
1767 FP = CE->getOperand(0);
1768 if (Function *F = dyn_cast<Function>(FP))
1769 StaticTors.insert(F);
1773 enum SpecialGlobalClass {
1775 GlobalCtors, GlobalDtors,
1779 /// getGlobalVariableClass - If this is a global that is specially recognized
1780 /// by LLVM, return a code that indicates how we should handle it.
1781 static SpecialGlobalClass getGlobalVariableClass(const GlobalVariable *GV) {
1782 // If this is a global ctors/dtors list, handle it now.
1783 if (GV->hasAppendingLinkage() && GV->use_empty()) {
1784 if (GV->getName() == "llvm.global_ctors")
1786 else if (GV->getName() == "llvm.global_dtors")
1790 // Otherwise, it it is other metadata, don't print it. This catches things
1791 // like debug information.
1792 if (GV->getSection() == "llvm.metadata")
1799 bool CWriter::doInitialization(Module &M) {
1803 TD = new TargetData(&M);
1804 IL = new IntrinsicLowering(*TD);
1805 IL->AddPrototypes(M);
1807 // Ensure that all structure types have names...
1808 Mang = new Mangler(M);
1809 Mang->markCharUnacceptable('.');
1811 // Keep track of which functions are static ctors/dtors so they can have
1812 // an attribute added to their prototypes.
1813 std::set<Function*> StaticCtors, StaticDtors;
1814 for (Module::global_iterator I = M.global_begin(), E = M.global_end();
1816 switch (getGlobalVariableClass(I)) {
1819 FindStaticTors(I, StaticCtors);
1822 FindStaticTors(I, StaticDtors);
1827 // get declaration for alloca
1828 Out << "/* Provide Declarations */\n";
1829 Out << "#include <stdarg.h>\n"; // Varargs support
1830 Out << "#include <setjmp.h>\n"; // Unwind support
1831 generateCompilerSpecificCode(Out, TD);
1833 // Provide a definition for `bool' if not compiling with a C++ compiler.
1835 << "#ifndef __cplusplus\ntypedef unsigned char bool;\n#endif\n"
1837 << "\n\n/* Support for floating point constants */\n"
1838 << "typedef unsigned long long ConstantDoubleTy;\n"
1839 << "typedef unsigned int ConstantFloatTy;\n"
1840 << "typedef struct { unsigned long long f1; unsigned short f2; "
1841 "unsigned short pad[3]; } ConstantFP80Ty;\n"
1842 // This is used for both kinds of 128-bit long double; meaning differs.
1843 << "typedef struct { unsigned long long f1; unsigned long long f2; }"
1844 " ConstantFP128Ty;\n"
1845 << "\n\n/* Global Declarations */\n";
1847 // First output all the declarations for the program, because C requires
1848 // Functions & globals to be declared before they are used.
1851 // Loop over the symbol table, emitting all named constants...
1852 printModuleTypes(M.getTypeSymbolTable());
1854 // Global variable declarations...
1855 if (!M.global_empty()) {
1856 Out << "\n/* External Global Variable Declarations */\n";
1857 for (Module::global_iterator I = M.global_begin(), E = M.global_end();
1860 if (I->hasExternalLinkage() || I->hasExternalWeakLinkage() ||
1861 I->hasCommonLinkage())
1863 else if (I->hasDLLImportLinkage())
1864 Out << "__declspec(dllimport) ";
1866 continue; // Internal Global
1868 // Thread Local Storage
1869 if (I->isThreadLocal())
1872 printType(Out, I->getType()->getElementType(), false, GetValueName(I));
1874 if (I->hasExternalWeakLinkage())
1875 Out << " __EXTERNAL_WEAK__";
1880 // Function declarations
1881 Out << "\n/* Function Declarations */\n";
1882 Out << "double fmod(double, double);\n"; // Support for FP rem
1883 Out << "float fmodf(float, float);\n";
1884 Out << "long double fmodl(long double, long double);\n";
1886 for (Module::iterator I = M.begin(), E = M.end(); I != E; ++I) {
1887 // Don't print declarations for intrinsic functions.
1888 if (!I->isIntrinsic() && I->getName() != "setjmp" &&
1889 I->getName() != "longjmp" && I->getName() != "_setjmp") {
1890 if (I->hasExternalWeakLinkage())
1892 printFunctionSignature(I, true);
1893 if (I->hasWeakLinkage() || I->hasLinkOnceLinkage())
1894 Out << " __ATTRIBUTE_WEAK__";
1895 if (I->hasExternalWeakLinkage())
1896 Out << " __EXTERNAL_WEAK__";
1897 if (StaticCtors.count(I))
1898 Out << " __ATTRIBUTE_CTOR__";
1899 if (StaticDtors.count(I))
1900 Out << " __ATTRIBUTE_DTOR__";
1901 if (I->hasHiddenVisibility())
1902 Out << " __HIDDEN__";
1904 if (I->hasName() && I->getName()[0] == 1)
1905 Out << " LLVM_ASM(\"" << I->getName().c_str()+1 << "\")";
1911 // Output the global variable declarations
1912 if (!M.global_empty()) {
1913 Out << "\n\n/* Global Variable Declarations */\n";
1914 for (Module::global_iterator I = M.global_begin(), E = M.global_end();
1916 if (!I->isDeclaration()) {
1917 // Ignore special globals, such as debug info.
1918 if (getGlobalVariableClass(I))
1921 if (I->hasLocalLinkage())
1926 // Thread Local Storage
1927 if (I->isThreadLocal())
1930 printType(Out, I->getType()->getElementType(), false,
1933 if (I->hasLinkOnceLinkage())
1934 Out << " __attribute__((common))";
1935 else if (I->hasCommonLinkage()) // FIXME is this right?
1936 Out << " __ATTRIBUTE_WEAK__";
1937 else if (I->hasWeakLinkage())
1938 Out << " __ATTRIBUTE_WEAK__";
1939 else if (I->hasExternalWeakLinkage())
1940 Out << " __EXTERNAL_WEAK__";
1941 if (I->hasHiddenVisibility())
1942 Out << " __HIDDEN__";
1947 // Output the global variable definitions and contents...
1948 if (!M.global_empty()) {
1949 Out << "\n\n/* Global Variable Definitions and Initialization */\n";
1950 for (Module::global_iterator I = M.global_begin(), E = M.global_end();
1952 if (!I->isDeclaration()) {
1953 // Ignore special globals, such as debug info.
1954 if (getGlobalVariableClass(I))
1957 if (I->hasLocalLinkage())
1959 else if (I->hasDLLImportLinkage())
1960 Out << "__declspec(dllimport) ";
1961 else if (I->hasDLLExportLinkage())
1962 Out << "__declspec(dllexport) ";
1964 // Thread Local Storage
1965 if (I->isThreadLocal())
1968 printType(Out, I->getType()->getElementType(), false,
1970 if (I->hasLinkOnceLinkage())
1971 Out << " __attribute__((common))";
1972 else if (I->hasWeakLinkage())
1973 Out << " __ATTRIBUTE_WEAK__";
1974 else if (I->hasCommonLinkage())
1975 Out << " __ATTRIBUTE_WEAK__";
1977 if (I->hasHiddenVisibility())
1978 Out << " __HIDDEN__";
1980 // If the initializer is not null, emit the initializer. If it is null,
1981 // we try to avoid emitting large amounts of zeros. The problem with
1982 // this, however, occurs when the variable has weak linkage. In this
1983 // case, the assembler will complain about the variable being both weak
1984 // and common, so we disable this optimization.
1985 // FIXME common linkage should avoid this problem.
1986 if (!I->getInitializer()->isNullValue()) {
1988 writeOperand(I->getInitializer(), true);
1989 } else if (I->hasWeakLinkage()) {
1990 // We have to specify an initializer, but it doesn't have to be
1991 // complete. If the value is an aggregate, print out { 0 }, and let
1992 // the compiler figure out the rest of the zeros.
1994 if (isa<StructType>(I->getInitializer()->getType()) ||
1995 isa<VectorType>(I->getInitializer()->getType())) {
1997 } else if (isa<ArrayType>(I->getInitializer()->getType())) {
1998 // As with structs and vectors, but with an extra set of braces
1999 // because arrays are wrapped in structs.
2002 // Just print it out normally.
2003 writeOperand(I->getInitializer(), true);
2011 Out << "\n\n/* Function Bodies */\n";
2013 // Emit some helper functions for dealing with FCMP instruction's
2015 Out << "static inline int llvm_fcmp_ord(double X, double Y) { ";
2016 Out << "return X == X && Y == Y; }\n";
2017 Out << "static inline int llvm_fcmp_uno(double X, double Y) { ";
2018 Out << "return X != X || Y != Y; }\n";
2019 Out << "static inline int llvm_fcmp_ueq(double X, double Y) { ";
2020 Out << "return X == Y || llvm_fcmp_uno(X, Y); }\n";
2021 Out << "static inline int llvm_fcmp_une(double X, double Y) { ";
2022 Out << "return X != Y; }\n";
2023 Out << "static inline int llvm_fcmp_ult(double X, double Y) { ";
2024 Out << "return X < Y || llvm_fcmp_uno(X, Y); }\n";
2025 Out << "static inline int llvm_fcmp_ugt(double X, double Y) { ";
2026 Out << "return X > Y || llvm_fcmp_uno(X, Y); }\n";
2027 Out << "static inline int llvm_fcmp_ule(double X, double Y) { ";
2028 Out << "return X <= Y || llvm_fcmp_uno(X, Y); }\n";
2029 Out << "static inline int llvm_fcmp_uge(double X, double Y) { ";
2030 Out << "return X >= Y || llvm_fcmp_uno(X, Y); }\n";
2031 Out << "static inline int llvm_fcmp_oeq(double X, double Y) { ";
2032 Out << "return X == Y ; }\n";
2033 Out << "static inline int llvm_fcmp_one(double X, double Y) { ";
2034 Out << "return X != Y && llvm_fcmp_ord(X, Y); }\n";
2035 Out << "static inline int llvm_fcmp_olt(double X, double Y) { ";
2036 Out << "return X < Y ; }\n";
2037 Out << "static inline int llvm_fcmp_ogt(double X, double Y) { ";
2038 Out << "return X > Y ; }\n";
2039 Out << "static inline int llvm_fcmp_ole(double X, double Y) { ";
2040 Out << "return X <= Y ; }\n";
2041 Out << "static inline int llvm_fcmp_oge(double X, double Y) { ";
2042 Out << "return X >= Y ; }\n";
2047 /// Output all floating point constants that cannot be printed accurately...
2048 void CWriter::printFloatingPointConstants(Function &F) {
2049 // Scan the module for floating point constants. If any FP constant is used
2050 // in the function, we want to redirect it here so that we do not depend on
2051 // the precision of the printed form, unless the printed form preserves
2054 for (constant_iterator I = constant_begin(&F), E = constant_end(&F);
2056 printFloatingPointConstants(*I);
2061 void CWriter::printFloatingPointConstants(const Constant *C) {
2062 // If this is a constant expression, recursively check for constant fp values.
2063 if (const ConstantExpr *CE = dyn_cast<ConstantExpr>(C)) {
2064 for (unsigned i = 0, e = CE->getNumOperands(); i != e; ++i)
2065 printFloatingPointConstants(CE->getOperand(i));
2069 // Otherwise, check for a FP constant that we need to print.
2070 const ConstantFP *FPC = dyn_cast<ConstantFP>(C);
2072 // Do not put in FPConstantMap if safe.
2073 isFPCSafeToPrint(FPC) ||
2074 // Already printed this constant?
2075 FPConstantMap.count(FPC))
2078 FPConstantMap[FPC] = FPCounter; // Number the FP constants
2080 if (FPC->getType() == Type::DoubleTy) {
2081 double Val = FPC->getValueAPF().convertToDouble();
2082 uint64_t i = FPC->getValueAPF().bitcastToAPInt().getZExtValue();
2083 Out << "static const ConstantDoubleTy FPConstant" << FPCounter++
2084 << " = 0x" << utohexstr(i)
2085 << "ULL; /* " << Val << " */\n";
2086 } else if (FPC->getType() == Type::FloatTy) {
2087 float Val = FPC->getValueAPF().convertToFloat();
2088 uint32_t i = (uint32_t)FPC->getValueAPF().bitcastToAPInt().
2090 Out << "static const ConstantFloatTy FPConstant" << FPCounter++
2091 << " = 0x" << utohexstr(i)
2092 << "U; /* " << Val << " */\n";
2093 } else if (FPC->getType() == Type::X86_FP80Ty) {
2094 // api needed to prevent premature destruction
2095 APInt api = FPC->getValueAPF().bitcastToAPInt();
2096 const uint64_t *p = api.getRawData();
2097 Out << "static const ConstantFP80Ty FPConstant" << FPCounter++
2098 << " = { 0x" << utohexstr(p[0])
2099 << "ULL, 0x" << utohexstr((uint16_t)p[1]) << ",{0,0,0}"
2100 << "}; /* Long double constant */\n";
2101 } else if (FPC->getType() == Type::PPC_FP128Ty) {
2102 APInt api = FPC->getValueAPF().bitcastToAPInt();
2103 const uint64_t *p = api.getRawData();
2104 Out << "static const ConstantFP128Ty FPConstant" << FPCounter++
2106 << utohexstr(p[0]) << ", 0x" << utohexstr(p[1])
2107 << "}; /* Long double constant */\n";
2110 assert(0 && "Unknown float type!");
2116 /// printSymbolTable - Run through symbol table looking for type names. If a
2117 /// type name is found, emit its declaration...
2119 void CWriter::printModuleTypes(const TypeSymbolTable &TST) {
2120 Out << "/* Helper union for bitcasts */\n";
2121 Out << "typedef union {\n";
2122 Out << " unsigned int Int32;\n";
2123 Out << " unsigned long long Int64;\n";
2124 Out << " float Float;\n";
2125 Out << " double Double;\n";
2126 Out << "} llvmBitCastUnion;\n";
2128 // We are only interested in the type plane of the symbol table.
2129 TypeSymbolTable::const_iterator I = TST.begin();
2130 TypeSymbolTable::const_iterator End = TST.end();
2132 // If there are no type names, exit early.
2133 if (I == End) return;
2135 // Print out forward declarations for structure types before anything else!
2136 Out << "/* Structure forward decls */\n";
2137 for (; I != End; ++I) {
2138 std::string Name = "struct l_" + Mang->makeNameProper(I->first);
2139 Out << Name << ";\n";
2140 TypeNames.insert(std::make_pair(I->second, Name));
2145 // Now we can print out typedefs. Above, we guaranteed that this can only be
2146 // for struct or opaque types.
2147 Out << "/* Typedefs */\n";
2148 for (I = TST.begin(); I != End; ++I) {
2149 std::string Name = "l_" + Mang->makeNameProper(I->first);
2151 printType(Out, I->second, false, Name);
2157 // Keep track of which structures have been printed so far...
2158 std::set<const Type *> StructPrinted;
2160 // Loop over all structures then push them into the stack so they are
2161 // printed in the correct order.
2163 Out << "/* Structure contents */\n";
2164 for (I = TST.begin(); I != End; ++I)
2165 if (isa<StructType>(I->second) || isa<ArrayType>(I->second))
2166 // Only print out used types!
2167 printContainedStructs(I->second, StructPrinted);
2170 // Push the struct onto the stack and recursively push all structs
2171 // this one depends on.
2173 // TODO: Make this work properly with vector types
2175 void CWriter::printContainedStructs(const Type *Ty,
2176 std::set<const Type*> &StructPrinted) {
2177 // Don't walk through pointers.
2178 if (isa<PointerType>(Ty) || Ty->isPrimitiveType() || Ty->isInteger()) return;
2180 // Print all contained types first.
2181 for (Type::subtype_iterator I = Ty->subtype_begin(),
2182 E = Ty->subtype_end(); I != E; ++I)
2183 printContainedStructs(*I, StructPrinted);
2185 if (isa<StructType>(Ty) || isa<ArrayType>(Ty)) {
2186 // Check to see if we have already printed this struct.
2187 if (StructPrinted.insert(Ty).second) {
2188 // Print structure type out.
2189 std::string Name = TypeNames[Ty];
2190 printType(Out, Ty, false, Name, true);
2196 void CWriter::printFunctionSignature(const Function *F, bool Prototype) {
2197 /// isStructReturn - Should this function actually return a struct by-value?
2198 bool isStructReturn = F->hasStructRetAttr();
2200 if (F->hasLocalLinkage()) Out << "static ";
2201 if (F->hasDLLImportLinkage()) Out << "__declspec(dllimport) ";
2202 if (F->hasDLLExportLinkage()) Out << "__declspec(dllexport) ";
2203 switch (F->getCallingConv()) {
2204 case CallingConv::X86_StdCall:
2205 Out << "__attribute__((stdcall)) ";
2207 case CallingConv::X86_FastCall:
2208 Out << "__attribute__((fastcall)) ";
2212 // Loop over the arguments, printing them...
2213 const FunctionType *FT = cast<FunctionType>(F->getFunctionType());
2214 const AttrListPtr &PAL = F->getAttributes();
2216 std::stringstream FunctionInnards;
2218 // Print out the name...
2219 FunctionInnards << GetValueName(F) << '(';
2221 bool PrintedArg = false;
2222 if (!F->isDeclaration()) {
2223 if (!F->arg_empty()) {
2224 Function::const_arg_iterator I = F->arg_begin(), E = F->arg_end();
2227 // If this is a struct-return function, don't print the hidden
2228 // struct-return argument.
2229 if (isStructReturn) {
2230 assert(I != E && "Invalid struct return function!");
2235 std::string ArgName;
2236 for (; I != E; ++I) {
2237 if (PrintedArg) FunctionInnards << ", ";
2238 if (I->hasName() || !Prototype)
2239 ArgName = GetValueName(I);
2242 const Type *ArgTy = I->getType();
2243 if (PAL.paramHasAttr(Idx, Attribute::ByVal)) {
2244 ArgTy = cast<PointerType>(ArgTy)->getElementType();
2245 ByValParams.insert(I);
2247 printType(FunctionInnards, ArgTy,
2248 /*isSigned=*/PAL.paramHasAttr(Idx, Attribute::SExt),
2255 // Loop over the arguments, printing them.
2256 FunctionType::param_iterator I = FT->param_begin(), E = FT->param_end();
2259 // If this is a struct-return function, don't print the hidden
2260 // struct-return argument.
2261 if (isStructReturn) {
2262 assert(I != E && "Invalid struct return function!");
2267 for (; I != E; ++I) {
2268 if (PrintedArg) FunctionInnards << ", ";
2269 const Type *ArgTy = *I;
2270 if (PAL.paramHasAttr(Idx, Attribute::ByVal)) {
2271 assert(isa<PointerType>(ArgTy));
2272 ArgTy = cast<PointerType>(ArgTy)->getElementType();
2274 printType(FunctionInnards, ArgTy,
2275 /*isSigned=*/PAL.paramHasAttr(Idx, Attribute::SExt));
2281 // Finish printing arguments... if this is a vararg function, print the ...,
2282 // unless there are no known types, in which case, we just emit ().
2284 if (FT->isVarArg() && PrintedArg) {
2285 if (PrintedArg) FunctionInnards << ", ";
2286 FunctionInnards << "..."; // Output varargs portion of signature!
2287 } else if (!FT->isVarArg() && !PrintedArg) {
2288 FunctionInnards << "void"; // ret() -> ret(void) in C.
2290 FunctionInnards << ')';
2292 // Get the return tpe for the function.
2294 if (!isStructReturn)
2295 RetTy = F->getReturnType();
2297 // If this is a struct-return function, print the struct-return type.
2298 RetTy = cast<PointerType>(FT->getParamType(0))->getElementType();
2301 // Print out the return type and the signature built above.
2302 printType(Out, RetTy,
2303 /*isSigned=*/PAL.paramHasAttr(0, Attribute::SExt),
2304 FunctionInnards.str());
2307 static inline bool isFPIntBitCast(const Instruction &I) {
2308 if (!isa<BitCastInst>(I))
2310 const Type *SrcTy = I.getOperand(0)->getType();
2311 const Type *DstTy = I.getType();
2312 return (SrcTy->isFloatingPoint() && DstTy->isInteger()) ||
2313 (DstTy->isFloatingPoint() && SrcTy->isInteger());
2316 void CWriter::printFunction(Function &F) {
2317 /// isStructReturn - Should this function actually return a struct by-value?
2318 bool isStructReturn = F.hasStructRetAttr();
2320 printFunctionSignature(&F, false);
2323 // If this is a struct return function, handle the result with magic.
2324 if (isStructReturn) {
2325 const Type *StructTy =
2326 cast<PointerType>(F.arg_begin()->getType())->getElementType();
2328 printType(Out, StructTy, false, "StructReturn");
2329 Out << "; /* Struct return temporary */\n";
2332 printType(Out, F.arg_begin()->getType(), false,
2333 GetValueName(F.arg_begin()));
2334 Out << " = &StructReturn;\n";
2337 bool PrintedVar = false;
2339 // print local variable information for the function
2340 for (inst_iterator I = inst_begin(&F), E = inst_end(&F); I != E; ++I) {
2341 if (const AllocaInst *AI = isDirectAlloca(&*I)) {
2343 printType(Out, AI->getAllocatedType(), false, GetValueName(AI));
2344 Out << "; /* Address-exposed local */\n";
2346 } else if (I->getType() != Type::VoidTy && !isInlinableInst(*I)) {
2348 printType(Out, I->getType(), false, GetValueName(&*I));
2351 if (isa<PHINode>(*I)) { // Print out PHI node temporaries as well...
2353 printType(Out, I->getType(), false,
2354 GetValueName(&*I)+"__PHI_TEMPORARY");
2359 // We need a temporary for the BitCast to use so it can pluck a value out
2360 // of a union to do the BitCast. This is separate from the need for a
2361 // variable to hold the result of the BitCast.
2362 if (isFPIntBitCast(*I)) {
2363 Out << " llvmBitCastUnion " << GetValueName(&*I)
2364 << "__BITCAST_TEMPORARY;\n";
2372 if (F.hasExternalLinkage() && F.getName() == "main")
2373 Out << " CODE_FOR_MAIN();\n";
2375 // print the basic blocks
2376 for (Function::iterator BB = F.begin(), E = F.end(); BB != E; ++BB) {
2377 if (Loop *L = LI->getLoopFor(BB)) {
2378 if (L->getHeader() == BB && L->getParentLoop() == 0)
2381 printBasicBlock(BB);
2388 void CWriter::printLoop(Loop *L) {
2389 Out << " do { /* Syntactic loop '" << L->getHeader()->getName()
2390 << "' to make GCC happy */\n";
2391 for (unsigned i = 0, e = L->getBlocks().size(); i != e; ++i) {
2392 BasicBlock *BB = L->getBlocks()[i];
2393 Loop *BBLoop = LI->getLoopFor(BB);
2395 printBasicBlock(BB);
2396 else if (BB == BBLoop->getHeader() && BBLoop->getParentLoop() == L)
2399 Out << " } while (1); /* end of syntactic loop '"
2400 << L->getHeader()->getName() << "' */\n";
2403 void CWriter::printBasicBlock(BasicBlock *BB) {
2405 // Don't print the label for the basic block if there are no uses, or if
2406 // the only terminator use is the predecessor basic block's terminator.
2407 // We have to scan the use list because PHI nodes use basic blocks too but
2408 // do not require a label to be generated.
2410 bool NeedsLabel = false;
2411 for (pred_iterator PI = pred_begin(BB), E = pred_end(BB); PI != E; ++PI)
2412 if (isGotoCodeNecessary(*PI, BB)) {
2417 if (NeedsLabel) Out << GetValueName(BB) << ":\n";
2419 // Output all of the instructions in the basic block...
2420 for (BasicBlock::iterator II = BB->begin(), E = --BB->end(); II != E;
2422 if (!isInlinableInst(*II) && !isDirectAlloca(II)) {
2423 if (II->getType() != Type::VoidTy && !isInlineAsm(*II))
2427 writeInstComputationInline(*II);
2432 // Don't emit prefix or suffix for the terminator.
2433 visit(*BB->getTerminator());
2437 // Specific Instruction type classes... note that all of the casts are
2438 // necessary because we use the instruction classes as opaque types...
2440 void CWriter::visitReturnInst(ReturnInst &I) {
2441 // If this is a struct return function, return the temporary struct.
2442 bool isStructReturn = I.getParent()->getParent()->hasStructRetAttr();
2444 if (isStructReturn) {
2445 Out << " return StructReturn;\n";
2449 // Don't output a void return if this is the last basic block in the function
2450 if (I.getNumOperands() == 0 &&
2451 &*--I.getParent()->getParent()->end() == I.getParent() &&
2452 !I.getParent()->size() == 1) {
2456 if (I.getNumOperands() > 1) {
2459 printType(Out, I.getParent()->getParent()->getReturnType());
2460 Out << " llvm_cbe_mrv_temp = {\n";
2461 for (unsigned i = 0, e = I.getNumOperands(); i != e; ++i) {
2463 writeOperand(I.getOperand(i));
2469 Out << " return llvm_cbe_mrv_temp;\n";
2475 if (I.getNumOperands()) {
2477 writeOperand(I.getOperand(0));
2482 void CWriter::visitSwitchInst(SwitchInst &SI) {
2485 writeOperand(SI.getOperand(0));
2486 Out << ") {\n default:\n";
2487 printPHICopiesForSuccessor (SI.getParent(), SI.getDefaultDest(), 2);
2488 printBranchToBlock(SI.getParent(), SI.getDefaultDest(), 2);
2490 for (unsigned i = 2, e = SI.getNumOperands(); i != e; i += 2) {
2492 writeOperand(SI.getOperand(i));
2494 BasicBlock *Succ = cast<BasicBlock>(SI.getOperand(i+1));
2495 printPHICopiesForSuccessor (SI.getParent(), Succ, 2);
2496 printBranchToBlock(SI.getParent(), Succ, 2);
2497 if (Function::iterator(Succ) == next(Function::iterator(SI.getParent())))
2503 void CWriter::visitUnreachableInst(UnreachableInst &I) {
2504 Out << " /*UNREACHABLE*/;\n";
2507 bool CWriter::isGotoCodeNecessary(BasicBlock *From, BasicBlock *To) {
2508 /// FIXME: This should be reenabled, but loop reordering safe!!
2511 if (next(Function::iterator(From)) != Function::iterator(To))
2512 return true; // Not the direct successor, we need a goto.
2514 //isa<SwitchInst>(From->getTerminator())
2516 if (LI->getLoopFor(From) != LI->getLoopFor(To))
2521 void CWriter::printPHICopiesForSuccessor (BasicBlock *CurBlock,
2522 BasicBlock *Successor,
2524 for (BasicBlock::iterator I = Successor->begin(); isa<PHINode>(I); ++I) {
2525 PHINode *PN = cast<PHINode>(I);
2526 // Now we have to do the printing.
2527 Value *IV = PN->getIncomingValueForBlock(CurBlock);
2528 if (!isa<UndefValue>(IV)) {
2529 Out << std::string(Indent, ' ');
2530 Out << " " << GetValueName(I) << "__PHI_TEMPORARY = ";
2532 Out << "; /* for PHI node */\n";
2537 void CWriter::printBranchToBlock(BasicBlock *CurBB, BasicBlock *Succ,
2539 if (isGotoCodeNecessary(CurBB, Succ)) {
2540 Out << std::string(Indent, ' ') << " goto ";
2546 // Branch instruction printing - Avoid printing out a branch to a basic block
2547 // that immediately succeeds the current one.
2549 void CWriter::visitBranchInst(BranchInst &I) {
2551 if (I.isConditional()) {
2552 if (isGotoCodeNecessary(I.getParent(), I.getSuccessor(0))) {
2554 writeOperand(I.getCondition());
2557 printPHICopiesForSuccessor (I.getParent(), I.getSuccessor(0), 2);
2558 printBranchToBlock(I.getParent(), I.getSuccessor(0), 2);
2560 if (isGotoCodeNecessary(I.getParent(), I.getSuccessor(1))) {
2561 Out << " } else {\n";
2562 printPHICopiesForSuccessor (I.getParent(), I.getSuccessor(1), 2);
2563 printBranchToBlock(I.getParent(), I.getSuccessor(1), 2);
2566 // First goto not necessary, assume second one is...
2568 writeOperand(I.getCondition());
2571 printPHICopiesForSuccessor (I.getParent(), I.getSuccessor(1), 2);
2572 printBranchToBlock(I.getParent(), I.getSuccessor(1), 2);
2577 printPHICopiesForSuccessor (I.getParent(), I.getSuccessor(0), 0);
2578 printBranchToBlock(I.getParent(), I.getSuccessor(0), 0);
2583 // PHI nodes get copied into temporary values at the end of predecessor basic
2584 // blocks. We now need to copy these temporary values into the REAL value for
2586 void CWriter::visitPHINode(PHINode &I) {
2588 Out << "__PHI_TEMPORARY";
2592 void CWriter::visitBinaryOperator(Instruction &I) {
2593 // binary instructions, shift instructions, setCond instructions.
2594 assert(!isa<PointerType>(I.getType()));
2596 // We must cast the results of binary operations which might be promoted.
2597 bool needsCast = false;
2598 if ((I.getType() == Type::Int8Ty) || (I.getType() == Type::Int16Ty)
2599 || (I.getType() == Type::FloatTy)) {
2602 printType(Out, I.getType(), false);
2606 // If this is a negation operation, print it out as such. For FP, we don't
2607 // want to print "-0.0 - X".
2608 if (BinaryOperator::isNeg(&I)) {
2610 writeOperand(BinaryOperator::getNegArgument(cast<BinaryOperator>(&I)));
2612 } else if (BinaryOperator::isFNeg(&I)) {
2614 writeOperand(BinaryOperator::getFNegArgument(cast<BinaryOperator>(&I)));
2616 } else if (I.getOpcode() == Instruction::FRem) {
2617 // Output a call to fmod/fmodf instead of emitting a%b
2618 if (I.getType() == Type::FloatTy)
2620 else if (I.getType() == Type::DoubleTy)
2622 else // all 3 flavors of long double
2624 writeOperand(I.getOperand(0));
2626 writeOperand(I.getOperand(1));
2630 // Write out the cast of the instruction's value back to the proper type
2632 bool NeedsClosingParens = writeInstructionCast(I);
2634 // Certain instructions require the operand to be forced to a specific type
2635 // so we use writeOperandWithCast here instead of writeOperand. Similarly
2636 // below for operand 1
2637 writeOperandWithCast(I.getOperand(0), I.getOpcode());
2639 switch (I.getOpcode()) {
2640 case Instruction::Add:
2641 case Instruction::FAdd: Out << " + "; break;
2642 case Instruction::Sub:
2643 case Instruction::FSub: Out << " - "; break;
2644 case Instruction::Mul:
2645 case Instruction::FMul: Out << " * "; break;
2646 case Instruction::URem:
2647 case Instruction::SRem:
2648 case Instruction::FRem: Out << " % "; break;
2649 case Instruction::UDiv:
2650 case Instruction::SDiv:
2651 case Instruction::FDiv: Out << " / "; break;
2652 case Instruction::And: Out << " & "; break;
2653 case Instruction::Or: Out << " | "; break;
2654 case Instruction::Xor: Out << " ^ "; break;
2655 case Instruction::Shl : Out << " << "; break;
2656 case Instruction::LShr:
2657 case Instruction::AShr: Out << " >> "; break;
2658 default: cerr << "Invalid operator type!" << I; abort();
2661 writeOperandWithCast(I.getOperand(1), I.getOpcode());
2662 if (NeedsClosingParens)
2671 void CWriter::visitICmpInst(ICmpInst &I) {
2672 // We must cast the results of icmp which might be promoted.
2673 bool needsCast = false;
2675 // Write out the cast of the instruction's value back to the proper type
2677 bool NeedsClosingParens = writeInstructionCast(I);
2679 // Certain icmp predicate require the operand to be forced to a specific type
2680 // so we use writeOperandWithCast here instead of writeOperand. Similarly
2681 // below for operand 1
2682 writeOperandWithCast(I.getOperand(0), I);
2684 switch (I.getPredicate()) {
2685 case ICmpInst::ICMP_EQ: Out << " == "; break;
2686 case ICmpInst::ICMP_NE: Out << " != "; break;
2687 case ICmpInst::ICMP_ULE:
2688 case ICmpInst::ICMP_SLE: Out << " <= "; break;
2689 case ICmpInst::ICMP_UGE:
2690 case ICmpInst::ICMP_SGE: Out << " >= "; break;
2691 case ICmpInst::ICMP_ULT:
2692 case ICmpInst::ICMP_SLT: Out << " < "; break;
2693 case ICmpInst::ICMP_UGT:
2694 case ICmpInst::ICMP_SGT: Out << " > "; break;
2695 default: cerr << "Invalid icmp predicate!" << I; abort();
2698 writeOperandWithCast(I.getOperand(1), I);
2699 if (NeedsClosingParens)
2707 void CWriter::visitFCmpInst(FCmpInst &I) {
2708 if (I.getPredicate() == FCmpInst::FCMP_FALSE) {
2712 if (I.getPredicate() == FCmpInst::FCMP_TRUE) {
2718 switch (I.getPredicate()) {
2719 default: assert(0 && "Illegal FCmp predicate");
2720 case FCmpInst::FCMP_ORD: op = "ord"; break;
2721 case FCmpInst::FCMP_UNO: op = "uno"; break;
2722 case FCmpInst::FCMP_UEQ: op = "ueq"; break;
2723 case FCmpInst::FCMP_UNE: op = "une"; break;
2724 case FCmpInst::FCMP_ULT: op = "ult"; break;
2725 case FCmpInst::FCMP_ULE: op = "ule"; break;
2726 case FCmpInst::FCMP_UGT: op = "ugt"; break;
2727 case FCmpInst::FCMP_UGE: op = "uge"; break;
2728 case FCmpInst::FCMP_OEQ: op = "oeq"; break;
2729 case FCmpInst::FCMP_ONE: op = "one"; break;
2730 case FCmpInst::FCMP_OLT: op = "olt"; break;
2731 case FCmpInst::FCMP_OLE: op = "ole"; break;
2732 case FCmpInst::FCMP_OGT: op = "ogt"; break;
2733 case FCmpInst::FCMP_OGE: op = "oge"; break;
2736 Out << "llvm_fcmp_" << op << "(";
2737 // Write the first operand
2738 writeOperand(I.getOperand(0));
2740 // Write the second operand
2741 writeOperand(I.getOperand(1));
2745 static const char * getFloatBitCastField(const Type *Ty) {
2746 switch (Ty->getTypeID()) {
2747 default: assert(0 && "Invalid Type");
2748 case Type::FloatTyID: return "Float";
2749 case Type::DoubleTyID: return "Double";
2750 case Type::IntegerTyID: {
2751 unsigned NumBits = cast<IntegerType>(Ty)->getBitWidth();
2760 void CWriter::visitCastInst(CastInst &I) {
2761 const Type *DstTy = I.getType();
2762 const Type *SrcTy = I.getOperand(0)->getType();
2763 if (isFPIntBitCast(I)) {
2765 // These int<->float and long<->double casts need to be handled specially
2766 Out << GetValueName(&I) << "__BITCAST_TEMPORARY."
2767 << getFloatBitCastField(I.getOperand(0)->getType()) << " = ";
2768 writeOperand(I.getOperand(0));
2769 Out << ", " << GetValueName(&I) << "__BITCAST_TEMPORARY."
2770 << getFloatBitCastField(I.getType());
2776 printCast(I.getOpcode(), SrcTy, DstTy);
2778 // Make a sext from i1 work by subtracting the i1 from 0 (an int).
2779 if (SrcTy == Type::Int1Ty && I.getOpcode() == Instruction::SExt)
2782 writeOperand(I.getOperand(0));
2784 if (DstTy == Type::Int1Ty &&
2785 (I.getOpcode() == Instruction::Trunc ||
2786 I.getOpcode() == Instruction::FPToUI ||
2787 I.getOpcode() == Instruction::FPToSI ||
2788 I.getOpcode() == Instruction::PtrToInt)) {
2789 // Make sure we really get a trunc to bool by anding the operand with 1
2795 void CWriter::visitSelectInst(SelectInst &I) {
2797 writeOperand(I.getCondition());
2799 writeOperand(I.getTrueValue());
2801 writeOperand(I.getFalseValue());
2806 void CWriter::lowerIntrinsics(Function &F) {
2807 // This is used to keep track of intrinsics that get generated to a lowered
2808 // function. We must generate the prototypes before the function body which
2809 // will only be expanded on first use (by the loop below).
2810 std::vector<Function*> prototypesToGen;
2812 // Examine all the instructions in this function to find the intrinsics that
2813 // need to be lowered.
2814 for (Function::iterator BB = F.begin(), EE = F.end(); BB != EE; ++BB)
2815 for (BasicBlock::iterator I = BB->begin(), E = BB->end(); I != E; )
2816 if (CallInst *CI = dyn_cast<CallInst>(I++))
2817 if (Function *F = CI->getCalledFunction())
2818 switch (F->getIntrinsicID()) {
2819 case Intrinsic::not_intrinsic:
2820 case Intrinsic::memory_barrier:
2821 case Intrinsic::vastart:
2822 case Intrinsic::vacopy:
2823 case Intrinsic::vaend:
2824 case Intrinsic::returnaddress:
2825 case Intrinsic::frameaddress:
2826 case Intrinsic::setjmp:
2827 case Intrinsic::longjmp:
2828 case Intrinsic::prefetch:
2829 case Intrinsic::dbg_stoppoint:
2830 case Intrinsic::powi:
2831 case Intrinsic::x86_sse_cmp_ss:
2832 case Intrinsic::x86_sse_cmp_ps:
2833 case Intrinsic::x86_sse2_cmp_sd:
2834 case Intrinsic::x86_sse2_cmp_pd:
2835 case Intrinsic::ppc_altivec_lvsl:
2836 // We directly implement these intrinsics
2839 // If this is an intrinsic that directly corresponds to a GCC
2840 // builtin, we handle it.
2841 const char *BuiltinName = "";
2842 #define GET_GCC_BUILTIN_NAME
2843 #include "llvm/Intrinsics.gen"
2844 #undef GET_GCC_BUILTIN_NAME
2845 // If we handle it, don't lower it.
2846 if (BuiltinName[0]) break;
2848 // All other intrinsic calls we must lower.
2849 Instruction *Before = 0;
2850 if (CI != &BB->front())
2851 Before = prior(BasicBlock::iterator(CI));
2853 IL->LowerIntrinsicCall(CI);
2854 if (Before) { // Move iterator to instruction after call
2859 // If the intrinsic got lowered to another call, and that call has
2860 // a definition then we need to make sure its prototype is emitted
2861 // before any calls to it.
2862 if (CallInst *Call = dyn_cast<CallInst>(I))
2863 if (Function *NewF = Call->getCalledFunction())
2864 if (!NewF->isDeclaration())
2865 prototypesToGen.push_back(NewF);
2870 // We may have collected some prototypes to emit in the loop above.
2871 // Emit them now, before the function that uses them is emitted. But,
2872 // be careful not to emit them twice.
2873 std::vector<Function*>::iterator I = prototypesToGen.begin();
2874 std::vector<Function*>::iterator E = prototypesToGen.end();
2875 for ( ; I != E; ++I) {
2876 if (intrinsicPrototypesAlreadyGenerated.insert(*I).second) {
2878 printFunctionSignature(*I, true);
2884 void CWriter::visitCallInst(CallInst &I) {
2885 if (isa<InlineAsm>(I.getOperand(0)))
2886 return visitInlineAsm(I);
2888 bool WroteCallee = false;
2890 // Handle intrinsic function calls first...
2891 if (Function *F = I.getCalledFunction())
2892 if (Intrinsic::ID ID = (Intrinsic::ID)F->getIntrinsicID())
2893 if (visitBuiltinCall(I, ID, WroteCallee))
2896 Value *Callee = I.getCalledValue();
2898 const PointerType *PTy = cast<PointerType>(Callee->getType());
2899 const FunctionType *FTy = cast<FunctionType>(PTy->getElementType());
2901 // If this is a call to a struct-return function, assign to the first
2902 // parameter instead of passing it to the call.
2903 const AttrListPtr &PAL = I.getAttributes();
2904 bool hasByVal = I.hasByValArgument();
2905 bool isStructRet = I.hasStructRetAttr();
2907 writeOperandDeref(I.getOperand(1));
2911 if (I.isTailCall()) Out << " /*tail*/ ";
2914 // If this is an indirect call to a struct return function, we need to cast
2915 // the pointer. Ditto for indirect calls with byval arguments.
2916 bool NeedsCast = (hasByVal || isStructRet) && !isa<Function>(Callee);
2918 // GCC is a real PITA. It does not permit codegening casts of functions to
2919 // function pointers if they are in a call (it generates a trap instruction
2920 // instead!). We work around this by inserting a cast to void* in between
2921 // the function and the function pointer cast. Unfortunately, we can't just
2922 // form the constant expression here, because the folder will immediately
2925 // Note finally, that this is completely unsafe. ANSI C does not guarantee
2926 // that void* and function pointers have the same size. :( To deal with this
2927 // in the common case, we handle casts where the number of arguments passed
2930 if (ConstantExpr *CE = dyn_cast<ConstantExpr>(Callee))
2932 if (Function *RF = dyn_cast<Function>(CE->getOperand(0))) {
2938 // Ok, just cast the pointer type.
2941 printStructReturnPointerFunctionType(Out, PAL,
2942 cast<PointerType>(I.getCalledValue()->getType()));
2944 printType(Out, I.getCalledValue()->getType(), false, "", true, PAL);
2946 printType(Out, I.getCalledValue()->getType());
2949 writeOperand(Callee);
2950 if (NeedsCast) Out << ')';
2955 unsigned NumDeclaredParams = FTy->getNumParams();
2957 CallSite::arg_iterator AI = I.op_begin()+1, AE = I.op_end();
2959 if (isStructRet) { // Skip struct return argument.
2964 bool PrintedArg = false;
2965 for (; AI != AE; ++AI, ++ArgNo) {
2966 if (PrintedArg) Out << ", ";
2967 if (ArgNo < NumDeclaredParams &&
2968 (*AI)->getType() != FTy->getParamType(ArgNo)) {
2970 printType(Out, FTy->getParamType(ArgNo),
2971 /*isSigned=*/PAL.paramHasAttr(ArgNo+1, Attribute::SExt));
2974 // Check if the argument is expected to be passed by value.
2975 if (I.paramHasAttr(ArgNo+1, Attribute::ByVal))
2976 writeOperandDeref(*AI);
2984 /// visitBuiltinCall - Handle the call to the specified builtin. Returns true
2985 /// if the entire call is handled, return false it it wasn't handled, and
2986 /// optionally set 'WroteCallee' if the callee has already been printed out.
2987 bool CWriter::visitBuiltinCall(CallInst &I, Intrinsic::ID ID,
2988 bool &WroteCallee) {
2991 // If this is an intrinsic that directly corresponds to a GCC
2992 // builtin, we emit it here.
2993 const char *BuiltinName = "";
2994 Function *F = I.getCalledFunction();
2995 #define GET_GCC_BUILTIN_NAME
2996 #include "llvm/Intrinsics.gen"
2997 #undef GET_GCC_BUILTIN_NAME
2998 assert(BuiltinName[0] && "Unknown LLVM intrinsic!");
3004 case Intrinsic::memory_barrier:
3005 Out << "__sync_synchronize()";
3007 case Intrinsic::vastart:
3010 Out << "va_start(*(va_list*)";
3011 writeOperand(I.getOperand(1));
3013 // Output the last argument to the enclosing function.
3014 if (I.getParent()->getParent()->arg_empty()) {
3015 cerr << "The C backend does not currently support zero "
3016 << "argument varargs functions, such as '"
3017 << I.getParent()->getParent()->getName() << "'!\n";
3020 writeOperand(--I.getParent()->getParent()->arg_end());
3023 case Intrinsic::vaend:
3024 if (!isa<ConstantPointerNull>(I.getOperand(1))) {
3025 Out << "0; va_end(*(va_list*)";
3026 writeOperand(I.getOperand(1));
3029 Out << "va_end(*(va_list*)0)";
3032 case Intrinsic::vacopy:
3034 Out << "va_copy(*(va_list*)";
3035 writeOperand(I.getOperand(1));
3036 Out << ", *(va_list*)";
3037 writeOperand(I.getOperand(2));
3040 case Intrinsic::returnaddress:
3041 Out << "__builtin_return_address(";
3042 writeOperand(I.getOperand(1));
3045 case Intrinsic::frameaddress:
3046 Out << "__builtin_frame_address(";
3047 writeOperand(I.getOperand(1));
3050 case Intrinsic::powi:
3051 Out << "__builtin_powi(";
3052 writeOperand(I.getOperand(1));
3054 writeOperand(I.getOperand(2));
3057 case Intrinsic::setjmp:
3058 Out << "setjmp(*(jmp_buf*)";
3059 writeOperand(I.getOperand(1));
3062 case Intrinsic::longjmp:
3063 Out << "longjmp(*(jmp_buf*)";
3064 writeOperand(I.getOperand(1));
3066 writeOperand(I.getOperand(2));
3069 case Intrinsic::prefetch:
3070 Out << "LLVM_PREFETCH((const void *)";
3071 writeOperand(I.getOperand(1));
3073 writeOperand(I.getOperand(2));
3075 writeOperand(I.getOperand(3));
3078 case Intrinsic::stacksave:
3079 // Emit this as: Val = 0; *((void**)&Val) = __builtin_stack_save()
3080 // to work around GCC bugs (see PR1809).
3081 Out << "0; *((void**)&" << GetValueName(&I)
3082 << ") = __builtin_stack_save()";
3084 case Intrinsic::dbg_stoppoint: {
3085 // If we use writeOperand directly we get a "u" suffix which is rejected
3087 std::stringstream SPIStr;
3088 DbgStopPointInst &SPI = cast<DbgStopPointInst>(I);
3089 SPI.getDirectory()->print(SPIStr);
3093 Out << SPIStr.str();
3095 SPI.getFileName()->print(SPIStr);
3096 Out << SPIStr.str() << "\"\n";
3099 case Intrinsic::x86_sse_cmp_ss:
3100 case Intrinsic::x86_sse_cmp_ps:
3101 case Intrinsic::x86_sse2_cmp_sd:
3102 case Intrinsic::x86_sse2_cmp_pd:
3104 printType(Out, I.getType());
3106 // Multiple GCC builtins multiplex onto this intrinsic.
3107 switch (cast<ConstantInt>(I.getOperand(3))->getZExtValue()) {
3108 default: assert(0 && "Invalid llvm.x86.sse.cmp!");
3109 case 0: Out << "__builtin_ia32_cmpeq"; break;
3110 case 1: Out << "__builtin_ia32_cmplt"; break;
3111 case 2: Out << "__builtin_ia32_cmple"; break;
3112 case 3: Out << "__builtin_ia32_cmpunord"; break;
3113 case 4: Out << "__builtin_ia32_cmpneq"; break;
3114 case 5: Out << "__builtin_ia32_cmpnlt"; break;
3115 case 6: Out << "__builtin_ia32_cmpnle"; break;
3116 case 7: Out << "__builtin_ia32_cmpord"; break;
3118 if (ID == Intrinsic::x86_sse_cmp_ps || ID == Intrinsic::x86_sse2_cmp_pd)
3122 if (ID == Intrinsic::x86_sse_cmp_ss || ID == Intrinsic::x86_sse_cmp_ps)
3128 writeOperand(I.getOperand(1));
3130 writeOperand(I.getOperand(2));
3133 case Intrinsic::ppc_altivec_lvsl:
3135 printType(Out, I.getType());
3137 Out << "__builtin_altivec_lvsl(0, (void*)";
3138 writeOperand(I.getOperand(1));
3144 //This converts the llvm constraint string to something gcc is expecting.
3145 //TODO: work out platform independent constraints and factor those out
3146 // of the per target tables
3147 // handle multiple constraint codes
3148 std::string CWriter::InterpretASMConstraint(InlineAsm::ConstraintInfo& c) {
3150 assert(c.Codes.size() == 1 && "Too many asm constraint codes to handle");
3152 const char *const *table = 0;
3154 //Grab the translation table from TargetAsmInfo if it exists
3157 const TargetMachineRegistry::entry* Match =
3158 TargetMachineRegistry::getClosestStaticTargetForModule(*TheModule, E);
3160 //Per platform Target Machines don't exist, so create it
3161 // this must be done only once
3162 const TargetMachine* TM = Match->CtorFn(*TheModule, "");
3163 TAsm = TM->getTargetAsmInfo();
3167 table = TAsm->getAsmCBE();
3169 //Search the translation table if it exists
3170 for (int i = 0; table && table[i]; i += 2)
3171 if (c.Codes[0] == table[i])
3174 //default is identity
3178 //TODO: import logic from AsmPrinter.cpp
3179 static std::string gccifyAsm(std::string asmstr) {
3180 for (std::string::size_type i = 0; i != asmstr.size(); ++i)
3181 if (asmstr[i] == '\n')
3182 asmstr.replace(i, 1, "\\n");
3183 else if (asmstr[i] == '\t')
3184 asmstr.replace(i, 1, "\\t");
3185 else if (asmstr[i] == '$') {
3186 if (asmstr[i + 1] == '{') {
3187 std::string::size_type a = asmstr.find_first_of(':', i + 1);
3188 std::string::size_type b = asmstr.find_first_of('}', i + 1);
3189 std::string n = "%" +
3190 asmstr.substr(a + 1, b - a - 1) +
3191 asmstr.substr(i + 2, a - i - 2);
3192 asmstr.replace(i, b - i + 1, n);
3195 asmstr.replace(i, 1, "%");
3197 else if (asmstr[i] == '%')//grr
3198 { asmstr.replace(i, 1, "%%"); ++i;}
3203 //TODO: assumptions about what consume arguments from the call are likely wrong
3204 // handle communitivity
3205 void CWriter::visitInlineAsm(CallInst &CI) {
3206 InlineAsm* as = cast<InlineAsm>(CI.getOperand(0));
3207 std::vector<InlineAsm::ConstraintInfo> Constraints = as->ParseConstraints();
3209 std::vector<std::pair<Value*, int> > ResultVals;
3210 if (CI.getType() == Type::VoidTy)
3212 else if (const StructType *ST = dyn_cast<StructType>(CI.getType())) {
3213 for (unsigned i = 0, e = ST->getNumElements(); i != e; ++i)
3214 ResultVals.push_back(std::make_pair(&CI, (int)i));
3216 ResultVals.push_back(std::make_pair(&CI, -1));
3219 // Fix up the asm string for gcc and emit it.
3220 Out << "__asm__ volatile (\"" << gccifyAsm(as->getAsmString()) << "\"\n";
3223 unsigned ValueCount = 0;
3224 bool IsFirst = true;
3226 // Convert over all the output constraints.
3227 for (std::vector<InlineAsm::ConstraintInfo>::iterator I = Constraints.begin(),
3228 E = Constraints.end(); I != E; ++I) {
3230 if (I->Type != InlineAsm::isOutput) {
3232 continue; // Ignore non-output constraints.
3235 assert(I->Codes.size() == 1 && "Too many asm constraint codes to handle");
3236 std::string C = InterpretASMConstraint(*I);
3237 if (C.empty()) continue;
3248 if (ValueCount < ResultVals.size()) {
3249 DestVal = ResultVals[ValueCount].first;
3250 DestValNo = ResultVals[ValueCount].second;
3252 DestVal = CI.getOperand(ValueCount-ResultVals.size()+1);
3254 if (I->isEarlyClobber)
3257 Out << "\"=" << C << "\"(" << GetValueName(DestVal);
3258 if (DestValNo != -1)
3259 Out << ".field" << DestValNo; // Multiple retvals.
3265 // Convert over all the input constraints.
3269 for (std::vector<InlineAsm::ConstraintInfo>::iterator I = Constraints.begin(),
3270 E = Constraints.end(); I != E; ++I) {
3271 if (I->Type != InlineAsm::isInput) {
3273 continue; // Ignore non-input constraints.
3276 assert(I->Codes.size() == 1 && "Too many asm constraint codes to handle");
3277 std::string C = InterpretASMConstraint(*I);
3278 if (C.empty()) continue;
3285 assert(ValueCount >= ResultVals.size() && "Input can't refer to result");
3286 Value *SrcVal = CI.getOperand(ValueCount-ResultVals.size()+1);
3288 Out << "\"" << C << "\"(";
3290 writeOperand(SrcVal);
3292 writeOperandDeref(SrcVal);
3296 // Convert over the clobber constraints.
3299 for (std::vector<InlineAsm::ConstraintInfo>::iterator I = Constraints.begin(),
3300 E = Constraints.end(); I != E; ++I) {
3301 if (I->Type != InlineAsm::isClobber)
3302 continue; // Ignore non-input constraints.
3304 assert(I->Codes.size() == 1 && "Too many asm constraint codes to handle");
3305 std::string C = InterpretASMConstraint(*I);
3306 if (C.empty()) continue;
3313 Out << '\"' << C << '"';
3319 void CWriter::visitMallocInst(MallocInst &I) {
3320 assert(0 && "lowerallocations pass didn't work!");
3323 void CWriter::visitAllocaInst(AllocaInst &I) {
3325 printType(Out, I.getType());
3326 Out << ") alloca(sizeof(";
3327 printType(Out, I.getType()->getElementType());
3329 if (I.isArrayAllocation()) {
3331 writeOperand(I.getOperand(0));
3336 void CWriter::visitFreeInst(FreeInst &I) {
3337 assert(0 && "lowerallocations pass didn't work!");
3340 void CWriter::printGEPExpression(Value *Ptr, gep_type_iterator I,
3341 gep_type_iterator E, bool Static) {
3343 // If there are no indices, just print out the pointer.
3349 // Find out if the last index is into a vector. If so, we have to print this
3350 // specially. Since vectors can't have elements of indexable type, only the
3351 // last index could possibly be of a vector element.
3352 const VectorType *LastIndexIsVector = 0;
3354 for (gep_type_iterator TmpI = I; TmpI != E; ++TmpI)
3355 LastIndexIsVector = dyn_cast<VectorType>(*TmpI);
3360 // If the last index is into a vector, we can't print it as &a[i][j] because
3361 // we can't index into a vector with j in GCC. Instead, emit this as
3362 // (((float*)&a[i])+j)
3363 if (LastIndexIsVector) {
3365 printType(Out, PointerType::getUnqual(LastIndexIsVector->getElementType()));
3371 // If the first index is 0 (very typical) we can do a number of
3372 // simplifications to clean up the code.
3373 Value *FirstOp = I.getOperand();
3374 if (!isa<Constant>(FirstOp) || !cast<Constant>(FirstOp)->isNullValue()) {
3375 // First index isn't simple, print it the hard way.
3378 ++I; // Skip the zero index.
3380 // Okay, emit the first operand. If Ptr is something that is already address
3381 // exposed, like a global, avoid emitting (&foo)[0], just emit foo instead.
3382 if (isAddressExposed(Ptr)) {
3383 writeOperandInternal(Ptr, Static);
3384 } else if (I != E && isa<StructType>(*I)) {
3385 // If we didn't already emit the first operand, see if we can print it as
3386 // P->f instead of "P[0].f"
3388 Out << "->field" << cast<ConstantInt>(I.getOperand())->getZExtValue();
3389 ++I; // eat the struct index as well.
3391 // Instead of emitting P[0][1], emit (*P)[1], which is more idiomatic.
3398 for (; I != E; ++I) {
3399 if (isa<StructType>(*I)) {
3400 Out << ".field" << cast<ConstantInt>(I.getOperand())->getZExtValue();
3401 } else if (isa<ArrayType>(*I)) {
3403 writeOperandWithCast(I.getOperand(), Instruction::GetElementPtr);
3405 } else if (!isa<VectorType>(*I)) {
3407 writeOperandWithCast(I.getOperand(), Instruction::GetElementPtr);
3410 // If the last index is into a vector, then print it out as "+j)". This
3411 // works with the 'LastIndexIsVector' code above.
3412 if (isa<Constant>(I.getOperand()) &&
3413 cast<Constant>(I.getOperand())->isNullValue()) {
3414 Out << "))"; // avoid "+0".
3417 writeOperandWithCast(I.getOperand(), Instruction::GetElementPtr);
3425 void CWriter::writeMemoryAccess(Value *Operand, const Type *OperandType,
3426 bool IsVolatile, unsigned Alignment) {
3428 bool IsUnaligned = Alignment &&
3429 Alignment < TD->getABITypeAlignment(OperandType);
3433 if (IsVolatile || IsUnaligned) {
3436 Out << "struct __attribute__ ((packed, aligned(" << Alignment << "))) {";
3437 printType(Out, OperandType, false, IsUnaligned ? "data" : "volatile*");
3440 if (IsVolatile) Out << "volatile ";
3446 writeOperand(Operand);
3448 if (IsVolatile || IsUnaligned) {
3455 void CWriter::visitLoadInst(LoadInst &I) {
3456 writeMemoryAccess(I.getOperand(0), I.getType(), I.isVolatile(),
3461 void CWriter::visitStoreInst(StoreInst &I) {
3462 writeMemoryAccess(I.getPointerOperand(), I.getOperand(0)->getType(),
3463 I.isVolatile(), I.getAlignment());
3465 Value *Operand = I.getOperand(0);
3466 Constant *BitMask = 0;
3467 if (const IntegerType* ITy = dyn_cast<IntegerType>(Operand->getType()))
3468 if (!ITy->isPowerOf2ByteWidth())
3469 // We have a bit width that doesn't match an even power-of-2 byte
3470 // size. Consequently we must & the value with the type's bit mask
3471 BitMask = ConstantInt::get(ITy, ITy->getBitMask());
3474 writeOperand(Operand);
3477 printConstant(BitMask, false);
3482 void CWriter::visitGetElementPtrInst(GetElementPtrInst &I) {
3483 printGEPExpression(I.getPointerOperand(), gep_type_begin(I),
3484 gep_type_end(I), false);
3487 void CWriter::visitVAArgInst(VAArgInst &I) {
3488 Out << "va_arg(*(va_list*)";
3489 writeOperand(I.getOperand(0));
3491 printType(Out, I.getType());
3495 void CWriter::visitInsertElementInst(InsertElementInst &I) {
3496 const Type *EltTy = I.getType()->getElementType();
3497 writeOperand(I.getOperand(0));
3500 printType(Out, PointerType::getUnqual(EltTy));
3501 Out << ")(&" << GetValueName(&I) << "))[";
3502 writeOperand(I.getOperand(2));
3504 writeOperand(I.getOperand(1));
3508 void CWriter::visitExtractElementInst(ExtractElementInst &I) {
3509 // We know that our operand is not inlined.
3512 cast<VectorType>(I.getOperand(0)->getType())->getElementType();
3513 printType(Out, PointerType::getUnqual(EltTy));
3514 Out << ")(&" << GetValueName(I.getOperand(0)) << "))[";
3515 writeOperand(I.getOperand(1));
3519 void CWriter::visitShuffleVectorInst(ShuffleVectorInst &SVI) {
3521 printType(Out, SVI.getType());
3523 const VectorType *VT = SVI.getType();
3524 unsigned NumElts = VT->getNumElements();
3525 const Type *EltTy = VT->getElementType();
3527 for (unsigned i = 0; i != NumElts; ++i) {
3529 int SrcVal = SVI.getMaskValue(i);
3530 if ((unsigned)SrcVal >= NumElts*2) {
3531 Out << " 0/*undef*/ ";
3533 Value *Op = SVI.getOperand((unsigned)SrcVal >= NumElts);
3534 if (isa<Instruction>(Op)) {
3535 // Do an extractelement of this value from the appropriate input.
3537 printType(Out, PointerType::getUnqual(EltTy));
3538 Out << ")(&" << GetValueName(Op)
3539 << "))[" << (SrcVal & (NumElts-1)) << "]";
3540 } else if (isa<ConstantAggregateZero>(Op) || isa<UndefValue>(Op)) {
3543 printConstant(cast<ConstantVector>(Op)->getOperand(SrcVal &
3552 void CWriter::visitInsertValueInst(InsertValueInst &IVI) {
3553 // Start by copying the entire aggregate value into the result variable.
3554 writeOperand(IVI.getOperand(0));
3557 // Then do the insert to update the field.
3558 Out << GetValueName(&IVI);
3559 for (const unsigned *b = IVI.idx_begin(), *i = b, *e = IVI.idx_end();
3561 const Type *IndexedTy =
3562 ExtractValueInst::getIndexedType(IVI.getOperand(0)->getType(), b, i+1);
3563 if (isa<ArrayType>(IndexedTy))
3564 Out << ".array[" << *i << "]";
3566 Out << ".field" << *i;
3569 writeOperand(IVI.getOperand(1));
3572 void CWriter::visitExtractValueInst(ExtractValueInst &EVI) {
3574 if (isa<UndefValue>(EVI.getOperand(0))) {
3576 printType(Out, EVI.getType());
3577 Out << ") 0/*UNDEF*/";
3579 Out << GetValueName(EVI.getOperand(0));
3580 for (const unsigned *b = EVI.idx_begin(), *i = b, *e = EVI.idx_end();
3582 const Type *IndexedTy =
3583 ExtractValueInst::getIndexedType(EVI.getOperand(0)->getType(), b, i+1);
3584 if (isa<ArrayType>(IndexedTy))
3585 Out << ".array[" << *i << "]";
3587 Out << ".field" << *i;
3593 //===----------------------------------------------------------------------===//
3594 // External Interface declaration
3595 //===----------------------------------------------------------------------===//
3597 bool CTargetMachine::addPassesToEmitWholeFile(PassManager &PM,
3599 CodeGenFileType FileType,
3600 CodeGenOpt::Level OptLevel) {
3601 if (FileType != TargetMachine::AssemblyFile) return true;
3603 PM.add(createGCLoweringPass());
3604 PM.add(createLowerAllocationsPass(true));
3605 PM.add(createLowerInvokePass());
3606 PM.add(createCFGSimplificationPass()); // clean up after lower invoke.
3607 PM.add(new CBackendNameAllUsedStructsAndMergeFunctions());
3608 PM.add(new CWriter(o));
3609 PM.add(createGCInfoDeleter());