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/ADT/StringExtras.h"
28 #include "llvm/ADT/SmallString.h"
29 #include "llvm/ADT/STLExtras.h"
30 #include "llvm/Analysis/ConstantsScanner.h"
31 #include "llvm/Analysis/FindUsedTypes.h"
32 #include "llvm/Analysis/LoopInfo.h"
33 #include "llvm/Analysis/ValueTracking.h"
34 #include "llvm/CodeGen/Passes.h"
35 #include "llvm/CodeGen/IntrinsicLowering.h"
36 #include "llvm/Target/Mangler.h"
37 #include "llvm/Transforms/Scalar.h"
38 #include "llvm/MC/MCAsmInfo.h"
39 #include "llvm/MC/MCContext.h"
40 #include "llvm/MC/MCSymbol.h"
41 #include "llvm/Target/TargetData.h"
42 #include "llvm/Target/TargetRegistry.h"
43 #include "llvm/Support/CallSite.h"
44 #include "llvm/Support/CFG.h"
45 #include "llvm/Support/ErrorHandling.h"
46 #include "llvm/Support/FormattedStream.h"
47 #include "llvm/Support/GetElementPtrTypeIterator.h"
48 #include "llvm/Support/InstVisitor.h"
49 #include "llvm/Support/MathExtras.h"
50 #include "llvm/Support/Host.h"
51 #include "llvm/Config/config.h"
53 // Some ms header decided to define setjmp as _setjmp, undo this for this file.
59 extern "C" void LLVMInitializeCBackendTarget() {
60 // Register the target.
61 RegisterTargetMachine<CTargetMachine> X(TheCBackendTarget);
65 class CBEMCAsmInfo : public MCAsmInfo {
69 PrivateGlobalPrefix = "";
72 /// CBackendNameAllUsedStructsAndMergeFunctions - This pass inserts names for
73 /// any unnamed structure types that are used by the program, and merges
74 /// external functions with the same name.
76 class CBackendNameAllUsedStructsAndMergeFunctions : public ModulePass {
79 CBackendNameAllUsedStructsAndMergeFunctions()
81 initializeFindUsedTypesPass(*PassRegistry::getPassRegistry());
83 void getAnalysisUsage(AnalysisUsage &AU) const {
84 AU.addRequired<FindUsedTypes>();
87 virtual const char *getPassName() const {
88 return "C backend type canonicalizer";
91 virtual bool runOnModule(Module &M);
94 char CBackendNameAllUsedStructsAndMergeFunctions::ID = 0;
96 /// CWriter - This class is the main chunk of code that converts an LLVM
97 /// module to a C translation unit.
98 class CWriter : public FunctionPass, public InstVisitor<CWriter> {
99 formatted_raw_ostream &Out;
100 IntrinsicLowering *IL;
103 const Module *TheModule;
104 const MCAsmInfo* TAsm;
106 const TargetData* TD;
107 std::map<const Type *, std::string> TypeNames;
108 std::map<const ConstantFP *, unsigned> FPConstantMap;
109 std::set<Function*> intrinsicPrototypesAlreadyGenerated;
110 std::set<const Argument*> ByValParams;
112 unsigned OpaqueCounter;
113 DenseMap<const Value*, unsigned> AnonValueNumbers;
114 unsigned NextAnonValueNumber;
118 explicit CWriter(formatted_raw_ostream &o)
119 : FunctionPass(ID), Out(o), IL(0), Mang(0), LI(0),
120 TheModule(0), TAsm(0), TCtx(0), TD(0), OpaqueCounter(0),
121 NextAnonValueNumber(0) {
122 initializeLoopInfoPass(*PassRegistry::getPassRegistry());
126 virtual const char *getPassName() const { return "C backend"; }
128 void getAnalysisUsage(AnalysisUsage &AU) const {
129 AU.addRequired<LoopInfo>();
130 AU.setPreservesAll();
133 virtual bool doInitialization(Module &M);
135 bool runOnFunction(Function &F) {
136 // Do not codegen any 'available_externally' functions at all, they have
137 // definitions outside the translation unit.
138 if (F.hasAvailableExternallyLinkage())
141 LI = &getAnalysis<LoopInfo>();
143 // Get rid of intrinsics we can't handle.
146 // Output all floating point constants that cannot be printed accurately.
147 printFloatingPointConstants(F);
153 virtual bool doFinalization(Module &M) {
160 FPConstantMap.clear();
163 intrinsicPrototypesAlreadyGenerated.clear();
167 raw_ostream &printType(raw_ostream &Out, const Type *Ty,
168 bool isSigned = false,
169 const std::string &VariableName = "",
170 bool IgnoreName = false,
171 const AttrListPtr &PAL = AttrListPtr());
172 raw_ostream &printSimpleType(raw_ostream &Out, const Type *Ty,
174 const std::string &NameSoFar = "");
176 void printStructReturnPointerFunctionType(raw_ostream &Out,
177 const AttrListPtr &PAL,
178 const PointerType *Ty);
180 /// writeOperandDeref - Print the result of dereferencing the specified
181 /// operand with '*'. This is equivalent to printing '*' then using
182 /// writeOperand, but avoids excess syntax in some cases.
183 void writeOperandDeref(Value *Operand) {
184 if (isAddressExposed(Operand)) {
185 // Already something with an address exposed.
186 writeOperandInternal(Operand);
189 writeOperand(Operand);
194 void writeOperand(Value *Operand, bool Static = false);
195 void writeInstComputationInline(Instruction &I);
196 void writeOperandInternal(Value *Operand, bool Static = false);
197 void writeOperandWithCast(Value* Operand, unsigned Opcode);
198 void writeOperandWithCast(Value* Operand, const ICmpInst &I);
199 bool writeInstructionCast(const Instruction &I);
201 void writeMemoryAccess(Value *Operand, const Type *OperandType,
202 bool IsVolatile, unsigned Alignment);
205 std::string InterpretASMConstraint(InlineAsm::ConstraintInfo& c);
207 void lowerIntrinsics(Function &F);
209 void printModuleTypes(const TypeSymbolTable &ST);
210 void printContainedStructs(const Type *Ty, std::set<const Type *> &);
211 void printFloatingPointConstants(Function &F);
212 void printFloatingPointConstants(const Constant *C);
213 void printFunctionSignature(const Function *F, bool Prototype);
215 void printFunction(Function &);
216 void printBasicBlock(BasicBlock *BB);
217 void printLoop(Loop *L);
219 void printCast(unsigned opcode, const Type *SrcTy, const Type *DstTy);
220 void printConstant(Constant *CPV, bool Static);
221 void printConstantWithCast(Constant *CPV, unsigned Opcode);
222 bool printConstExprCast(const ConstantExpr *CE, bool Static);
223 void printConstantArray(ConstantArray *CPA, bool Static);
224 void printConstantVector(ConstantVector *CV, bool Static);
226 /// isAddressExposed - Return true if the specified value's name needs to
227 /// have its address taken in order to get a C value of the correct type.
228 /// This happens for global variables, byval parameters, and direct allocas.
229 bool isAddressExposed(const Value *V) const {
230 if (const Argument *A = dyn_cast<Argument>(V))
231 return ByValParams.count(A);
232 return isa<GlobalVariable>(V) || isDirectAlloca(V);
235 // isInlinableInst - Attempt to inline instructions into their uses to build
236 // trees as much as possible. To do this, we have to consistently decide
237 // what is acceptable to inline, so that variable declarations don't get
238 // printed and an extra copy of the expr is not emitted.
240 static bool isInlinableInst(const Instruction &I) {
241 // Always inline cmp instructions, even if they are shared by multiple
242 // expressions. GCC generates horrible code if we don't.
246 // Must be an expression, must be used exactly once. If it is dead, we
247 // emit it inline where it would go.
248 if (I.getType() == Type::getVoidTy(I.getContext()) || !I.hasOneUse() ||
249 isa<TerminatorInst>(I) || isa<CallInst>(I) || isa<PHINode>(I) ||
250 isa<LoadInst>(I) || isa<VAArgInst>(I) || isa<InsertElementInst>(I) ||
251 isa<InsertValueInst>(I))
252 // Don't inline a load across a store or other bad things!
255 // Must not be used in inline asm, extractelement, or shufflevector.
257 const Instruction &User = cast<Instruction>(*I.use_back());
258 if (isInlineAsm(User) || isa<ExtractElementInst>(User) ||
259 isa<ShuffleVectorInst>(User))
263 // Only inline instruction it if it's use is in the same BB as the inst.
264 return I.getParent() == cast<Instruction>(I.use_back())->getParent();
267 // isDirectAlloca - Define fixed sized allocas in the entry block as direct
268 // variables which are accessed with the & operator. This causes GCC to
269 // generate significantly better code than to emit alloca calls directly.
271 static const AllocaInst *isDirectAlloca(const Value *V) {
272 const AllocaInst *AI = dyn_cast<AllocaInst>(V);
274 if (AI->isArrayAllocation())
275 return 0; // FIXME: we can also inline fixed size array allocas!
276 if (AI->getParent() != &AI->getParent()->getParent()->getEntryBlock())
281 // isInlineAsm - Check if the instruction is a call to an inline asm chunk
282 static bool isInlineAsm(const Instruction& I) {
283 if (const CallInst *CI = dyn_cast<CallInst>(&I))
284 return isa<InlineAsm>(CI->getCalledValue());
288 // Instruction visitation functions
289 friend class InstVisitor<CWriter>;
291 void visitReturnInst(ReturnInst &I);
292 void visitBranchInst(BranchInst &I);
293 void visitSwitchInst(SwitchInst &I);
294 void visitIndirectBrInst(IndirectBrInst &I);
295 void visitInvokeInst(InvokeInst &I) {
296 llvm_unreachable("Lowerinvoke pass didn't work!");
299 void visitUnwindInst(UnwindInst &I) {
300 llvm_unreachable("Lowerinvoke pass didn't work!");
302 void visitUnreachableInst(UnreachableInst &I);
304 void visitPHINode(PHINode &I);
305 void visitBinaryOperator(Instruction &I);
306 void visitICmpInst(ICmpInst &I);
307 void visitFCmpInst(FCmpInst &I);
309 void visitCastInst (CastInst &I);
310 void visitSelectInst(SelectInst &I);
311 void visitCallInst (CallInst &I);
312 void visitInlineAsm(CallInst &I);
313 bool visitBuiltinCall(CallInst &I, Intrinsic::ID ID, bool &WroteCallee);
315 void visitAllocaInst(AllocaInst &I);
316 void visitLoadInst (LoadInst &I);
317 void visitStoreInst (StoreInst &I);
318 void visitGetElementPtrInst(GetElementPtrInst &I);
319 void visitVAArgInst (VAArgInst &I);
321 void visitInsertElementInst(InsertElementInst &I);
322 void visitExtractElementInst(ExtractElementInst &I);
323 void visitShuffleVectorInst(ShuffleVectorInst &SVI);
325 void visitInsertValueInst(InsertValueInst &I);
326 void visitExtractValueInst(ExtractValueInst &I);
328 void visitInstruction(Instruction &I) {
330 errs() << "C Writer does not know about " << I;
335 void outputLValue(Instruction *I) {
336 Out << " " << GetValueName(I) << " = ";
339 bool isGotoCodeNecessary(BasicBlock *From, BasicBlock *To);
340 void printPHICopiesForSuccessor(BasicBlock *CurBlock,
341 BasicBlock *Successor, unsigned Indent);
342 void printBranchToBlock(BasicBlock *CurBlock, BasicBlock *SuccBlock,
344 void printGEPExpression(Value *Ptr, gep_type_iterator I,
345 gep_type_iterator E, bool Static);
347 std::string GetValueName(const Value *Operand);
351 char CWriter::ID = 0;
354 static std::string CBEMangle(const std::string &S) {
357 for (unsigned i = 0, e = S.size(); i != e; ++i)
358 if (isalnum(S[i]) || S[i] == '_') {
362 Result += 'A'+(S[i]&15);
363 Result += 'A'+((S[i]>>4)&15);
370 /// This method inserts names for any unnamed structure types that are used by
371 /// the program, and removes names from structure types that are not used by the
374 bool CBackendNameAllUsedStructsAndMergeFunctions::runOnModule(Module &M) {
375 // Get a set of types that are used by the program...
376 std::set<const Type *> UT = getAnalysis<FindUsedTypes>().getTypes();
378 // Loop over the module symbol table, removing types from UT that are
379 // already named, and removing names for types that are not used.
381 TypeSymbolTable &TST = M.getTypeSymbolTable();
382 for (TypeSymbolTable::iterator TI = TST.begin(), TE = TST.end();
384 TypeSymbolTable::iterator I = TI++;
386 // If this isn't a struct or array type, remove it from our set of types
387 // to name. This simplifies emission later.
388 if (!I->second->isStructTy() && !I->second->isOpaqueTy() &&
389 !I->second->isArrayTy()) {
392 // If this is not used, remove it from the symbol table.
393 std::set<const Type *>::iterator UTI = UT.find(I->second);
397 UT.erase(UTI); // Only keep one name for this type.
401 // UT now contains types that are not named. Loop over it, naming
404 bool Changed = false;
405 unsigned RenameCounter = 0;
406 for (std::set<const Type *>::const_iterator I = UT.begin(), E = UT.end();
408 if ((*I)->isStructTy() || (*I)->isArrayTy()) {
409 while (M.addTypeName("unnamed"+utostr(RenameCounter), *I))
415 // Loop over all external functions and globals. If we have two with
416 // identical names, merge them.
417 // FIXME: This code should disappear when we don't allow values with the same
418 // names when they have different types!
419 std::map<std::string, GlobalValue*> ExtSymbols;
420 for (Module::iterator I = M.begin(), E = M.end(); I != E;) {
422 if (GV->isDeclaration() && GV->hasName()) {
423 std::pair<std::map<std::string, GlobalValue*>::iterator, bool> X
424 = ExtSymbols.insert(std::make_pair(GV->getName(), GV));
426 // Found a conflict, replace this global with the previous one.
427 GlobalValue *OldGV = X.first->second;
428 GV->replaceAllUsesWith(ConstantExpr::getBitCast(OldGV, GV->getType()));
429 GV->eraseFromParent();
434 // Do the same for globals.
435 for (Module::global_iterator I = M.global_begin(), E = M.global_end();
437 GlobalVariable *GV = I++;
438 if (GV->isDeclaration() && GV->hasName()) {
439 std::pair<std::map<std::string, GlobalValue*>::iterator, bool> X
440 = ExtSymbols.insert(std::make_pair(GV->getName(), GV));
442 // Found a conflict, replace this global with the previous one.
443 GlobalValue *OldGV = X.first->second;
444 GV->replaceAllUsesWith(ConstantExpr::getBitCast(OldGV, GV->getType()));
445 GV->eraseFromParent();
454 /// printStructReturnPointerFunctionType - This is like printType for a struct
455 /// return type, except, instead of printing the type as void (*)(Struct*, ...)
456 /// print it as "Struct (*)(...)", for struct return functions.
457 void CWriter::printStructReturnPointerFunctionType(raw_ostream &Out,
458 const AttrListPtr &PAL,
459 const PointerType *TheTy) {
460 const FunctionType *FTy = cast<FunctionType>(TheTy->getElementType());
462 raw_string_ostream FunctionInnards(tstr);
463 FunctionInnards << " (*) (";
464 bool PrintedType = false;
466 FunctionType::param_iterator I = FTy->param_begin(), E = FTy->param_end();
467 const Type *RetTy = cast<PointerType>(I->get())->getElementType();
469 for (++I, ++Idx; I != E; ++I, ++Idx) {
471 FunctionInnards << ", ";
472 const Type *ArgTy = *I;
473 if (PAL.paramHasAttr(Idx, Attribute::ByVal)) {
474 assert(ArgTy->isPointerTy());
475 ArgTy = cast<PointerType>(ArgTy)->getElementType();
477 printType(FunctionInnards, ArgTy,
478 /*isSigned=*/PAL.paramHasAttr(Idx, Attribute::SExt), "");
481 if (FTy->isVarArg()) {
483 FunctionInnards << " int"; //dummy argument for empty vararg functs
484 FunctionInnards << ", ...";
485 } else if (!PrintedType) {
486 FunctionInnards << "void";
488 FunctionInnards << ')';
489 printType(Out, RetTy,
490 /*isSigned=*/PAL.paramHasAttr(0, Attribute::SExt), FunctionInnards.str());
494 CWriter::printSimpleType(raw_ostream &Out, const Type *Ty, bool isSigned,
495 const std::string &NameSoFar) {
496 assert((Ty->isPrimitiveType() || Ty->isIntegerTy() || Ty->isVectorTy()) &&
497 "Invalid type for printSimpleType");
498 switch (Ty->getTypeID()) {
499 case Type::VoidTyID: return Out << "void " << NameSoFar;
500 case Type::IntegerTyID: {
501 unsigned NumBits = cast<IntegerType>(Ty)->getBitWidth();
503 return Out << "bool " << NameSoFar;
504 else if (NumBits <= 8)
505 return Out << (isSigned?"signed":"unsigned") << " char " << NameSoFar;
506 else if (NumBits <= 16)
507 return Out << (isSigned?"signed":"unsigned") << " short " << NameSoFar;
508 else if (NumBits <= 32)
509 return Out << (isSigned?"signed":"unsigned") << " int " << NameSoFar;
510 else if (NumBits <= 64)
511 return Out << (isSigned?"signed":"unsigned") << " long long "<< NameSoFar;
513 assert(NumBits <= 128 && "Bit widths > 128 not implemented yet");
514 return Out << (isSigned?"llvmInt128":"llvmUInt128") << " " << NameSoFar;
517 case Type::FloatTyID: return Out << "float " << NameSoFar;
518 case Type::DoubleTyID: return Out << "double " << NameSoFar;
519 // Lacking emulation of FP80 on PPC, etc., we assume whichever of these is
520 // present matches host 'long double'.
521 case Type::X86_FP80TyID:
522 case Type::PPC_FP128TyID:
523 case Type::FP128TyID: return Out << "long double " << NameSoFar;
525 case Type::X86_MMXTyID:
526 return printSimpleType(Out, Type::getInt32Ty(Ty->getContext()), isSigned,
527 " __attribute__((vector_size(64))) " + NameSoFar);
529 case Type::VectorTyID: {
530 const VectorType *VTy = cast<VectorType>(Ty);
531 return printSimpleType(Out, VTy->getElementType(), isSigned,
532 " __attribute__((vector_size(" +
533 utostr(TD->getTypeAllocSize(VTy)) + " ))) " + NameSoFar);
538 errs() << "Unknown primitive type: " << *Ty << "\n";
544 // Pass the Type* and the variable name and this prints out the variable
547 raw_ostream &CWriter::printType(raw_ostream &Out, const Type *Ty,
548 bool isSigned, const std::string &NameSoFar,
549 bool IgnoreName, const AttrListPtr &PAL) {
550 if (Ty->isPrimitiveType() || Ty->isIntegerTy() || Ty->isVectorTy()) {
551 printSimpleType(Out, Ty, isSigned, NameSoFar);
555 // Check to see if the type is named.
556 if (!IgnoreName || Ty->isOpaqueTy()) {
557 std::map<const Type *, std::string>::iterator I = TypeNames.find(Ty);
558 if (I != TypeNames.end()) return Out << I->second << ' ' << NameSoFar;
561 switch (Ty->getTypeID()) {
562 case Type::FunctionTyID: {
563 const FunctionType *FTy = cast<FunctionType>(Ty);
565 raw_string_ostream FunctionInnards(tstr);
566 FunctionInnards << " (" << NameSoFar << ") (";
568 for (FunctionType::param_iterator I = FTy->param_begin(),
569 E = FTy->param_end(); I != E; ++I) {
570 const Type *ArgTy = *I;
571 if (PAL.paramHasAttr(Idx, Attribute::ByVal)) {
572 assert(ArgTy->isPointerTy());
573 ArgTy = cast<PointerType>(ArgTy)->getElementType();
575 if (I != FTy->param_begin())
576 FunctionInnards << ", ";
577 printType(FunctionInnards, ArgTy,
578 /*isSigned=*/PAL.paramHasAttr(Idx, Attribute::SExt), "");
581 if (FTy->isVarArg()) {
582 if (!FTy->getNumParams())
583 FunctionInnards << " int"; //dummy argument for empty vaarg functs
584 FunctionInnards << ", ...";
585 } else if (!FTy->getNumParams()) {
586 FunctionInnards << "void";
588 FunctionInnards << ')';
589 printType(Out, FTy->getReturnType(),
590 /*isSigned=*/PAL.paramHasAttr(0, Attribute::SExt), FunctionInnards.str());
593 case Type::StructTyID: {
594 const StructType *STy = cast<StructType>(Ty);
595 Out << NameSoFar + " {\n";
597 for (StructType::element_iterator I = STy->element_begin(),
598 E = STy->element_end(); I != E; ++I) {
600 printType(Out, *I, false, "field" + utostr(Idx++));
605 Out << " __attribute__ ((packed))";
609 case Type::PointerTyID: {
610 const PointerType *PTy = cast<PointerType>(Ty);
611 std::string ptrName = "*" + NameSoFar;
613 if (PTy->getElementType()->isArrayTy() ||
614 PTy->getElementType()->isVectorTy())
615 ptrName = "(" + ptrName + ")";
618 // Must be a function ptr cast!
619 return printType(Out, PTy->getElementType(), false, ptrName, true, PAL);
620 return printType(Out, PTy->getElementType(), false, ptrName);
623 case Type::ArrayTyID: {
624 const ArrayType *ATy = cast<ArrayType>(Ty);
625 unsigned NumElements = ATy->getNumElements();
626 if (NumElements == 0) NumElements = 1;
627 // Arrays are wrapped in structs to allow them to have normal
628 // value semantics (avoiding the array "decay").
629 Out << NameSoFar << " { ";
630 printType(Out, ATy->getElementType(), false,
631 "array[" + utostr(NumElements) + "]");
635 case Type::OpaqueTyID: {
636 std::string TyName = "struct opaque_" + itostr(OpaqueCounter++);
637 assert(TypeNames.find(Ty) == TypeNames.end());
638 TypeNames[Ty] = TyName;
639 return Out << TyName << ' ' << NameSoFar;
642 llvm_unreachable("Unhandled case in getTypeProps!");
648 void CWriter::printConstantArray(ConstantArray *CPA, bool Static) {
650 // As a special case, print the array as a string if it is an array of
651 // ubytes or an array of sbytes with positive values.
653 const Type *ETy = CPA->getType()->getElementType();
654 bool isString = (ETy == Type::getInt8Ty(CPA->getContext()) ||
655 ETy == Type::getInt8Ty(CPA->getContext()));
657 // Make sure the last character is a null char, as automatically added by C
658 if (isString && (CPA->getNumOperands() == 0 ||
659 !cast<Constant>(*(CPA->op_end()-1))->isNullValue()))
664 // Keep track of whether the last number was a hexadecimal escape
665 bool LastWasHex = false;
667 // Do not include the last character, which we know is null
668 for (unsigned i = 0, e = CPA->getNumOperands()-1; i != e; ++i) {
669 unsigned char C = cast<ConstantInt>(CPA->getOperand(i))->getZExtValue();
671 // Print it out literally if it is a printable character. The only thing
672 // to be careful about is when the last letter output was a hex escape
673 // code, in which case we have to be careful not to print out hex digits
674 // explicitly (the C compiler thinks it is a continuation of the previous
675 // character, sheesh...)
677 if (isprint(C) && (!LastWasHex || !isxdigit(C))) {
679 if (C == '"' || C == '\\')
680 Out << "\\" << (char)C;
686 case '\n': Out << "\\n"; break;
687 case '\t': Out << "\\t"; break;
688 case '\r': Out << "\\r"; break;
689 case '\v': Out << "\\v"; break;
690 case '\a': Out << "\\a"; break;
691 case '\"': Out << "\\\""; break;
692 case '\'': Out << "\\\'"; break;
695 Out << (char)(( C/16 < 10) ? ( C/16 +'0') : ( C/16 -10+'A'));
696 Out << (char)(((C&15) < 10) ? ((C&15)+'0') : ((C&15)-10+'A'));
705 if (CPA->getNumOperands()) {
707 printConstant(cast<Constant>(CPA->getOperand(0)), Static);
708 for (unsigned i = 1, e = CPA->getNumOperands(); i != e; ++i) {
710 printConstant(cast<Constant>(CPA->getOperand(i)), Static);
717 void CWriter::printConstantVector(ConstantVector *CP, bool Static) {
719 if (CP->getNumOperands()) {
721 printConstant(cast<Constant>(CP->getOperand(0)), Static);
722 for (unsigned i = 1, e = CP->getNumOperands(); i != e; ++i) {
724 printConstant(cast<Constant>(CP->getOperand(i)), Static);
730 // isFPCSafeToPrint - Returns true if we may assume that CFP may be written out
731 // textually as a double (rather than as a reference to a stack-allocated
732 // variable). We decide this by converting CFP to a string and back into a
733 // double, and then checking whether the conversion results in a bit-equal
734 // double to the original value of CFP. This depends on us and the target C
735 // compiler agreeing on the conversion process (which is pretty likely since we
736 // only deal in IEEE FP).
738 static bool isFPCSafeToPrint(const ConstantFP *CFP) {
740 // Do long doubles in hex for now.
741 if (CFP->getType() != Type::getFloatTy(CFP->getContext()) &&
742 CFP->getType() != Type::getDoubleTy(CFP->getContext()))
744 APFloat APF = APFloat(CFP->getValueAPF()); // copy
745 if (CFP->getType() == Type::getFloatTy(CFP->getContext()))
746 APF.convert(APFloat::IEEEdouble, APFloat::rmNearestTiesToEven, &ignored);
747 #if HAVE_PRINTF_A && ENABLE_CBE_PRINTF_A
749 sprintf(Buffer, "%a", APF.convertToDouble());
750 if (!strncmp(Buffer, "0x", 2) ||
751 !strncmp(Buffer, "-0x", 3) ||
752 !strncmp(Buffer, "+0x", 3))
753 return APF.bitwiseIsEqual(APFloat(atof(Buffer)));
756 std::string StrVal = ftostr(APF);
758 while (StrVal[0] == ' ')
759 StrVal.erase(StrVal.begin());
761 // Check to make sure that the stringized number is not some string like "Inf"
762 // or NaN. Check that the string matches the "[-+]?[0-9]" regex.
763 if ((StrVal[0] >= '0' && StrVal[0] <= '9') ||
764 ((StrVal[0] == '-' || StrVal[0] == '+') &&
765 (StrVal[1] >= '0' && StrVal[1] <= '9')))
766 // Reparse stringized version!
767 return APF.bitwiseIsEqual(APFloat(atof(StrVal.c_str())));
772 /// Print out the casting for a cast operation. This does the double casting
773 /// necessary for conversion to the destination type, if necessary.
774 /// @brief Print a cast
775 void CWriter::printCast(unsigned opc, const Type *SrcTy, const Type *DstTy) {
776 // Print the destination type cast
778 case Instruction::UIToFP:
779 case Instruction::SIToFP:
780 case Instruction::IntToPtr:
781 case Instruction::Trunc:
782 case Instruction::BitCast:
783 case Instruction::FPExt:
784 case Instruction::FPTrunc: // For these the DstTy sign doesn't matter
786 printType(Out, DstTy);
789 case Instruction::ZExt:
790 case Instruction::PtrToInt:
791 case Instruction::FPToUI: // For these, make sure we get an unsigned dest
793 printSimpleType(Out, DstTy, false);
796 case Instruction::SExt:
797 case Instruction::FPToSI: // For these, make sure we get a signed dest
799 printSimpleType(Out, DstTy, true);
803 llvm_unreachable("Invalid cast opcode");
806 // Print the source type cast
808 case Instruction::UIToFP:
809 case Instruction::ZExt:
811 printSimpleType(Out, SrcTy, false);
814 case Instruction::SIToFP:
815 case Instruction::SExt:
817 printSimpleType(Out, SrcTy, true);
820 case Instruction::IntToPtr:
821 case Instruction::PtrToInt:
822 // Avoid "cast to pointer from integer of different size" warnings
823 Out << "(unsigned long)";
825 case Instruction::Trunc:
826 case Instruction::BitCast:
827 case Instruction::FPExt:
828 case Instruction::FPTrunc:
829 case Instruction::FPToSI:
830 case Instruction::FPToUI:
831 break; // These don't need a source cast.
833 llvm_unreachable("Invalid cast opcode");
838 // printConstant - The LLVM Constant to C Constant converter.
839 void CWriter::printConstant(Constant *CPV, bool Static) {
840 if (const ConstantExpr *CE = dyn_cast<ConstantExpr>(CPV)) {
841 switch (CE->getOpcode()) {
842 case Instruction::Trunc:
843 case Instruction::ZExt:
844 case Instruction::SExt:
845 case Instruction::FPTrunc:
846 case Instruction::FPExt:
847 case Instruction::UIToFP:
848 case Instruction::SIToFP:
849 case Instruction::FPToUI:
850 case Instruction::FPToSI:
851 case Instruction::PtrToInt:
852 case Instruction::IntToPtr:
853 case Instruction::BitCast:
855 printCast(CE->getOpcode(), CE->getOperand(0)->getType(), CE->getType());
856 if (CE->getOpcode() == Instruction::SExt &&
857 CE->getOperand(0)->getType() == Type::getInt1Ty(CPV->getContext())) {
858 // Make sure we really sext from bool here by subtracting from 0
861 printConstant(CE->getOperand(0), Static);
862 if (CE->getType() == Type::getInt1Ty(CPV->getContext()) &&
863 (CE->getOpcode() == Instruction::Trunc ||
864 CE->getOpcode() == Instruction::FPToUI ||
865 CE->getOpcode() == Instruction::FPToSI ||
866 CE->getOpcode() == Instruction::PtrToInt)) {
867 // Make sure we really truncate to bool here by anding with 1
873 case Instruction::GetElementPtr:
875 printGEPExpression(CE->getOperand(0), gep_type_begin(CPV),
876 gep_type_end(CPV), Static);
879 case Instruction::Select:
881 printConstant(CE->getOperand(0), Static);
883 printConstant(CE->getOperand(1), Static);
885 printConstant(CE->getOperand(2), Static);
888 case Instruction::Add:
889 case Instruction::FAdd:
890 case Instruction::Sub:
891 case Instruction::FSub:
892 case Instruction::Mul:
893 case Instruction::FMul:
894 case Instruction::SDiv:
895 case Instruction::UDiv:
896 case Instruction::FDiv:
897 case Instruction::URem:
898 case Instruction::SRem:
899 case Instruction::FRem:
900 case Instruction::And:
901 case Instruction::Or:
902 case Instruction::Xor:
903 case Instruction::ICmp:
904 case Instruction::Shl:
905 case Instruction::LShr:
906 case Instruction::AShr:
909 bool NeedsClosingParens = printConstExprCast(CE, Static);
910 printConstantWithCast(CE->getOperand(0), CE->getOpcode());
911 switch (CE->getOpcode()) {
912 case Instruction::Add:
913 case Instruction::FAdd: Out << " + "; break;
914 case Instruction::Sub:
915 case Instruction::FSub: Out << " - "; break;
916 case Instruction::Mul:
917 case Instruction::FMul: Out << " * "; break;
918 case Instruction::URem:
919 case Instruction::SRem:
920 case Instruction::FRem: Out << " % "; break;
921 case Instruction::UDiv:
922 case Instruction::SDiv:
923 case Instruction::FDiv: Out << " / "; break;
924 case Instruction::And: Out << " & "; break;
925 case Instruction::Or: Out << " | "; break;
926 case Instruction::Xor: Out << " ^ "; break;
927 case Instruction::Shl: Out << " << "; break;
928 case Instruction::LShr:
929 case Instruction::AShr: Out << " >> "; break;
930 case Instruction::ICmp:
931 switch (CE->getPredicate()) {
932 case ICmpInst::ICMP_EQ: Out << " == "; break;
933 case ICmpInst::ICMP_NE: Out << " != "; break;
934 case ICmpInst::ICMP_SLT:
935 case ICmpInst::ICMP_ULT: Out << " < "; break;
936 case ICmpInst::ICMP_SLE:
937 case ICmpInst::ICMP_ULE: Out << " <= "; break;
938 case ICmpInst::ICMP_SGT:
939 case ICmpInst::ICMP_UGT: Out << " > "; break;
940 case ICmpInst::ICMP_SGE:
941 case ICmpInst::ICMP_UGE: Out << " >= "; break;
942 default: llvm_unreachable("Illegal ICmp predicate");
945 default: llvm_unreachable("Illegal opcode here!");
947 printConstantWithCast(CE->getOperand(1), CE->getOpcode());
948 if (NeedsClosingParens)
953 case Instruction::FCmp: {
955 bool NeedsClosingParens = printConstExprCast(CE, Static);
956 if (CE->getPredicate() == FCmpInst::FCMP_FALSE)
958 else if (CE->getPredicate() == FCmpInst::FCMP_TRUE)
962 switch (CE->getPredicate()) {
963 default: llvm_unreachable("Illegal FCmp predicate");
964 case FCmpInst::FCMP_ORD: op = "ord"; break;
965 case FCmpInst::FCMP_UNO: op = "uno"; break;
966 case FCmpInst::FCMP_UEQ: op = "ueq"; break;
967 case FCmpInst::FCMP_UNE: op = "une"; break;
968 case FCmpInst::FCMP_ULT: op = "ult"; break;
969 case FCmpInst::FCMP_ULE: op = "ule"; break;
970 case FCmpInst::FCMP_UGT: op = "ugt"; break;
971 case FCmpInst::FCMP_UGE: op = "uge"; break;
972 case FCmpInst::FCMP_OEQ: op = "oeq"; break;
973 case FCmpInst::FCMP_ONE: op = "one"; break;
974 case FCmpInst::FCMP_OLT: op = "olt"; break;
975 case FCmpInst::FCMP_OLE: op = "ole"; break;
976 case FCmpInst::FCMP_OGT: op = "ogt"; break;
977 case FCmpInst::FCMP_OGE: op = "oge"; break;
979 Out << "llvm_fcmp_" << op << "(";
980 printConstantWithCast(CE->getOperand(0), CE->getOpcode());
982 printConstantWithCast(CE->getOperand(1), CE->getOpcode());
985 if (NeedsClosingParens)
992 errs() << "CWriter Error: Unhandled constant expression: "
997 } else if (isa<UndefValue>(CPV) && CPV->getType()->isSingleValueType()) {
999 printType(Out, CPV->getType()); // sign doesn't matter
1000 Out << ")/*UNDEF*/";
1001 if (!CPV->getType()->isVectorTy()) {
1009 if (ConstantInt *CI = dyn_cast<ConstantInt>(CPV)) {
1010 const Type* Ty = CI->getType();
1011 if (Ty == Type::getInt1Ty(CPV->getContext()))
1012 Out << (CI->getZExtValue() ? '1' : '0');
1013 else if (Ty == Type::getInt32Ty(CPV->getContext()))
1014 Out << CI->getZExtValue() << 'u';
1015 else if (Ty->getPrimitiveSizeInBits() > 32)
1016 Out << CI->getZExtValue() << "ull";
1019 printSimpleType(Out, Ty, false) << ')';
1020 if (CI->isMinValue(true))
1021 Out << CI->getZExtValue() << 'u';
1023 Out << CI->getSExtValue();
1029 switch (CPV->getType()->getTypeID()) {
1030 case Type::FloatTyID:
1031 case Type::DoubleTyID:
1032 case Type::X86_FP80TyID:
1033 case Type::PPC_FP128TyID:
1034 case Type::FP128TyID: {
1035 ConstantFP *FPC = cast<ConstantFP>(CPV);
1036 std::map<const ConstantFP*, unsigned>::iterator I = FPConstantMap.find(FPC);
1037 if (I != FPConstantMap.end()) {
1038 // Because of FP precision problems we must load from a stack allocated
1039 // value that holds the value in hex.
1040 Out << "(*(" << (FPC->getType() == Type::getFloatTy(CPV->getContext()) ?
1042 FPC->getType() == Type::getDoubleTy(CPV->getContext()) ?
1045 << "*)&FPConstant" << I->second << ')';
1048 if (FPC->getType() == Type::getFloatTy(CPV->getContext()))
1049 V = FPC->getValueAPF().convertToFloat();
1050 else if (FPC->getType() == Type::getDoubleTy(CPV->getContext()))
1051 V = FPC->getValueAPF().convertToDouble();
1053 // Long double. Convert the number to double, discarding precision.
1054 // This is not awesome, but it at least makes the CBE output somewhat
1056 APFloat Tmp = FPC->getValueAPF();
1058 Tmp.convert(APFloat::IEEEdouble, APFloat::rmTowardZero, &LosesInfo);
1059 V = Tmp.convertToDouble();
1065 // FIXME the actual NaN bits should be emitted.
1066 // The prefix for a quiet NaN is 0x7FF8. For a signalling NaN,
1068 const unsigned long QuietNaN = 0x7ff8UL;
1069 //const unsigned long SignalNaN = 0x7ff4UL;
1071 // We need to grab the first part of the FP #
1074 uint64_t ll = DoubleToBits(V);
1075 sprintf(Buffer, "0x%llx", static_cast<long long>(ll));
1077 std::string Num(&Buffer[0], &Buffer[6]);
1078 unsigned long Val = strtoul(Num.c_str(), 0, 16);
1080 if (FPC->getType() == Type::getFloatTy(FPC->getContext()))
1081 Out << "LLVM_NAN" << (Val == QuietNaN ? "" : "S") << "F(\""
1082 << Buffer << "\") /*nan*/ ";
1084 Out << "LLVM_NAN" << (Val == QuietNaN ? "" : "S") << "(\""
1085 << Buffer << "\") /*nan*/ ";
1086 } else if (IsInf(V)) {
1088 if (V < 0) Out << '-';
1089 Out << "LLVM_INF" <<
1090 (FPC->getType() == Type::getFloatTy(FPC->getContext()) ? "F" : "")
1094 #if HAVE_PRINTF_A && ENABLE_CBE_PRINTF_A
1095 // Print out the constant as a floating point number.
1097 sprintf(Buffer, "%a", V);
1100 Num = ftostr(FPC->getValueAPF());
1108 case Type::ArrayTyID:
1109 // Use C99 compound expression literal initializer syntax.
1112 printType(Out, CPV->getType());
1115 Out << "{ "; // Arrays are wrapped in struct types.
1116 if (ConstantArray *CA = dyn_cast<ConstantArray>(CPV)) {
1117 printConstantArray(CA, Static);
1119 assert(isa<ConstantAggregateZero>(CPV) || isa<UndefValue>(CPV));
1120 const ArrayType *AT = cast<ArrayType>(CPV->getType());
1122 if (AT->getNumElements()) {
1124 Constant *CZ = Constant::getNullValue(AT->getElementType());
1125 printConstant(CZ, Static);
1126 for (unsigned i = 1, e = AT->getNumElements(); i != e; ++i) {
1128 printConstant(CZ, Static);
1133 Out << " }"; // Arrays are wrapped in struct types.
1136 case Type::VectorTyID:
1137 // Use C99 compound expression literal initializer syntax.
1140 printType(Out, CPV->getType());
1143 if (ConstantVector *CV = dyn_cast<ConstantVector>(CPV)) {
1144 printConstantVector(CV, Static);
1146 assert(isa<ConstantAggregateZero>(CPV) || isa<UndefValue>(CPV));
1147 const VectorType *VT = cast<VectorType>(CPV->getType());
1149 Constant *CZ = Constant::getNullValue(VT->getElementType());
1150 printConstant(CZ, Static);
1151 for (unsigned i = 1, e = VT->getNumElements(); i != e; ++i) {
1153 printConstant(CZ, Static);
1159 case Type::StructTyID:
1160 // Use C99 compound expression literal initializer syntax.
1163 printType(Out, CPV->getType());
1166 if (isa<ConstantAggregateZero>(CPV) || isa<UndefValue>(CPV)) {
1167 const StructType *ST = cast<StructType>(CPV->getType());
1169 if (ST->getNumElements()) {
1171 printConstant(Constant::getNullValue(ST->getElementType(0)), Static);
1172 for (unsigned i = 1, e = ST->getNumElements(); i != e; ++i) {
1174 printConstant(Constant::getNullValue(ST->getElementType(i)), Static);
1180 if (CPV->getNumOperands()) {
1182 printConstant(cast<Constant>(CPV->getOperand(0)), Static);
1183 for (unsigned i = 1, e = CPV->getNumOperands(); i != e; ++i) {
1185 printConstant(cast<Constant>(CPV->getOperand(i)), Static);
1192 case Type::PointerTyID:
1193 if (isa<ConstantPointerNull>(CPV)) {
1195 printType(Out, CPV->getType()); // sign doesn't matter
1196 Out << ")/*NULL*/0)";
1198 } else if (GlobalValue *GV = dyn_cast<GlobalValue>(CPV)) {
1199 writeOperand(GV, Static);
1205 errs() << "Unknown constant type: " << *CPV << "\n";
1207 llvm_unreachable(0);
1211 // Some constant expressions need to be casted back to the original types
1212 // because their operands were casted to the expected type. This function takes
1213 // care of detecting that case and printing the cast for the ConstantExpr.
1214 bool CWriter::printConstExprCast(const ConstantExpr* CE, bool Static) {
1215 bool NeedsExplicitCast = false;
1216 const Type *Ty = CE->getOperand(0)->getType();
1217 bool TypeIsSigned = false;
1218 switch (CE->getOpcode()) {
1219 case Instruction::Add:
1220 case Instruction::Sub:
1221 case Instruction::Mul:
1222 // We need to cast integer arithmetic so that it is always performed
1223 // as unsigned, to avoid undefined behavior on overflow.
1224 case Instruction::LShr:
1225 case Instruction::URem:
1226 case Instruction::UDiv: NeedsExplicitCast = true; break;
1227 case Instruction::AShr:
1228 case Instruction::SRem:
1229 case Instruction::SDiv: NeedsExplicitCast = true; TypeIsSigned = true; break;
1230 case Instruction::SExt:
1232 NeedsExplicitCast = true;
1233 TypeIsSigned = true;
1235 case Instruction::ZExt:
1236 case Instruction::Trunc:
1237 case Instruction::FPTrunc:
1238 case Instruction::FPExt:
1239 case Instruction::UIToFP:
1240 case Instruction::SIToFP:
1241 case Instruction::FPToUI:
1242 case Instruction::FPToSI:
1243 case Instruction::PtrToInt:
1244 case Instruction::IntToPtr:
1245 case Instruction::BitCast:
1247 NeedsExplicitCast = true;
1251 if (NeedsExplicitCast) {
1253 if (Ty->isIntegerTy() && Ty != Type::getInt1Ty(Ty->getContext()))
1254 printSimpleType(Out, Ty, TypeIsSigned);
1256 printType(Out, Ty); // not integer, sign doesn't matter
1259 return NeedsExplicitCast;
1262 // Print a constant assuming that it is the operand for a given Opcode. The
1263 // opcodes that care about sign need to cast their operands to the expected
1264 // type before the operation proceeds. This function does the casting.
1265 void CWriter::printConstantWithCast(Constant* CPV, unsigned Opcode) {
1267 // Extract the operand's type, we'll need it.
1268 const Type* OpTy = CPV->getType();
1270 // Indicate whether to do the cast or not.
1271 bool shouldCast = false;
1272 bool typeIsSigned = false;
1274 // Based on the Opcode for which this Constant is being written, determine
1275 // the new type to which the operand should be casted by setting the value
1276 // of OpTy. If we change OpTy, also set shouldCast to true so it gets
1280 // for most instructions, it doesn't matter
1282 case Instruction::Add:
1283 case Instruction::Sub:
1284 case Instruction::Mul:
1285 // We need to cast integer arithmetic so that it is always performed
1286 // as unsigned, to avoid undefined behavior on overflow.
1287 case Instruction::LShr:
1288 case Instruction::UDiv:
1289 case Instruction::URem:
1292 case Instruction::AShr:
1293 case Instruction::SDiv:
1294 case Instruction::SRem:
1296 typeIsSigned = true;
1300 // Write out the casted constant if we should, otherwise just write the
1304 printSimpleType(Out, OpTy, typeIsSigned);
1306 printConstant(CPV, false);
1309 printConstant(CPV, false);
1312 std::string CWriter::GetValueName(const Value *Operand) {
1314 // Resolve potential alias.
1315 if (const GlobalAlias *GA = dyn_cast<GlobalAlias>(Operand)) {
1316 if (const Value *V = GA->resolveAliasedGlobal(false))
1320 // Mangle globals with the standard mangler interface for LLC compatibility.
1321 if (const GlobalValue *GV = dyn_cast<GlobalValue>(Operand)) {
1322 SmallString<128> Str;
1323 Mang->getNameWithPrefix(Str, GV, false);
1324 return CBEMangle(Str.str().str());
1327 std::string Name = Operand->getName();
1329 if (Name.empty()) { // Assign unique names to local temporaries.
1330 unsigned &No = AnonValueNumbers[Operand];
1332 No = ++NextAnonValueNumber;
1333 Name = "tmp__" + utostr(No);
1336 std::string VarName;
1337 VarName.reserve(Name.capacity());
1339 for (std::string::iterator I = Name.begin(), E = Name.end();
1343 if (!((ch >= 'a' && ch <= 'z') || (ch >= 'A' && ch <= 'Z') ||
1344 (ch >= '0' && ch <= '9') || ch == '_')) {
1346 sprintf(buffer, "_%x_", ch);
1352 return "llvm_cbe_" + VarName;
1355 /// writeInstComputationInline - Emit the computation for the specified
1356 /// instruction inline, with no destination provided.
1357 void CWriter::writeInstComputationInline(Instruction &I) {
1358 // We can't currently support integer types other than 1, 8, 16, 32, 64.
1360 const Type *Ty = I.getType();
1361 if (Ty->isIntegerTy() && (Ty!=Type::getInt1Ty(I.getContext()) &&
1362 Ty!=Type::getInt8Ty(I.getContext()) &&
1363 Ty!=Type::getInt16Ty(I.getContext()) &&
1364 Ty!=Type::getInt32Ty(I.getContext()) &&
1365 Ty!=Type::getInt64Ty(I.getContext()))) {
1366 report_fatal_error("The C backend does not currently support integer "
1367 "types of widths other than 1, 8, 16, 32, 64.\n"
1368 "This is being tracked as PR 4158.");
1371 // If this is a non-trivial bool computation, make sure to truncate down to
1372 // a 1 bit value. This is important because we want "add i1 x, y" to return
1373 // "0" when x and y are true, not "2" for example.
1374 bool NeedBoolTrunc = false;
1375 if (I.getType() == Type::getInt1Ty(I.getContext()) &&
1376 !isa<ICmpInst>(I) && !isa<FCmpInst>(I))
1377 NeedBoolTrunc = true;
1389 void CWriter::writeOperandInternal(Value *Operand, bool Static) {
1390 if (Instruction *I = dyn_cast<Instruction>(Operand))
1391 // Should we inline this instruction to build a tree?
1392 if (isInlinableInst(*I) && !isDirectAlloca(I)) {
1394 writeInstComputationInline(*I);
1399 Constant* CPV = dyn_cast<Constant>(Operand);
1401 if (CPV && !isa<GlobalValue>(CPV))
1402 printConstant(CPV, Static);
1404 Out << GetValueName(Operand);
1407 void CWriter::writeOperand(Value *Operand, bool Static) {
1408 bool isAddressImplicit = isAddressExposed(Operand);
1409 if (isAddressImplicit)
1410 Out << "(&"; // Global variables are referenced as their addresses by llvm
1412 writeOperandInternal(Operand, Static);
1414 if (isAddressImplicit)
1418 // Some instructions need to have their result value casted back to the
1419 // original types because their operands were casted to the expected type.
1420 // This function takes care of detecting that case and printing the cast
1421 // for the Instruction.
1422 bool CWriter::writeInstructionCast(const Instruction &I) {
1423 const Type *Ty = I.getOperand(0)->getType();
1424 switch (I.getOpcode()) {
1425 case Instruction::Add:
1426 case Instruction::Sub:
1427 case Instruction::Mul:
1428 // We need to cast integer arithmetic so that it is always performed
1429 // as unsigned, to avoid undefined behavior on overflow.
1430 case Instruction::LShr:
1431 case Instruction::URem:
1432 case Instruction::UDiv:
1434 printSimpleType(Out, Ty, false);
1437 case Instruction::AShr:
1438 case Instruction::SRem:
1439 case Instruction::SDiv:
1441 printSimpleType(Out, Ty, true);
1449 // Write the operand with a cast to another type based on the Opcode being used.
1450 // This will be used in cases where an instruction has specific type
1451 // requirements (usually signedness) for its operands.
1452 void CWriter::writeOperandWithCast(Value* Operand, unsigned Opcode) {
1454 // Extract the operand's type, we'll need it.
1455 const Type* OpTy = Operand->getType();
1457 // Indicate whether to do the cast or not.
1458 bool shouldCast = false;
1460 // Indicate whether the cast should be to a signed type or not.
1461 bool castIsSigned = false;
1463 // Based on the Opcode for which this Operand is being written, determine
1464 // the new type to which the operand should be casted by setting the value
1465 // of OpTy. If we change OpTy, also set shouldCast to true.
1468 // for most instructions, it doesn't matter
1470 case Instruction::Add:
1471 case Instruction::Sub:
1472 case Instruction::Mul:
1473 // We need to cast integer arithmetic so that it is always performed
1474 // as unsigned, to avoid undefined behavior on overflow.
1475 case Instruction::LShr:
1476 case Instruction::UDiv:
1477 case Instruction::URem: // Cast to unsigned first
1479 castIsSigned = false;
1481 case Instruction::GetElementPtr:
1482 case Instruction::AShr:
1483 case Instruction::SDiv:
1484 case Instruction::SRem: // Cast to signed first
1486 castIsSigned = true;
1490 // Write out the casted operand if we should, otherwise just write the
1494 printSimpleType(Out, OpTy, castIsSigned);
1496 writeOperand(Operand);
1499 writeOperand(Operand);
1502 // Write the operand with a cast to another type based on the icmp predicate
1504 void CWriter::writeOperandWithCast(Value* Operand, const ICmpInst &Cmp) {
1505 // This has to do a cast to ensure the operand has the right signedness.
1506 // Also, if the operand is a pointer, we make sure to cast to an integer when
1507 // doing the comparison both for signedness and so that the C compiler doesn't
1508 // optimize things like "p < NULL" to false (p may contain an integer value
1510 bool shouldCast = Cmp.isRelational();
1512 // Write out the casted operand if we should, otherwise just write the
1515 writeOperand(Operand);
1519 // Should this be a signed comparison? If so, convert to signed.
1520 bool castIsSigned = Cmp.isSigned();
1522 // If the operand was a pointer, convert to a large integer type.
1523 const Type* OpTy = Operand->getType();
1524 if (OpTy->isPointerTy())
1525 OpTy = TD->getIntPtrType(Operand->getContext());
1528 printSimpleType(Out, OpTy, castIsSigned);
1530 writeOperand(Operand);
1534 // generateCompilerSpecificCode - This is where we add conditional compilation
1535 // directives to cater to specific compilers as need be.
1537 static void generateCompilerSpecificCode(formatted_raw_ostream& Out,
1538 const TargetData *TD) {
1539 // Alloca is hard to get, and we don't want to include stdlib.h here.
1540 Out << "/* get a declaration for alloca */\n"
1541 << "#if defined(__CYGWIN__) || defined(__MINGW32__)\n"
1542 << "#define alloca(x) __builtin_alloca((x))\n"
1543 << "#define _alloca(x) __builtin_alloca((x))\n"
1544 << "#elif defined(__APPLE__)\n"
1545 << "extern void *__builtin_alloca(unsigned long);\n"
1546 << "#define alloca(x) __builtin_alloca(x)\n"
1547 << "#define longjmp _longjmp\n"
1548 << "#define setjmp _setjmp\n"
1549 << "#elif defined(__sun__)\n"
1550 << "#if defined(__sparcv9)\n"
1551 << "extern void *__builtin_alloca(unsigned long);\n"
1553 << "extern void *__builtin_alloca(unsigned int);\n"
1555 << "#define alloca(x) __builtin_alloca(x)\n"
1556 << "#elif defined(__FreeBSD__) || defined(__NetBSD__) || defined(__OpenBSD__) || defined(__DragonFly__) || defined(__arm__)\n"
1557 << "#define alloca(x) __builtin_alloca(x)\n"
1558 << "#elif defined(_MSC_VER)\n"
1559 << "#define inline _inline\n"
1560 << "#define alloca(x) _alloca(x)\n"
1562 << "#include <alloca.h>\n"
1565 // We output GCC specific attributes to preserve 'linkonce'ness on globals.
1566 // If we aren't being compiled with GCC, just drop these attributes.
1567 Out << "#ifndef __GNUC__ /* Can only support \"linkonce\" vars with GCC */\n"
1568 << "#define __attribute__(X)\n"
1571 // On Mac OS X, "external weak" is spelled "__attribute__((weak_import))".
1572 Out << "#if defined(__GNUC__) && defined(__APPLE_CC__)\n"
1573 << "#define __EXTERNAL_WEAK__ __attribute__((weak_import))\n"
1574 << "#elif defined(__GNUC__)\n"
1575 << "#define __EXTERNAL_WEAK__ __attribute__((weak))\n"
1577 << "#define __EXTERNAL_WEAK__\n"
1580 // For now, turn off the weak linkage attribute on Mac OS X. (See above.)
1581 Out << "#if defined(__GNUC__) && defined(__APPLE_CC__)\n"
1582 << "#define __ATTRIBUTE_WEAK__\n"
1583 << "#elif defined(__GNUC__)\n"
1584 << "#define __ATTRIBUTE_WEAK__ __attribute__((weak))\n"
1586 << "#define __ATTRIBUTE_WEAK__\n"
1589 // Add hidden visibility support. FIXME: APPLE_CC?
1590 Out << "#if defined(__GNUC__)\n"
1591 << "#define __HIDDEN__ __attribute__((visibility(\"hidden\")))\n"
1594 // Define NaN and Inf as GCC builtins if using GCC, as 0 otherwise
1595 // From the GCC documentation:
1597 // double __builtin_nan (const char *str)
1599 // This is an implementation of the ISO C99 function nan.
1601 // Since ISO C99 defines this function in terms of strtod, which we do
1602 // not implement, a description of the parsing is in order. The string is
1603 // parsed as by strtol; that is, the base is recognized by leading 0 or
1604 // 0x prefixes. The number parsed is placed in the significand such that
1605 // the least significant bit of the number is at the least significant
1606 // bit of the significand. The number is truncated to fit the significand
1607 // field provided. The significand is forced to be a quiet NaN.
1609 // This function, if given a string literal, is evaluated early enough
1610 // that it is considered a compile-time constant.
1612 // float __builtin_nanf (const char *str)
1614 // Similar to __builtin_nan, except the return type is float.
1616 // double __builtin_inf (void)
1618 // Similar to __builtin_huge_val, except a warning is generated if the
1619 // target floating-point format does not support infinities. This
1620 // function is suitable for implementing the ISO C99 macro INFINITY.
1622 // float __builtin_inff (void)
1624 // Similar to __builtin_inf, except the return type is float.
1625 Out << "#ifdef __GNUC__\n"
1626 << "#define LLVM_NAN(NanStr) __builtin_nan(NanStr) /* Double */\n"
1627 << "#define LLVM_NANF(NanStr) __builtin_nanf(NanStr) /* Float */\n"
1628 << "#define LLVM_NANS(NanStr) __builtin_nans(NanStr) /* Double */\n"
1629 << "#define LLVM_NANSF(NanStr) __builtin_nansf(NanStr) /* Float */\n"
1630 << "#define LLVM_INF __builtin_inf() /* Double */\n"
1631 << "#define LLVM_INFF __builtin_inff() /* Float */\n"
1632 << "#define LLVM_PREFETCH(addr,rw,locality) "
1633 "__builtin_prefetch(addr,rw,locality)\n"
1634 << "#define __ATTRIBUTE_CTOR__ __attribute__((constructor))\n"
1635 << "#define __ATTRIBUTE_DTOR__ __attribute__((destructor))\n"
1636 << "#define LLVM_ASM __asm__\n"
1638 << "#define LLVM_NAN(NanStr) ((double)0.0) /* Double */\n"
1639 << "#define LLVM_NANF(NanStr) 0.0F /* Float */\n"
1640 << "#define LLVM_NANS(NanStr) ((double)0.0) /* Double */\n"
1641 << "#define LLVM_NANSF(NanStr) 0.0F /* Float */\n"
1642 << "#define LLVM_INF ((double)0.0) /* Double */\n"
1643 << "#define LLVM_INFF 0.0F /* Float */\n"
1644 << "#define LLVM_PREFETCH(addr,rw,locality) /* PREFETCH */\n"
1645 << "#define __ATTRIBUTE_CTOR__\n"
1646 << "#define __ATTRIBUTE_DTOR__\n"
1647 << "#define LLVM_ASM(X)\n"
1650 Out << "#if __GNUC__ < 4 /* Old GCC's, or compilers not GCC */ \n"
1651 << "#define __builtin_stack_save() 0 /* not implemented */\n"
1652 << "#define __builtin_stack_restore(X) /* noop */\n"
1655 // Output typedefs for 128-bit integers. If these are needed with a
1656 // 32-bit target or with a C compiler that doesn't support mode(TI),
1657 // more drastic measures will be needed.
1658 Out << "#if __GNUC__ && __LP64__ /* 128-bit integer types */\n"
1659 << "typedef int __attribute__((mode(TI))) llvmInt128;\n"
1660 << "typedef unsigned __attribute__((mode(TI))) llvmUInt128;\n"
1663 // Output target-specific code that should be inserted into main.
1664 Out << "#define CODE_FOR_MAIN() /* Any target-specific code for main()*/\n";
1667 /// FindStaticTors - Given a static ctor/dtor list, unpack its contents into
1668 /// the StaticTors set.
1669 static void FindStaticTors(GlobalVariable *GV, std::set<Function*> &StaticTors){
1670 ConstantArray *InitList = dyn_cast<ConstantArray>(GV->getInitializer());
1671 if (!InitList) return;
1673 for (unsigned i = 0, e = InitList->getNumOperands(); i != e; ++i)
1674 if (ConstantStruct *CS = dyn_cast<ConstantStruct>(InitList->getOperand(i))){
1675 if (CS->getNumOperands() != 2) return; // Not array of 2-element structs.
1677 if (CS->getOperand(1)->isNullValue())
1678 return; // Found a null terminator, exit printing.
1679 Constant *FP = CS->getOperand(1);
1680 if (ConstantExpr *CE = dyn_cast<ConstantExpr>(FP))
1682 FP = CE->getOperand(0);
1683 if (Function *F = dyn_cast<Function>(FP))
1684 StaticTors.insert(F);
1688 enum SpecialGlobalClass {
1690 GlobalCtors, GlobalDtors,
1694 /// getGlobalVariableClass - If this is a global that is specially recognized
1695 /// by LLVM, return a code that indicates how we should handle it.
1696 static SpecialGlobalClass getGlobalVariableClass(const GlobalVariable *GV) {
1697 // If this is a global ctors/dtors list, handle it now.
1698 if (GV->hasAppendingLinkage() && GV->use_empty()) {
1699 if (GV->getName() == "llvm.global_ctors")
1701 else if (GV->getName() == "llvm.global_dtors")
1705 // Otherwise, if it is other metadata, don't print it. This catches things
1706 // like debug information.
1707 if (GV->getSection() == "llvm.metadata")
1713 // PrintEscapedString - Print each character of the specified string, escaping
1714 // it if it is not printable or if it is an escape char.
1715 static void PrintEscapedString(const char *Str, unsigned Length,
1717 for (unsigned i = 0; i != Length; ++i) {
1718 unsigned char C = Str[i];
1719 if (isprint(C) && C != '\\' && C != '"')
1728 Out << "\\x" << hexdigit(C >> 4) << hexdigit(C & 0x0F);
1732 // PrintEscapedString - Print each character of the specified string, escaping
1733 // it if it is not printable or if it is an escape char.
1734 static void PrintEscapedString(const std::string &Str, raw_ostream &Out) {
1735 PrintEscapedString(Str.c_str(), Str.size(), Out);
1738 bool CWriter::doInitialization(Module &M) {
1739 FunctionPass::doInitialization(M);
1744 TD = new TargetData(&M);
1745 IL = new IntrinsicLowering(*TD);
1746 IL->AddPrototypes(M);
1749 std::string Triple = TheModule->getTargetTriple();
1751 Triple = llvm::sys::getHostTriple();
1754 if (const Target *Match = TargetRegistry::lookupTarget(Triple, E))
1755 TAsm = Match->createAsmInfo(Triple);
1757 TAsm = new CBEMCAsmInfo();
1758 TCtx = new MCContext(*TAsm, NULL);
1759 Mang = new Mangler(*TCtx, *TD);
1761 // Keep track of which functions are static ctors/dtors so they can have
1762 // an attribute added to their prototypes.
1763 std::set<Function*> StaticCtors, StaticDtors;
1764 for (Module::global_iterator I = M.global_begin(), E = M.global_end();
1766 switch (getGlobalVariableClass(I)) {
1769 FindStaticTors(I, StaticCtors);
1772 FindStaticTors(I, StaticDtors);
1777 // get declaration for alloca
1778 Out << "/* Provide Declarations */\n";
1779 Out << "#include <stdarg.h>\n"; // Varargs support
1780 Out << "#include <setjmp.h>\n"; // Unwind support
1781 generateCompilerSpecificCode(Out, TD);
1783 // Provide a definition for `bool' if not compiling with a C++ compiler.
1785 << "#ifndef __cplusplus\ntypedef unsigned char bool;\n#endif\n"
1787 << "\n\n/* Support for floating point constants */\n"
1788 << "typedef unsigned long long ConstantDoubleTy;\n"
1789 << "typedef unsigned int ConstantFloatTy;\n"
1790 << "typedef struct { unsigned long long f1; unsigned short f2; "
1791 "unsigned short pad[3]; } ConstantFP80Ty;\n"
1792 // This is used for both kinds of 128-bit long double; meaning differs.
1793 << "typedef struct { unsigned long long f1; unsigned long long f2; }"
1794 " ConstantFP128Ty;\n"
1795 << "\n\n/* Global Declarations */\n";
1797 // First output all the declarations for the program, because C requires
1798 // Functions & globals to be declared before they are used.
1800 if (!M.getModuleInlineAsm().empty()) {
1801 Out << "/* Module asm statements */\n"
1804 // Split the string into lines, to make it easier to read the .ll file.
1805 std::string Asm = M.getModuleInlineAsm();
1807 size_t NewLine = Asm.find_first_of('\n', CurPos);
1808 while (NewLine != std::string::npos) {
1809 // We found a newline, print the portion of the asm string from the
1810 // last newline up to this newline.
1812 PrintEscapedString(std::string(Asm.begin()+CurPos, Asm.begin()+NewLine),
1816 NewLine = Asm.find_first_of('\n', CurPos);
1819 PrintEscapedString(std::string(Asm.begin()+CurPos, Asm.end()), Out);
1821 << "/* End Module asm statements */\n";
1824 // Loop over the symbol table, emitting all named constants...
1825 printModuleTypes(M.getTypeSymbolTable());
1827 // Global variable declarations...
1828 if (!M.global_empty()) {
1829 Out << "\n/* External Global Variable Declarations */\n";
1830 for (Module::global_iterator I = M.global_begin(), E = M.global_end();
1833 if (I->hasExternalLinkage() || I->hasExternalWeakLinkage() ||
1834 I->hasCommonLinkage())
1836 else if (I->hasDLLImportLinkage())
1837 Out << "__declspec(dllimport) ";
1839 continue; // Internal Global
1841 // Thread Local Storage
1842 if (I->isThreadLocal())
1845 printType(Out, I->getType()->getElementType(), false, GetValueName(I));
1847 if (I->hasExternalWeakLinkage())
1848 Out << " __EXTERNAL_WEAK__";
1853 // Function declarations
1854 Out << "\n/* Function Declarations */\n";
1855 Out << "double fmod(double, double);\n"; // Support for FP rem
1856 Out << "float fmodf(float, float);\n";
1857 Out << "long double fmodl(long double, long double);\n";
1859 for (Module::iterator I = M.begin(), E = M.end(); I != E; ++I) {
1860 // Don't print declarations for intrinsic functions.
1861 if (!I->isIntrinsic() && I->getName() != "setjmp" &&
1862 I->getName() != "longjmp" && I->getName() != "_setjmp") {
1863 if (I->hasExternalWeakLinkage())
1865 printFunctionSignature(I, true);
1866 if (I->hasWeakLinkage() || I->hasLinkOnceLinkage())
1867 Out << " __ATTRIBUTE_WEAK__";
1868 if (I->hasExternalWeakLinkage())
1869 Out << " __EXTERNAL_WEAK__";
1870 if (StaticCtors.count(I))
1871 Out << " __ATTRIBUTE_CTOR__";
1872 if (StaticDtors.count(I))
1873 Out << " __ATTRIBUTE_DTOR__";
1874 if (I->hasHiddenVisibility())
1875 Out << " __HIDDEN__";
1877 if (I->hasName() && I->getName()[0] == 1)
1878 Out << " LLVM_ASM(\"" << I->getName().substr(1) << "\")";
1884 // Output the global variable declarations
1885 if (!M.global_empty()) {
1886 Out << "\n\n/* Global Variable Declarations */\n";
1887 for (Module::global_iterator I = M.global_begin(), E = M.global_end();
1889 if (!I->isDeclaration()) {
1890 // Ignore special globals, such as debug info.
1891 if (getGlobalVariableClass(I))
1894 if (I->hasLocalLinkage())
1899 // Thread Local Storage
1900 if (I->isThreadLocal())
1903 printType(Out, I->getType()->getElementType(), false,
1906 if (I->hasLinkOnceLinkage())
1907 Out << " __attribute__((common))";
1908 else if (I->hasCommonLinkage()) // FIXME is this right?
1909 Out << " __ATTRIBUTE_WEAK__";
1910 else if (I->hasWeakLinkage())
1911 Out << " __ATTRIBUTE_WEAK__";
1912 else if (I->hasExternalWeakLinkage())
1913 Out << " __EXTERNAL_WEAK__";
1914 if (I->hasHiddenVisibility())
1915 Out << " __HIDDEN__";
1920 // Output the global variable definitions and contents...
1921 if (!M.global_empty()) {
1922 Out << "\n\n/* Global Variable Definitions and Initialization */\n";
1923 for (Module::global_iterator I = M.global_begin(), E = M.global_end();
1925 if (!I->isDeclaration()) {
1926 // Ignore special globals, such as debug info.
1927 if (getGlobalVariableClass(I))
1930 if (I->hasLocalLinkage())
1932 else if (I->hasDLLImportLinkage())
1933 Out << "__declspec(dllimport) ";
1934 else if (I->hasDLLExportLinkage())
1935 Out << "__declspec(dllexport) ";
1937 // Thread Local Storage
1938 if (I->isThreadLocal())
1941 printType(Out, I->getType()->getElementType(), false,
1943 if (I->hasLinkOnceLinkage())
1944 Out << " __attribute__((common))";
1945 else if (I->hasWeakLinkage())
1946 Out << " __ATTRIBUTE_WEAK__";
1947 else if (I->hasCommonLinkage())
1948 Out << " __ATTRIBUTE_WEAK__";
1950 if (I->hasHiddenVisibility())
1951 Out << " __HIDDEN__";
1953 // If the initializer is not null, emit the initializer. If it is null,
1954 // we try to avoid emitting large amounts of zeros. The problem with
1955 // this, however, occurs when the variable has weak linkage. In this
1956 // case, the assembler will complain about the variable being both weak
1957 // and common, so we disable this optimization.
1958 // FIXME common linkage should avoid this problem.
1959 if (!I->getInitializer()->isNullValue()) {
1961 writeOperand(I->getInitializer(), true);
1962 } else if (I->hasWeakLinkage()) {
1963 // We have to specify an initializer, but it doesn't have to be
1964 // complete. If the value is an aggregate, print out { 0 }, and let
1965 // the compiler figure out the rest of the zeros.
1967 if (I->getInitializer()->getType()->isStructTy() ||
1968 I->getInitializer()->getType()->isVectorTy()) {
1970 } else if (I->getInitializer()->getType()->isArrayTy()) {
1971 // As with structs and vectors, but with an extra set of braces
1972 // because arrays are wrapped in structs.
1975 // Just print it out normally.
1976 writeOperand(I->getInitializer(), true);
1984 Out << "\n\n/* Function Bodies */\n";
1986 // Emit some helper functions for dealing with FCMP instruction's
1988 Out << "static inline int llvm_fcmp_ord(double X, double Y) { ";
1989 Out << "return X == X && Y == Y; }\n";
1990 Out << "static inline int llvm_fcmp_uno(double X, double Y) { ";
1991 Out << "return X != X || Y != Y; }\n";
1992 Out << "static inline int llvm_fcmp_ueq(double X, double Y) { ";
1993 Out << "return X == Y || llvm_fcmp_uno(X, Y); }\n";
1994 Out << "static inline int llvm_fcmp_une(double X, double Y) { ";
1995 Out << "return X != Y; }\n";
1996 Out << "static inline int llvm_fcmp_ult(double X, double Y) { ";
1997 Out << "return X < Y || llvm_fcmp_uno(X, Y); }\n";
1998 Out << "static inline int llvm_fcmp_ugt(double X, double Y) { ";
1999 Out << "return X > Y || llvm_fcmp_uno(X, Y); }\n";
2000 Out << "static inline int llvm_fcmp_ule(double X, double Y) { ";
2001 Out << "return X <= Y || llvm_fcmp_uno(X, Y); }\n";
2002 Out << "static inline int llvm_fcmp_uge(double X, double Y) { ";
2003 Out << "return X >= Y || llvm_fcmp_uno(X, Y); }\n";
2004 Out << "static inline int llvm_fcmp_oeq(double X, double Y) { ";
2005 Out << "return X == Y ; }\n";
2006 Out << "static inline int llvm_fcmp_one(double X, double Y) { ";
2007 Out << "return X != Y && llvm_fcmp_ord(X, Y); }\n";
2008 Out << "static inline int llvm_fcmp_olt(double X, double Y) { ";
2009 Out << "return X < Y ; }\n";
2010 Out << "static inline int llvm_fcmp_ogt(double X, double Y) { ";
2011 Out << "return X > Y ; }\n";
2012 Out << "static inline int llvm_fcmp_ole(double X, double Y) { ";
2013 Out << "return X <= Y ; }\n";
2014 Out << "static inline int llvm_fcmp_oge(double X, double Y) { ";
2015 Out << "return X >= Y ; }\n";
2020 /// Output all floating point constants that cannot be printed accurately...
2021 void CWriter::printFloatingPointConstants(Function &F) {
2022 // Scan the module for floating point constants. If any FP constant is used
2023 // in the function, we want to redirect it here so that we do not depend on
2024 // the precision of the printed form, unless the printed form preserves
2027 for (constant_iterator I = constant_begin(&F), E = constant_end(&F);
2029 printFloatingPointConstants(*I);
2034 void CWriter::printFloatingPointConstants(const Constant *C) {
2035 // If this is a constant expression, recursively check for constant fp values.
2036 if (const ConstantExpr *CE = dyn_cast<ConstantExpr>(C)) {
2037 for (unsigned i = 0, e = CE->getNumOperands(); i != e; ++i)
2038 printFloatingPointConstants(CE->getOperand(i));
2042 // Otherwise, check for a FP constant that we need to print.
2043 const ConstantFP *FPC = dyn_cast<ConstantFP>(C);
2045 // Do not put in FPConstantMap if safe.
2046 isFPCSafeToPrint(FPC) ||
2047 // Already printed this constant?
2048 FPConstantMap.count(FPC))
2051 FPConstantMap[FPC] = FPCounter; // Number the FP constants
2053 if (FPC->getType() == Type::getDoubleTy(FPC->getContext())) {
2054 double Val = FPC->getValueAPF().convertToDouble();
2055 uint64_t i = FPC->getValueAPF().bitcastToAPInt().getZExtValue();
2056 Out << "static const ConstantDoubleTy FPConstant" << FPCounter++
2057 << " = 0x" << utohexstr(i)
2058 << "ULL; /* " << Val << " */\n";
2059 } else if (FPC->getType() == Type::getFloatTy(FPC->getContext())) {
2060 float Val = FPC->getValueAPF().convertToFloat();
2061 uint32_t i = (uint32_t)FPC->getValueAPF().bitcastToAPInt().
2063 Out << "static const ConstantFloatTy FPConstant" << FPCounter++
2064 << " = 0x" << utohexstr(i)
2065 << "U; /* " << Val << " */\n";
2066 } else if (FPC->getType() == Type::getX86_FP80Ty(FPC->getContext())) {
2067 // api needed to prevent premature destruction
2068 APInt api = FPC->getValueAPF().bitcastToAPInt();
2069 const uint64_t *p = api.getRawData();
2070 Out << "static const ConstantFP80Ty FPConstant" << FPCounter++
2071 << " = { 0x" << utohexstr(p[0])
2072 << "ULL, 0x" << utohexstr((uint16_t)p[1]) << ",{0,0,0}"
2073 << "}; /* Long double constant */\n";
2074 } else if (FPC->getType() == Type::getPPC_FP128Ty(FPC->getContext()) ||
2075 FPC->getType() == Type::getFP128Ty(FPC->getContext())) {
2076 APInt api = FPC->getValueAPF().bitcastToAPInt();
2077 const uint64_t *p = api.getRawData();
2078 Out << "static const ConstantFP128Ty FPConstant" << FPCounter++
2080 << utohexstr(p[0]) << ", 0x" << utohexstr(p[1])
2081 << "}; /* Long double constant */\n";
2084 llvm_unreachable("Unknown float type!");
2090 /// printSymbolTable - Run through symbol table looking for type names. If a
2091 /// type name is found, emit its declaration...
2093 void CWriter::printModuleTypes(const TypeSymbolTable &TST) {
2094 Out << "/* Helper union for bitcasts */\n";
2095 Out << "typedef union {\n";
2096 Out << " unsigned int Int32;\n";
2097 Out << " unsigned long long Int64;\n";
2098 Out << " float Float;\n";
2099 Out << " double Double;\n";
2100 Out << "} llvmBitCastUnion;\n";
2102 // We are only interested in the type plane of the symbol table.
2103 TypeSymbolTable::const_iterator I = TST.begin();
2104 TypeSymbolTable::const_iterator End = TST.end();
2106 // If there are no type names, exit early.
2107 if (I == End) return;
2109 // Print out forward declarations for structure types before anything else!
2110 Out << "/* Structure forward decls */\n";
2111 for (; I != End; ++I) {
2112 std::string Name = "struct " + CBEMangle("l_"+I->first);
2113 Out << Name << ";\n";
2114 TypeNames.insert(std::make_pair(I->second, Name));
2119 // Now we can print out typedefs. Above, we guaranteed that this can only be
2120 // for struct or opaque types.
2121 Out << "/* Typedefs */\n";
2122 for (I = TST.begin(); I != End; ++I) {
2123 std::string Name = CBEMangle("l_"+I->first);
2125 printType(Out, I->second, false, Name);
2131 // Keep track of which structures have been printed so far...
2132 std::set<const Type *> StructPrinted;
2134 // Loop over all structures then push them into the stack so they are
2135 // printed in the correct order.
2137 Out << "/* Structure contents */\n";
2138 for (I = TST.begin(); I != End; ++I)
2139 if (I->second->isStructTy() || I->second->isArrayTy())
2140 // Only print out used types!
2141 printContainedStructs(I->second, StructPrinted);
2144 // Push the struct onto the stack and recursively push all structs
2145 // this one depends on.
2147 // TODO: Make this work properly with vector types
2149 void CWriter::printContainedStructs(const Type *Ty,
2150 std::set<const Type*> &StructPrinted) {
2151 // Don't walk through pointers.
2152 if (Ty->isPointerTy() || Ty->isPrimitiveType() || Ty->isIntegerTy())
2155 // Print all contained types first.
2156 for (Type::subtype_iterator I = Ty->subtype_begin(),
2157 E = Ty->subtype_end(); I != E; ++I)
2158 printContainedStructs(*I, StructPrinted);
2160 if (Ty->isStructTy() || Ty->isArrayTy()) {
2161 // Check to see if we have already printed this struct.
2162 if (StructPrinted.insert(Ty).second) {
2163 // Print structure type out.
2164 std::string Name = TypeNames[Ty];
2165 printType(Out, Ty, false, Name, true);
2171 void CWriter::printFunctionSignature(const Function *F, bool Prototype) {
2172 /// isStructReturn - Should this function actually return a struct by-value?
2173 bool isStructReturn = F->hasStructRetAttr();
2175 if (F->hasLocalLinkage()) Out << "static ";
2176 if (F->hasDLLImportLinkage()) Out << "__declspec(dllimport) ";
2177 if (F->hasDLLExportLinkage()) Out << "__declspec(dllexport) ";
2178 switch (F->getCallingConv()) {
2179 case CallingConv::X86_StdCall:
2180 Out << "__attribute__((stdcall)) ";
2182 case CallingConv::X86_FastCall:
2183 Out << "__attribute__((fastcall)) ";
2185 case CallingConv::X86_ThisCall:
2186 Out << "__attribute__((thiscall)) ";
2192 // Loop over the arguments, printing them...
2193 const FunctionType *FT = cast<FunctionType>(F->getFunctionType());
2194 const AttrListPtr &PAL = F->getAttributes();
2197 raw_string_ostream FunctionInnards(tstr);
2199 // Print out the name...
2200 FunctionInnards << GetValueName(F) << '(';
2202 bool PrintedArg = false;
2203 if (!F->isDeclaration()) {
2204 if (!F->arg_empty()) {
2205 Function::const_arg_iterator I = F->arg_begin(), E = F->arg_end();
2208 // If this is a struct-return function, don't print the hidden
2209 // struct-return argument.
2210 if (isStructReturn) {
2211 assert(I != E && "Invalid struct return function!");
2216 std::string ArgName;
2217 for (; I != E; ++I) {
2218 if (PrintedArg) FunctionInnards << ", ";
2219 if (I->hasName() || !Prototype)
2220 ArgName = GetValueName(I);
2223 const Type *ArgTy = I->getType();
2224 if (PAL.paramHasAttr(Idx, Attribute::ByVal)) {
2225 ArgTy = cast<PointerType>(ArgTy)->getElementType();
2226 ByValParams.insert(I);
2228 printType(FunctionInnards, ArgTy,
2229 /*isSigned=*/PAL.paramHasAttr(Idx, Attribute::SExt),
2236 // Loop over the arguments, printing them.
2237 FunctionType::param_iterator I = FT->param_begin(), E = FT->param_end();
2240 // If this is a struct-return function, don't print the hidden
2241 // struct-return argument.
2242 if (isStructReturn) {
2243 assert(I != E && "Invalid struct return function!");
2248 for (; I != E; ++I) {
2249 if (PrintedArg) FunctionInnards << ", ";
2250 const Type *ArgTy = *I;
2251 if (PAL.paramHasAttr(Idx, Attribute::ByVal)) {
2252 assert(ArgTy->isPointerTy());
2253 ArgTy = cast<PointerType>(ArgTy)->getElementType();
2255 printType(FunctionInnards, ArgTy,
2256 /*isSigned=*/PAL.paramHasAttr(Idx, Attribute::SExt));
2262 if (!PrintedArg && FT->isVarArg()) {
2263 FunctionInnards << "int vararg_dummy_arg";
2267 // Finish printing arguments... if this is a vararg function, print the ...,
2268 // unless there are no known types, in which case, we just emit ().
2270 if (FT->isVarArg() && PrintedArg) {
2271 FunctionInnards << ",..."; // Output varargs portion of signature!
2272 } else if (!FT->isVarArg() && !PrintedArg) {
2273 FunctionInnards << "void"; // ret() -> ret(void) in C.
2275 FunctionInnards << ')';
2277 // Get the return tpe for the function.
2279 if (!isStructReturn)
2280 RetTy = F->getReturnType();
2282 // If this is a struct-return function, print the struct-return type.
2283 RetTy = cast<PointerType>(FT->getParamType(0))->getElementType();
2286 // Print out the return type and the signature built above.
2287 printType(Out, RetTy,
2288 /*isSigned=*/PAL.paramHasAttr(0, Attribute::SExt),
2289 FunctionInnards.str());
2292 static inline bool isFPIntBitCast(const Instruction &I) {
2293 if (!isa<BitCastInst>(I))
2295 const Type *SrcTy = I.getOperand(0)->getType();
2296 const Type *DstTy = I.getType();
2297 return (SrcTy->isFloatingPointTy() && DstTy->isIntegerTy()) ||
2298 (DstTy->isFloatingPointTy() && SrcTy->isIntegerTy());
2301 void CWriter::printFunction(Function &F) {
2302 /// isStructReturn - Should this function actually return a struct by-value?
2303 bool isStructReturn = F.hasStructRetAttr();
2305 printFunctionSignature(&F, false);
2308 // If this is a struct return function, handle the result with magic.
2309 if (isStructReturn) {
2310 const Type *StructTy =
2311 cast<PointerType>(F.arg_begin()->getType())->getElementType();
2313 printType(Out, StructTy, false, "StructReturn");
2314 Out << "; /* Struct return temporary */\n";
2317 printType(Out, F.arg_begin()->getType(), false,
2318 GetValueName(F.arg_begin()));
2319 Out << " = &StructReturn;\n";
2322 bool PrintedVar = false;
2324 // print local variable information for the function
2325 for (inst_iterator I = inst_begin(&F), E = inst_end(&F); I != E; ++I) {
2326 if (const AllocaInst *AI = isDirectAlloca(&*I)) {
2328 printType(Out, AI->getAllocatedType(), false, GetValueName(AI));
2329 Out << "; /* Address-exposed local */\n";
2331 } else if (I->getType() != Type::getVoidTy(F.getContext()) &&
2332 !isInlinableInst(*I)) {
2334 printType(Out, I->getType(), false, GetValueName(&*I));
2337 if (isa<PHINode>(*I)) { // Print out PHI node temporaries as well...
2339 printType(Out, I->getType(), false,
2340 GetValueName(&*I)+"__PHI_TEMPORARY");
2345 // We need a temporary for the BitCast to use so it can pluck a value out
2346 // of a union to do the BitCast. This is separate from the need for a
2347 // variable to hold the result of the BitCast.
2348 if (isFPIntBitCast(*I)) {
2349 Out << " llvmBitCastUnion " << GetValueName(&*I)
2350 << "__BITCAST_TEMPORARY;\n";
2358 if (F.hasExternalLinkage() && F.getName() == "main")
2359 Out << " CODE_FOR_MAIN();\n";
2361 // print the basic blocks
2362 for (Function::iterator BB = F.begin(), E = F.end(); BB != E; ++BB) {
2363 if (Loop *L = LI->getLoopFor(BB)) {
2364 if (L->getHeader() == BB && L->getParentLoop() == 0)
2367 printBasicBlock(BB);
2374 void CWriter::printLoop(Loop *L) {
2375 Out << " do { /* Syntactic loop '" << L->getHeader()->getName()
2376 << "' to make GCC happy */\n";
2377 for (unsigned i = 0, e = L->getBlocks().size(); i != e; ++i) {
2378 BasicBlock *BB = L->getBlocks()[i];
2379 Loop *BBLoop = LI->getLoopFor(BB);
2381 printBasicBlock(BB);
2382 else if (BB == BBLoop->getHeader() && BBLoop->getParentLoop() == L)
2385 Out << " } while (1); /* end of syntactic loop '"
2386 << L->getHeader()->getName() << "' */\n";
2389 void CWriter::printBasicBlock(BasicBlock *BB) {
2391 // Don't print the label for the basic block if there are no uses, or if
2392 // the only terminator use is the predecessor basic block's terminator.
2393 // We have to scan the use list because PHI nodes use basic blocks too but
2394 // do not require a label to be generated.
2396 bool NeedsLabel = false;
2397 for (pred_iterator PI = pred_begin(BB), E = pred_end(BB); PI != E; ++PI)
2398 if (isGotoCodeNecessary(*PI, BB)) {
2403 if (NeedsLabel) Out << GetValueName(BB) << ":\n";
2405 // Output all of the instructions in the basic block...
2406 for (BasicBlock::iterator II = BB->begin(), E = --BB->end(); II != E;
2408 if (!isInlinableInst(*II) && !isDirectAlloca(II)) {
2409 if (II->getType() != Type::getVoidTy(BB->getContext()) &&
2414 writeInstComputationInline(*II);
2419 // Don't emit prefix or suffix for the terminator.
2420 visit(*BB->getTerminator());
2424 // Specific Instruction type classes... note that all of the casts are
2425 // necessary because we use the instruction classes as opaque types...
2427 void CWriter::visitReturnInst(ReturnInst &I) {
2428 // If this is a struct return function, return the temporary struct.
2429 bool isStructReturn = I.getParent()->getParent()->hasStructRetAttr();
2431 if (isStructReturn) {
2432 Out << " return StructReturn;\n";
2436 // Don't output a void return if this is the last basic block in the function
2437 if (I.getNumOperands() == 0 &&
2438 &*--I.getParent()->getParent()->end() == I.getParent() &&
2439 !I.getParent()->size() == 1) {
2444 if (I.getNumOperands()) {
2446 writeOperand(I.getOperand(0));
2451 void CWriter::visitSwitchInst(SwitchInst &SI) {
2454 writeOperand(SI.getOperand(0));
2455 Out << ") {\n default:\n";
2456 printPHICopiesForSuccessor (SI.getParent(), SI.getDefaultDest(), 2);
2457 printBranchToBlock(SI.getParent(), SI.getDefaultDest(), 2);
2459 for (unsigned i = 2, e = SI.getNumOperands(); i != e; i += 2) {
2461 writeOperand(SI.getOperand(i));
2463 BasicBlock *Succ = cast<BasicBlock>(SI.getOperand(i+1));
2464 printPHICopiesForSuccessor (SI.getParent(), Succ, 2);
2465 printBranchToBlock(SI.getParent(), Succ, 2);
2466 if (Function::iterator(Succ) == llvm::next(Function::iterator(SI.getParent())))
2472 void CWriter::visitIndirectBrInst(IndirectBrInst &IBI) {
2473 Out << " goto *(void*)(";
2474 writeOperand(IBI.getOperand(0));
2478 void CWriter::visitUnreachableInst(UnreachableInst &I) {
2479 Out << " /*UNREACHABLE*/;\n";
2482 bool CWriter::isGotoCodeNecessary(BasicBlock *From, BasicBlock *To) {
2483 /// FIXME: This should be reenabled, but loop reordering safe!!
2486 if (llvm::next(Function::iterator(From)) != Function::iterator(To))
2487 return true; // Not the direct successor, we need a goto.
2489 //isa<SwitchInst>(From->getTerminator())
2491 if (LI->getLoopFor(From) != LI->getLoopFor(To))
2496 void CWriter::printPHICopiesForSuccessor (BasicBlock *CurBlock,
2497 BasicBlock *Successor,
2499 for (BasicBlock::iterator I = Successor->begin(); isa<PHINode>(I); ++I) {
2500 PHINode *PN = cast<PHINode>(I);
2501 // Now we have to do the printing.
2502 Value *IV = PN->getIncomingValueForBlock(CurBlock);
2503 if (!isa<UndefValue>(IV)) {
2504 Out << std::string(Indent, ' ');
2505 Out << " " << GetValueName(I) << "__PHI_TEMPORARY = ";
2507 Out << "; /* for PHI node */\n";
2512 void CWriter::printBranchToBlock(BasicBlock *CurBB, BasicBlock *Succ,
2514 if (isGotoCodeNecessary(CurBB, Succ)) {
2515 Out << std::string(Indent, ' ') << " goto ";
2521 // Branch instruction printing - Avoid printing out a branch to a basic block
2522 // that immediately succeeds the current one.
2524 void CWriter::visitBranchInst(BranchInst &I) {
2526 if (I.isConditional()) {
2527 if (isGotoCodeNecessary(I.getParent(), I.getSuccessor(0))) {
2529 writeOperand(I.getCondition());
2532 printPHICopiesForSuccessor (I.getParent(), I.getSuccessor(0), 2);
2533 printBranchToBlock(I.getParent(), I.getSuccessor(0), 2);
2535 if (isGotoCodeNecessary(I.getParent(), I.getSuccessor(1))) {
2536 Out << " } else {\n";
2537 printPHICopiesForSuccessor (I.getParent(), I.getSuccessor(1), 2);
2538 printBranchToBlock(I.getParent(), I.getSuccessor(1), 2);
2541 // First goto not necessary, assume second one is...
2543 writeOperand(I.getCondition());
2546 printPHICopiesForSuccessor (I.getParent(), I.getSuccessor(1), 2);
2547 printBranchToBlock(I.getParent(), I.getSuccessor(1), 2);
2552 printPHICopiesForSuccessor (I.getParent(), I.getSuccessor(0), 0);
2553 printBranchToBlock(I.getParent(), I.getSuccessor(0), 0);
2558 // PHI nodes get copied into temporary values at the end of predecessor basic
2559 // blocks. We now need to copy these temporary values into the REAL value for
2561 void CWriter::visitPHINode(PHINode &I) {
2563 Out << "__PHI_TEMPORARY";
2567 void CWriter::visitBinaryOperator(Instruction &I) {
2568 // binary instructions, shift instructions, setCond instructions.
2569 assert(!I.getType()->isPointerTy());
2571 // We must cast the results of binary operations which might be promoted.
2572 bool needsCast = false;
2573 if ((I.getType() == Type::getInt8Ty(I.getContext())) ||
2574 (I.getType() == Type::getInt16Ty(I.getContext()))
2575 || (I.getType() == Type::getFloatTy(I.getContext()))) {
2578 printType(Out, I.getType(), false);
2582 // If this is a negation operation, print it out as such. For FP, we don't
2583 // want to print "-0.0 - X".
2584 if (BinaryOperator::isNeg(&I)) {
2586 writeOperand(BinaryOperator::getNegArgument(cast<BinaryOperator>(&I)));
2588 } else if (BinaryOperator::isFNeg(&I)) {
2590 writeOperand(BinaryOperator::getFNegArgument(cast<BinaryOperator>(&I)));
2592 } else if (I.getOpcode() == Instruction::FRem) {
2593 // Output a call to fmod/fmodf instead of emitting a%b
2594 if (I.getType() == Type::getFloatTy(I.getContext()))
2596 else if (I.getType() == Type::getDoubleTy(I.getContext()))
2598 else // all 3 flavors of long double
2600 writeOperand(I.getOperand(0));
2602 writeOperand(I.getOperand(1));
2606 // Write out the cast of the instruction's value back to the proper type
2608 bool NeedsClosingParens = writeInstructionCast(I);
2610 // Certain instructions require the operand to be forced to a specific type
2611 // so we use writeOperandWithCast here instead of writeOperand. Similarly
2612 // below for operand 1
2613 writeOperandWithCast(I.getOperand(0), I.getOpcode());
2615 switch (I.getOpcode()) {
2616 case Instruction::Add:
2617 case Instruction::FAdd: Out << " + "; break;
2618 case Instruction::Sub:
2619 case Instruction::FSub: Out << " - "; break;
2620 case Instruction::Mul:
2621 case Instruction::FMul: Out << " * "; break;
2622 case Instruction::URem:
2623 case Instruction::SRem:
2624 case Instruction::FRem: Out << " % "; break;
2625 case Instruction::UDiv:
2626 case Instruction::SDiv:
2627 case Instruction::FDiv: Out << " / "; break;
2628 case Instruction::And: Out << " & "; break;
2629 case Instruction::Or: Out << " | "; break;
2630 case Instruction::Xor: Out << " ^ "; break;
2631 case Instruction::Shl : Out << " << "; break;
2632 case Instruction::LShr:
2633 case Instruction::AShr: Out << " >> "; break;
2636 errs() << "Invalid operator type!" << I;
2638 llvm_unreachable(0);
2641 writeOperandWithCast(I.getOperand(1), I.getOpcode());
2642 if (NeedsClosingParens)
2651 void CWriter::visitICmpInst(ICmpInst &I) {
2652 // We must cast the results of icmp which might be promoted.
2653 bool needsCast = false;
2655 // Write out the cast of the instruction's value back to the proper type
2657 bool NeedsClosingParens = writeInstructionCast(I);
2659 // Certain icmp predicate require the operand to be forced to a specific type
2660 // so we use writeOperandWithCast here instead of writeOperand. Similarly
2661 // below for operand 1
2662 writeOperandWithCast(I.getOperand(0), I);
2664 switch (I.getPredicate()) {
2665 case ICmpInst::ICMP_EQ: Out << " == "; break;
2666 case ICmpInst::ICMP_NE: Out << " != "; break;
2667 case ICmpInst::ICMP_ULE:
2668 case ICmpInst::ICMP_SLE: Out << " <= "; break;
2669 case ICmpInst::ICMP_UGE:
2670 case ICmpInst::ICMP_SGE: Out << " >= "; break;
2671 case ICmpInst::ICMP_ULT:
2672 case ICmpInst::ICMP_SLT: Out << " < "; break;
2673 case ICmpInst::ICMP_UGT:
2674 case ICmpInst::ICMP_SGT: Out << " > "; break;
2677 errs() << "Invalid icmp predicate!" << I;
2679 llvm_unreachable(0);
2682 writeOperandWithCast(I.getOperand(1), I);
2683 if (NeedsClosingParens)
2691 void CWriter::visitFCmpInst(FCmpInst &I) {
2692 if (I.getPredicate() == FCmpInst::FCMP_FALSE) {
2696 if (I.getPredicate() == FCmpInst::FCMP_TRUE) {
2702 switch (I.getPredicate()) {
2703 default: llvm_unreachable("Illegal FCmp predicate");
2704 case FCmpInst::FCMP_ORD: op = "ord"; break;
2705 case FCmpInst::FCMP_UNO: op = "uno"; break;
2706 case FCmpInst::FCMP_UEQ: op = "ueq"; break;
2707 case FCmpInst::FCMP_UNE: op = "une"; break;
2708 case FCmpInst::FCMP_ULT: op = "ult"; break;
2709 case FCmpInst::FCMP_ULE: op = "ule"; break;
2710 case FCmpInst::FCMP_UGT: op = "ugt"; break;
2711 case FCmpInst::FCMP_UGE: op = "uge"; break;
2712 case FCmpInst::FCMP_OEQ: op = "oeq"; break;
2713 case FCmpInst::FCMP_ONE: op = "one"; break;
2714 case FCmpInst::FCMP_OLT: op = "olt"; break;
2715 case FCmpInst::FCMP_OLE: op = "ole"; break;
2716 case FCmpInst::FCMP_OGT: op = "ogt"; break;
2717 case FCmpInst::FCMP_OGE: op = "oge"; break;
2720 Out << "llvm_fcmp_" << op << "(";
2721 // Write the first operand
2722 writeOperand(I.getOperand(0));
2724 // Write the second operand
2725 writeOperand(I.getOperand(1));
2729 static const char * getFloatBitCastField(const Type *Ty) {
2730 switch (Ty->getTypeID()) {
2731 default: llvm_unreachable("Invalid Type");
2732 case Type::FloatTyID: return "Float";
2733 case Type::DoubleTyID: return "Double";
2734 case Type::IntegerTyID: {
2735 unsigned NumBits = cast<IntegerType>(Ty)->getBitWidth();
2744 void CWriter::visitCastInst(CastInst &I) {
2745 const Type *DstTy = I.getType();
2746 const Type *SrcTy = I.getOperand(0)->getType();
2747 if (isFPIntBitCast(I)) {
2749 // These int<->float and long<->double casts need to be handled specially
2750 Out << GetValueName(&I) << "__BITCAST_TEMPORARY."
2751 << getFloatBitCastField(I.getOperand(0)->getType()) << " = ";
2752 writeOperand(I.getOperand(0));
2753 Out << ", " << GetValueName(&I) << "__BITCAST_TEMPORARY."
2754 << getFloatBitCastField(I.getType());
2760 printCast(I.getOpcode(), SrcTy, DstTy);
2762 // Make a sext from i1 work by subtracting the i1 from 0 (an int).
2763 if (SrcTy == Type::getInt1Ty(I.getContext()) &&
2764 I.getOpcode() == Instruction::SExt)
2767 writeOperand(I.getOperand(0));
2769 if (DstTy == Type::getInt1Ty(I.getContext()) &&
2770 (I.getOpcode() == Instruction::Trunc ||
2771 I.getOpcode() == Instruction::FPToUI ||
2772 I.getOpcode() == Instruction::FPToSI ||
2773 I.getOpcode() == Instruction::PtrToInt)) {
2774 // Make sure we really get a trunc to bool by anding the operand with 1
2780 void CWriter::visitSelectInst(SelectInst &I) {
2782 writeOperand(I.getCondition());
2784 writeOperand(I.getTrueValue());
2786 writeOperand(I.getFalseValue());
2791 void CWriter::lowerIntrinsics(Function &F) {
2792 // This is used to keep track of intrinsics that get generated to a lowered
2793 // function. We must generate the prototypes before the function body which
2794 // will only be expanded on first use (by the loop below).
2795 std::vector<Function*> prototypesToGen;
2797 // Examine all the instructions in this function to find the intrinsics that
2798 // need to be lowered.
2799 for (Function::iterator BB = F.begin(), EE = F.end(); BB != EE; ++BB)
2800 for (BasicBlock::iterator I = BB->begin(), E = BB->end(); I != E; )
2801 if (CallInst *CI = dyn_cast<CallInst>(I++))
2802 if (Function *F = CI->getCalledFunction())
2803 switch (F->getIntrinsicID()) {
2804 case Intrinsic::not_intrinsic:
2805 case Intrinsic::memory_barrier:
2806 case Intrinsic::vastart:
2807 case Intrinsic::vacopy:
2808 case Intrinsic::vaend:
2809 case Intrinsic::returnaddress:
2810 case Intrinsic::frameaddress:
2811 case Intrinsic::setjmp:
2812 case Intrinsic::longjmp:
2813 case Intrinsic::prefetch:
2814 case Intrinsic::powi:
2815 case Intrinsic::x86_sse_cmp_ss:
2816 case Intrinsic::x86_sse_cmp_ps:
2817 case Intrinsic::x86_sse2_cmp_sd:
2818 case Intrinsic::x86_sse2_cmp_pd:
2819 case Intrinsic::ppc_altivec_lvsl:
2820 // We directly implement these intrinsics
2823 // If this is an intrinsic that directly corresponds to a GCC
2824 // builtin, we handle it.
2825 const char *BuiltinName = "";
2826 #define GET_GCC_BUILTIN_NAME
2827 #include "llvm/Intrinsics.gen"
2828 #undef GET_GCC_BUILTIN_NAME
2829 // If we handle it, don't lower it.
2830 if (BuiltinName[0]) break;
2832 // All other intrinsic calls we must lower.
2833 Instruction *Before = 0;
2834 if (CI != &BB->front())
2835 Before = prior(BasicBlock::iterator(CI));
2837 IL->LowerIntrinsicCall(CI);
2838 if (Before) { // Move iterator to instruction after call
2843 // If the intrinsic got lowered to another call, and that call has
2844 // a definition then we need to make sure its prototype is emitted
2845 // before any calls to it.
2846 if (CallInst *Call = dyn_cast<CallInst>(I))
2847 if (Function *NewF = Call->getCalledFunction())
2848 if (!NewF->isDeclaration())
2849 prototypesToGen.push_back(NewF);
2854 // We may have collected some prototypes to emit in the loop above.
2855 // Emit them now, before the function that uses them is emitted. But,
2856 // be careful not to emit them twice.
2857 std::vector<Function*>::iterator I = prototypesToGen.begin();
2858 std::vector<Function*>::iterator E = prototypesToGen.end();
2859 for ( ; I != E; ++I) {
2860 if (intrinsicPrototypesAlreadyGenerated.insert(*I).second) {
2862 printFunctionSignature(*I, true);
2868 void CWriter::visitCallInst(CallInst &I) {
2869 if (isa<InlineAsm>(I.getCalledValue()))
2870 return visitInlineAsm(I);
2872 bool WroteCallee = false;
2874 // Handle intrinsic function calls first...
2875 if (Function *F = I.getCalledFunction())
2876 if (Intrinsic::ID ID = (Intrinsic::ID)F->getIntrinsicID())
2877 if (visitBuiltinCall(I, ID, WroteCallee))
2880 Value *Callee = I.getCalledValue();
2882 const PointerType *PTy = cast<PointerType>(Callee->getType());
2883 const FunctionType *FTy = cast<FunctionType>(PTy->getElementType());
2885 // If this is a call to a struct-return function, assign to the first
2886 // parameter instead of passing it to the call.
2887 const AttrListPtr &PAL = I.getAttributes();
2888 bool hasByVal = I.hasByValArgument();
2889 bool isStructRet = I.hasStructRetAttr();
2891 writeOperandDeref(I.getArgOperand(0));
2895 if (I.isTailCall()) Out << " /*tail*/ ";
2898 // If this is an indirect call to a struct return function, we need to cast
2899 // the pointer. Ditto for indirect calls with byval arguments.
2900 bool NeedsCast = (hasByVal || isStructRet) && !isa<Function>(Callee);
2902 // GCC is a real PITA. It does not permit codegening casts of functions to
2903 // function pointers if they are in a call (it generates a trap instruction
2904 // instead!). We work around this by inserting a cast to void* in between
2905 // the function and the function pointer cast. Unfortunately, we can't just
2906 // form the constant expression here, because the folder will immediately
2909 // Note finally, that this is completely unsafe. ANSI C does not guarantee
2910 // that void* and function pointers have the same size. :( To deal with this
2911 // in the common case, we handle casts where the number of arguments passed
2914 if (ConstantExpr *CE = dyn_cast<ConstantExpr>(Callee))
2916 if (Function *RF = dyn_cast<Function>(CE->getOperand(0))) {
2922 // Ok, just cast the pointer type.
2925 printStructReturnPointerFunctionType(Out, PAL,
2926 cast<PointerType>(I.getCalledValue()->getType()));
2928 printType(Out, I.getCalledValue()->getType(), false, "", true, PAL);
2930 printType(Out, I.getCalledValue()->getType());
2933 writeOperand(Callee);
2934 if (NeedsCast) Out << ')';
2939 bool PrintedArg = false;
2940 if(FTy->isVarArg() && !FTy->getNumParams()) {
2941 Out << "0 /*dummy arg*/";
2945 unsigned NumDeclaredParams = FTy->getNumParams();
2947 CallSite::arg_iterator AI = CS.arg_begin(), AE = CS.arg_end();
2949 if (isStructRet) { // Skip struct return argument.
2955 for (; AI != AE; ++AI, ++ArgNo) {
2956 if (PrintedArg) Out << ", ";
2957 if (ArgNo < NumDeclaredParams &&
2958 (*AI)->getType() != FTy->getParamType(ArgNo)) {
2960 printType(Out, FTy->getParamType(ArgNo),
2961 /*isSigned=*/PAL.paramHasAttr(ArgNo+1, Attribute::SExt));
2964 // Check if the argument is expected to be passed by value.
2965 if (I.paramHasAttr(ArgNo+1, Attribute::ByVal))
2966 writeOperandDeref(*AI);
2974 /// visitBuiltinCall - Handle the call to the specified builtin. Returns true
2975 /// if the entire call is handled, return false if it wasn't handled, and
2976 /// optionally set 'WroteCallee' if the callee has already been printed out.
2977 bool CWriter::visitBuiltinCall(CallInst &I, Intrinsic::ID ID,
2978 bool &WroteCallee) {
2981 // If this is an intrinsic that directly corresponds to a GCC
2982 // builtin, we emit it here.
2983 const char *BuiltinName = "";
2984 Function *F = I.getCalledFunction();
2985 #define GET_GCC_BUILTIN_NAME
2986 #include "llvm/Intrinsics.gen"
2987 #undef GET_GCC_BUILTIN_NAME
2988 assert(BuiltinName[0] && "Unknown LLVM intrinsic!");
2994 case Intrinsic::memory_barrier:
2995 Out << "__sync_synchronize()";
2997 case Intrinsic::vastart:
3000 Out << "va_start(*(va_list*)";
3001 writeOperand(I.getArgOperand(0));
3003 // Output the last argument to the enclosing function.
3004 if (I.getParent()->getParent()->arg_empty())
3005 Out << "vararg_dummy_arg";
3007 writeOperand(--I.getParent()->getParent()->arg_end());
3010 case Intrinsic::vaend:
3011 if (!isa<ConstantPointerNull>(I.getArgOperand(0))) {
3012 Out << "0; va_end(*(va_list*)";
3013 writeOperand(I.getArgOperand(0));
3016 Out << "va_end(*(va_list*)0)";
3019 case Intrinsic::vacopy:
3021 Out << "va_copy(*(va_list*)";
3022 writeOperand(I.getArgOperand(0));
3023 Out << ", *(va_list*)";
3024 writeOperand(I.getArgOperand(1));
3027 case Intrinsic::returnaddress:
3028 Out << "__builtin_return_address(";
3029 writeOperand(I.getArgOperand(0));
3032 case Intrinsic::frameaddress:
3033 Out << "__builtin_frame_address(";
3034 writeOperand(I.getArgOperand(0));
3037 case Intrinsic::powi:
3038 Out << "__builtin_powi(";
3039 writeOperand(I.getArgOperand(0));
3041 writeOperand(I.getArgOperand(1));
3044 case Intrinsic::setjmp:
3045 Out << "setjmp(*(jmp_buf*)";
3046 writeOperand(I.getArgOperand(0));
3049 case Intrinsic::longjmp:
3050 Out << "longjmp(*(jmp_buf*)";
3051 writeOperand(I.getArgOperand(0));
3053 writeOperand(I.getArgOperand(1));
3056 case Intrinsic::prefetch:
3057 Out << "LLVM_PREFETCH((const void *)";
3058 writeOperand(I.getArgOperand(0));
3060 writeOperand(I.getArgOperand(1));
3062 writeOperand(I.getArgOperand(2));
3065 case Intrinsic::stacksave:
3066 // Emit this as: Val = 0; *((void**)&Val) = __builtin_stack_save()
3067 // to work around GCC bugs (see PR1809).
3068 Out << "0; *((void**)&" << GetValueName(&I)
3069 << ") = __builtin_stack_save()";
3071 case Intrinsic::x86_sse_cmp_ss:
3072 case Intrinsic::x86_sse_cmp_ps:
3073 case Intrinsic::x86_sse2_cmp_sd:
3074 case Intrinsic::x86_sse2_cmp_pd:
3076 printType(Out, I.getType());
3078 // Multiple GCC builtins multiplex onto this intrinsic.
3079 switch (cast<ConstantInt>(I.getArgOperand(2))->getZExtValue()) {
3080 default: llvm_unreachable("Invalid llvm.x86.sse.cmp!");
3081 case 0: Out << "__builtin_ia32_cmpeq"; break;
3082 case 1: Out << "__builtin_ia32_cmplt"; break;
3083 case 2: Out << "__builtin_ia32_cmple"; break;
3084 case 3: Out << "__builtin_ia32_cmpunord"; break;
3085 case 4: Out << "__builtin_ia32_cmpneq"; break;
3086 case 5: Out << "__builtin_ia32_cmpnlt"; break;
3087 case 6: Out << "__builtin_ia32_cmpnle"; break;
3088 case 7: Out << "__builtin_ia32_cmpord"; break;
3090 if (ID == Intrinsic::x86_sse_cmp_ps || ID == Intrinsic::x86_sse2_cmp_pd)
3094 if (ID == Intrinsic::x86_sse_cmp_ss || ID == Intrinsic::x86_sse_cmp_ps)
3100 writeOperand(I.getArgOperand(0));
3102 writeOperand(I.getArgOperand(1));
3105 case Intrinsic::ppc_altivec_lvsl:
3107 printType(Out, I.getType());
3109 Out << "__builtin_altivec_lvsl(0, (void*)";
3110 writeOperand(I.getArgOperand(0));
3116 //This converts the llvm constraint string to something gcc is expecting.
3117 //TODO: work out platform independent constraints and factor those out
3118 // of the per target tables
3119 // handle multiple constraint codes
3120 std::string CWriter::InterpretASMConstraint(InlineAsm::ConstraintInfo& c) {
3121 assert(c.Codes.size() == 1 && "Too many asm constraint codes to handle");
3123 // Grab the translation table from MCAsmInfo if it exists.
3124 const MCAsmInfo *TargetAsm;
3125 std::string Triple = TheModule->getTargetTriple();
3127 Triple = llvm::sys::getHostTriple();
3130 if (const Target *Match = TargetRegistry::lookupTarget(Triple, E))
3131 TargetAsm = Match->createAsmInfo(Triple);
3135 const char *const *table = TargetAsm->getAsmCBE();
3137 // Search the translation table if it exists.
3138 for (int i = 0; table && table[i]; i += 2)
3139 if (c.Codes[0] == table[i]) {
3144 // Default is identity.
3149 //TODO: import logic from AsmPrinter.cpp
3150 static std::string gccifyAsm(std::string asmstr) {
3151 for (std::string::size_type i = 0; i != asmstr.size(); ++i)
3152 if (asmstr[i] == '\n')
3153 asmstr.replace(i, 1, "\\n");
3154 else if (asmstr[i] == '\t')
3155 asmstr.replace(i, 1, "\\t");
3156 else if (asmstr[i] == '$') {
3157 if (asmstr[i + 1] == '{') {
3158 std::string::size_type a = asmstr.find_first_of(':', i + 1);
3159 std::string::size_type b = asmstr.find_first_of('}', i + 1);
3160 std::string n = "%" +
3161 asmstr.substr(a + 1, b - a - 1) +
3162 asmstr.substr(i + 2, a - i - 2);
3163 asmstr.replace(i, b - i + 1, n);
3166 asmstr.replace(i, 1, "%");
3168 else if (asmstr[i] == '%')//grr
3169 { asmstr.replace(i, 1, "%%"); ++i;}
3174 //TODO: assumptions about what consume arguments from the call are likely wrong
3175 // handle communitivity
3176 void CWriter::visitInlineAsm(CallInst &CI) {
3177 InlineAsm* as = cast<InlineAsm>(CI.getCalledValue());
3178 InlineAsm::ConstraintInfoVector Constraints = as->ParseConstraints();
3180 std::vector<std::pair<Value*, int> > ResultVals;
3181 if (CI.getType() == Type::getVoidTy(CI.getContext()))
3183 else if (const StructType *ST = dyn_cast<StructType>(CI.getType())) {
3184 for (unsigned i = 0, e = ST->getNumElements(); i != e; ++i)
3185 ResultVals.push_back(std::make_pair(&CI, (int)i));
3187 ResultVals.push_back(std::make_pair(&CI, -1));
3190 // Fix up the asm string for gcc and emit it.
3191 Out << "__asm__ volatile (\"" << gccifyAsm(as->getAsmString()) << "\"\n";
3194 unsigned ValueCount = 0;
3195 bool IsFirst = true;
3197 // Convert over all the output constraints.
3198 for (InlineAsm::ConstraintInfoVector::iterator I = Constraints.begin(),
3199 E = Constraints.end(); I != E; ++I) {
3201 if (I->Type != InlineAsm::isOutput) {
3203 continue; // Ignore non-output constraints.
3206 assert(I->Codes.size() == 1 && "Too many asm constraint codes to handle");
3207 std::string C = InterpretASMConstraint(*I);
3208 if (C.empty()) continue;
3219 if (ValueCount < ResultVals.size()) {
3220 DestVal = ResultVals[ValueCount].first;
3221 DestValNo = ResultVals[ValueCount].second;
3223 DestVal = CI.getArgOperand(ValueCount-ResultVals.size());
3225 if (I->isEarlyClobber)
3228 Out << "\"=" << C << "\"(" << GetValueName(DestVal);
3229 if (DestValNo != -1)
3230 Out << ".field" << DestValNo; // Multiple retvals.
3236 // Convert over all the input constraints.
3240 for (InlineAsm::ConstraintInfoVector::iterator I = Constraints.begin(),
3241 E = Constraints.end(); I != E; ++I) {
3242 if (I->Type != InlineAsm::isInput) {
3244 continue; // Ignore non-input constraints.
3247 assert(I->Codes.size() == 1 && "Too many asm constraint codes to handle");
3248 std::string C = InterpretASMConstraint(*I);
3249 if (C.empty()) continue;
3256 assert(ValueCount >= ResultVals.size() && "Input can't refer to result");
3257 Value *SrcVal = CI.getArgOperand(ValueCount-ResultVals.size());
3259 Out << "\"" << C << "\"(";
3261 writeOperand(SrcVal);
3263 writeOperandDeref(SrcVal);
3267 // Convert over the clobber constraints.
3269 for (InlineAsm::ConstraintInfoVector::iterator I = Constraints.begin(),
3270 E = Constraints.end(); I != E; ++I) {
3271 if (I->Type != InlineAsm::isClobber)
3272 continue; // Ignore non-input constraints.
3274 assert(I->Codes.size() == 1 && "Too many asm constraint codes to handle");
3275 std::string C = InterpretASMConstraint(*I);
3276 if (C.empty()) continue;
3283 Out << '\"' << C << '"';
3289 void CWriter::visitAllocaInst(AllocaInst &I) {
3291 printType(Out, I.getType());
3292 Out << ") alloca(sizeof(";
3293 printType(Out, I.getType()->getElementType());
3295 if (I.isArrayAllocation()) {
3297 writeOperand(I.getOperand(0));
3302 void CWriter::printGEPExpression(Value *Ptr, gep_type_iterator I,
3303 gep_type_iterator E, bool Static) {
3305 // If there are no indices, just print out the pointer.
3311 // Find out if the last index is into a vector. If so, we have to print this
3312 // specially. Since vectors can't have elements of indexable type, only the
3313 // last index could possibly be of a vector element.
3314 const VectorType *LastIndexIsVector = 0;
3316 for (gep_type_iterator TmpI = I; TmpI != E; ++TmpI)
3317 LastIndexIsVector = dyn_cast<VectorType>(*TmpI);
3322 // If the last index is into a vector, we can't print it as &a[i][j] because
3323 // we can't index into a vector with j in GCC. Instead, emit this as
3324 // (((float*)&a[i])+j)
3325 if (LastIndexIsVector) {
3327 printType(Out, PointerType::getUnqual(LastIndexIsVector->getElementType()));
3333 // If the first index is 0 (very typical) we can do a number of
3334 // simplifications to clean up the code.
3335 Value *FirstOp = I.getOperand();
3336 if (!isa<Constant>(FirstOp) || !cast<Constant>(FirstOp)->isNullValue()) {
3337 // First index isn't simple, print it the hard way.
3340 ++I; // Skip the zero index.
3342 // Okay, emit the first operand. If Ptr is something that is already address
3343 // exposed, like a global, avoid emitting (&foo)[0], just emit foo instead.
3344 if (isAddressExposed(Ptr)) {
3345 writeOperandInternal(Ptr, Static);
3346 } else if (I != E && (*I)->isStructTy()) {
3347 // If we didn't already emit the first operand, see if we can print it as
3348 // P->f instead of "P[0].f"
3350 Out << "->field" << cast<ConstantInt>(I.getOperand())->getZExtValue();
3351 ++I; // eat the struct index as well.
3353 // Instead of emitting P[0][1], emit (*P)[1], which is more idiomatic.
3360 for (; I != E; ++I) {
3361 if ((*I)->isStructTy()) {
3362 Out << ".field" << cast<ConstantInt>(I.getOperand())->getZExtValue();
3363 } else if ((*I)->isArrayTy()) {
3365 writeOperandWithCast(I.getOperand(), Instruction::GetElementPtr);
3367 } else if (!(*I)->isVectorTy()) {
3369 writeOperandWithCast(I.getOperand(), Instruction::GetElementPtr);
3372 // If the last index is into a vector, then print it out as "+j)". This
3373 // works with the 'LastIndexIsVector' code above.
3374 if (isa<Constant>(I.getOperand()) &&
3375 cast<Constant>(I.getOperand())->isNullValue()) {
3376 Out << "))"; // avoid "+0".
3379 writeOperandWithCast(I.getOperand(), Instruction::GetElementPtr);
3387 void CWriter::writeMemoryAccess(Value *Operand, const Type *OperandType,
3388 bool IsVolatile, unsigned Alignment) {
3390 bool IsUnaligned = Alignment &&
3391 Alignment < TD->getABITypeAlignment(OperandType);
3395 if (IsVolatile || IsUnaligned) {
3398 Out << "struct __attribute__ ((packed, aligned(" << Alignment << "))) {";
3399 printType(Out, OperandType, false, IsUnaligned ? "data" : "volatile*");
3402 if (IsVolatile) Out << "volatile ";
3408 writeOperand(Operand);
3410 if (IsVolatile || IsUnaligned) {
3417 void CWriter::visitLoadInst(LoadInst &I) {
3418 writeMemoryAccess(I.getOperand(0), I.getType(), I.isVolatile(),
3423 void CWriter::visitStoreInst(StoreInst &I) {
3424 writeMemoryAccess(I.getPointerOperand(), I.getOperand(0)->getType(),
3425 I.isVolatile(), I.getAlignment());
3427 Value *Operand = I.getOperand(0);
3428 Constant *BitMask = 0;
3429 if (const IntegerType* ITy = dyn_cast<IntegerType>(Operand->getType()))
3430 if (!ITy->isPowerOf2ByteWidth())
3431 // We have a bit width that doesn't match an even power-of-2 byte
3432 // size. Consequently we must & the value with the type's bit mask
3433 BitMask = ConstantInt::get(ITy, ITy->getBitMask());
3436 writeOperand(Operand);
3439 printConstant(BitMask, false);
3444 void CWriter::visitGetElementPtrInst(GetElementPtrInst &I) {
3445 printGEPExpression(I.getPointerOperand(), gep_type_begin(I),
3446 gep_type_end(I), false);
3449 void CWriter::visitVAArgInst(VAArgInst &I) {
3450 Out << "va_arg(*(va_list*)";
3451 writeOperand(I.getOperand(0));
3453 printType(Out, I.getType());
3457 void CWriter::visitInsertElementInst(InsertElementInst &I) {
3458 const Type *EltTy = I.getType()->getElementType();
3459 writeOperand(I.getOperand(0));
3462 printType(Out, PointerType::getUnqual(EltTy));
3463 Out << ")(&" << GetValueName(&I) << "))[";
3464 writeOperand(I.getOperand(2));
3466 writeOperand(I.getOperand(1));
3470 void CWriter::visitExtractElementInst(ExtractElementInst &I) {
3471 // We know that our operand is not inlined.
3474 cast<VectorType>(I.getOperand(0)->getType())->getElementType();
3475 printType(Out, PointerType::getUnqual(EltTy));
3476 Out << ")(&" << GetValueName(I.getOperand(0)) << "))[";
3477 writeOperand(I.getOperand(1));
3481 void CWriter::visitShuffleVectorInst(ShuffleVectorInst &SVI) {
3483 printType(Out, SVI.getType());
3485 const VectorType *VT = SVI.getType();
3486 unsigned NumElts = VT->getNumElements();
3487 const Type *EltTy = VT->getElementType();
3489 for (unsigned i = 0; i != NumElts; ++i) {
3491 int SrcVal = SVI.getMaskValue(i);
3492 if ((unsigned)SrcVal >= NumElts*2) {
3493 Out << " 0/*undef*/ ";
3495 Value *Op = SVI.getOperand((unsigned)SrcVal >= NumElts);
3496 if (isa<Instruction>(Op)) {
3497 // Do an extractelement of this value from the appropriate input.
3499 printType(Out, PointerType::getUnqual(EltTy));
3500 Out << ")(&" << GetValueName(Op)
3501 << "))[" << (SrcVal & (NumElts-1)) << "]";
3502 } else if (isa<ConstantAggregateZero>(Op) || isa<UndefValue>(Op)) {
3505 printConstant(cast<ConstantVector>(Op)->getOperand(SrcVal &
3514 void CWriter::visitInsertValueInst(InsertValueInst &IVI) {
3515 // Start by copying the entire aggregate value into the result variable.
3516 writeOperand(IVI.getOperand(0));
3519 // Then do the insert to update the field.
3520 Out << GetValueName(&IVI);
3521 for (const unsigned *b = IVI.idx_begin(), *i = b, *e = IVI.idx_end();
3523 const Type *IndexedTy =
3524 ExtractValueInst::getIndexedType(IVI.getOperand(0)->getType(), b, i+1);
3525 if (IndexedTy->isArrayTy())
3526 Out << ".array[" << *i << "]";
3528 Out << ".field" << *i;
3531 writeOperand(IVI.getOperand(1));
3534 void CWriter::visitExtractValueInst(ExtractValueInst &EVI) {
3536 if (isa<UndefValue>(EVI.getOperand(0))) {
3538 printType(Out, EVI.getType());
3539 Out << ") 0/*UNDEF*/";
3541 Out << GetValueName(EVI.getOperand(0));
3542 for (const unsigned *b = EVI.idx_begin(), *i = b, *e = EVI.idx_end();
3544 const Type *IndexedTy =
3545 ExtractValueInst::getIndexedType(EVI.getOperand(0)->getType(), b, i+1);
3546 if (IndexedTy->isArrayTy())
3547 Out << ".array[" << *i << "]";
3549 Out << ".field" << *i;
3555 //===----------------------------------------------------------------------===//
3556 // External Interface declaration
3557 //===----------------------------------------------------------------------===//
3559 bool CTargetMachine::addPassesToEmitFile(PassManagerBase &PM,
3560 formatted_raw_ostream &o,
3561 CodeGenFileType FileType,
3562 CodeGenOpt::Level OptLevel,
3563 bool DisableVerify) {
3564 if (FileType != TargetMachine::CGFT_AssemblyFile) return true;
3566 PM.add(createGCLoweringPass());
3567 PM.add(createLowerInvokePass());
3568 PM.add(createCFGSimplificationPass()); // clean up after lower invoke.
3569 PM.add(new CBackendNameAllUsedStructsAndMergeFunctions());
3570 PM.add(new CWriter(o));
3571 PM.add(createGCInfoDeleter());