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/ErrorHandling.h"
39 #include "llvm/Support/GetElementPtrTypeIterator.h"
40 #include "llvm/Support/InstVisitor.h"
41 #include "llvm/Support/Mangler.h"
42 #include "llvm/Support/MathExtras.h"
43 #include "llvm/Support/raw_ostream.h"
44 #include "llvm/ADT/StringExtras.h"
45 #include "llvm/ADT/STLExtras.h"
46 #include "llvm/Support/MathExtras.h"
47 #include "llvm/Config/config.h"
52 /// CBackendTargetMachineModule - Note that this is used on hosts that
53 /// cannot link in a library unless there are references into the
54 /// library. In particular, it seems that it is not possible to get
55 /// things to work on Win32 without this. Though it is unused, do not
57 extern "C" int CBackendTargetMachineModule;
58 int CBackendTargetMachineModule = 0;
60 // Register the target.
61 static RegisterTarget<CTargetMachine> X("c", "C backend");
63 // Force static initialization.
64 extern "C" void LLVMInitializeCBackendTarget() { }
67 /// CBackendNameAllUsedStructsAndMergeFunctions - This pass inserts names for
68 /// any unnamed structure types that are used by the program, and merges
69 /// external functions with the same name.
71 class CBackendNameAllUsedStructsAndMergeFunctions : public ModulePass {
74 CBackendNameAllUsedStructsAndMergeFunctions()
76 void getAnalysisUsage(AnalysisUsage &AU) const {
77 AU.addRequired<FindUsedTypes>();
80 virtual const char *getPassName() const {
81 return "C backend type canonicalizer";
84 virtual bool runOnModule(Module &M);
87 char CBackendNameAllUsedStructsAndMergeFunctions::ID = 0;
89 /// CWriter - This class is the main chunk of code that converts an LLVM
90 /// module to a C translation unit.
91 class CWriter : public FunctionPass, public InstVisitor<CWriter> {
93 IntrinsicLowering *IL;
96 const Module *TheModule;
97 const TargetAsmInfo* TAsm;
99 std::map<const Type *, std::string> TypeNames;
100 std::map<const ConstantFP *, unsigned> FPConstantMap;
101 std::set<Function*> intrinsicPrototypesAlreadyGenerated;
102 std::set<const Argument*> ByValParams;
104 unsigned OpaqueCounter;
105 DenseMap<const Value*, unsigned> AnonValueNumbers;
106 unsigned NextAnonValueNumber;
110 explicit CWriter(raw_ostream &o)
111 : FunctionPass(&ID), Out(o), IL(0), Mang(0), LI(0),
112 TheModule(0), TAsm(0), TD(0), OpaqueCounter(0), NextAnonValueNumber(0) {
116 virtual const char *getPassName() const { return "C backend"; }
118 void getAnalysisUsage(AnalysisUsage &AU) const {
119 AU.addRequired<LoopInfo>();
120 AU.setPreservesAll();
123 virtual bool doInitialization(Module &M);
125 bool runOnFunction(Function &F) {
126 // Do not codegen any 'available_externally' functions at all, they have
127 // definitions outside the translation unit.
128 if (F.hasAvailableExternallyLinkage())
131 LI = &getAnalysis<LoopInfo>();
133 // Get rid of intrinsics we can't handle.
136 // Output all floating point constants that cannot be printed accurately.
137 printFloatingPointConstants(F);
143 virtual bool doFinalization(Module &M) {
148 FPConstantMap.clear();
151 intrinsicPrototypesAlreadyGenerated.clear();
155 raw_ostream &printType(raw_ostream &Out, const Type *Ty,
156 bool isSigned = false,
157 const std::string &VariableName = "",
158 bool IgnoreName = false,
159 const AttrListPtr &PAL = AttrListPtr());
160 std::ostream &printType(std::ostream &Out, const Type *Ty,
161 bool isSigned = false,
162 const std::string &VariableName = "",
163 bool IgnoreName = false,
164 const AttrListPtr &PAL = AttrListPtr());
165 raw_ostream &printSimpleType(raw_ostream &Out, const Type *Ty,
167 const std::string &NameSoFar = "");
168 std::ostream &printSimpleType(std::ostream &Out, const Type *Ty,
170 const std::string &NameSoFar = "");
172 void printStructReturnPointerFunctionType(raw_ostream &Out,
173 const AttrListPtr &PAL,
174 const PointerType *Ty);
176 /// writeOperandDeref - Print the result of dereferencing the specified
177 /// operand with '*'. This is equivalent to printing '*' then using
178 /// writeOperand, but avoids excess syntax in some cases.
179 void writeOperandDeref(Value *Operand) {
180 if (isAddressExposed(Operand)) {
181 // Already something with an address exposed.
182 writeOperandInternal(Operand);
185 writeOperand(Operand);
190 void writeOperand(Value *Operand, bool Static = false);
191 void writeInstComputationInline(Instruction &I);
192 void writeOperandInternal(Value *Operand, bool Static = false);
193 void writeOperandWithCast(Value* Operand, unsigned Opcode);
194 void writeOperandWithCast(Value* Operand, const ICmpInst &I);
195 bool writeInstructionCast(const Instruction &I);
197 void writeMemoryAccess(Value *Operand, const Type *OperandType,
198 bool IsVolatile, unsigned Alignment);
201 std::string InterpretASMConstraint(InlineAsm::ConstraintInfo& c);
203 void lowerIntrinsics(Function &F);
205 void printModule(Module *M);
206 void printModuleTypes(const TypeSymbolTable &ST);
207 void printContainedStructs(const Type *Ty, std::set<const Type *> &);
208 void printFloatingPointConstants(Function &F);
209 void printFloatingPointConstants(const Constant *C);
210 void printFunctionSignature(const Function *F, bool Prototype);
212 void printFunction(Function &);
213 void printBasicBlock(BasicBlock *BB);
214 void printLoop(Loop *L);
216 void printCast(unsigned opcode, const Type *SrcTy, const Type *DstTy);
217 void printConstant(Constant *CPV, bool Static);
218 void printConstantWithCast(Constant *CPV, unsigned Opcode);
219 bool printConstExprCast(const ConstantExpr *CE, bool Static);
220 void printConstantArray(ConstantArray *CPA, bool Static);
221 void printConstantVector(ConstantVector *CV, bool Static);
223 /// isAddressExposed - Return true if the specified value's name needs to
224 /// have its address taken in order to get a C value of the correct type.
225 /// This happens for global variables, byval parameters, and direct allocas.
226 bool isAddressExposed(const Value *V) const {
227 if (const Argument *A = dyn_cast<Argument>(V))
228 return ByValParams.count(A);
229 return isa<GlobalVariable>(V) || isDirectAlloca(V);
232 // isInlinableInst - Attempt to inline instructions into their uses to build
233 // trees as much as possible. To do this, we have to consistently decide
234 // what is acceptable to inline, so that variable declarations don't get
235 // printed and an extra copy of the expr is not emitted.
237 static bool isInlinableInst(const Instruction &I) {
238 // Always inline cmp instructions, even if they are shared by multiple
239 // expressions. GCC generates horrible code if we don't.
243 // Must be an expression, must be used exactly once. If it is dead, we
244 // emit it inline where it would go.
245 if (I.getType() == Type::VoidTy || !I.hasOneUse() ||
246 isa<TerminatorInst>(I) || isa<CallInst>(I) || isa<PHINode>(I) ||
247 isa<LoadInst>(I) || isa<VAArgInst>(I) || isa<InsertElementInst>(I) ||
248 isa<InsertValueInst>(I))
249 // Don't inline a load across a store or other bad things!
252 // Must not be used in inline asm, extractelement, or shufflevector.
254 const Instruction &User = cast<Instruction>(*I.use_back());
255 if (isInlineAsm(User) || isa<ExtractElementInst>(User) ||
256 isa<ShuffleVectorInst>(User))
260 // Only inline instruction it if it's use is in the same BB as the inst.
261 return I.getParent() == cast<Instruction>(I.use_back())->getParent();
264 // isDirectAlloca - Define fixed sized allocas in the entry block as direct
265 // variables which are accessed with the & operator. This causes GCC to
266 // generate significantly better code than to emit alloca calls directly.
268 static const AllocaInst *isDirectAlloca(const Value *V) {
269 const AllocaInst *AI = dyn_cast<AllocaInst>(V);
270 if (!AI) return false;
271 if (AI->isArrayAllocation())
272 return 0; // FIXME: we can also inline fixed size array allocas!
273 if (AI->getParent() != &AI->getParent()->getParent()->getEntryBlock())
278 // isInlineAsm - Check if the instruction is a call to an inline asm chunk
279 static bool isInlineAsm(const Instruction& I) {
280 if (isa<CallInst>(&I) && isa<InlineAsm>(I.getOperand(0)))
285 // Instruction visitation functions
286 friend class InstVisitor<CWriter>;
288 void visitReturnInst(ReturnInst &I);
289 void visitBranchInst(BranchInst &I);
290 void visitSwitchInst(SwitchInst &I);
291 void visitInvokeInst(InvokeInst &I) {
292 LLVM_UNREACHABLE("Lowerinvoke pass didn't work!");
295 void visitUnwindInst(UnwindInst &I) {
296 LLVM_UNREACHABLE("Lowerinvoke pass didn't work!");
298 void visitUnreachableInst(UnreachableInst &I);
300 void visitPHINode(PHINode &I);
301 void visitBinaryOperator(Instruction &I);
302 void visitICmpInst(ICmpInst &I);
303 void visitFCmpInst(FCmpInst &I);
305 void visitCastInst (CastInst &I);
306 void visitSelectInst(SelectInst &I);
307 void visitCallInst (CallInst &I);
308 void visitInlineAsm(CallInst &I);
309 bool visitBuiltinCall(CallInst &I, Intrinsic::ID ID, bool &WroteCallee);
311 void visitMallocInst(MallocInst &I);
312 void visitAllocaInst(AllocaInst &I);
313 void visitFreeInst (FreeInst &I);
314 void visitLoadInst (LoadInst &I);
315 void visitStoreInst (StoreInst &I);
316 void visitGetElementPtrInst(GetElementPtrInst &I);
317 void visitVAArgInst (VAArgInst &I);
319 void visitInsertElementInst(InsertElementInst &I);
320 void visitExtractElementInst(ExtractElementInst &I);
321 void visitShuffleVectorInst(ShuffleVectorInst &SVI);
323 void visitInsertValueInst(InsertValueInst &I);
324 void visitExtractValueInst(ExtractValueInst &I);
326 void visitInstruction(Instruction &I) {
328 cerr << "C Writer does not know about " << I;
333 void outputLValue(Instruction *I) {
334 Out << " " << GetValueName(I) << " = ";
337 bool isGotoCodeNecessary(BasicBlock *From, BasicBlock *To);
338 void printPHICopiesForSuccessor(BasicBlock *CurBlock,
339 BasicBlock *Successor, unsigned Indent);
340 void printBranchToBlock(BasicBlock *CurBlock, BasicBlock *SuccBlock,
342 void printGEPExpression(Value *Ptr, gep_type_iterator I,
343 gep_type_iterator E, bool Static);
345 std::string GetValueName(const Value *Operand);
349 char CWriter::ID = 0;
351 /// This method inserts names for any unnamed structure types that are used by
352 /// the program, and removes names from structure types that are not used by the
355 bool CBackendNameAllUsedStructsAndMergeFunctions::runOnModule(Module &M) {
356 // Get a set of types that are used by the program...
357 std::set<const Type *> UT = getAnalysis<FindUsedTypes>().getTypes();
359 // Loop over the module symbol table, removing types from UT that are
360 // already named, and removing names for types that are not used.
362 TypeSymbolTable &TST = M.getTypeSymbolTable();
363 for (TypeSymbolTable::iterator TI = TST.begin(), TE = TST.end();
365 TypeSymbolTable::iterator I = TI++;
367 // If this isn't a struct or array type, remove it from our set of types
368 // to name. This simplifies emission later.
369 if (!isa<StructType>(I->second) && !isa<OpaqueType>(I->second) &&
370 !isa<ArrayType>(I->second)) {
373 // If this is not used, remove it from the symbol table.
374 std::set<const Type *>::iterator UTI = UT.find(I->second);
378 UT.erase(UTI); // Only keep one name for this type.
382 // UT now contains types that are not named. Loop over it, naming
385 bool Changed = false;
386 unsigned RenameCounter = 0;
387 for (std::set<const Type *>::const_iterator I = UT.begin(), E = UT.end();
389 if (isa<StructType>(*I) || isa<ArrayType>(*I)) {
390 while (M.addTypeName("unnamed"+utostr(RenameCounter), *I))
396 // Loop over all external functions and globals. If we have two with
397 // identical names, merge them.
398 // FIXME: This code should disappear when we don't allow values with the same
399 // names when they have different types!
400 std::map<std::string, GlobalValue*> ExtSymbols;
401 for (Module::iterator I = M.begin(), E = M.end(); I != E;) {
403 if (GV->isDeclaration() && GV->hasName()) {
404 std::pair<std::map<std::string, GlobalValue*>::iterator, bool> X
405 = ExtSymbols.insert(std::make_pair(GV->getName(), GV));
407 // Found a conflict, replace this global with the previous one.
408 GlobalValue *OldGV = X.first->second;
409 GV->replaceAllUsesWith(ConstantExpr::getBitCast(OldGV, GV->getType()));
410 GV->eraseFromParent();
415 // Do the same for globals.
416 for (Module::global_iterator I = M.global_begin(), E = M.global_end();
418 GlobalVariable *GV = I++;
419 if (GV->isDeclaration() && GV->hasName()) {
420 std::pair<std::map<std::string, GlobalValue*>::iterator, bool> X
421 = ExtSymbols.insert(std::make_pair(GV->getName(), GV));
423 // Found a conflict, replace this global with the previous one.
424 GlobalValue *OldGV = X.first->second;
425 GV->replaceAllUsesWith(ConstantExpr::getBitCast(OldGV, GV->getType()));
426 GV->eraseFromParent();
435 /// printStructReturnPointerFunctionType - This is like printType for a struct
436 /// return type, except, instead of printing the type as void (*)(Struct*, ...)
437 /// print it as "Struct (*)(...)", for struct return functions.
438 void CWriter::printStructReturnPointerFunctionType(raw_ostream &Out,
439 const AttrListPtr &PAL,
440 const PointerType *TheTy) {
441 const FunctionType *FTy = cast<FunctionType>(TheTy->getElementType());
442 std::stringstream FunctionInnards;
443 FunctionInnards << " (*) (";
444 bool PrintedType = false;
446 FunctionType::param_iterator I = FTy->param_begin(), E = FTy->param_end();
447 const Type *RetTy = cast<PointerType>(I->get())->getElementType();
449 for (++I, ++Idx; I != E; ++I, ++Idx) {
451 FunctionInnards << ", ";
452 const Type *ArgTy = *I;
453 if (PAL.paramHasAttr(Idx, Attribute::ByVal)) {
454 assert(isa<PointerType>(ArgTy));
455 ArgTy = cast<PointerType>(ArgTy)->getElementType();
457 printType(FunctionInnards, ArgTy,
458 /*isSigned=*/PAL.paramHasAttr(Idx, Attribute::SExt), "");
461 if (FTy->isVarArg()) {
463 FunctionInnards << ", ...";
464 } else if (!PrintedType) {
465 FunctionInnards << "void";
467 FunctionInnards << ')';
468 std::string tstr = FunctionInnards.str();
469 printType(Out, RetTy,
470 /*isSigned=*/PAL.paramHasAttr(0, Attribute::SExt), tstr);
474 CWriter::printSimpleType(raw_ostream &Out, const Type *Ty, bool isSigned,
475 const std::string &NameSoFar) {
476 assert((Ty->isPrimitiveType() || Ty->isInteger() || isa<VectorType>(Ty)) &&
477 "Invalid type for printSimpleType");
478 switch (Ty->getTypeID()) {
479 case Type::VoidTyID: return Out << "void " << NameSoFar;
480 case Type::IntegerTyID: {
481 unsigned NumBits = cast<IntegerType>(Ty)->getBitWidth();
483 return Out << "bool " << NameSoFar;
484 else if (NumBits <= 8)
485 return Out << (isSigned?"signed":"unsigned") << " char " << NameSoFar;
486 else if (NumBits <= 16)
487 return Out << (isSigned?"signed":"unsigned") << " short " << NameSoFar;
488 else if (NumBits <= 32)
489 return Out << (isSigned?"signed":"unsigned") << " int " << NameSoFar;
490 else if (NumBits <= 64)
491 return Out << (isSigned?"signed":"unsigned") << " long long "<< NameSoFar;
493 assert(NumBits <= 128 && "Bit widths > 128 not implemented yet");
494 return Out << (isSigned?"llvmInt128":"llvmUInt128") << " " << NameSoFar;
497 case Type::FloatTyID: return Out << "float " << NameSoFar;
498 case Type::DoubleTyID: return Out << "double " << NameSoFar;
499 // Lacking emulation of FP80 on PPC, etc., we assume whichever of these is
500 // present matches host 'long double'.
501 case Type::X86_FP80TyID:
502 case Type::PPC_FP128TyID:
503 case Type::FP128TyID: return Out << "long double " << NameSoFar;
505 case Type::VectorTyID: {
506 const VectorType *VTy = cast<VectorType>(Ty);
507 return printSimpleType(Out, VTy->getElementType(), isSigned,
508 " __attribute__((vector_size(" +
509 utostr(TD->getTypeAllocSize(VTy)) + " ))) " + NameSoFar);
514 cerr << "Unknown primitive type: " << *Ty << "\n";
521 CWriter::printSimpleType(std::ostream &Out, const Type *Ty, bool isSigned,
522 const std::string &NameSoFar) {
523 assert((Ty->isPrimitiveType() || Ty->isInteger() || isa<VectorType>(Ty)) &&
524 "Invalid type for printSimpleType");
525 switch (Ty->getTypeID()) {
526 case Type::VoidTyID: return Out << "void " << NameSoFar;
527 case Type::IntegerTyID: {
528 unsigned NumBits = cast<IntegerType>(Ty)->getBitWidth();
530 return Out << "bool " << NameSoFar;
531 else if (NumBits <= 8)
532 return Out << (isSigned?"signed":"unsigned") << " char " << NameSoFar;
533 else if (NumBits <= 16)
534 return Out << (isSigned?"signed":"unsigned") << " short " << NameSoFar;
535 else if (NumBits <= 32)
536 return Out << (isSigned?"signed":"unsigned") << " int " << NameSoFar;
537 else if (NumBits <= 64)
538 return Out << (isSigned?"signed":"unsigned") << " long long "<< NameSoFar;
540 assert(NumBits <= 128 && "Bit widths > 128 not implemented yet");
541 return Out << (isSigned?"llvmInt128":"llvmUInt128") << " " << NameSoFar;
544 case Type::FloatTyID: return Out << "float " << NameSoFar;
545 case Type::DoubleTyID: return Out << "double " << NameSoFar;
546 // Lacking emulation of FP80 on PPC, etc., we assume whichever of these is
547 // present matches host 'long double'.
548 case Type::X86_FP80TyID:
549 case Type::PPC_FP128TyID:
550 case Type::FP128TyID: return Out << "long double " << NameSoFar;
552 case Type::VectorTyID: {
553 const VectorType *VTy = cast<VectorType>(Ty);
554 return printSimpleType(Out, VTy->getElementType(), isSigned,
555 " __attribute__((vector_size(" +
556 utostr(TD->getTypeAllocSize(VTy)) + " ))) " + NameSoFar);
561 cerr << "Unknown primitive type: " << *Ty << "\n";
567 // Pass the Type* and the variable name and this prints out the variable
570 raw_ostream &CWriter::printType(raw_ostream &Out, const Type *Ty,
571 bool isSigned, const std::string &NameSoFar,
572 bool IgnoreName, const AttrListPtr &PAL) {
573 if (Ty->isPrimitiveType() || Ty->isInteger() || isa<VectorType>(Ty)) {
574 printSimpleType(Out, Ty, isSigned, NameSoFar);
578 // Check to see if the type is named.
579 if (!IgnoreName || isa<OpaqueType>(Ty)) {
580 std::map<const Type *, std::string>::iterator I = TypeNames.find(Ty);
581 if (I != TypeNames.end()) return Out << I->second << ' ' << NameSoFar;
584 switch (Ty->getTypeID()) {
585 case Type::FunctionTyID: {
586 const FunctionType *FTy = cast<FunctionType>(Ty);
587 std::stringstream FunctionInnards;
588 FunctionInnards << " (" << NameSoFar << ") (";
590 for (FunctionType::param_iterator I = FTy->param_begin(),
591 E = FTy->param_end(); I != E; ++I) {
592 const Type *ArgTy = *I;
593 if (PAL.paramHasAttr(Idx, Attribute::ByVal)) {
594 assert(isa<PointerType>(ArgTy));
595 ArgTy = cast<PointerType>(ArgTy)->getElementType();
597 if (I != FTy->param_begin())
598 FunctionInnards << ", ";
599 printType(FunctionInnards, ArgTy,
600 /*isSigned=*/PAL.paramHasAttr(Idx, Attribute::SExt), "");
603 if (FTy->isVarArg()) {
604 if (FTy->getNumParams())
605 FunctionInnards << ", ...";
606 } else if (!FTy->getNumParams()) {
607 FunctionInnards << "void";
609 FunctionInnards << ')';
610 std::string tstr = FunctionInnards.str();
611 printType(Out, FTy->getReturnType(),
612 /*isSigned=*/PAL.paramHasAttr(0, Attribute::SExt), tstr);
615 case Type::StructTyID: {
616 const StructType *STy = cast<StructType>(Ty);
617 Out << NameSoFar + " {\n";
619 for (StructType::element_iterator I = STy->element_begin(),
620 E = STy->element_end(); I != E; ++I) {
622 printType(Out, *I, false, "field" + utostr(Idx++));
627 Out << " __attribute__ ((packed))";
631 case Type::PointerTyID: {
632 const PointerType *PTy = cast<PointerType>(Ty);
633 std::string ptrName = "*" + NameSoFar;
635 if (isa<ArrayType>(PTy->getElementType()) ||
636 isa<VectorType>(PTy->getElementType()))
637 ptrName = "(" + ptrName + ")";
640 // Must be a function ptr cast!
641 return printType(Out, PTy->getElementType(), false, ptrName, true, PAL);
642 return printType(Out, PTy->getElementType(), false, ptrName);
645 case Type::ArrayTyID: {
646 const ArrayType *ATy = cast<ArrayType>(Ty);
647 unsigned NumElements = ATy->getNumElements();
648 if (NumElements == 0) NumElements = 1;
649 // Arrays are wrapped in structs to allow them to have normal
650 // value semantics (avoiding the array "decay").
651 Out << NameSoFar << " { ";
652 printType(Out, ATy->getElementType(), false,
653 "array[" + utostr(NumElements) + "]");
657 case Type::OpaqueTyID: {
658 std::string TyName = "struct opaque_" + itostr(OpaqueCounter++);
659 assert(TypeNames.find(Ty) == TypeNames.end());
660 TypeNames[Ty] = TyName;
661 return Out << TyName << ' ' << NameSoFar;
664 LLVM_UNREACHABLE("Unhandled case in getTypeProps!");
670 // Pass the Type* and the variable name and this prints out the variable
673 std::ostream &CWriter::printType(std::ostream &Out, const Type *Ty,
674 bool isSigned, const std::string &NameSoFar,
675 bool IgnoreName, const AttrListPtr &PAL) {
676 if (Ty->isPrimitiveType() || Ty->isInteger() || isa<VectorType>(Ty)) {
677 printSimpleType(Out, Ty, isSigned, NameSoFar);
681 // Check to see if the type is named.
682 if (!IgnoreName || isa<OpaqueType>(Ty)) {
683 std::map<const Type *, std::string>::iterator I = TypeNames.find(Ty);
684 if (I != TypeNames.end()) return Out << I->second << ' ' << NameSoFar;
687 switch (Ty->getTypeID()) {
688 case Type::FunctionTyID: {
689 const FunctionType *FTy = cast<FunctionType>(Ty);
690 std::stringstream FunctionInnards;
691 FunctionInnards << " (" << NameSoFar << ") (";
693 for (FunctionType::param_iterator I = FTy->param_begin(),
694 E = FTy->param_end(); I != E; ++I) {
695 const Type *ArgTy = *I;
696 if (PAL.paramHasAttr(Idx, Attribute::ByVal)) {
697 assert(isa<PointerType>(ArgTy));
698 ArgTy = cast<PointerType>(ArgTy)->getElementType();
700 if (I != FTy->param_begin())
701 FunctionInnards << ", ";
702 printType(FunctionInnards, ArgTy,
703 /*isSigned=*/PAL.paramHasAttr(Idx, Attribute::SExt), "");
706 if (FTy->isVarArg()) {
707 if (FTy->getNumParams())
708 FunctionInnards << ", ...";
709 } else if (!FTy->getNumParams()) {
710 FunctionInnards << "void";
712 FunctionInnards << ')';
713 std::string tstr = FunctionInnards.str();
714 printType(Out, FTy->getReturnType(),
715 /*isSigned=*/PAL.paramHasAttr(0, Attribute::SExt), tstr);
718 case Type::StructTyID: {
719 const StructType *STy = cast<StructType>(Ty);
720 Out << NameSoFar + " {\n";
722 for (StructType::element_iterator I = STy->element_begin(),
723 E = STy->element_end(); I != E; ++I) {
725 printType(Out, *I, false, "field" + utostr(Idx++));
730 Out << " __attribute__ ((packed))";
734 case Type::PointerTyID: {
735 const PointerType *PTy = cast<PointerType>(Ty);
736 std::string ptrName = "*" + NameSoFar;
738 if (isa<ArrayType>(PTy->getElementType()) ||
739 isa<VectorType>(PTy->getElementType()))
740 ptrName = "(" + ptrName + ")";
743 // Must be a function ptr cast!
744 return printType(Out, PTy->getElementType(), false, ptrName, true, PAL);
745 return printType(Out, PTy->getElementType(), false, ptrName);
748 case Type::ArrayTyID: {
749 const ArrayType *ATy = cast<ArrayType>(Ty);
750 unsigned NumElements = ATy->getNumElements();
751 if (NumElements == 0) NumElements = 1;
752 // Arrays are wrapped in structs to allow them to have normal
753 // value semantics (avoiding the array "decay").
754 Out << NameSoFar << " { ";
755 printType(Out, ATy->getElementType(), false,
756 "array[" + utostr(NumElements) + "]");
760 case Type::OpaqueTyID: {
761 std::string TyName = "struct opaque_" + itostr(OpaqueCounter++);
762 assert(TypeNames.find(Ty) == TypeNames.end());
763 TypeNames[Ty] = TyName;
764 return Out << TyName << ' ' << NameSoFar;
767 LLVM_UNREACHABLE("Unhandled case in getTypeProps!");
773 void CWriter::printConstantArray(ConstantArray *CPA, bool Static) {
775 // As a special case, print the array as a string if it is an array of
776 // ubytes or an array of sbytes with positive values.
778 const Type *ETy = CPA->getType()->getElementType();
779 bool isString = (ETy == Type::Int8Ty || ETy == Type::Int8Ty);
781 // Make sure the last character is a null char, as automatically added by C
782 if (isString && (CPA->getNumOperands() == 0 ||
783 !cast<Constant>(*(CPA->op_end()-1))->isNullValue()))
788 // Keep track of whether the last number was a hexadecimal escape
789 bool LastWasHex = false;
791 // Do not include the last character, which we know is null
792 for (unsigned i = 0, e = CPA->getNumOperands()-1; i != e; ++i) {
793 unsigned char C = cast<ConstantInt>(CPA->getOperand(i))->getZExtValue();
795 // Print it out literally if it is a printable character. The only thing
796 // to be careful about is when the last letter output was a hex escape
797 // code, in which case we have to be careful not to print out hex digits
798 // explicitly (the C compiler thinks it is a continuation of the previous
799 // character, sheesh...)
801 if (isprint(C) && (!LastWasHex || !isxdigit(C))) {
803 if (C == '"' || C == '\\')
804 Out << "\\" << (char)C;
810 case '\n': Out << "\\n"; break;
811 case '\t': Out << "\\t"; break;
812 case '\r': Out << "\\r"; break;
813 case '\v': Out << "\\v"; break;
814 case '\a': Out << "\\a"; break;
815 case '\"': Out << "\\\""; break;
816 case '\'': Out << "\\\'"; break;
819 Out << (char)(( C/16 < 10) ? ( C/16 +'0') : ( C/16 -10+'A'));
820 Out << (char)(((C&15) < 10) ? ((C&15)+'0') : ((C&15)-10+'A'));
829 if (CPA->getNumOperands()) {
831 printConstant(cast<Constant>(CPA->getOperand(0)), Static);
832 for (unsigned i = 1, e = CPA->getNumOperands(); i != e; ++i) {
834 printConstant(cast<Constant>(CPA->getOperand(i)), Static);
841 void CWriter::printConstantVector(ConstantVector *CP, bool Static) {
843 if (CP->getNumOperands()) {
845 printConstant(cast<Constant>(CP->getOperand(0)), Static);
846 for (unsigned i = 1, e = CP->getNumOperands(); i != e; ++i) {
848 printConstant(cast<Constant>(CP->getOperand(i)), Static);
854 // isFPCSafeToPrint - Returns true if we may assume that CFP may be written out
855 // textually as a double (rather than as a reference to a stack-allocated
856 // variable). We decide this by converting CFP to a string and back into a
857 // double, and then checking whether the conversion results in a bit-equal
858 // double to the original value of CFP. This depends on us and the target C
859 // compiler agreeing on the conversion process (which is pretty likely since we
860 // only deal in IEEE FP).
862 static bool isFPCSafeToPrint(const ConstantFP *CFP) {
864 // Do long doubles in hex for now.
865 if (CFP->getType() != Type::FloatTy && CFP->getType() != Type::DoubleTy)
867 APFloat APF = APFloat(CFP->getValueAPF()); // copy
868 if (CFP->getType() == Type::FloatTy)
869 APF.convert(APFloat::IEEEdouble, APFloat::rmNearestTiesToEven, &ignored);
870 #if HAVE_PRINTF_A && ENABLE_CBE_PRINTF_A
872 sprintf(Buffer, "%a", APF.convertToDouble());
873 if (!strncmp(Buffer, "0x", 2) ||
874 !strncmp(Buffer, "-0x", 3) ||
875 !strncmp(Buffer, "+0x", 3))
876 return APF.bitwiseIsEqual(APFloat(atof(Buffer)));
879 std::string StrVal = ftostr(APF);
881 while (StrVal[0] == ' ')
882 StrVal.erase(StrVal.begin());
884 // Check to make sure that the stringized number is not some string like "Inf"
885 // or NaN. Check that the string matches the "[-+]?[0-9]" regex.
886 if ((StrVal[0] >= '0' && StrVal[0] <= '9') ||
887 ((StrVal[0] == '-' || StrVal[0] == '+') &&
888 (StrVal[1] >= '0' && StrVal[1] <= '9')))
889 // Reparse stringized version!
890 return APF.bitwiseIsEqual(APFloat(atof(StrVal.c_str())));
895 /// Print out the casting for a cast operation. This does the double casting
896 /// necessary for conversion to the destination type, if necessary.
897 /// @brief Print a cast
898 void CWriter::printCast(unsigned opc, const Type *SrcTy, const Type *DstTy) {
899 // Print the destination type cast
901 case Instruction::UIToFP:
902 case Instruction::SIToFP:
903 case Instruction::IntToPtr:
904 case Instruction::Trunc:
905 case Instruction::BitCast:
906 case Instruction::FPExt:
907 case Instruction::FPTrunc: // For these the DstTy sign doesn't matter
909 printType(Out, DstTy);
912 case Instruction::ZExt:
913 case Instruction::PtrToInt:
914 case Instruction::FPToUI: // For these, make sure we get an unsigned dest
916 printSimpleType(Out, DstTy, false);
919 case Instruction::SExt:
920 case Instruction::FPToSI: // For these, make sure we get a signed dest
922 printSimpleType(Out, DstTy, true);
926 LLVM_UNREACHABLE("Invalid cast opcode");
929 // Print the source type cast
931 case Instruction::UIToFP:
932 case Instruction::ZExt:
934 printSimpleType(Out, SrcTy, false);
937 case Instruction::SIToFP:
938 case Instruction::SExt:
940 printSimpleType(Out, SrcTy, true);
943 case Instruction::IntToPtr:
944 case Instruction::PtrToInt:
945 // Avoid "cast to pointer from integer of different size" warnings
946 Out << "(unsigned long)";
948 case Instruction::Trunc:
949 case Instruction::BitCast:
950 case Instruction::FPExt:
951 case Instruction::FPTrunc:
952 case Instruction::FPToSI:
953 case Instruction::FPToUI:
954 break; // These don't need a source cast.
956 LLVM_UNREACHABLE("Invalid cast opcode");
961 // printConstant - The LLVM Constant to C Constant converter.
962 void CWriter::printConstant(Constant *CPV, bool Static) {
963 if (const ConstantExpr *CE = dyn_cast<ConstantExpr>(CPV)) {
964 switch (CE->getOpcode()) {
965 case Instruction::Trunc:
966 case Instruction::ZExt:
967 case Instruction::SExt:
968 case Instruction::FPTrunc:
969 case Instruction::FPExt:
970 case Instruction::UIToFP:
971 case Instruction::SIToFP:
972 case Instruction::FPToUI:
973 case Instruction::FPToSI:
974 case Instruction::PtrToInt:
975 case Instruction::IntToPtr:
976 case Instruction::BitCast:
978 printCast(CE->getOpcode(), CE->getOperand(0)->getType(), CE->getType());
979 if (CE->getOpcode() == Instruction::SExt &&
980 CE->getOperand(0)->getType() == Type::Int1Ty) {
981 // Make sure we really sext from bool here by subtracting from 0
984 printConstant(CE->getOperand(0), Static);
985 if (CE->getType() == Type::Int1Ty &&
986 (CE->getOpcode() == Instruction::Trunc ||
987 CE->getOpcode() == Instruction::FPToUI ||
988 CE->getOpcode() == Instruction::FPToSI ||
989 CE->getOpcode() == Instruction::PtrToInt)) {
990 // Make sure we really truncate to bool here by anding with 1
996 case Instruction::GetElementPtr:
998 printGEPExpression(CE->getOperand(0), gep_type_begin(CPV),
999 gep_type_end(CPV), Static);
1002 case Instruction::Select:
1004 printConstant(CE->getOperand(0), Static);
1006 printConstant(CE->getOperand(1), Static);
1008 printConstant(CE->getOperand(2), Static);
1011 case Instruction::Add:
1012 case Instruction::FAdd:
1013 case Instruction::Sub:
1014 case Instruction::FSub:
1015 case Instruction::Mul:
1016 case Instruction::FMul:
1017 case Instruction::SDiv:
1018 case Instruction::UDiv:
1019 case Instruction::FDiv:
1020 case Instruction::URem:
1021 case Instruction::SRem:
1022 case Instruction::FRem:
1023 case Instruction::And:
1024 case Instruction::Or:
1025 case Instruction::Xor:
1026 case Instruction::ICmp:
1027 case Instruction::Shl:
1028 case Instruction::LShr:
1029 case Instruction::AShr:
1032 bool NeedsClosingParens = printConstExprCast(CE, Static);
1033 printConstantWithCast(CE->getOperand(0), CE->getOpcode());
1034 switch (CE->getOpcode()) {
1035 case Instruction::Add:
1036 case Instruction::FAdd: Out << " + "; break;
1037 case Instruction::Sub:
1038 case Instruction::FSub: Out << " - "; break;
1039 case Instruction::Mul:
1040 case Instruction::FMul: Out << " * "; break;
1041 case Instruction::URem:
1042 case Instruction::SRem:
1043 case Instruction::FRem: Out << " % "; break;
1044 case Instruction::UDiv:
1045 case Instruction::SDiv:
1046 case Instruction::FDiv: Out << " / "; break;
1047 case Instruction::And: Out << " & "; break;
1048 case Instruction::Or: Out << " | "; break;
1049 case Instruction::Xor: Out << " ^ "; break;
1050 case Instruction::Shl: Out << " << "; break;
1051 case Instruction::LShr:
1052 case Instruction::AShr: Out << " >> "; break;
1053 case Instruction::ICmp:
1054 switch (CE->getPredicate()) {
1055 case ICmpInst::ICMP_EQ: Out << " == "; break;
1056 case ICmpInst::ICMP_NE: Out << " != "; break;
1057 case ICmpInst::ICMP_SLT:
1058 case ICmpInst::ICMP_ULT: Out << " < "; break;
1059 case ICmpInst::ICMP_SLE:
1060 case ICmpInst::ICMP_ULE: Out << " <= "; break;
1061 case ICmpInst::ICMP_SGT:
1062 case ICmpInst::ICMP_UGT: Out << " > "; break;
1063 case ICmpInst::ICMP_SGE:
1064 case ICmpInst::ICMP_UGE: Out << " >= "; break;
1065 default: LLVM_UNREACHABLE("Illegal ICmp predicate");
1068 default: LLVM_UNREACHABLE("Illegal opcode here!");
1070 printConstantWithCast(CE->getOperand(1), CE->getOpcode());
1071 if (NeedsClosingParens)
1076 case Instruction::FCmp: {
1078 bool NeedsClosingParens = printConstExprCast(CE, Static);
1079 if (CE->getPredicate() == FCmpInst::FCMP_FALSE)
1081 else if (CE->getPredicate() == FCmpInst::FCMP_TRUE)
1085 switch (CE->getPredicate()) {
1086 default: LLVM_UNREACHABLE("Illegal FCmp predicate");
1087 case FCmpInst::FCMP_ORD: op = "ord"; break;
1088 case FCmpInst::FCMP_UNO: op = "uno"; break;
1089 case FCmpInst::FCMP_UEQ: op = "ueq"; break;
1090 case FCmpInst::FCMP_UNE: op = "une"; break;
1091 case FCmpInst::FCMP_ULT: op = "ult"; break;
1092 case FCmpInst::FCMP_ULE: op = "ule"; break;
1093 case FCmpInst::FCMP_UGT: op = "ugt"; break;
1094 case FCmpInst::FCMP_UGE: op = "uge"; break;
1095 case FCmpInst::FCMP_OEQ: op = "oeq"; break;
1096 case FCmpInst::FCMP_ONE: op = "one"; break;
1097 case FCmpInst::FCMP_OLT: op = "olt"; break;
1098 case FCmpInst::FCMP_OLE: op = "ole"; break;
1099 case FCmpInst::FCMP_OGT: op = "ogt"; break;
1100 case FCmpInst::FCMP_OGE: op = "oge"; break;
1102 Out << "llvm_fcmp_" << op << "(";
1103 printConstantWithCast(CE->getOperand(0), CE->getOpcode());
1105 printConstantWithCast(CE->getOperand(1), CE->getOpcode());
1108 if (NeedsClosingParens)
1115 cerr << "CWriter Error: Unhandled constant expression: "
1120 } else if (isa<UndefValue>(CPV) && CPV->getType()->isSingleValueType()) {
1122 printType(Out, CPV->getType()); // sign doesn't matter
1123 Out << ")/*UNDEF*/";
1124 if (!isa<VectorType>(CPV->getType())) {
1132 if (ConstantInt *CI = dyn_cast<ConstantInt>(CPV)) {
1133 const Type* Ty = CI->getType();
1134 if (Ty == Type::Int1Ty)
1135 Out << (CI->getZExtValue() ? '1' : '0');
1136 else if (Ty == Type::Int32Ty)
1137 Out << CI->getZExtValue() << 'u';
1138 else if (Ty->getPrimitiveSizeInBits() > 32)
1139 Out << CI->getZExtValue() << "ull";
1142 printSimpleType(Out, Ty, false) << ')';
1143 if (CI->isMinValue(true))
1144 Out << CI->getZExtValue() << 'u';
1146 Out << CI->getSExtValue();
1152 switch (CPV->getType()->getTypeID()) {
1153 case Type::FloatTyID:
1154 case Type::DoubleTyID:
1155 case Type::X86_FP80TyID:
1156 case Type::PPC_FP128TyID:
1157 case Type::FP128TyID: {
1158 ConstantFP *FPC = cast<ConstantFP>(CPV);
1159 std::map<const ConstantFP*, unsigned>::iterator I = FPConstantMap.find(FPC);
1160 if (I != FPConstantMap.end()) {
1161 // Because of FP precision problems we must load from a stack allocated
1162 // value that holds the value in hex.
1163 Out << "(*(" << (FPC->getType() == Type::FloatTy ? "float" :
1164 FPC->getType() == Type::DoubleTy ? "double" :
1166 << "*)&FPConstant" << I->second << ')';
1169 if (FPC->getType() == Type::FloatTy)
1170 V = FPC->getValueAPF().convertToFloat();
1171 else if (FPC->getType() == Type::DoubleTy)
1172 V = FPC->getValueAPF().convertToDouble();
1174 // Long double. Convert the number to double, discarding precision.
1175 // This is not awesome, but it at least makes the CBE output somewhat
1177 APFloat Tmp = FPC->getValueAPF();
1179 Tmp.convert(APFloat::IEEEdouble, APFloat::rmTowardZero, &LosesInfo);
1180 V = Tmp.convertToDouble();
1186 // FIXME the actual NaN bits should be emitted.
1187 // The prefix for a quiet NaN is 0x7FF8. For a signalling NaN,
1189 const unsigned long QuietNaN = 0x7ff8UL;
1190 //const unsigned long SignalNaN = 0x7ff4UL;
1192 // We need to grab the first part of the FP #
1195 uint64_t ll = DoubleToBits(V);
1196 sprintf(Buffer, "0x%llx", static_cast<long long>(ll));
1198 std::string Num(&Buffer[0], &Buffer[6]);
1199 unsigned long Val = strtoul(Num.c_str(), 0, 16);
1201 if (FPC->getType() == Type::FloatTy)
1202 Out << "LLVM_NAN" << (Val == QuietNaN ? "" : "S") << "F(\""
1203 << Buffer << "\") /*nan*/ ";
1205 Out << "LLVM_NAN" << (Val == QuietNaN ? "" : "S") << "(\""
1206 << Buffer << "\") /*nan*/ ";
1207 } else if (IsInf(V)) {
1209 if (V < 0) Out << '-';
1210 Out << "LLVM_INF" << (FPC->getType() == Type::FloatTy ? "F" : "")
1214 #if HAVE_PRINTF_A && ENABLE_CBE_PRINTF_A
1215 // Print out the constant as a floating point number.
1217 sprintf(Buffer, "%a", V);
1220 Num = ftostr(FPC->getValueAPF());
1228 case Type::ArrayTyID:
1229 // Use C99 compound expression literal initializer syntax.
1232 printType(Out, CPV->getType());
1235 Out << "{ "; // Arrays are wrapped in struct types.
1236 if (ConstantArray *CA = dyn_cast<ConstantArray>(CPV)) {
1237 printConstantArray(CA, Static);
1239 assert(isa<ConstantAggregateZero>(CPV) || isa<UndefValue>(CPV));
1240 const ArrayType *AT = cast<ArrayType>(CPV->getType());
1242 if (AT->getNumElements()) {
1244 Constant *CZ = Context->getNullValue(AT->getElementType());
1245 printConstant(CZ, Static);
1246 for (unsigned i = 1, e = AT->getNumElements(); i != e; ++i) {
1248 printConstant(CZ, Static);
1253 Out << " }"; // Arrays are wrapped in struct types.
1256 case Type::VectorTyID:
1257 // Use C99 compound expression literal initializer syntax.
1260 printType(Out, CPV->getType());
1263 if (ConstantVector *CV = dyn_cast<ConstantVector>(CPV)) {
1264 printConstantVector(CV, Static);
1266 assert(isa<ConstantAggregateZero>(CPV) || isa<UndefValue>(CPV));
1267 const VectorType *VT = cast<VectorType>(CPV->getType());
1269 Constant *CZ = Context->getNullValue(VT->getElementType());
1270 printConstant(CZ, Static);
1271 for (unsigned i = 1, e = VT->getNumElements(); i != e; ++i) {
1273 printConstant(CZ, Static);
1279 case Type::StructTyID:
1280 // Use C99 compound expression literal initializer syntax.
1283 printType(Out, CPV->getType());
1286 if (isa<ConstantAggregateZero>(CPV) || isa<UndefValue>(CPV)) {
1287 const StructType *ST = cast<StructType>(CPV->getType());
1289 if (ST->getNumElements()) {
1291 printConstant(Context->getNullValue(ST->getElementType(0)), Static);
1292 for (unsigned i = 1, e = ST->getNumElements(); i != e; ++i) {
1294 printConstant(Context->getNullValue(ST->getElementType(i)), Static);
1300 if (CPV->getNumOperands()) {
1302 printConstant(cast<Constant>(CPV->getOperand(0)), Static);
1303 for (unsigned i = 1, e = CPV->getNumOperands(); i != e; ++i) {
1305 printConstant(cast<Constant>(CPV->getOperand(i)), Static);
1312 case Type::PointerTyID:
1313 if (isa<ConstantPointerNull>(CPV)) {
1315 printType(Out, CPV->getType()); // sign doesn't matter
1316 Out << ")/*NULL*/0)";
1318 } else if (GlobalValue *GV = dyn_cast<GlobalValue>(CPV)) {
1319 writeOperand(GV, Static);
1325 cerr << "Unknown constant type: " << *CPV << "\n";
1331 // Some constant expressions need to be casted back to the original types
1332 // because their operands were casted to the expected type. This function takes
1333 // care of detecting that case and printing the cast for the ConstantExpr.
1334 bool CWriter::printConstExprCast(const ConstantExpr* CE, bool Static) {
1335 bool NeedsExplicitCast = false;
1336 const Type *Ty = CE->getOperand(0)->getType();
1337 bool TypeIsSigned = false;
1338 switch (CE->getOpcode()) {
1339 case Instruction::Add:
1340 case Instruction::Sub:
1341 case Instruction::Mul:
1342 // We need to cast integer arithmetic so that it is always performed
1343 // as unsigned, to avoid undefined behavior on overflow.
1344 case Instruction::LShr:
1345 case Instruction::URem:
1346 case Instruction::UDiv: NeedsExplicitCast = true; break;
1347 case Instruction::AShr:
1348 case Instruction::SRem:
1349 case Instruction::SDiv: NeedsExplicitCast = true; TypeIsSigned = true; break;
1350 case Instruction::SExt:
1352 NeedsExplicitCast = true;
1353 TypeIsSigned = true;
1355 case Instruction::ZExt:
1356 case Instruction::Trunc:
1357 case Instruction::FPTrunc:
1358 case Instruction::FPExt:
1359 case Instruction::UIToFP:
1360 case Instruction::SIToFP:
1361 case Instruction::FPToUI:
1362 case Instruction::FPToSI:
1363 case Instruction::PtrToInt:
1364 case Instruction::IntToPtr:
1365 case Instruction::BitCast:
1367 NeedsExplicitCast = true;
1371 if (NeedsExplicitCast) {
1373 if (Ty->isInteger() && Ty != Type::Int1Ty)
1374 printSimpleType(Out, Ty, TypeIsSigned);
1376 printType(Out, Ty); // not integer, sign doesn't matter
1379 return NeedsExplicitCast;
1382 // Print a constant assuming that it is the operand for a given Opcode. The
1383 // opcodes that care about sign need to cast their operands to the expected
1384 // type before the operation proceeds. This function does the casting.
1385 void CWriter::printConstantWithCast(Constant* CPV, unsigned Opcode) {
1387 // Extract the operand's type, we'll need it.
1388 const Type* OpTy = CPV->getType();
1390 // Indicate whether to do the cast or not.
1391 bool shouldCast = false;
1392 bool typeIsSigned = false;
1394 // Based on the Opcode for which this Constant is being written, determine
1395 // the new type to which the operand should be casted by setting the value
1396 // of OpTy. If we change OpTy, also set shouldCast to true so it gets
1400 // for most instructions, it doesn't matter
1402 case Instruction::Add:
1403 case Instruction::Sub:
1404 case Instruction::Mul:
1405 // We need to cast integer arithmetic so that it is always performed
1406 // as unsigned, to avoid undefined behavior on overflow.
1407 case Instruction::LShr:
1408 case Instruction::UDiv:
1409 case Instruction::URem:
1412 case Instruction::AShr:
1413 case Instruction::SDiv:
1414 case Instruction::SRem:
1416 typeIsSigned = true;
1420 // Write out the casted constant if we should, otherwise just write the
1424 printSimpleType(Out, OpTy, typeIsSigned);
1426 printConstant(CPV, false);
1429 printConstant(CPV, false);
1432 std::string CWriter::GetValueName(const Value *Operand) {
1433 // Mangle globals with the standard mangler interface for LLC compatibility.
1434 if (const GlobalValue *GV = dyn_cast<GlobalValue>(Operand))
1435 return Mang->getMangledName(GV);
1437 std::string Name = Operand->getName();
1439 if (Name.empty()) { // Assign unique names to local temporaries.
1440 unsigned &No = AnonValueNumbers[Operand];
1442 No = ++NextAnonValueNumber;
1443 Name = "tmp__" + utostr(No);
1446 std::string VarName;
1447 VarName.reserve(Name.capacity());
1449 for (std::string::iterator I = Name.begin(), E = Name.end();
1453 if (!((ch >= 'a' && ch <= 'z') || (ch >= 'A' && ch <= 'Z') ||
1454 (ch >= '0' && ch <= '9') || ch == '_')) {
1456 sprintf(buffer, "_%x_", ch);
1462 return "llvm_cbe_" + VarName;
1465 /// writeInstComputationInline - Emit the computation for the specified
1466 /// instruction inline, with no destination provided.
1467 void CWriter::writeInstComputationInline(Instruction &I) {
1468 // We can't currently support integer types other than 1, 8, 16, 32, 64.
1470 const Type *Ty = I.getType();
1471 if (Ty->isInteger() && (Ty!=Type::Int1Ty && Ty!=Type::Int8Ty &&
1472 Ty!=Type::Int16Ty && Ty!=Type::Int32Ty && Ty!=Type::Int64Ty)) {
1473 llvm_report_error("The C backend does not currently support integer "
1474 "types of widths other than 1, 8, 16, 32, 64.\n"
1475 "This is being tracked as PR 4158.");
1478 // If this is a non-trivial bool computation, make sure to truncate down to
1479 // a 1 bit value. This is important because we want "add i1 x, y" to return
1480 // "0" when x and y are true, not "2" for example.
1481 bool NeedBoolTrunc = false;
1482 if (I.getType() == Type::Int1Ty && !isa<ICmpInst>(I) && !isa<FCmpInst>(I))
1483 NeedBoolTrunc = true;
1495 void CWriter::writeOperandInternal(Value *Operand, bool Static) {
1496 if (Instruction *I = dyn_cast<Instruction>(Operand))
1497 // Should we inline this instruction to build a tree?
1498 if (isInlinableInst(*I) && !isDirectAlloca(I)) {
1500 writeInstComputationInline(*I);
1505 Constant* CPV = dyn_cast<Constant>(Operand);
1507 if (CPV && !isa<GlobalValue>(CPV))
1508 printConstant(CPV, Static);
1510 Out << GetValueName(Operand);
1513 void CWriter::writeOperand(Value *Operand, bool Static) {
1514 bool isAddressImplicit = isAddressExposed(Operand);
1515 if (isAddressImplicit)
1516 Out << "(&"; // Global variables are referenced as their addresses by llvm
1518 writeOperandInternal(Operand, Static);
1520 if (isAddressImplicit)
1524 // Some instructions need to have their result value casted back to the
1525 // original types because their operands were casted to the expected type.
1526 // This function takes care of detecting that case and printing the cast
1527 // for the Instruction.
1528 bool CWriter::writeInstructionCast(const Instruction &I) {
1529 const Type *Ty = I.getOperand(0)->getType();
1530 switch (I.getOpcode()) {
1531 case Instruction::Add:
1532 case Instruction::Sub:
1533 case Instruction::Mul:
1534 // We need to cast integer arithmetic so that it is always performed
1535 // as unsigned, to avoid undefined behavior on overflow.
1536 case Instruction::LShr:
1537 case Instruction::URem:
1538 case Instruction::UDiv:
1540 printSimpleType(Out, Ty, false);
1543 case Instruction::AShr:
1544 case Instruction::SRem:
1545 case Instruction::SDiv:
1547 printSimpleType(Out, Ty, true);
1555 // Write the operand with a cast to another type based on the Opcode being used.
1556 // This will be used in cases where an instruction has specific type
1557 // requirements (usually signedness) for its operands.
1558 void CWriter::writeOperandWithCast(Value* Operand, unsigned Opcode) {
1560 // Extract the operand's type, we'll need it.
1561 const Type* OpTy = Operand->getType();
1563 // Indicate whether to do the cast or not.
1564 bool shouldCast = false;
1566 // Indicate whether the cast should be to a signed type or not.
1567 bool castIsSigned = false;
1569 // Based on the Opcode for which this Operand is being written, determine
1570 // the new type to which the operand should be casted by setting the value
1571 // of OpTy. If we change OpTy, also set shouldCast to true.
1574 // for most instructions, it doesn't matter
1576 case Instruction::Add:
1577 case Instruction::Sub:
1578 case Instruction::Mul:
1579 // We need to cast integer arithmetic so that it is always performed
1580 // as unsigned, to avoid undefined behavior on overflow.
1581 case Instruction::LShr:
1582 case Instruction::UDiv:
1583 case Instruction::URem: // Cast to unsigned first
1585 castIsSigned = false;
1587 case Instruction::GetElementPtr:
1588 case Instruction::AShr:
1589 case Instruction::SDiv:
1590 case Instruction::SRem: // Cast to signed first
1592 castIsSigned = true;
1596 // Write out the casted operand if we should, otherwise just write the
1600 printSimpleType(Out, OpTy, castIsSigned);
1602 writeOperand(Operand);
1605 writeOperand(Operand);
1608 // Write the operand with a cast to another type based on the icmp predicate
1610 void CWriter::writeOperandWithCast(Value* Operand, const ICmpInst &Cmp) {
1611 // This has to do a cast to ensure the operand has the right signedness.
1612 // Also, if the operand is a pointer, we make sure to cast to an integer when
1613 // doing the comparison both for signedness and so that the C compiler doesn't
1614 // optimize things like "p < NULL" to false (p may contain an integer value
1616 bool shouldCast = Cmp.isRelational();
1618 // Write out the casted operand if we should, otherwise just write the
1621 writeOperand(Operand);
1625 // Should this be a signed comparison? If so, convert to signed.
1626 bool castIsSigned = Cmp.isSignedPredicate();
1628 // If the operand was a pointer, convert to a large integer type.
1629 const Type* OpTy = Operand->getType();
1630 if (isa<PointerType>(OpTy))
1631 OpTy = TD->getIntPtrType();
1634 printSimpleType(Out, OpTy, castIsSigned);
1636 writeOperand(Operand);
1640 // generateCompilerSpecificCode - This is where we add conditional compilation
1641 // directives to cater to specific compilers as need be.
1643 static void generateCompilerSpecificCode(raw_ostream& Out,
1644 const TargetData *TD) {
1645 // Alloca is hard to get, and we don't want to include stdlib.h here.
1646 Out << "/* get a declaration for alloca */\n"
1647 << "#if defined(__CYGWIN__) || defined(__MINGW32__)\n"
1648 << "#define alloca(x) __builtin_alloca((x))\n"
1649 << "#define _alloca(x) __builtin_alloca((x))\n"
1650 << "#elif defined(__APPLE__)\n"
1651 << "extern void *__builtin_alloca(unsigned long);\n"
1652 << "#define alloca(x) __builtin_alloca(x)\n"
1653 << "#define longjmp _longjmp\n"
1654 << "#define setjmp _setjmp\n"
1655 << "#elif defined(__sun__)\n"
1656 << "#if defined(__sparcv9)\n"
1657 << "extern void *__builtin_alloca(unsigned long);\n"
1659 << "extern void *__builtin_alloca(unsigned int);\n"
1661 << "#define alloca(x) __builtin_alloca(x)\n"
1662 << "#elif defined(__FreeBSD__) || defined(__NetBSD__) || defined(__OpenBSD__) || defined(__DragonFly__)\n"
1663 << "#define alloca(x) __builtin_alloca(x)\n"
1664 << "#elif defined(_MSC_VER)\n"
1665 << "#define inline _inline\n"
1666 << "#define alloca(x) _alloca(x)\n"
1668 << "#include <alloca.h>\n"
1671 // We output GCC specific attributes to preserve 'linkonce'ness on globals.
1672 // If we aren't being compiled with GCC, just drop these attributes.
1673 Out << "#ifndef __GNUC__ /* Can only support \"linkonce\" vars with GCC */\n"
1674 << "#define __attribute__(X)\n"
1677 // On Mac OS X, "external weak" is spelled "__attribute__((weak_import))".
1678 Out << "#if defined(__GNUC__) && defined(__APPLE_CC__)\n"
1679 << "#define __EXTERNAL_WEAK__ __attribute__((weak_import))\n"
1680 << "#elif defined(__GNUC__)\n"
1681 << "#define __EXTERNAL_WEAK__ __attribute__((weak))\n"
1683 << "#define __EXTERNAL_WEAK__\n"
1686 // For now, turn off the weak linkage attribute on Mac OS X. (See above.)
1687 Out << "#if defined(__GNUC__) && defined(__APPLE_CC__)\n"
1688 << "#define __ATTRIBUTE_WEAK__\n"
1689 << "#elif defined(__GNUC__)\n"
1690 << "#define __ATTRIBUTE_WEAK__ __attribute__((weak))\n"
1692 << "#define __ATTRIBUTE_WEAK__\n"
1695 // Add hidden visibility support. FIXME: APPLE_CC?
1696 Out << "#if defined(__GNUC__)\n"
1697 << "#define __HIDDEN__ __attribute__((visibility(\"hidden\")))\n"
1700 // Define NaN and Inf as GCC builtins if using GCC, as 0 otherwise
1701 // From the GCC documentation:
1703 // double __builtin_nan (const char *str)
1705 // This is an implementation of the ISO C99 function nan.
1707 // Since ISO C99 defines this function in terms of strtod, which we do
1708 // not implement, a description of the parsing is in order. The string is
1709 // parsed as by strtol; that is, the base is recognized by leading 0 or
1710 // 0x prefixes. The number parsed is placed in the significand such that
1711 // the least significant bit of the number is at the least significant
1712 // bit of the significand. The number is truncated to fit the significand
1713 // field provided. The significand is forced to be a quiet NaN.
1715 // This function, if given a string literal, is evaluated early enough
1716 // that it is considered a compile-time constant.
1718 // float __builtin_nanf (const char *str)
1720 // Similar to __builtin_nan, except the return type is float.
1722 // double __builtin_inf (void)
1724 // Similar to __builtin_huge_val, except a warning is generated if the
1725 // target floating-point format does not support infinities. This
1726 // function is suitable for implementing the ISO C99 macro INFINITY.
1728 // float __builtin_inff (void)
1730 // Similar to __builtin_inf, except the return type is float.
1731 Out << "#ifdef __GNUC__\n"
1732 << "#define LLVM_NAN(NanStr) __builtin_nan(NanStr) /* Double */\n"
1733 << "#define LLVM_NANF(NanStr) __builtin_nanf(NanStr) /* Float */\n"
1734 << "#define LLVM_NANS(NanStr) __builtin_nans(NanStr) /* Double */\n"
1735 << "#define LLVM_NANSF(NanStr) __builtin_nansf(NanStr) /* Float */\n"
1736 << "#define LLVM_INF __builtin_inf() /* Double */\n"
1737 << "#define LLVM_INFF __builtin_inff() /* Float */\n"
1738 << "#define LLVM_PREFETCH(addr,rw,locality) "
1739 "__builtin_prefetch(addr,rw,locality)\n"
1740 << "#define __ATTRIBUTE_CTOR__ __attribute__((constructor))\n"
1741 << "#define __ATTRIBUTE_DTOR__ __attribute__((destructor))\n"
1742 << "#define LLVM_ASM __asm__\n"
1744 << "#define LLVM_NAN(NanStr) ((double)0.0) /* Double */\n"
1745 << "#define LLVM_NANF(NanStr) 0.0F /* Float */\n"
1746 << "#define LLVM_NANS(NanStr) ((double)0.0) /* Double */\n"
1747 << "#define LLVM_NANSF(NanStr) 0.0F /* Float */\n"
1748 << "#define LLVM_INF ((double)0.0) /* Double */\n"
1749 << "#define LLVM_INFF 0.0F /* Float */\n"
1750 << "#define LLVM_PREFETCH(addr,rw,locality) /* PREFETCH */\n"
1751 << "#define __ATTRIBUTE_CTOR__\n"
1752 << "#define __ATTRIBUTE_DTOR__\n"
1753 << "#define LLVM_ASM(X)\n"
1756 Out << "#if __GNUC__ < 4 /* Old GCC's, or compilers not GCC */ \n"
1757 << "#define __builtin_stack_save() 0 /* not implemented */\n"
1758 << "#define __builtin_stack_restore(X) /* noop */\n"
1761 // Output typedefs for 128-bit integers. If these are needed with a
1762 // 32-bit target or with a C compiler that doesn't support mode(TI),
1763 // more drastic measures will be needed.
1764 Out << "#if __GNUC__ && __LP64__ /* 128-bit integer types */\n"
1765 << "typedef int __attribute__((mode(TI))) llvmInt128;\n"
1766 << "typedef unsigned __attribute__((mode(TI))) llvmUInt128;\n"
1769 // Output target-specific code that should be inserted into main.
1770 Out << "#define CODE_FOR_MAIN() /* Any target-specific code for main()*/\n";
1773 /// FindStaticTors - Given a static ctor/dtor list, unpack its contents into
1774 /// the StaticTors set.
1775 static void FindStaticTors(GlobalVariable *GV, std::set<Function*> &StaticTors){
1776 ConstantArray *InitList = dyn_cast<ConstantArray>(GV->getInitializer());
1777 if (!InitList) return;
1779 for (unsigned i = 0, e = InitList->getNumOperands(); i != e; ++i)
1780 if (ConstantStruct *CS = dyn_cast<ConstantStruct>(InitList->getOperand(i))){
1781 if (CS->getNumOperands() != 2) return; // Not array of 2-element structs.
1783 if (CS->getOperand(1)->isNullValue())
1784 return; // Found a null terminator, exit printing.
1785 Constant *FP = CS->getOperand(1);
1786 if (ConstantExpr *CE = dyn_cast<ConstantExpr>(FP))
1788 FP = CE->getOperand(0);
1789 if (Function *F = dyn_cast<Function>(FP))
1790 StaticTors.insert(F);
1794 enum SpecialGlobalClass {
1796 GlobalCtors, GlobalDtors,
1800 /// getGlobalVariableClass - If this is a global that is specially recognized
1801 /// by LLVM, return a code that indicates how we should handle it.
1802 static SpecialGlobalClass getGlobalVariableClass(const GlobalVariable *GV) {
1803 // If this is a global ctors/dtors list, handle it now.
1804 if (GV->hasAppendingLinkage() && GV->use_empty()) {
1805 if (GV->getName() == "llvm.global_ctors")
1807 else if (GV->getName() == "llvm.global_dtors")
1811 // Otherwise, it it is other metadata, don't print it. This catches things
1812 // like debug information.
1813 if (GV->getSection() == "llvm.metadata")
1820 bool CWriter::doInitialization(Module &M) {
1824 TD = new TargetData(&M);
1825 IL = new IntrinsicLowering(*TD);
1826 IL->AddPrototypes(M);
1828 // Ensure that all structure types have names...
1829 Mang = new Mangler(M);
1830 Mang->markCharUnacceptable('.');
1832 // Keep track of which functions are static ctors/dtors so they can have
1833 // an attribute added to their prototypes.
1834 std::set<Function*> StaticCtors, StaticDtors;
1835 for (Module::global_iterator I = M.global_begin(), E = M.global_end();
1837 switch (getGlobalVariableClass(I)) {
1840 FindStaticTors(I, StaticCtors);
1843 FindStaticTors(I, StaticDtors);
1848 // get declaration for alloca
1849 Out << "/* Provide Declarations */\n";
1850 Out << "#include <stdarg.h>\n"; // Varargs support
1851 Out << "#include <setjmp.h>\n"; // Unwind support
1852 generateCompilerSpecificCode(Out, TD);
1854 // Provide a definition for `bool' if not compiling with a C++ compiler.
1856 << "#ifndef __cplusplus\ntypedef unsigned char bool;\n#endif\n"
1858 << "\n\n/* Support for floating point constants */\n"
1859 << "typedef unsigned long long ConstantDoubleTy;\n"
1860 << "typedef unsigned int ConstantFloatTy;\n"
1861 << "typedef struct { unsigned long long f1; unsigned short f2; "
1862 "unsigned short pad[3]; } ConstantFP80Ty;\n"
1863 // This is used for both kinds of 128-bit long double; meaning differs.
1864 << "typedef struct { unsigned long long f1; unsigned long long f2; }"
1865 " ConstantFP128Ty;\n"
1866 << "\n\n/* Global Declarations */\n";
1868 // First output all the declarations for the program, because C requires
1869 // Functions & globals to be declared before they are used.
1872 // Loop over the symbol table, emitting all named constants...
1873 printModuleTypes(M.getTypeSymbolTable());
1875 // Global variable declarations...
1876 if (!M.global_empty()) {
1877 Out << "\n/* External Global Variable Declarations */\n";
1878 for (Module::global_iterator I = M.global_begin(), E = M.global_end();
1881 if (I->hasExternalLinkage() || I->hasExternalWeakLinkage() ||
1882 I->hasCommonLinkage())
1884 else if (I->hasDLLImportLinkage())
1885 Out << "__declspec(dllimport) ";
1887 continue; // Internal Global
1889 // Thread Local Storage
1890 if (I->isThreadLocal())
1893 printType(Out, I->getType()->getElementType(), false, GetValueName(I));
1895 if (I->hasExternalWeakLinkage())
1896 Out << " __EXTERNAL_WEAK__";
1901 // Function declarations
1902 Out << "\n/* Function Declarations */\n";
1903 Out << "double fmod(double, double);\n"; // Support for FP rem
1904 Out << "float fmodf(float, float);\n";
1905 Out << "long double fmodl(long double, long double);\n";
1907 for (Module::iterator I = M.begin(), E = M.end(); I != E; ++I) {
1908 // Don't print declarations for intrinsic functions.
1909 if (!I->isIntrinsic() && I->getName() != "setjmp" &&
1910 I->getName() != "longjmp" && I->getName() != "_setjmp") {
1911 if (I->hasExternalWeakLinkage())
1913 printFunctionSignature(I, true);
1914 if (I->hasWeakLinkage() || I->hasLinkOnceLinkage())
1915 Out << " __ATTRIBUTE_WEAK__";
1916 if (I->hasExternalWeakLinkage())
1917 Out << " __EXTERNAL_WEAK__";
1918 if (StaticCtors.count(I))
1919 Out << " __ATTRIBUTE_CTOR__";
1920 if (StaticDtors.count(I))
1921 Out << " __ATTRIBUTE_DTOR__";
1922 if (I->hasHiddenVisibility())
1923 Out << " __HIDDEN__";
1925 if (I->hasName() && I->getName()[0] == 1)
1926 Out << " LLVM_ASM(\"" << I->getName().c_str()+1 << "\")";
1932 // Output the global variable declarations
1933 if (!M.global_empty()) {
1934 Out << "\n\n/* Global Variable Declarations */\n";
1935 for (Module::global_iterator I = M.global_begin(), E = M.global_end();
1937 if (!I->isDeclaration()) {
1938 // Ignore special globals, such as debug info.
1939 if (getGlobalVariableClass(I))
1942 if (I->hasLocalLinkage())
1947 // Thread Local Storage
1948 if (I->isThreadLocal())
1951 printType(Out, I->getType()->getElementType(), false,
1954 if (I->hasLinkOnceLinkage())
1955 Out << " __attribute__((common))";
1956 else if (I->hasCommonLinkage()) // FIXME is this right?
1957 Out << " __ATTRIBUTE_WEAK__";
1958 else if (I->hasWeakLinkage())
1959 Out << " __ATTRIBUTE_WEAK__";
1960 else if (I->hasExternalWeakLinkage())
1961 Out << " __EXTERNAL_WEAK__";
1962 if (I->hasHiddenVisibility())
1963 Out << " __HIDDEN__";
1968 // Output the global variable definitions and contents...
1969 if (!M.global_empty()) {
1970 Out << "\n\n/* Global Variable Definitions and Initialization */\n";
1971 for (Module::global_iterator I = M.global_begin(), E = M.global_end();
1973 if (!I->isDeclaration()) {
1974 // Ignore special globals, such as debug info.
1975 if (getGlobalVariableClass(I))
1978 if (I->hasLocalLinkage())
1980 else if (I->hasDLLImportLinkage())
1981 Out << "__declspec(dllimport) ";
1982 else if (I->hasDLLExportLinkage())
1983 Out << "__declspec(dllexport) ";
1985 // Thread Local Storage
1986 if (I->isThreadLocal())
1989 printType(Out, I->getType()->getElementType(), false,
1991 if (I->hasLinkOnceLinkage())
1992 Out << " __attribute__((common))";
1993 else if (I->hasWeakLinkage())
1994 Out << " __ATTRIBUTE_WEAK__";
1995 else if (I->hasCommonLinkage())
1996 Out << " __ATTRIBUTE_WEAK__";
1998 if (I->hasHiddenVisibility())
1999 Out << " __HIDDEN__";
2001 // If the initializer is not null, emit the initializer. If it is null,
2002 // we try to avoid emitting large amounts of zeros. The problem with
2003 // this, however, occurs when the variable has weak linkage. In this
2004 // case, the assembler will complain about the variable being both weak
2005 // and common, so we disable this optimization.
2006 // FIXME common linkage should avoid this problem.
2007 if (!I->getInitializer()->isNullValue()) {
2009 writeOperand(I->getInitializer(), true);
2010 } else if (I->hasWeakLinkage()) {
2011 // We have to specify an initializer, but it doesn't have to be
2012 // complete. If the value is an aggregate, print out { 0 }, and let
2013 // the compiler figure out the rest of the zeros.
2015 if (isa<StructType>(I->getInitializer()->getType()) ||
2016 isa<VectorType>(I->getInitializer()->getType())) {
2018 } else if (isa<ArrayType>(I->getInitializer()->getType())) {
2019 // As with structs and vectors, but with an extra set of braces
2020 // because arrays are wrapped in structs.
2023 // Just print it out normally.
2024 writeOperand(I->getInitializer(), true);
2032 Out << "\n\n/* Function Bodies */\n";
2034 // Emit some helper functions for dealing with FCMP instruction's
2036 Out << "static inline int llvm_fcmp_ord(double X, double Y) { ";
2037 Out << "return X == X && Y == Y; }\n";
2038 Out << "static inline int llvm_fcmp_uno(double X, double Y) { ";
2039 Out << "return X != X || Y != Y; }\n";
2040 Out << "static inline int llvm_fcmp_ueq(double X, double Y) { ";
2041 Out << "return X == Y || llvm_fcmp_uno(X, Y); }\n";
2042 Out << "static inline int llvm_fcmp_une(double X, double Y) { ";
2043 Out << "return X != Y; }\n";
2044 Out << "static inline int llvm_fcmp_ult(double X, double Y) { ";
2045 Out << "return X < Y || llvm_fcmp_uno(X, Y); }\n";
2046 Out << "static inline int llvm_fcmp_ugt(double X, double Y) { ";
2047 Out << "return X > Y || llvm_fcmp_uno(X, Y); }\n";
2048 Out << "static inline int llvm_fcmp_ule(double X, double Y) { ";
2049 Out << "return X <= Y || llvm_fcmp_uno(X, Y); }\n";
2050 Out << "static inline int llvm_fcmp_uge(double X, double Y) { ";
2051 Out << "return X >= Y || llvm_fcmp_uno(X, Y); }\n";
2052 Out << "static inline int llvm_fcmp_oeq(double X, double Y) { ";
2053 Out << "return X == Y ; }\n";
2054 Out << "static inline int llvm_fcmp_one(double X, double Y) { ";
2055 Out << "return X != Y && llvm_fcmp_ord(X, Y); }\n";
2056 Out << "static inline int llvm_fcmp_olt(double X, double Y) { ";
2057 Out << "return X < Y ; }\n";
2058 Out << "static inline int llvm_fcmp_ogt(double X, double Y) { ";
2059 Out << "return X > Y ; }\n";
2060 Out << "static inline int llvm_fcmp_ole(double X, double Y) { ";
2061 Out << "return X <= Y ; }\n";
2062 Out << "static inline int llvm_fcmp_oge(double X, double Y) { ";
2063 Out << "return X >= Y ; }\n";
2068 /// Output all floating point constants that cannot be printed accurately...
2069 void CWriter::printFloatingPointConstants(Function &F) {
2070 // Scan the module for floating point constants. If any FP constant is used
2071 // in the function, we want to redirect it here so that we do not depend on
2072 // the precision of the printed form, unless the printed form preserves
2075 for (constant_iterator I = constant_begin(&F), E = constant_end(&F);
2077 printFloatingPointConstants(*I);
2082 void CWriter::printFloatingPointConstants(const Constant *C) {
2083 // If this is a constant expression, recursively check for constant fp values.
2084 if (const ConstantExpr *CE = dyn_cast<ConstantExpr>(C)) {
2085 for (unsigned i = 0, e = CE->getNumOperands(); i != e; ++i)
2086 printFloatingPointConstants(CE->getOperand(i));
2090 // Otherwise, check for a FP constant that we need to print.
2091 const ConstantFP *FPC = dyn_cast<ConstantFP>(C);
2093 // Do not put in FPConstantMap if safe.
2094 isFPCSafeToPrint(FPC) ||
2095 // Already printed this constant?
2096 FPConstantMap.count(FPC))
2099 FPConstantMap[FPC] = FPCounter; // Number the FP constants
2101 if (FPC->getType() == Type::DoubleTy) {
2102 double Val = FPC->getValueAPF().convertToDouble();
2103 uint64_t i = FPC->getValueAPF().bitcastToAPInt().getZExtValue();
2104 Out << "static const ConstantDoubleTy FPConstant" << FPCounter++
2105 << " = 0x" << utohexstr(i)
2106 << "ULL; /* " << Val << " */\n";
2107 } else if (FPC->getType() == Type::FloatTy) {
2108 float Val = FPC->getValueAPF().convertToFloat();
2109 uint32_t i = (uint32_t)FPC->getValueAPF().bitcastToAPInt().
2111 Out << "static const ConstantFloatTy FPConstant" << FPCounter++
2112 << " = 0x" << utohexstr(i)
2113 << "U; /* " << Val << " */\n";
2114 } else if (FPC->getType() == Type::X86_FP80Ty) {
2115 // api needed to prevent premature destruction
2116 APInt api = FPC->getValueAPF().bitcastToAPInt();
2117 const uint64_t *p = api.getRawData();
2118 Out << "static const ConstantFP80Ty FPConstant" << FPCounter++
2119 << " = { 0x" << utohexstr(p[0])
2120 << "ULL, 0x" << utohexstr((uint16_t)p[1]) << ",{0,0,0}"
2121 << "}; /* Long double constant */\n";
2122 } else if (FPC->getType() == Type::PPC_FP128Ty) {
2123 APInt api = FPC->getValueAPF().bitcastToAPInt();
2124 const uint64_t *p = api.getRawData();
2125 Out << "static const ConstantFP128Ty FPConstant" << FPCounter++
2127 << utohexstr(p[0]) << ", 0x" << utohexstr(p[1])
2128 << "}; /* Long double constant */\n";
2131 LLVM_UNREACHABLE("Unknown float type!");
2137 /// printSymbolTable - Run through symbol table looking for type names. If a
2138 /// type name is found, emit its declaration...
2140 void CWriter::printModuleTypes(const TypeSymbolTable &TST) {
2141 Out << "/* Helper union for bitcasts */\n";
2142 Out << "typedef union {\n";
2143 Out << " unsigned int Int32;\n";
2144 Out << " unsigned long long Int64;\n";
2145 Out << " float Float;\n";
2146 Out << " double Double;\n";
2147 Out << "} llvmBitCastUnion;\n";
2149 // We are only interested in the type plane of the symbol table.
2150 TypeSymbolTable::const_iterator I = TST.begin();
2151 TypeSymbolTable::const_iterator End = TST.end();
2153 // If there are no type names, exit early.
2154 if (I == End) return;
2156 // Print out forward declarations for structure types before anything else!
2157 Out << "/* Structure forward decls */\n";
2158 for (; I != End; ++I) {
2159 std::string Name = "struct l_" + Mang->makeNameProper(I->first);
2160 Out << Name << ";\n";
2161 TypeNames.insert(std::make_pair(I->second, Name));
2166 // Now we can print out typedefs. Above, we guaranteed that this can only be
2167 // for struct or opaque types.
2168 Out << "/* Typedefs */\n";
2169 for (I = TST.begin(); I != End; ++I) {
2170 std::string Name = "l_" + Mang->makeNameProper(I->first);
2172 printType(Out, I->second, false, Name);
2178 // Keep track of which structures have been printed so far...
2179 std::set<const Type *> StructPrinted;
2181 // Loop over all structures then push them into the stack so they are
2182 // printed in the correct order.
2184 Out << "/* Structure contents */\n";
2185 for (I = TST.begin(); I != End; ++I)
2186 if (isa<StructType>(I->second) || isa<ArrayType>(I->second))
2187 // Only print out used types!
2188 printContainedStructs(I->second, StructPrinted);
2191 // Push the struct onto the stack and recursively push all structs
2192 // this one depends on.
2194 // TODO: Make this work properly with vector types
2196 void CWriter::printContainedStructs(const Type *Ty,
2197 std::set<const Type*> &StructPrinted) {
2198 // Don't walk through pointers.
2199 if (isa<PointerType>(Ty) || Ty->isPrimitiveType() || Ty->isInteger()) return;
2201 // Print all contained types first.
2202 for (Type::subtype_iterator I = Ty->subtype_begin(),
2203 E = Ty->subtype_end(); I != E; ++I)
2204 printContainedStructs(*I, StructPrinted);
2206 if (isa<StructType>(Ty) || isa<ArrayType>(Ty)) {
2207 // Check to see if we have already printed this struct.
2208 if (StructPrinted.insert(Ty).second) {
2209 // Print structure type out.
2210 std::string Name = TypeNames[Ty];
2211 printType(Out, Ty, false, Name, true);
2217 void CWriter::printFunctionSignature(const Function *F, bool Prototype) {
2218 /// isStructReturn - Should this function actually return a struct by-value?
2219 bool isStructReturn = F->hasStructRetAttr();
2221 if (F->hasLocalLinkage()) Out << "static ";
2222 if (F->hasDLLImportLinkage()) Out << "__declspec(dllimport) ";
2223 if (F->hasDLLExportLinkage()) Out << "__declspec(dllexport) ";
2224 switch (F->getCallingConv()) {
2225 case CallingConv::X86_StdCall:
2226 Out << "__attribute__((stdcall)) ";
2228 case CallingConv::X86_FastCall:
2229 Out << "__attribute__((fastcall)) ";
2233 // Loop over the arguments, printing them...
2234 const FunctionType *FT = cast<FunctionType>(F->getFunctionType());
2235 const AttrListPtr &PAL = F->getAttributes();
2237 std::stringstream FunctionInnards;
2239 // Print out the name...
2240 FunctionInnards << GetValueName(F) << '(';
2242 bool PrintedArg = false;
2243 if (!F->isDeclaration()) {
2244 if (!F->arg_empty()) {
2245 Function::const_arg_iterator I = F->arg_begin(), E = F->arg_end();
2248 // If this is a struct-return function, don't print the hidden
2249 // struct-return argument.
2250 if (isStructReturn) {
2251 assert(I != E && "Invalid struct return function!");
2256 std::string ArgName;
2257 for (; I != E; ++I) {
2258 if (PrintedArg) FunctionInnards << ", ";
2259 if (I->hasName() || !Prototype)
2260 ArgName = GetValueName(I);
2263 const Type *ArgTy = I->getType();
2264 if (PAL.paramHasAttr(Idx, Attribute::ByVal)) {
2265 ArgTy = cast<PointerType>(ArgTy)->getElementType();
2266 ByValParams.insert(I);
2268 printType(FunctionInnards, ArgTy,
2269 /*isSigned=*/PAL.paramHasAttr(Idx, Attribute::SExt),
2276 // Loop over the arguments, printing them.
2277 FunctionType::param_iterator I = FT->param_begin(), E = FT->param_end();
2280 // If this is a struct-return function, don't print the hidden
2281 // struct-return argument.
2282 if (isStructReturn) {
2283 assert(I != E && "Invalid struct return function!");
2288 for (; I != E; ++I) {
2289 if (PrintedArg) FunctionInnards << ", ";
2290 const Type *ArgTy = *I;
2291 if (PAL.paramHasAttr(Idx, Attribute::ByVal)) {
2292 assert(isa<PointerType>(ArgTy));
2293 ArgTy = cast<PointerType>(ArgTy)->getElementType();
2295 printType(FunctionInnards, ArgTy,
2296 /*isSigned=*/PAL.paramHasAttr(Idx, Attribute::SExt));
2302 // Finish printing arguments... if this is a vararg function, print the ...,
2303 // unless there are no known types, in which case, we just emit ().
2305 if (FT->isVarArg() && PrintedArg) {
2306 if (PrintedArg) FunctionInnards << ", ";
2307 FunctionInnards << "..."; // Output varargs portion of signature!
2308 } else if (!FT->isVarArg() && !PrintedArg) {
2309 FunctionInnards << "void"; // ret() -> ret(void) in C.
2311 FunctionInnards << ')';
2313 // Get the return tpe for the function.
2315 if (!isStructReturn)
2316 RetTy = F->getReturnType();
2318 // If this is a struct-return function, print the struct-return type.
2319 RetTy = cast<PointerType>(FT->getParamType(0))->getElementType();
2322 // Print out the return type and the signature built above.
2323 printType(Out, RetTy,
2324 /*isSigned=*/PAL.paramHasAttr(0, Attribute::SExt),
2325 FunctionInnards.str());
2328 static inline bool isFPIntBitCast(const Instruction &I) {
2329 if (!isa<BitCastInst>(I))
2331 const Type *SrcTy = I.getOperand(0)->getType();
2332 const Type *DstTy = I.getType();
2333 return (SrcTy->isFloatingPoint() && DstTy->isInteger()) ||
2334 (DstTy->isFloatingPoint() && SrcTy->isInteger());
2337 void CWriter::printFunction(Function &F) {
2338 /// isStructReturn - Should this function actually return a struct by-value?
2339 bool isStructReturn = F.hasStructRetAttr();
2341 printFunctionSignature(&F, false);
2344 // If this is a struct return function, handle the result with magic.
2345 if (isStructReturn) {
2346 const Type *StructTy =
2347 cast<PointerType>(F.arg_begin()->getType())->getElementType();
2349 printType(Out, StructTy, false, "StructReturn");
2350 Out << "; /* Struct return temporary */\n";
2353 printType(Out, F.arg_begin()->getType(), false,
2354 GetValueName(F.arg_begin()));
2355 Out << " = &StructReturn;\n";
2358 bool PrintedVar = false;
2360 // print local variable information for the function
2361 for (inst_iterator I = inst_begin(&F), E = inst_end(&F); I != E; ++I) {
2362 if (const AllocaInst *AI = isDirectAlloca(&*I)) {
2364 printType(Out, AI->getAllocatedType(), false, GetValueName(AI));
2365 Out << "; /* Address-exposed local */\n";
2367 } else if (I->getType() != Type::VoidTy && !isInlinableInst(*I)) {
2369 printType(Out, I->getType(), false, GetValueName(&*I));
2372 if (isa<PHINode>(*I)) { // Print out PHI node temporaries as well...
2374 printType(Out, I->getType(), false,
2375 GetValueName(&*I)+"__PHI_TEMPORARY");
2380 // We need a temporary for the BitCast to use so it can pluck a value out
2381 // of a union to do the BitCast. This is separate from the need for a
2382 // variable to hold the result of the BitCast.
2383 if (isFPIntBitCast(*I)) {
2384 Out << " llvmBitCastUnion " << GetValueName(&*I)
2385 << "__BITCAST_TEMPORARY;\n";
2393 if (F.hasExternalLinkage() && F.getName() == "main")
2394 Out << " CODE_FOR_MAIN();\n";
2396 // print the basic blocks
2397 for (Function::iterator BB = F.begin(), E = F.end(); BB != E; ++BB) {
2398 if (Loop *L = LI->getLoopFor(BB)) {
2399 if (L->getHeader() == BB && L->getParentLoop() == 0)
2402 printBasicBlock(BB);
2409 void CWriter::printLoop(Loop *L) {
2410 Out << " do { /* Syntactic loop '" << L->getHeader()->getName()
2411 << "' to make GCC happy */\n";
2412 for (unsigned i = 0, e = L->getBlocks().size(); i != e; ++i) {
2413 BasicBlock *BB = L->getBlocks()[i];
2414 Loop *BBLoop = LI->getLoopFor(BB);
2416 printBasicBlock(BB);
2417 else if (BB == BBLoop->getHeader() && BBLoop->getParentLoop() == L)
2420 Out << " } while (1); /* end of syntactic loop '"
2421 << L->getHeader()->getName() << "' */\n";
2424 void CWriter::printBasicBlock(BasicBlock *BB) {
2426 // Don't print the label for the basic block if there are no uses, or if
2427 // the only terminator use is the predecessor basic block's terminator.
2428 // We have to scan the use list because PHI nodes use basic blocks too but
2429 // do not require a label to be generated.
2431 bool NeedsLabel = false;
2432 for (pred_iterator PI = pred_begin(BB), E = pred_end(BB); PI != E; ++PI)
2433 if (isGotoCodeNecessary(*PI, BB)) {
2438 if (NeedsLabel) Out << GetValueName(BB) << ":\n";
2440 // Output all of the instructions in the basic block...
2441 for (BasicBlock::iterator II = BB->begin(), E = --BB->end(); II != E;
2443 if (!isInlinableInst(*II) && !isDirectAlloca(II)) {
2444 if (II->getType() != Type::VoidTy && !isInlineAsm(*II))
2448 writeInstComputationInline(*II);
2453 // Don't emit prefix or suffix for the terminator.
2454 visit(*BB->getTerminator());
2458 // Specific Instruction type classes... note that all of the casts are
2459 // necessary because we use the instruction classes as opaque types...
2461 void CWriter::visitReturnInst(ReturnInst &I) {
2462 // If this is a struct return function, return the temporary struct.
2463 bool isStructReturn = I.getParent()->getParent()->hasStructRetAttr();
2465 if (isStructReturn) {
2466 Out << " return StructReturn;\n";
2470 // Don't output a void return if this is the last basic block in the function
2471 if (I.getNumOperands() == 0 &&
2472 &*--I.getParent()->getParent()->end() == I.getParent() &&
2473 !I.getParent()->size() == 1) {
2477 if (I.getNumOperands() > 1) {
2480 printType(Out, I.getParent()->getParent()->getReturnType());
2481 Out << " llvm_cbe_mrv_temp = {\n";
2482 for (unsigned i = 0, e = I.getNumOperands(); i != e; ++i) {
2484 writeOperand(I.getOperand(i));
2490 Out << " return llvm_cbe_mrv_temp;\n";
2496 if (I.getNumOperands()) {
2498 writeOperand(I.getOperand(0));
2503 void CWriter::visitSwitchInst(SwitchInst &SI) {
2506 writeOperand(SI.getOperand(0));
2507 Out << ") {\n default:\n";
2508 printPHICopiesForSuccessor (SI.getParent(), SI.getDefaultDest(), 2);
2509 printBranchToBlock(SI.getParent(), SI.getDefaultDest(), 2);
2511 for (unsigned i = 2, e = SI.getNumOperands(); i != e; i += 2) {
2513 writeOperand(SI.getOperand(i));
2515 BasicBlock *Succ = cast<BasicBlock>(SI.getOperand(i+1));
2516 printPHICopiesForSuccessor (SI.getParent(), Succ, 2);
2517 printBranchToBlock(SI.getParent(), Succ, 2);
2518 if (Function::iterator(Succ) == next(Function::iterator(SI.getParent())))
2524 void CWriter::visitUnreachableInst(UnreachableInst &I) {
2525 Out << " /*UNREACHABLE*/;\n";
2528 bool CWriter::isGotoCodeNecessary(BasicBlock *From, BasicBlock *To) {
2529 /// FIXME: This should be reenabled, but loop reordering safe!!
2532 if (next(Function::iterator(From)) != Function::iterator(To))
2533 return true; // Not the direct successor, we need a goto.
2535 //isa<SwitchInst>(From->getTerminator())
2537 if (LI->getLoopFor(From) != LI->getLoopFor(To))
2542 void CWriter::printPHICopiesForSuccessor (BasicBlock *CurBlock,
2543 BasicBlock *Successor,
2545 for (BasicBlock::iterator I = Successor->begin(); isa<PHINode>(I); ++I) {
2546 PHINode *PN = cast<PHINode>(I);
2547 // Now we have to do the printing.
2548 Value *IV = PN->getIncomingValueForBlock(CurBlock);
2549 if (!isa<UndefValue>(IV)) {
2550 Out << std::string(Indent, ' ');
2551 Out << " " << GetValueName(I) << "__PHI_TEMPORARY = ";
2553 Out << "; /* for PHI node */\n";
2558 void CWriter::printBranchToBlock(BasicBlock *CurBB, BasicBlock *Succ,
2560 if (isGotoCodeNecessary(CurBB, Succ)) {
2561 Out << std::string(Indent, ' ') << " goto ";
2567 // Branch instruction printing - Avoid printing out a branch to a basic block
2568 // that immediately succeeds the current one.
2570 void CWriter::visitBranchInst(BranchInst &I) {
2572 if (I.isConditional()) {
2573 if (isGotoCodeNecessary(I.getParent(), I.getSuccessor(0))) {
2575 writeOperand(I.getCondition());
2578 printPHICopiesForSuccessor (I.getParent(), I.getSuccessor(0), 2);
2579 printBranchToBlock(I.getParent(), I.getSuccessor(0), 2);
2581 if (isGotoCodeNecessary(I.getParent(), I.getSuccessor(1))) {
2582 Out << " } else {\n";
2583 printPHICopiesForSuccessor (I.getParent(), I.getSuccessor(1), 2);
2584 printBranchToBlock(I.getParent(), I.getSuccessor(1), 2);
2587 // First goto not necessary, assume second one is...
2589 writeOperand(I.getCondition());
2592 printPHICopiesForSuccessor (I.getParent(), I.getSuccessor(1), 2);
2593 printBranchToBlock(I.getParent(), I.getSuccessor(1), 2);
2598 printPHICopiesForSuccessor (I.getParent(), I.getSuccessor(0), 0);
2599 printBranchToBlock(I.getParent(), I.getSuccessor(0), 0);
2604 // PHI nodes get copied into temporary values at the end of predecessor basic
2605 // blocks. We now need to copy these temporary values into the REAL value for
2607 void CWriter::visitPHINode(PHINode &I) {
2609 Out << "__PHI_TEMPORARY";
2613 void CWriter::visitBinaryOperator(Instruction &I) {
2614 // binary instructions, shift instructions, setCond instructions.
2615 assert(!isa<PointerType>(I.getType()));
2617 // We must cast the results of binary operations which might be promoted.
2618 bool needsCast = false;
2619 if ((I.getType() == Type::Int8Ty) || (I.getType() == Type::Int16Ty)
2620 || (I.getType() == Type::FloatTy)) {
2623 printType(Out, I.getType(), false);
2627 // If this is a negation operation, print it out as such. For FP, we don't
2628 // want to print "-0.0 - X".
2629 if (BinaryOperator::isNeg(&I)) {
2631 writeOperand(BinaryOperator::getNegArgument(cast<BinaryOperator>(&I)));
2633 } else if (BinaryOperator::isFNeg(&I)) {
2635 writeOperand(BinaryOperator::getFNegArgument(cast<BinaryOperator>(&I)));
2637 } else if (I.getOpcode() == Instruction::FRem) {
2638 // Output a call to fmod/fmodf instead of emitting a%b
2639 if (I.getType() == Type::FloatTy)
2641 else if (I.getType() == Type::DoubleTy)
2643 else // all 3 flavors of long double
2645 writeOperand(I.getOperand(0));
2647 writeOperand(I.getOperand(1));
2651 // Write out the cast of the instruction's value back to the proper type
2653 bool NeedsClosingParens = writeInstructionCast(I);
2655 // Certain instructions require the operand to be forced to a specific type
2656 // so we use writeOperandWithCast here instead of writeOperand. Similarly
2657 // below for operand 1
2658 writeOperandWithCast(I.getOperand(0), I.getOpcode());
2660 switch (I.getOpcode()) {
2661 case Instruction::Add:
2662 case Instruction::FAdd: Out << " + "; break;
2663 case Instruction::Sub:
2664 case Instruction::FSub: Out << " - "; break;
2665 case Instruction::Mul:
2666 case Instruction::FMul: Out << " * "; break;
2667 case Instruction::URem:
2668 case Instruction::SRem:
2669 case Instruction::FRem: Out << " % "; break;
2670 case Instruction::UDiv:
2671 case Instruction::SDiv:
2672 case Instruction::FDiv: Out << " / "; break;
2673 case Instruction::And: Out << " & "; break;
2674 case Instruction::Or: Out << " | "; break;
2675 case Instruction::Xor: Out << " ^ "; break;
2676 case Instruction::Shl : Out << " << "; break;
2677 case Instruction::LShr:
2678 case Instruction::AShr: Out << " >> "; break;
2681 cerr << "Invalid operator type!" << I;
2686 writeOperandWithCast(I.getOperand(1), I.getOpcode());
2687 if (NeedsClosingParens)
2696 void CWriter::visitICmpInst(ICmpInst &I) {
2697 // We must cast the results of icmp which might be promoted.
2698 bool needsCast = false;
2700 // Write out the cast of the instruction's value back to the proper type
2702 bool NeedsClosingParens = writeInstructionCast(I);
2704 // Certain icmp predicate require the operand to be forced to a specific type
2705 // so we use writeOperandWithCast here instead of writeOperand. Similarly
2706 // below for operand 1
2707 writeOperandWithCast(I.getOperand(0), I);
2709 switch (I.getPredicate()) {
2710 case ICmpInst::ICMP_EQ: Out << " == "; break;
2711 case ICmpInst::ICMP_NE: Out << " != "; break;
2712 case ICmpInst::ICMP_ULE:
2713 case ICmpInst::ICMP_SLE: Out << " <= "; break;
2714 case ICmpInst::ICMP_UGE:
2715 case ICmpInst::ICMP_SGE: Out << " >= "; break;
2716 case ICmpInst::ICMP_ULT:
2717 case ICmpInst::ICMP_SLT: Out << " < "; break;
2718 case ICmpInst::ICMP_UGT:
2719 case ICmpInst::ICMP_SGT: Out << " > "; break;
2722 cerr << "Invalid icmp predicate!" << I;
2727 writeOperandWithCast(I.getOperand(1), I);
2728 if (NeedsClosingParens)
2736 void CWriter::visitFCmpInst(FCmpInst &I) {
2737 if (I.getPredicate() == FCmpInst::FCMP_FALSE) {
2741 if (I.getPredicate() == FCmpInst::FCMP_TRUE) {
2747 switch (I.getPredicate()) {
2748 default: LLVM_UNREACHABLE("Illegal FCmp predicate");
2749 case FCmpInst::FCMP_ORD: op = "ord"; break;
2750 case FCmpInst::FCMP_UNO: op = "uno"; break;
2751 case FCmpInst::FCMP_UEQ: op = "ueq"; break;
2752 case FCmpInst::FCMP_UNE: op = "une"; break;
2753 case FCmpInst::FCMP_ULT: op = "ult"; break;
2754 case FCmpInst::FCMP_ULE: op = "ule"; break;
2755 case FCmpInst::FCMP_UGT: op = "ugt"; break;
2756 case FCmpInst::FCMP_UGE: op = "uge"; break;
2757 case FCmpInst::FCMP_OEQ: op = "oeq"; break;
2758 case FCmpInst::FCMP_ONE: op = "one"; break;
2759 case FCmpInst::FCMP_OLT: op = "olt"; break;
2760 case FCmpInst::FCMP_OLE: op = "ole"; break;
2761 case FCmpInst::FCMP_OGT: op = "ogt"; break;
2762 case FCmpInst::FCMP_OGE: op = "oge"; break;
2765 Out << "llvm_fcmp_" << op << "(";
2766 // Write the first operand
2767 writeOperand(I.getOperand(0));
2769 // Write the second operand
2770 writeOperand(I.getOperand(1));
2774 static const char * getFloatBitCastField(const Type *Ty) {
2775 switch (Ty->getTypeID()) {
2776 default: LLVM_UNREACHABLE("Invalid Type");
2777 case Type::FloatTyID: return "Float";
2778 case Type::DoubleTyID: return "Double";
2779 case Type::IntegerTyID: {
2780 unsigned NumBits = cast<IntegerType>(Ty)->getBitWidth();
2789 void CWriter::visitCastInst(CastInst &I) {
2790 const Type *DstTy = I.getType();
2791 const Type *SrcTy = I.getOperand(0)->getType();
2792 if (isFPIntBitCast(I)) {
2794 // These int<->float and long<->double casts need to be handled specially
2795 Out << GetValueName(&I) << "__BITCAST_TEMPORARY."
2796 << getFloatBitCastField(I.getOperand(0)->getType()) << " = ";
2797 writeOperand(I.getOperand(0));
2798 Out << ", " << GetValueName(&I) << "__BITCAST_TEMPORARY."
2799 << getFloatBitCastField(I.getType());
2805 printCast(I.getOpcode(), SrcTy, DstTy);
2807 // Make a sext from i1 work by subtracting the i1 from 0 (an int).
2808 if (SrcTy == Type::Int1Ty && I.getOpcode() == Instruction::SExt)
2811 writeOperand(I.getOperand(0));
2813 if (DstTy == Type::Int1Ty &&
2814 (I.getOpcode() == Instruction::Trunc ||
2815 I.getOpcode() == Instruction::FPToUI ||
2816 I.getOpcode() == Instruction::FPToSI ||
2817 I.getOpcode() == Instruction::PtrToInt)) {
2818 // Make sure we really get a trunc to bool by anding the operand with 1
2824 void CWriter::visitSelectInst(SelectInst &I) {
2826 writeOperand(I.getCondition());
2828 writeOperand(I.getTrueValue());
2830 writeOperand(I.getFalseValue());
2835 void CWriter::lowerIntrinsics(Function &F) {
2836 // This is used to keep track of intrinsics that get generated to a lowered
2837 // function. We must generate the prototypes before the function body which
2838 // will only be expanded on first use (by the loop below).
2839 std::vector<Function*> prototypesToGen;
2841 // Examine all the instructions in this function to find the intrinsics that
2842 // need to be lowered.
2843 for (Function::iterator BB = F.begin(), EE = F.end(); BB != EE; ++BB)
2844 for (BasicBlock::iterator I = BB->begin(), E = BB->end(); I != E; )
2845 if (CallInst *CI = dyn_cast<CallInst>(I++))
2846 if (Function *F = CI->getCalledFunction())
2847 switch (F->getIntrinsicID()) {
2848 case Intrinsic::not_intrinsic:
2849 case Intrinsic::memory_barrier:
2850 case Intrinsic::vastart:
2851 case Intrinsic::vacopy:
2852 case Intrinsic::vaend:
2853 case Intrinsic::returnaddress:
2854 case Intrinsic::frameaddress:
2855 case Intrinsic::setjmp:
2856 case Intrinsic::longjmp:
2857 case Intrinsic::prefetch:
2858 case Intrinsic::dbg_stoppoint:
2859 case Intrinsic::powi:
2860 case Intrinsic::x86_sse_cmp_ss:
2861 case Intrinsic::x86_sse_cmp_ps:
2862 case Intrinsic::x86_sse2_cmp_sd:
2863 case Intrinsic::x86_sse2_cmp_pd:
2864 case Intrinsic::ppc_altivec_lvsl:
2865 // We directly implement these intrinsics
2868 // If this is an intrinsic that directly corresponds to a GCC
2869 // builtin, we handle it.
2870 const char *BuiltinName = "";
2871 #define GET_GCC_BUILTIN_NAME
2872 #include "llvm/Intrinsics.gen"
2873 #undef GET_GCC_BUILTIN_NAME
2874 // If we handle it, don't lower it.
2875 if (BuiltinName[0]) break;
2877 // All other intrinsic calls we must lower.
2878 Instruction *Before = 0;
2879 if (CI != &BB->front())
2880 Before = prior(BasicBlock::iterator(CI));
2882 IL->LowerIntrinsicCall(CI);
2883 if (Before) { // Move iterator to instruction after call
2888 // If the intrinsic got lowered to another call, and that call has
2889 // a definition then we need to make sure its prototype is emitted
2890 // before any calls to it.
2891 if (CallInst *Call = dyn_cast<CallInst>(I))
2892 if (Function *NewF = Call->getCalledFunction())
2893 if (!NewF->isDeclaration())
2894 prototypesToGen.push_back(NewF);
2899 // We may have collected some prototypes to emit in the loop above.
2900 // Emit them now, before the function that uses them is emitted. But,
2901 // be careful not to emit them twice.
2902 std::vector<Function*>::iterator I = prototypesToGen.begin();
2903 std::vector<Function*>::iterator E = prototypesToGen.end();
2904 for ( ; I != E; ++I) {
2905 if (intrinsicPrototypesAlreadyGenerated.insert(*I).second) {
2907 printFunctionSignature(*I, true);
2913 void CWriter::visitCallInst(CallInst &I) {
2914 if (isa<InlineAsm>(I.getOperand(0)))
2915 return visitInlineAsm(I);
2917 bool WroteCallee = false;
2919 // Handle intrinsic function calls first...
2920 if (Function *F = I.getCalledFunction())
2921 if (Intrinsic::ID ID = (Intrinsic::ID)F->getIntrinsicID())
2922 if (visitBuiltinCall(I, ID, WroteCallee))
2925 Value *Callee = I.getCalledValue();
2927 const PointerType *PTy = cast<PointerType>(Callee->getType());
2928 const FunctionType *FTy = cast<FunctionType>(PTy->getElementType());
2930 // If this is a call to a struct-return function, assign to the first
2931 // parameter instead of passing it to the call.
2932 const AttrListPtr &PAL = I.getAttributes();
2933 bool hasByVal = I.hasByValArgument();
2934 bool isStructRet = I.hasStructRetAttr();
2936 writeOperandDeref(I.getOperand(1));
2940 if (I.isTailCall()) Out << " /*tail*/ ";
2943 // If this is an indirect call to a struct return function, we need to cast
2944 // the pointer. Ditto for indirect calls with byval arguments.
2945 bool NeedsCast = (hasByVal || isStructRet) && !isa<Function>(Callee);
2947 // GCC is a real PITA. It does not permit codegening casts of functions to
2948 // function pointers if they are in a call (it generates a trap instruction
2949 // instead!). We work around this by inserting a cast to void* in between
2950 // the function and the function pointer cast. Unfortunately, we can't just
2951 // form the constant expression here, because the folder will immediately
2954 // Note finally, that this is completely unsafe. ANSI C does not guarantee
2955 // that void* and function pointers have the same size. :( To deal with this
2956 // in the common case, we handle casts where the number of arguments passed
2959 if (ConstantExpr *CE = dyn_cast<ConstantExpr>(Callee))
2961 if (Function *RF = dyn_cast<Function>(CE->getOperand(0))) {
2967 // Ok, just cast the pointer type.
2970 printStructReturnPointerFunctionType(Out, PAL,
2971 cast<PointerType>(I.getCalledValue()->getType()));
2973 printType(Out, I.getCalledValue()->getType(), false, "", true, PAL);
2975 printType(Out, I.getCalledValue()->getType());
2978 writeOperand(Callee);
2979 if (NeedsCast) Out << ')';
2984 unsigned NumDeclaredParams = FTy->getNumParams();
2986 CallSite::arg_iterator AI = I.op_begin()+1, AE = I.op_end();
2988 if (isStructRet) { // Skip struct return argument.
2993 bool PrintedArg = false;
2994 for (; AI != AE; ++AI, ++ArgNo) {
2995 if (PrintedArg) Out << ", ";
2996 if (ArgNo < NumDeclaredParams &&
2997 (*AI)->getType() != FTy->getParamType(ArgNo)) {
2999 printType(Out, FTy->getParamType(ArgNo),
3000 /*isSigned=*/PAL.paramHasAttr(ArgNo+1, Attribute::SExt));
3003 // Check if the argument is expected to be passed by value.
3004 if (I.paramHasAttr(ArgNo+1, Attribute::ByVal))
3005 writeOperandDeref(*AI);
3013 /// visitBuiltinCall - Handle the call to the specified builtin. Returns true
3014 /// if the entire call is handled, return false it it wasn't handled, and
3015 /// optionally set 'WroteCallee' if the callee has already been printed out.
3016 bool CWriter::visitBuiltinCall(CallInst &I, Intrinsic::ID ID,
3017 bool &WroteCallee) {
3020 // If this is an intrinsic that directly corresponds to a GCC
3021 // builtin, we emit it here.
3022 const char *BuiltinName = "";
3023 Function *F = I.getCalledFunction();
3024 #define GET_GCC_BUILTIN_NAME
3025 #include "llvm/Intrinsics.gen"
3026 #undef GET_GCC_BUILTIN_NAME
3027 assert(BuiltinName[0] && "Unknown LLVM intrinsic!");
3033 case Intrinsic::memory_barrier:
3034 Out << "__sync_synchronize()";
3036 case Intrinsic::vastart:
3039 Out << "va_start(*(va_list*)";
3040 writeOperand(I.getOperand(1));
3042 // Output the last argument to the enclosing function.
3043 if (I.getParent()->getParent()->arg_empty()) {
3045 raw_string_ostream Msg(msg);
3046 Msg << "The C backend does not currently support zero "
3047 << "argument varargs functions, such as '"
3048 << I.getParent()->getParent()->getName() << "'!";
3049 llvm_report_error(Msg.str());
3051 writeOperand(--I.getParent()->getParent()->arg_end());
3054 case Intrinsic::vaend:
3055 if (!isa<ConstantPointerNull>(I.getOperand(1))) {
3056 Out << "0; va_end(*(va_list*)";
3057 writeOperand(I.getOperand(1));
3060 Out << "va_end(*(va_list*)0)";
3063 case Intrinsic::vacopy:
3065 Out << "va_copy(*(va_list*)";
3066 writeOperand(I.getOperand(1));
3067 Out << ", *(va_list*)";
3068 writeOperand(I.getOperand(2));
3071 case Intrinsic::returnaddress:
3072 Out << "__builtin_return_address(";
3073 writeOperand(I.getOperand(1));
3076 case Intrinsic::frameaddress:
3077 Out << "__builtin_frame_address(";
3078 writeOperand(I.getOperand(1));
3081 case Intrinsic::powi:
3082 Out << "__builtin_powi(";
3083 writeOperand(I.getOperand(1));
3085 writeOperand(I.getOperand(2));
3088 case Intrinsic::setjmp:
3089 Out << "setjmp(*(jmp_buf*)";
3090 writeOperand(I.getOperand(1));
3093 case Intrinsic::longjmp:
3094 Out << "longjmp(*(jmp_buf*)";
3095 writeOperand(I.getOperand(1));
3097 writeOperand(I.getOperand(2));
3100 case Intrinsic::prefetch:
3101 Out << "LLVM_PREFETCH((const void *)";
3102 writeOperand(I.getOperand(1));
3104 writeOperand(I.getOperand(2));
3106 writeOperand(I.getOperand(3));
3109 case Intrinsic::stacksave:
3110 // Emit this as: Val = 0; *((void**)&Val) = __builtin_stack_save()
3111 // to work around GCC bugs (see PR1809).
3112 Out << "0; *((void**)&" << GetValueName(&I)
3113 << ") = __builtin_stack_save()";
3115 case Intrinsic::dbg_stoppoint: {
3116 // If we use writeOperand directly we get a "u" suffix which is rejected
3118 std::stringstream SPIStr;
3119 DbgStopPointInst &SPI = cast<DbgStopPointInst>(I);
3120 SPI.getDirectory()->print(SPIStr);
3124 Out << SPIStr.str();
3126 SPI.getFileName()->print(SPIStr);
3127 Out << SPIStr.str() << "\"\n";
3130 case Intrinsic::x86_sse_cmp_ss:
3131 case Intrinsic::x86_sse_cmp_ps:
3132 case Intrinsic::x86_sse2_cmp_sd:
3133 case Intrinsic::x86_sse2_cmp_pd:
3135 printType(Out, I.getType());
3137 // Multiple GCC builtins multiplex onto this intrinsic.
3138 switch (cast<ConstantInt>(I.getOperand(3))->getZExtValue()) {
3139 default: LLVM_UNREACHABLE("Invalid llvm.x86.sse.cmp!");
3140 case 0: Out << "__builtin_ia32_cmpeq"; break;
3141 case 1: Out << "__builtin_ia32_cmplt"; break;
3142 case 2: Out << "__builtin_ia32_cmple"; break;
3143 case 3: Out << "__builtin_ia32_cmpunord"; break;
3144 case 4: Out << "__builtin_ia32_cmpneq"; break;
3145 case 5: Out << "__builtin_ia32_cmpnlt"; break;
3146 case 6: Out << "__builtin_ia32_cmpnle"; break;
3147 case 7: Out << "__builtin_ia32_cmpord"; break;
3149 if (ID == Intrinsic::x86_sse_cmp_ps || ID == Intrinsic::x86_sse2_cmp_pd)
3153 if (ID == Intrinsic::x86_sse_cmp_ss || ID == Intrinsic::x86_sse_cmp_ps)
3159 writeOperand(I.getOperand(1));
3161 writeOperand(I.getOperand(2));
3164 case Intrinsic::ppc_altivec_lvsl:
3166 printType(Out, I.getType());
3168 Out << "__builtin_altivec_lvsl(0, (void*)";
3169 writeOperand(I.getOperand(1));
3175 //This converts the llvm constraint string to something gcc is expecting.
3176 //TODO: work out platform independent constraints and factor those out
3177 // of the per target tables
3178 // handle multiple constraint codes
3179 std::string CWriter::InterpretASMConstraint(InlineAsm::ConstraintInfo& c) {
3181 assert(c.Codes.size() == 1 && "Too many asm constraint codes to handle");
3183 const char *const *table = 0;
3185 //Grab the translation table from TargetAsmInfo if it exists
3188 const TargetMachineRegistry::entry* Match =
3189 TargetMachineRegistry::getClosestStaticTargetForModule(*TheModule, E);
3191 //Per platform Target Machines don't exist, so create it
3192 // this must be done only once
3193 const TargetMachine* TM = Match->CtorFn(*TheModule, "");
3194 TAsm = TM->getTargetAsmInfo();
3198 table = TAsm->getAsmCBE();
3200 //Search the translation table if it exists
3201 for (int i = 0; table && table[i]; i += 2)
3202 if (c.Codes[0] == table[i])
3205 //default is identity
3209 //TODO: import logic from AsmPrinter.cpp
3210 static std::string gccifyAsm(std::string asmstr) {
3211 for (std::string::size_type i = 0; i != asmstr.size(); ++i)
3212 if (asmstr[i] == '\n')
3213 asmstr.replace(i, 1, "\\n");
3214 else if (asmstr[i] == '\t')
3215 asmstr.replace(i, 1, "\\t");
3216 else if (asmstr[i] == '$') {
3217 if (asmstr[i + 1] == '{') {
3218 std::string::size_type a = asmstr.find_first_of(':', i + 1);
3219 std::string::size_type b = asmstr.find_first_of('}', i + 1);
3220 std::string n = "%" +
3221 asmstr.substr(a + 1, b - a - 1) +
3222 asmstr.substr(i + 2, a - i - 2);
3223 asmstr.replace(i, b - i + 1, n);
3226 asmstr.replace(i, 1, "%");
3228 else if (asmstr[i] == '%')//grr
3229 { asmstr.replace(i, 1, "%%"); ++i;}
3234 //TODO: assumptions about what consume arguments from the call are likely wrong
3235 // handle communitivity
3236 void CWriter::visitInlineAsm(CallInst &CI) {
3237 InlineAsm* as = cast<InlineAsm>(CI.getOperand(0));
3238 std::vector<InlineAsm::ConstraintInfo> Constraints = as->ParseConstraints();
3240 std::vector<std::pair<Value*, int> > ResultVals;
3241 if (CI.getType() == Type::VoidTy)
3243 else if (const StructType *ST = dyn_cast<StructType>(CI.getType())) {
3244 for (unsigned i = 0, e = ST->getNumElements(); i != e; ++i)
3245 ResultVals.push_back(std::make_pair(&CI, (int)i));
3247 ResultVals.push_back(std::make_pair(&CI, -1));
3250 // Fix up the asm string for gcc and emit it.
3251 Out << "__asm__ volatile (\"" << gccifyAsm(as->getAsmString()) << "\"\n";
3254 unsigned ValueCount = 0;
3255 bool IsFirst = true;
3257 // Convert over all the output constraints.
3258 for (std::vector<InlineAsm::ConstraintInfo>::iterator I = Constraints.begin(),
3259 E = Constraints.end(); I != E; ++I) {
3261 if (I->Type != InlineAsm::isOutput) {
3263 continue; // Ignore non-output constraints.
3266 assert(I->Codes.size() == 1 && "Too many asm constraint codes to handle");
3267 std::string C = InterpretASMConstraint(*I);
3268 if (C.empty()) continue;
3279 if (ValueCount < ResultVals.size()) {
3280 DestVal = ResultVals[ValueCount].first;
3281 DestValNo = ResultVals[ValueCount].second;
3283 DestVal = CI.getOperand(ValueCount-ResultVals.size()+1);
3285 if (I->isEarlyClobber)
3288 Out << "\"=" << C << "\"(" << GetValueName(DestVal);
3289 if (DestValNo != -1)
3290 Out << ".field" << DestValNo; // Multiple retvals.
3296 // Convert over all the input constraints.
3300 for (std::vector<InlineAsm::ConstraintInfo>::iterator I = Constraints.begin(),
3301 E = Constraints.end(); I != E; ++I) {
3302 if (I->Type != InlineAsm::isInput) {
3304 continue; // Ignore non-input constraints.
3307 assert(I->Codes.size() == 1 && "Too many asm constraint codes to handle");
3308 std::string C = InterpretASMConstraint(*I);
3309 if (C.empty()) continue;
3316 assert(ValueCount >= ResultVals.size() && "Input can't refer to result");
3317 Value *SrcVal = CI.getOperand(ValueCount-ResultVals.size()+1);
3319 Out << "\"" << C << "\"(";
3321 writeOperand(SrcVal);
3323 writeOperandDeref(SrcVal);
3327 // Convert over the clobber constraints.
3330 for (std::vector<InlineAsm::ConstraintInfo>::iterator I = Constraints.begin(),
3331 E = Constraints.end(); I != E; ++I) {
3332 if (I->Type != InlineAsm::isClobber)
3333 continue; // Ignore non-input constraints.
3335 assert(I->Codes.size() == 1 && "Too many asm constraint codes to handle");
3336 std::string C = InterpretASMConstraint(*I);
3337 if (C.empty()) continue;
3344 Out << '\"' << C << '"';
3350 void CWriter::visitMallocInst(MallocInst &I) {
3351 LLVM_UNREACHABLE("lowerallocations pass didn't work!");
3354 void CWriter::visitAllocaInst(AllocaInst &I) {
3356 printType(Out, I.getType());
3357 Out << ") alloca(sizeof(";
3358 printType(Out, I.getType()->getElementType());
3360 if (I.isArrayAllocation()) {
3362 writeOperand(I.getOperand(0));
3367 void CWriter::visitFreeInst(FreeInst &I) {
3368 LLVM_UNREACHABLE("lowerallocations pass didn't work!");
3371 void CWriter::printGEPExpression(Value *Ptr, gep_type_iterator I,
3372 gep_type_iterator E, bool Static) {
3374 // If there are no indices, just print out the pointer.
3380 // Find out if the last index is into a vector. If so, we have to print this
3381 // specially. Since vectors can't have elements of indexable type, only the
3382 // last index could possibly be of a vector element.
3383 const VectorType *LastIndexIsVector = 0;
3385 for (gep_type_iterator TmpI = I; TmpI != E; ++TmpI)
3386 LastIndexIsVector = dyn_cast<VectorType>(*TmpI);
3391 // If the last index is into a vector, we can't print it as &a[i][j] because
3392 // we can't index into a vector with j in GCC. Instead, emit this as
3393 // (((float*)&a[i])+j)
3394 if (LastIndexIsVector) {
3396 printType(Out, PointerType::getUnqual(LastIndexIsVector->getElementType()));
3402 // If the first index is 0 (very typical) we can do a number of
3403 // simplifications to clean up the code.
3404 Value *FirstOp = I.getOperand();
3405 if (!isa<Constant>(FirstOp) || !cast<Constant>(FirstOp)->isNullValue()) {
3406 // First index isn't simple, print it the hard way.
3409 ++I; // Skip the zero index.
3411 // Okay, emit the first operand. If Ptr is something that is already address
3412 // exposed, like a global, avoid emitting (&foo)[0], just emit foo instead.
3413 if (isAddressExposed(Ptr)) {
3414 writeOperandInternal(Ptr, Static);
3415 } else if (I != E && isa<StructType>(*I)) {
3416 // If we didn't already emit the first operand, see if we can print it as
3417 // P->f instead of "P[0].f"
3419 Out << "->field" << cast<ConstantInt>(I.getOperand())->getZExtValue();
3420 ++I; // eat the struct index as well.
3422 // Instead of emitting P[0][1], emit (*P)[1], which is more idiomatic.
3429 for (; I != E; ++I) {
3430 if (isa<StructType>(*I)) {
3431 Out << ".field" << cast<ConstantInt>(I.getOperand())->getZExtValue();
3432 } else if (isa<ArrayType>(*I)) {
3434 writeOperandWithCast(I.getOperand(), Instruction::GetElementPtr);
3436 } else if (!isa<VectorType>(*I)) {
3438 writeOperandWithCast(I.getOperand(), Instruction::GetElementPtr);
3441 // If the last index is into a vector, then print it out as "+j)". This
3442 // works with the 'LastIndexIsVector' code above.
3443 if (isa<Constant>(I.getOperand()) &&
3444 cast<Constant>(I.getOperand())->isNullValue()) {
3445 Out << "))"; // avoid "+0".
3448 writeOperandWithCast(I.getOperand(), Instruction::GetElementPtr);
3456 void CWriter::writeMemoryAccess(Value *Operand, const Type *OperandType,
3457 bool IsVolatile, unsigned Alignment) {
3459 bool IsUnaligned = Alignment &&
3460 Alignment < TD->getABITypeAlignment(OperandType);
3464 if (IsVolatile || IsUnaligned) {
3467 Out << "struct __attribute__ ((packed, aligned(" << Alignment << "))) {";
3468 printType(Out, OperandType, false, IsUnaligned ? "data" : "volatile*");
3471 if (IsVolatile) Out << "volatile ";
3477 writeOperand(Operand);
3479 if (IsVolatile || IsUnaligned) {
3486 void CWriter::visitLoadInst(LoadInst &I) {
3487 writeMemoryAccess(I.getOperand(0), I.getType(), I.isVolatile(),
3492 void CWriter::visitStoreInst(StoreInst &I) {
3493 writeMemoryAccess(I.getPointerOperand(), I.getOperand(0)->getType(),
3494 I.isVolatile(), I.getAlignment());
3496 Value *Operand = I.getOperand(0);
3497 Constant *BitMask = 0;
3498 if (const IntegerType* ITy = dyn_cast<IntegerType>(Operand->getType()))
3499 if (!ITy->isPowerOf2ByteWidth())
3500 // We have a bit width that doesn't match an even power-of-2 byte
3501 // size. Consequently we must & the value with the type's bit mask
3502 BitMask = ConstantInt::get(ITy, ITy->getBitMask());
3505 writeOperand(Operand);
3508 printConstant(BitMask, false);
3513 void CWriter::visitGetElementPtrInst(GetElementPtrInst &I) {
3514 printGEPExpression(I.getPointerOperand(), gep_type_begin(I),
3515 gep_type_end(I), false);
3518 void CWriter::visitVAArgInst(VAArgInst &I) {
3519 Out << "va_arg(*(va_list*)";
3520 writeOperand(I.getOperand(0));
3522 printType(Out, I.getType());
3526 void CWriter::visitInsertElementInst(InsertElementInst &I) {
3527 const Type *EltTy = I.getType()->getElementType();
3528 writeOperand(I.getOperand(0));
3531 printType(Out, PointerType::getUnqual(EltTy));
3532 Out << ")(&" << GetValueName(&I) << "))[";
3533 writeOperand(I.getOperand(2));
3535 writeOperand(I.getOperand(1));
3539 void CWriter::visitExtractElementInst(ExtractElementInst &I) {
3540 // We know that our operand is not inlined.
3543 cast<VectorType>(I.getOperand(0)->getType())->getElementType();
3544 printType(Out, PointerType::getUnqual(EltTy));
3545 Out << ")(&" << GetValueName(I.getOperand(0)) << "))[";
3546 writeOperand(I.getOperand(1));
3550 void CWriter::visitShuffleVectorInst(ShuffleVectorInst &SVI) {
3552 printType(Out, SVI.getType());
3554 const VectorType *VT = SVI.getType();
3555 unsigned NumElts = VT->getNumElements();
3556 const Type *EltTy = VT->getElementType();
3558 for (unsigned i = 0; i != NumElts; ++i) {
3560 int SrcVal = SVI.getMaskValue(i);
3561 if ((unsigned)SrcVal >= NumElts*2) {
3562 Out << " 0/*undef*/ ";
3564 Value *Op = SVI.getOperand((unsigned)SrcVal >= NumElts);
3565 if (isa<Instruction>(Op)) {
3566 // Do an extractelement of this value from the appropriate input.
3568 printType(Out, PointerType::getUnqual(EltTy));
3569 Out << ")(&" << GetValueName(Op)
3570 << "))[" << (SrcVal & (NumElts-1)) << "]";
3571 } else if (isa<ConstantAggregateZero>(Op) || isa<UndefValue>(Op)) {
3574 printConstant(cast<ConstantVector>(Op)->getOperand(SrcVal &
3583 void CWriter::visitInsertValueInst(InsertValueInst &IVI) {
3584 // Start by copying the entire aggregate value into the result variable.
3585 writeOperand(IVI.getOperand(0));
3588 // Then do the insert to update the field.
3589 Out << GetValueName(&IVI);
3590 for (const unsigned *b = IVI.idx_begin(), *i = b, *e = IVI.idx_end();
3592 const Type *IndexedTy =
3593 ExtractValueInst::getIndexedType(IVI.getOperand(0)->getType(), b, i+1);
3594 if (isa<ArrayType>(IndexedTy))
3595 Out << ".array[" << *i << "]";
3597 Out << ".field" << *i;
3600 writeOperand(IVI.getOperand(1));
3603 void CWriter::visitExtractValueInst(ExtractValueInst &EVI) {
3605 if (isa<UndefValue>(EVI.getOperand(0))) {
3607 printType(Out, EVI.getType());
3608 Out << ") 0/*UNDEF*/";
3610 Out << GetValueName(EVI.getOperand(0));
3611 for (const unsigned *b = EVI.idx_begin(), *i = b, *e = EVI.idx_end();
3613 const Type *IndexedTy =
3614 ExtractValueInst::getIndexedType(EVI.getOperand(0)->getType(), b, i+1);
3615 if (isa<ArrayType>(IndexedTy))
3616 Out << ".array[" << *i << "]";
3618 Out << ".field" << *i;
3624 //===----------------------------------------------------------------------===//
3625 // External Interface declaration
3626 //===----------------------------------------------------------------------===//
3628 bool CTargetMachine::addPassesToEmitWholeFile(PassManager &PM,
3630 CodeGenFileType FileType,
3631 CodeGenOpt::Level OptLevel) {
3632 if (FileType != TargetMachine::AssemblyFile) return true;
3634 PM.add(createGCLoweringPass());
3635 PM.add(createLowerAllocationsPass(true));
3636 PM.add(createLowerInvokePass());
3637 PM.add(createCFGSimplificationPass()); // clean up after lower invoke.
3638 PM.add(new CBackendNameAllUsedStructsAndMergeFunctions());
3639 PM.add(new CWriter(o));
3640 PM.add(createGCInfoDeleter());