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/System/Host.h"
51 #include "llvm/Config/config.h"
55 extern "C" void LLVMInitializeCBackendTarget() {
56 // Register the target.
57 RegisterTargetMachine<CTargetMachine> X(TheCBackendTarget);
61 class CBEMCAsmInfo : public MCAsmInfo {
65 PrivateGlobalPrefix = "";
68 /// CBackendNameAllUsedStructsAndMergeFunctions - This pass inserts names for
69 /// any unnamed structure types that are used by the program, and merges
70 /// external functions with the same name.
72 class CBackendNameAllUsedStructsAndMergeFunctions : public ModulePass {
75 CBackendNameAllUsedStructsAndMergeFunctions()
77 void getAnalysisUsage(AnalysisUsage &AU) const {
78 AU.addRequired<FindUsedTypes>();
81 virtual const char *getPassName() const {
82 return "C backend type canonicalizer";
85 virtual bool runOnModule(Module &M);
88 char CBackendNameAllUsedStructsAndMergeFunctions::ID = 0;
90 /// CWriter - This class is the main chunk of code that converts an LLVM
91 /// module to a C translation unit.
92 class CWriter : public FunctionPass, public InstVisitor<CWriter> {
93 formatted_raw_ostream &Out;
94 IntrinsicLowering *IL;
97 const Module *TheModule;
98 const MCAsmInfo* TAsm;
100 const TargetData* TD;
101 std::map<const Type *, std::string> TypeNames;
102 std::map<const ConstantFP *, unsigned> FPConstantMap;
103 std::set<Function*> intrinsicPrototypesAlreadyGenerated;
104 std::set<const Argument*> ByValParams;
106 unsigned OpaqueCounter;
107 DenseMap<const Value*, unsigned> AnonValueNumbers;
108 unsigned NextAnonValueNumber;
112 explicit CWriter(formatted_raw_ostream &o)
113 : FunctionPass(&ID), Out(o), IL(0), Mang(0), LI(0),
114 TheModule(0), TAsm(0), TCtx(0), TD(0), OpaqueCounter(0),
115 NextAnonValueNumber(0) {
119 virtual const char *getPassName() const { return "C backend"; }
121 void getAnalysisUsage(AnalysisUsage &AU) const {
122 AU.addRequired<LoopInfo>();
123 AU.setPreservesAll();
126 virtual bool doInitialization(Module &M);
128 bool runOnFunction(Function &F) {
129 // Do not codegen any 'available_externally' functions at all, they have
130 // definitions outside the translation unit.
131 if (F.hasAvailableExternallyLinkage())
134 LI = &getAnalysis<LoopInfo>();
136 // Get rid of intrinsics we can't handle.
139 // Output all floating point constants that cannot be printed accurately.
140 printFloatingPointConstants(F);
146 virtual bool doFinalization(Module &M) {
153 FPConstantMap.clear();
156 intrinsicPrototypesAlreadyGenerated.clear();
160 raw_ostream &printType(raw_ostream &Out, const Type *Ty,
161 bool isSigned = false,
162 const std::string &VariableName = "",
163 bool IgnoreName = false,
164 const AttrListPtr &PAL = AttrListPtr());
165 raw_ostream &printSimpleType(raw_ostream &Out, const Type *Ty,
167 const std::string &NameSoFar = "");
169 void printStructReturnPointerFunctionType(raw_ostream &Out,
170 const AttrListPtr &PAL,
171 const PointerType *Ty);
173 /// writeOperandDeref - Print the result of dereferencing the specified
174 /// operand with '*'. This is equivalent to printing '*' then using
175 /// writeOperand, but avoids excess syntax in some cases.
176 void writeOperandDeref(Value *Operand) {
177 if (isAddressExposed(Operand)) {
178 // Already something with an address exposed.
179 writeOperandInternal(Operand);
182 writeOperand(Operand);
187 void writeOperand(Value *Operand, bool Static = false);
188 void writeInstComputationInline(Instruction &I);
189 void writeOperandInternal(Value *Operand, bool Static = false);
190 void writeOperandWithCast(Value* Operand, unsigned Opcode);
191 void writeOperandWithCast(Value* Operand, const ICmpInst &I);
192 bool writeInstructionCast(const Instruction &I);
194 void writeMemoryAccess(Value *Operand, const Type *OperandType,
195 bool IsVolatile, unsigned Alignment);
198 std::string InterpretASMConstraint(InlineAsm::ConstraintInfo& c);
200 void lowerIntrinsics(Function &F);
202 void printModule(Module *M);
203 void printModuleTypes(const TypeSymbolTable &ST);
204 void printContainedStructs(const Type *Ty, std::set<const Type *> &);
205 void printFloatingPointConstants(Function &F);
206 void printFloatingPointConstants(const Constant *C);
207 void printFunctionSignature(const Function *F, bool Prototype);
209 void printFunction(Function &);
210 void printBasicBlock(BasicBlock *BB);
211 void printLoop(Loop *L);
213 void printCast(unsigned opcode, const Type *SrcTy, const Type *DstTy);
214 void printConstant(Constant *CPV, bool Static);
215 void printConstantWithCast(Constant *CPV, unsigned Opcode);
216 bool printConstExprCast(const ConstantExpr *CE, bool Static);
217 void printConstantArray(ConstantArray *CPA, bool Static);
218 void printConstantVector(ConstantVector *CV, bool Static);
220 /// isAddressExposed - Return true if the specified value's name needs to
221 /// have its address taken in order to get a C value of the correct type.
222 /// This happens for global variables, byval parameters, and direct allocas.
223 bool isAddressExposed(const Value *V) const {
224 if (const Argument *A = dyn_cast<Argument>(V))
225 return ByValParams.count(A);
226 return isa<GlobalVariable>(V) || isDirectAlloca(V);
229 // isInlinableInst - Attempt to inline instructions into their uses to build
230 // trees as much as possible. To do this, we have to consistently decide
231 // what is acceptable to inline, so that variable declarations don't get
232 // printed and an extra copy of the expr is not emitted.
234 static bool isInlinableInst(const Instruction &I) {
235 // Always inline cmp instructions, even if they are shared by multiple
236 // expressions. GCC generates horrible code if we don't.
240 // Must be an expression, must be used exactly once. If it is dead, we
241 // emit it inline where it would go.
242 if (I.getType() == Type::getVoidTy(I.getContext()) || !I.hasOneUse() ||
243 isa<TerminatorInst>(I) || isa<CallInst>(I) || isa<PHINode>(I) ||
244 isa<LoadInst>(I) || isa<VAArgInst>(I) || isa<InsertElementInst>(I) ||
245 isa<InsertValueInst>(I))
246 // Don't inline a load across a store or other bad things!
249 // Must not be used in inline asm, extractelement, or shufflevector.
251 const Instruction &User = cast<Instruction>(*I.use_back());
252 if (isInlineAsm(User) || isa<ExtractElementInst>(User) ||
253 isa<ShuffleVectorInst>(User))
257 // Only inline instruction it if it's use is in the same BB as the inst.
258 return I.getParent() == cast<Instruction>(I.use_back())->getParent();
261 // isDirectAlloca - Define fixed sized allocas in the entry block as direct
262 // variables which are accessed with the & operator. This causes GCC to
263 // generate significantly better code than to emit alloca calls directly.
265 static const AllocaInst *isDirectAlloca(const Value *V) {
266 const AllocaInst *AI = dyn_cast<AllocaInst>(V);
268 if (AI->isArrayAllocation())
269 return 0; // FIXME: we can also inline fixed size array allocas!
270 if (AI->getParent() != &AI->getParent()->getParent()->getEntryBlock())
275 // isInlineAsm - Check if the instruction is a call to an inline asm chunk
276 static bool isInlineAsm(const Instruction& I) {
277 if (const CallInst *CI = dyn_cast<CallInst>(&I))
278 return isa<InlineAsm>(CI->getCalledValue());
282 // Instruction visitation functions
283 friend class InstVisitor<CWriter>;
285 void visitReturnInst(ReturnInst &I);
286 void visitBranchInst(BranchInst &I);
287 void visitSwitchInst(SwitchInst &I);
288 void visitIndirectBrInst(IndirectBrInst &I);
289 void visitInvokeInst(InvokeInst &I) {
290 llvm_unreachable("Lowerinvoke pass didn't work!");
293 void visitUnwindInst(UnwindInst &I) {
294 llvm_unreachable("Lowerinvoke pass didn't work!");
296 void visitUnreachableInst(UnreachableInst &I);
298 void visitPHINode(PHINode &I);
299 void visitBinaryOperator(Instruction &I);
300 void visitICmpInst(ICmpInst &I);
301 void visitFCmpInst(FCmpInst &I);
303 void visitCastInst (CastInst &I);
304 void visitSelectInst(SelectInst &I);
305 void visitCallInst (CallInst &I);
306 void visitInlineAsm(CallInst &I);
307 bool visitBuiltinCall(CallInst &I, Intrinsic::ID ID, bool &WroteCallee);
309 void visitAllocaInst(AllocaInst &I);
310 void visitLoadInst (LoadInst &I);
311 void visitStoreInst (StoreInst &I);
312 void visitGetElementPtrInst(GetElementPtrInst &I);
313 void visitVAArgInst (VAArgInst &I);
315 void visitInsertElementInst(InsertElementInst &I);
316 void visitExtractElementInst(ExtractElementInst &I);
317 void visitShuffleVectorInst(ShuffleVectorInst &SVI);
319 void visitInsertValueInst(InsertValueInst &I);
320 void visitExtractValueInst(ExtractValueInst &I);
322 void visitInstruction(Instruction &I) {
324 errs() << "C Writer does not know about " << I;
329 void outputLValue(Instruction *I) {
330 Out << " " << GetValueName(I) << " = ";
333 bool isGotoCodeNecessary(BasicBlock *From, BasicBlock *To);
334 void printPHICopiesForSuccessor(BasicBlock *CurBlock,
335 BasicBlock *Successor, unsigned Indent);
336 void printBranchToBlock(BasicBlock *CurBlock, BasicBlock *SuccBlock,
338 void printGEPExpression(Value *Ptr, gep_type_iterator I,
339 gep_type_iterator E, bool Static);
341 std::string GetValueName(const Value *Operand);
345 char CWriter::ID = 0;
348 static std::string CBEMangle(const std::string &S) {
351 for (unsigned i = 0, e = S.size(); i != e; ++i)
352 if (isalnum(S[i]) || S[i] == '_') {
356 Result += 'A'+(S[i]&15);
357 Result += 'A'+((S[i]>>4)&15);
364 /// This method inserts names for any unnamed structure types that are used by
365 /// the program, and removes names from structure types that are not used by the
368 bool CBackendNameAllUsedStructsAndMergeFunctions::runOnModule(Module &M) {
369 // Get a set of types that are used by the program...
370 std::set<const Type *> UT = getAnalysis<FindUsedTypes>().getTypes();
372 // Loop over the module symbol table, removing types from UT that are
373 // already named, and removing names for types that are not used.
375 TypeSymbolTable &TST = M.getTypeSymbolTable();
376 for (TypeSymbolTable::iterator TI = TST.begin(), TE = TST.end();
378 TypeSymbolTable::iterator I = TI++;
380 // If this isn't a struct or array type, remove it from our set of types
381 // to name. This simplifies emission later.
382 if (!I->second->isStructTy() && !I->second->isOpaqueTy() &&
383 !I->second->isArrayTy()) {
386 // If this is not used, remove it from the symbol table.
387 std::set<const Type *>::iterator UTI = UT.find(I->second);
391 UT.erase(UTI); // Only keep one name for this type.
395 // UT now contains types that are not named. Loop over it, naming
398 bool Changed = false;
399 unsigned RenameCounter = 0;
400 for (std::set<const Type *>::const_iterator I = UT.begin(), E = UT.end();
402 if ((*I)->isStructTy() || (*I)->isArrayTy()) {
403 while (M.addTypeName("unnamed"+utostr(RenameCounter), *I))
409 // Loop over all external functions and globals. If we have two with
410 // identical names, merge them.
411 // FIXME: This code should disappear when we don't allow values with the same
412 // names when they have different types!
413 std::map<std::string, GlobalValue*> ExtSymbols;
414 for (Module::iterator I = M.begin(), E = M.end(); I != E;) {
416 if (GV->isDeclaration() && GV->hasName()) {
417 std::pair<std::map<std::string, GlobalValue*>::iterator, bool> X
418 = ExtSymbols.insert(std::make_pair(GV->getName(), GV));
420 // Found a conflict, replace this global with the previous one.
421 GlobalValue *OldGV = X.first->second;
422 GV->replaceAllUsesWith(ConstantExpr::getBitCast(OldGV, GV->getType()));
423 GV->eraseFromParent();
428 // Do the same for globals.
429 for (Module::global_iterator I = M.global_begin(), E = M.global_end();
431 GlobalVariable *GV = I++;
432 if (GV->isDeclaration() && GV->hasName()) {
433 std::pair<std::map<std::string, GlobalValue*>::iterator, bool> X
434 = ExtSymbols.insert(std::make_pair(GV->getName(), GV));
436 // Found a conflict, replace this global with the previous one.
437 GlobalValue *OldGV = X.first->second;
438 GV->replaceAllUsesWith(ConstantExpr::getBitCast(OldGV, GV->getType()));
439 GV->eraseFromParent();
448 /// printStructReturnPointerFunctionType - This is like printType for a struct
449 /// return type, except, instead of printing the type as void (*)(Struct*, ...)
450 /// print it as "Struct (*)(...)", for struct return functions.
451 void CWriter::printStructReturnPointerFunctionType(raw_ostream &Out,
452 const AttrListPtr &PAL,
453 const PointerType *TheTy) {
454 const FunctionType *FTy = cast<FunctionType>(TheTy->getElementType());
456 raw_string_ostream FunctionInnards(tstr);
457 FunctionInnards << " (*) (";
458 bool PrintedType = false;
460 FunctionType::param_iterator I = FTy->param_begin(), E = FTy->param_end();
461 const Type *RetTy = cast<PointerType>(I->get())->getElementType();
463 for (++I, ++Idx; I != E; ++I, ++Idx) {
465 FunctionInnards << ", ";
466 const Type *ArgTy = *I;
467 if (PAL.paramHasAttr(Idx, Attribute::ByVal)) {
468 assert(ArgTy->isPointerTy());
469 ArgTy = cast<PointerType>(ArgTy)->getElementType();
471 printType(FunctionInnards, ArgTy,
472 /*isSigned=*/PAL.paramHasAttr(Idx, Attribute::SExt), "");
475 if (FTy->isVarArg()) {
477 FunctionInnards << " int"; //dummy argument for empty vararg functs
478 FunctionInnards << ", ...";
479 } else if (!PrintedType) {
480 FunctionInnards << "void";
482 FunctionInnards << ')';
483 printType(Out, RetTy,
484 /*isSigned=*/PAL.paramHasAttr(0, Attribute::SExt), FunctionInnards.str());
488 CWriter::printSimpleType(raw_ostream &Out, const Type *Ty, bool isSigned,
489 const std::string &NameSoFar) {
490 assert((Ty->isPrimitiveType() || Ty->isIntegerTy() || Ty->isVectorTy()) &&
491 "Invalid type for printSimpleType");
492 switch (Ty->getTypeID()) {
493 case Type::VoidTyID: return Out << "void " << NameSoFar;
494 case Type::IntegerTyID: {
495 unsigned NumBits = cast<IntegerType>(Ty)->getBitWidth();
497 return Out << "bool " << NameSoFar;
498 else if (NumBits <= 8)
499 return Out << (isSigned?"signed":"unsigned") << " char " << NameSoFar;
500 else if (NumBits <= 16)
501 return Out << (isSigned?"signed":"unsigned") << " short " << NameSoFar;
502 else if (NumBits <= 32)
503 return Out << (isSigned?"signed":"unsigned") << " int " << NameSoFar;
504 else if (NumBits <= 64)
505 return Out << (isSigned?"signed":"unsigned") << " long long "<< NameSoFar;
507 assert(NumBits <= 128 && "Bit widths > 128 not implemented yet");
508 return Out << (isSigned?"llvmInt128":"llvmUInt128") << " " << NameSoFar;
511 case Type::FloatTyID: return Out << "float " << NameSoFar;
512 case Type::DoubleTyID: return Out << "double " << NameSoFar;
513 // Lacking emulation of FP80 on PPC, etc., we assume whichever of these is
514 // present matches host 'long double'.
515 case Type::X86_FP80TyID:
516 case Type::PPC_FP128TyID:
517 case Type::FP128TyID: return Out << "long double " << NameSoFar;
519 case Type::VectorTyID: {
520 const VectorType *VTy = cast<VectorType>(Ty);
521 return printSimpleType(Out, VTy->getElementType(), isSigned,
522 " __attribute__((vector_size(" +
523 utostr(TD->getTypeAllocSize(VTy)) + " ))) " + NameSoFar);
528 errs() << "Unknown primitive type: " << *Ty << "\n";
534 // Pass the Type* and the variable name and this prints out the variable
537 raw_ostream &CWriter::printType(raw_ostream &Out, const Type *Ty,
538 bool isSigned, const std::string &NameSoFar,
539 bool IgnoreName, const AttrListPtr &PAL) {
540 if (Ty->isPrimitiveType() || Ty->isIntegerTy() || Ty->isVectorTy()) {
541 printSimpleType(Out, Ty, isSigned, NameSoFar);
545 // Check to see if the type is named.
546 if (!IgnoreName || Ty->isOpaqueTy()) {
547 std::map<const Type *, std::string>::iterator I = TypeNames.find(Ty);
548 if (I != TypeNames.end()) return Out << I->second << ' ' << NameSoFar;
551 switch (Ty->getTypeID()) {
552 case Type::FunctionTyID: {
553 const FunctionType *FTy = cast<FunctionType>(Ty);
555 raw_string_ostream FunctionInnards(tstr);
556 FunctionInnards << " (" << NameSoFar << ") (";
558 for (FunctionType::param_iterator I = FTy->param_begin(),
559 E = FTy->param_end(); I != E; ++I) {
560 const Type *ArgTy = *I;
561 if (PAL.paramHasAttr(Idx, Attribute::ByVal)) {
562 assert(ArgTy->isPointerTy());
563 ArgTy = cast<PointerType>(ArgTy)->getElementType();
565 if (I != FTy->param_begin())
566 FunctionInnards << ", ";
567 printType(FunctionInnards, ArgTy,
568 /*isSigned=*/PAL.paramHasAttr(Idx, Attribute::SExt), "");
571 if (FTy->isVarArg()) {
572 if (!FTy->getNumParams())
573 FunctionInnards << " int"; //dummy argument for empty vaarg functs
574 FunctionInnards << ", ...";
575 } else if (!FTy->getNumParams()) {
576 FunctionInnards << "void";
578 FunctionInnards << ')';
579 printType(Out, FTy->getReturnType(),
580 /*isSigned=*/PAL.paramHasAttr(0, Attribute::SExt), FunctionInnards.str());
583 case Type::StructTyID: {
584 const StructType *STy = cast<StructType>(Ty);
585 Out << NameSoFar + " {\n";
587 for (StructType::element_iterator I = STy->element_begin(),
588 E = STy->element_end(); I != E; ++I) {
590 printType(Out, *I, false, "field" + utostr(Idx++));
595 Out << " __attribute__ ((packed))";
599 case Type::PointerTyID: {
600 const PointerType *PTy = cast<PointerType>(Ty);
601 std::string ptrName = "*" + NameSoFar;
603 if (PTy->getElementType()->isArrayTy() ||
604 PTy->getElementType()->isVectorTy())
605 ptrName = "(" + ptrName + ")";
608 // Must be a function ptr cast!
609 return printType(Out, PTy->getElementType(), false, ptrName, true, PAL);
610 return printType(Out, PTy->getElementType(), false, ptrName);
613 case Type::ArrayTyID: {
614 const ArrayType *ATy = cast<ArrayType>(Ty);
615 unsigned NumElements = ATy->getNumElements();
616 if (NumElements == 0) NumElements = 1;
617 // Arrays are wrapped in structs to allow them to have normal
618 // value semantics (avoiding the array "decay").
619 Out << NameSoFar << " { ";
620 printType(Out, ATy->getElementType(), false,
621 "array[" + utostr(NumElements) + "]");
625 case Type::OpaqueTyID: {
626 std::string TyName = "struct opaque_" + itostr(OpaqueCounter++);
627 assert(TypeNames.find(Ty) == TypeNames.end());
628 TypeNames[Ty] = TyName;
629 return Out << TyName << ' ' << NameSoFar;
632 llvm_unreachable("Unhandled case in getTypeProps!");
638 void CWriter::printConstantArray(ConstantArray *CPA, bool Static) {
640 // As a special case, print the array as a string if it is an array of
641 // ubytes or an array of sbytes with positive values.
643 const Type *ETy = CPA->getType()->getElementType();
644 bool isString = (ETy == Type::getInt8Ty(CPA->getContext()) ||
645 ETy == Type::getInt8Ty(CPA->getContext()));
647 // Make sure the last character is a null char, as automatically added by C
648 if (isString && (CPA->getNumOperands() == 0 ||
649 !cast<Constant>(*(CPA->op_end()-1))->isNullValue()))
654 // Keep track of whether the last number was a hexadecimal escape
655 bool LastWasHex = false;
657 // Do not include the last character, which we know is null
658 for (unsigned i = 0, e = CPA->getNumOperands()-1; i != e; ++i) {
659 unsigned char C = cast<ConstantInt>(CPA->getOperand(i))->getZExtValue();
661 // Print it out literally if it is a printable character. The only thing
662 // to be careful about is when the last letter output was a hex escape
663 // code, in which case we have to be careful not to print out hex digits
664 // explicitly (the C compiler thinks it is a continuation of the previous
665 // character, sheesh...)
667 if (isprint(C) && (!LastWasHex || !isxdigit(C))) {
669 if (C == '"' || C == '\\')
670 Out << "\\" << (char)C;
676 case '\n': Out << "\\n"; break;
677 case '\t': Out << "\\t"; break;
678 case '\r': Out << "\\r"; break;
679 case '\v': Out << "\\v"; break;
680 case '\a': Out << "\\a"; break;
681 case '\"': Out << "\\\""; break;
682 case '\'': Out << "\\\'"; break;
685 Out << (char)(( C/16 < 10) ? ( C/16 +'0') : ( C/16 -10+'A'));
686 Out << (char)(((C&15) < 10) ? ((C&15)+'0') : ((C&15)-10+'A'));
695 if (CPA->getNumOperands()) {
697 printConstant(cast<Constant>(CPA->getOperand(0)), Static);
698 for (unsigned i = 1, e = CPA->getNumOperands(); i != e; ++i) {
700 printConstant(cast<Constant>(CPA->getOperand(i)), Static);
707 void CWriter::printConstantVector(ConstantVector *CP, bool Static) {
709 if (CP->getNumOperands()) {
711 printConstant(cast<Constant>(CP->getOperand(0)), Static);
712 for (unsigned i = 1, e = CP->getNumOperands(); i != e; ++i) {
714 printConstant(cast<Constant>(CP->getOperand(i)), Static);
720 // isFPCSafeToPrint - Returns true if we may assume that CFP may be written out
721 // textually as a double (rather than as a reference to a stack-allocated
722 // variable). We decide this by converting CFP to a string and back into a
723 // double, and then checking whether the conversion results in a bit-equal
724 // double to the original value of CFP. This depends on us and the target C
725 // compiler agreeing on the conversion process (which is pretty likely since we
726 // only deal in IEEE FP).
728 static bool isFPCSafeToPrint(const ConstantFP *CFP) {
730 // Do long doubles in hex for now.
731 if (CFP->getType() != Type::getFloatTy(CFP->getContext()) &&
732 CFP->getType() != Type::getDoubleTy(CFP->getContext()))
734 APFloat APF = APFloat(CFP->getValueAPF()); // copy
735 if (CFP->getType() == Type::getFloatTy(CFP->getContext()))
736 APF.convert(APFloat::IEEEdouble, APFloat::rmNearestTiesToEven, &ignored);
737 #if HAVE_PRINTF_A && ENABLE_CBE_PRINTF_A
739 sprintf(Buffer, "%a", APF.convertToDouble());
740 if (!strncmp(Buffer, "0x", 2) ||
741 !strncmp(Buffer, "-0x", 3) ||
742 !strncmp(Buffer, "+0x", 3))
743 return APF.bitwiseIsEqual(APFloat(atof(Buffer)));
746 std::string StrVal = ftostr(APF);
748 while (StrVal[0] == ' ')
749 StrVal.erase(StrVal.begin());
751 // Check to make sure that the stringized number is not some string like "Inf"
752 // or NaN. Check that the string matches the "[-+]?[0-9]" regex.
753 if ((StrVal[0] >= '0' && StrVal[0] <= '9') ||
754 ((StrVal[0] == '-' || StrVal[0] == '+') &&
755 (StrVal[1] >= '0' && StrVal[1] <= '9')))
756 // Reparse stringized version!
757 return APF.bitwiseIsEqual(APFloat(atof(StrVal.c_str())));
762 /// Print out the casting for a cast operation. This does the double casting
763 /// necessary for conversion to the destination type, if necessary.
764 /// @brief Print a cast
765 void CWriter::printCast(unsigned opc, const Type *SrcTy, const Type *DstTy) {
766 // Print the destination type cast
768 case Instruction::UIToFP:
769 case Instruction::SIToFP:
770 case Instruction::IntToPtr:
771 case Instruction::Trunc:
772 case Instruction::BitCast:
773 case Instruction::FPExt:
774 case Instruction::FPTrunc: // For these the DstTy sign doesn't matter
776 printType(Out, DstTy);
779 case Instruction::ZExt:
780 case Instruction::PtrToInt:
781 case Instruction::FPToUI: // For these, make sure we get an unsigned dest
783 printSimpleType(Out, DstTy, false);
786 case Instruction::SExt:
787 case Instruction::FPToSI: // For these, make sure we get a signed dest
789 printSimpleType(Out, DstTy, true);
793 llvm_unreachable("Invalid cast opcode");
796 // Print the source type cast
798 case Instruction::UIToFP:
799 case Instruction::ZExt:
801 printSimpleType(Out, SrcTy, false);
804 case Instruction::SIToFP:
805 case Instruction::SExt:
807 printSimpleType(Out, SrcTy, true);
810 case Instruction::IntToPtr:
811 case Instruction::PtrToInt:
812 // Avoid "cast to pointer from integer of different size" warnings
813 Out << "(unsigned long)";
815 case Instruction::Trunc:
816 case Instruction::BitCast:
817 case Instruction::FPExt:
818 case Instruction::FPTrunc:
819 case Instruction::FPToSI:
820 case Instruction::FPToUI:
821 break; // These don't need a source cast.
823 llvm_unreachable("Invalid cast opcode");
828 // printConstant - The LLVM Constant to C Constant converter.
829 void CWriter::printConstant(Constant *CPV, bool Static) {
830 if (const ConstantExpr *CE = dyn_cast<ConstantExpr>(CPV)) {
831 switch (CE->getOpcode()) {
832 case Instruction::Trunc:
833 case Instruction::ZExt:
834 case Instruction::SExt:
835 case Instruction::FPTrunc:
836 case Instruction::FPExt:
837 case Instruction::UIToFP:
838 case Instruction::SIToFP:
839 case Instruction::FPToUI:
840 case Instruction::FPToSI:
841 case Instruction::PtrToInt:
842 case Instruction::IntToPtr:
843 case Instruction::BitCast:
845 printCast(CE->getOpcode(), CE->getOperand(0)->getType(), CE->getType());
846 if (CE->getOpcode() == Instruction::SExt &&
847 CE->getOperand(0)->getType() == Type::getInt1Ty(CPV->getContext())) {
848 // Make sure we really sext from bool here by subtracting from 0
851 printConstant(CE->getOperand(0), Static);
852 if (CE->getType() == Type::getInt1Ty(CPV->getContext()) &&
853 (CE->getOpcode() == Instruction::Trunc ||
854 CE->getOpcode() == Instruction::FPToUI ||
855 CE->getOpcode() == Instruction::FPToSI ||
856 CE->getOpcode() == Instruction::PtrToInt)) {
857 // Make sure we really truncate to bool here by anding with 1
863 case Instruction::GetElementPtr:
865 printGEPExpression(CE->getOperand(0), gep_type_begin(CPV),
866 gep_type_end(CPV), Static);
869 case Instruction::Select:
871 printConstant(CE->getOperand(0), Static);
873 printConstant(CE->getOperand(1), Static);
875 printConstant(CE->getOperand(2), Static);
878 case Instruction::Add:
879 case Instruction::FAdd:
880 case Instruction::Sub:
881 case Instruction::FSub:
882 case Instruction::Mul:
883 case Instruction::FMul:
884 case Instruction::SDiv:
885 case Instruction::UDiv:
886 case Instruction::FDiv:
887 case Instruction::URem:
888 case Instruction::SRem:
889 case Instruction::FRem:
890 case Instruction::And:
891 case Instruction::Or:
892 case Instruction::Xor:
893 case Instruction::ICmp:
894 case Instruction::Shl:
895 case Instruction::LShr:
896 case Instruction::AShr:
899 bool NeedsClosingParens = printConstExprCast(CE, Static);
900 printConstantWithCast(CE->getOperand(0), CE->getOpcode());
901 switch (CE->getOpcode()) {
902 case Instruction::Add:
903 case Instruction::FAdd: Out << " + "; break;
904 case Instruction::Sub:
905 case Instruction::FSub: Out << " - "; break;
906 case Instruction::Mul:
907 case Instruction::FMul: Out << " * "; break;
908 case Instruction::URem:
909 case Instruction::SRem:
910 case Instruction::FRem: Out << " % "; break;
911 case Instruction::UDiv:
912 case Instruction::SDiv:
913 case Instruction::FDiv: Out << " / "; break;
914 case Instruction::And: Out << " & "; break;
915 case Instruction::Or: Out << " | "; break;
916 case Instruction::Xor: Out << " ^ "; break;
917 case Instruction::Shl: Out << " << "; break;
918 case Instruction::LShr:
919 case Instruction::AShr: Out << " >> "; break;
920 case Instruction::ICmp:
921 switch (CE->getPredicate()) {
922 case ICmpInst::ICMP_EQ: Out << " == "; break;
923 case ICmpInst::ICMP_NE: Out << " != "; break;
924 case ICmpInst::ICMP_SLT:
925 case ICmpInst::ICMP_ULT: Out << " < "; break;
926 case ICmpInst::ICMP_SLE:
927 case ICmpInst::ICMP_ULE: Out << " <= "; break;
928 case ICmpInst::ICMP_SGT:
929 case ICmpInst::ICMP_UGT: Out << " > "; break;
930 case ICmpInst::ICMP_SGE:
931 case ICmpInst::ICMP_UGE: Out << " >= "; break;
932 default: llvm_unreachable("Illegal ICmp predicate");
935 default: llvm_unreachable("Illegal opcode here!");
937 printConstantWithCast(CE->getOperand(1), CE->getOpcode());
938 if (NeedsClosingParens)
943 case Instruction::FCmp: {
945 bool NeedsClosingParens = printConstExprCast(CE, Static);
946 if (CE->getPredicate() == FCmpInst::FCMP_FALSE)
948 else if (CE->getPredicate() == FCmpInst::FCMP_TRUE)
952 switch (CE->getPredicate()) {
953 default: llvm_unreachable("Illegal FCmp predicate");
954 case FCmpInst::FCMP_ORD: op = "ord"; break;
955 case FCmpInst::FCMP_UNO: op = "uno"; break;
956 case FCmpInst::FCMP_UEQ: op = "ueq"; break;
957 case FCmpInst::FCMP_UNE: op = "une"; break;
958 case FCmpInst::FCMP_ULT: op = "ult"; break;
959 case FCmpInst::FCMP_ULE: op = "ule"; break;
960 case FCmpInst::FCMP_UGT: op = "ugt"; break;
961 case FCmpInst::FCMP_UGE: op = "uge"; break;
962 case FCmpInst::FCMP_OEQ: op = "oeq"; break;
963 case FCmpInst::FCMP_ONE: op = "one"; break;
964 case FCmpInst::FCMP_OLT: op = "olt"; break;
965 case FCmpInst::FCMP_OLE: op = "ole"; break;
966 case FCmpInst::FCMP_OGT: op = "ogt"; break;
967 case FCmpInst::FCMP_OGE: op = "oge"; break;
969 Out << "llvm_fcmp_" << op << "(";
970 printConstantWithCast(CE->getOperand(0), CE->getOpcode());
972 printConstantWithCast(CE->getOperand(1), CE->getOpcode());
975 if (NeedsClosingParens)
982 errs() << "CWriter Error: Unhandled constant expression: "
987 } else if (isa<UndefValue>(CPV) && CPV->getType()->isSingleValueType()) {
989 printType(Out, CPV->getType()); // sign doesn't matter
991 if (!CPV->getType()->isVectorTy()) {
999 if (ConstantInt *CI = dyn_cast<ConstantInt>(CPV)) {
1000 const Type* Ty = CI->getType();
1001 if (Ty == Type::getInt1Ty(CPV->getContext()))
1002 Out << (CI->getZExtValue() ? '1' : '0');
1003 else if (Ty == Type::getInt32Ty(CPV->getContext()))
1004 Out << CI->getZExtValue() << 'u';
1005 else if (Ty->getPrimitiveSizeInBits() > 32)
1006 Out << CI->getZExtValue() << "ull";
1009 printSimpleType(Out, Ty, false) << ')';
1010 if (CI->isMinValue(true))
1011 Out << CI->getZExtValue() << 'u';
1013 Out << CI->getSExtValue();
1019 switch (CPV->getType()->getTypeID()) {
1020 case Type::FloatTyID:
1021 case Type::DoubleTyID:
1022 case Type::X86_FP80TyID:
1023 case Type::PPC_FP128TyID:
1024 case Type::FP128TyID: {
1025 ConstantFP *FPC = cast<ConstantFP>(CPV);
1026 std::map<const ConstantFP*, unsigned>::iterator I = FPConstantMap.find(FPC);
1027 if (I != FPConstantMap.end()) {
1028 // Because of FP precision problems we must load from a stack allocated
1029 // value that holds the value in hex.
1030 Out << "(*(" << (FPC->getType() == Type::getFloatTy(CPV->getContext()) ?
1032 FPC->getType() == Type::getDoubleTy(CPV->getContext()) ?
1035 << "*)&FPConstant" << I->second << ')';
1038 if (FPC->getType() == Type::getFloatTy(CPV->getContext()))
1039 V = FPC->getValueAPF().convertToFloat();
1040 else if (FPC->getType() == Type::getDoubleTy(CPV->getContext()))
1041 V = FPC->getValueAPF().convertToDouble();
1043 // Long double. Convert the number to double, discarding precision.
1044 // This is not awesome, but it at least makes the CBE output somewhat
1046 APFloat Tmp = FPC->getValueAPF();
1048 Tmp.convert(APFloat::IEEEdouble, APFloat::rmTowardZero, &LosesInfo);
1049 V = Tmp.convertToDouble();
1055 // FIXME the actual NaN bits should be emitted.
1056 // The prefix for a quiet NaN is 0x7FF8. For a signalling NaN,
1058 const unsigned long QuietNaN = 0x7ff8UL;
1059 //const unsigned long SignalNaN = 0x7ff4UL;
1061 // We need to grab the first part of the FP #
1064 uint64_t ll = DoubleToBits(V);
1065 sprintf(Buffer, "0x%llx", static_cast<long long>(ll));
1067 std::string Num(&Buffer[0], &Buffer[6]);
1068 unsigned long Val = strtoul(Num.c_str(), 0, 16);
1070 if (FPC->getType() == Type::getFloatTy(FPC->getContext()))
1071 Out << "LLVM_NAN" << (Val == QuietNaN ? "" : "S") << "F(\""
1072 << Buffer << "\") /*nan*/ ";
1074 Out << "LLVM_NAN" << (Val == QuietNaN ? "" : "S") << "(\""
1075 << Buffer << "\") /*nan*/ ";
1076 } else if (IsInf(V)) {
1078 if (V < 0) Out << '-';
1079 Out << "LLVM_INF" <<
1080 (FPC->getType() == Type::getFloatTy(FPC->getContext()) ? "F" : "")
1084 #if HAVE_PRINTF_A && ENABLE_CBE_PRINTF_A
1085 // Print out the constant as a floating point number.
1087 sprintf(Buffer, "%a", V);
1090 Num = ftostr(FPC->getValueAPF());
1098 case Type::ArrayTyID:
1099 // Use C99 compound expression literal initializer syntax.
1102 printType(Out, CPV->getType());
1105 Out << "{ "; // Arrays are wrapped in struct types.
1106 if (ConstantArray *CA = dyn_cast<ConstantArray>(CPV)) {
1107 printConstantArray(CA, Static);
1109 assert(isa<ConstantAggregateZero>(CPV) || isa<UndefValue>(CPV));
1110 const ArrayType *AT = cast<ArrayType>(CPV->getType());
1112 if (AT->getNumElements()) {
1114 Constant *CZ = Constant::getNullValue(AT->getElementType());
1115 printConstant(CZ, Static);
1116 for (unsigned i = 1, e = AT->getNumElements(); i != e; ++i) {
1118 printConstant(CZ, Static);
1123 Out << " }"; // Arrays are wrapped in struct types.
1126 case Type::VectorTyID:
1127 // Use C99 compound expression literal initializer syntax.
1130 printType(Out, CPV->getType());
1133 if (ConstantVector *CV = dyn_cast<ConstantVector>(CPV)) {
1134 printConstantVector(CV, Static);
1136 assert(isa<ConstantAggregateZero>(CPV) || isa<UndefValue>(CPV));
1137 const VectorType *VT = cast<VectorType>(CPV->getType());
1139 Constant *CZ = Constant::getNullValue(VT->getElementType());
1140 printConstant(CZ, Static);
1141 for (unsigned i = 1, e = VT->getNumElements(); i != e; ++i) {
1143 printConstant(CZ, Static);
1149 case Type::StructTyID:
1150 // Use C99 compound expression literal initializer syntax.
1153 printType(Out, CPV->getType());
1156 if (isa<ConstantAggregateZero>(CPV) || isa<UndefValue>(CPV)) {
1157 const StructType *ST = cast<StructType>(CPV->getType());
1159 if (ST->getNumElements()) {
1161 printConstant(Constant::getNullValue(ST->getElementType(0)), Static);
1162 for (unsigned i = 1, e = ST->getNumElements(); i != e; ++i) {
1164 printConstant(Constant::getNullValue(ST->getElementType(i)), Static);
1170 if (CPV->getNumOperands()) {
1172 printConstant(cast<Constant>(CPV->getOperand(0)), Static);
1173 for (unsigned i = 1, e = CPV->getNumOperands(); i != e; ++i) {
1175 printConstant(cast<Constant>(CPV->getOperand(i)), Static);
1182 case Type::PointerTyID:
1183 if (isa<ConstantPointerNull>(CPV)) {
1185 printType(Out, CPV->getType()); // sign doesn't matter
1186 Out << ")/*NULL*/0)";
1188 } else if (GlobalValue *GV = dyn_cast<GlobalValue>(CPV)) {
1189 writeOperand(GV, Static);
1195 errs() << "Unknown constant type: " << *CPV << "\n";
1197 llvm_unreachable(0);
1201 // Some constant expressions need to be casted back to the original types
1202 // because their operands were casted to the expected type. This function takes
1203 // care of detecting that case and printing the cast for the ConstantExpr.
1204 bool CWriter::printConstExprCast(const ConstantExpr* CE, bool Static) {
1205 bool NeedsExplicitCast = false;
1206 const Type *Ty = CE->getOperand(0)->getType();
1207 bool TypeIsSigned = false;
1208 switch (CE->getOpcode()) {
1209 case Instruction::Add:
1210 case Instruction::Sub:
1211 case Instruction::Mul:
1212 // We need to cast integer arithmetic so that it is always performed
1213 // as unsigned, to avoid undefined behavior on overflow.
1214 case Instruction::LShr:
1215 case Instruction::URem:
1216 case Instruction::UDiv: NeedsExplicitCast = true; break;
1217 case Instruction::AShr:
1218 case Instruction::SRem:
1219 case Instruction::SDiv: NeedsExplicitCast = true; TypeIsSigned = true; break;
1220 case Instruction::SExt:
1222 NeedsExplicitCast = true;
1223 TypeIsSigned = true;
1225 case Instruction::ZExt:
1226 case Instruction::Trunc:
1227 case Instruction::FPTrunc:
1228 case Instruction::FPExt:
1229 case Instruction::UIToFP:
1230 case Instruction::SIToFP:
1231 case Instruction::FPToUI:
1232 case Instruction::FPToSI:
1233 case Instruction::PtrToInt:
1234 case Instruction::IntToPtr:
1235 case Instruction::BitCast:
1237 NeedsExplicitCast = true;
1241 if (NeedsExplicitCast) {
1243 if (Ty->isIntegerTy() && Ty != Type::getInt1Ty(Ty->getContext()))
1244 printSimpleType(Out, Ty, TypeIsSigned);
1246 printType(Out, Ty); // not integer, sign doesn't matter
1249 return NeedsExplicitCast;
1252 // Print a constant assuming that it is the operand for a given Opcode. The
1253 // opcodes that care about sign need to cast their operands to the expected
1254 // type before the operation proceeds. This function does the casting.
1255 void CWriter::printConstantWithCast(Constant* CPV, unsigned Opcode) {
1257 // Extract the operand's type, we'll need it.
1258 const Type* OpTy = CPV->getType();
1260 // Indicate whether to do the cast or not.
1261 bool shouldCast = false;
1262 bool typeIsSigned = false;
1264 // Based on the Opcode for which this Constant is being written, determine
1265 // the new type to which the operand should be casted by setting the value
1266 // of OpTy. If we change OpTy, also set shouldCast to true so it gets
1270 // for most instructions, it doesn't matter
1272 case Instruction::Add:
1273 case Instruction::Sub:
1274 case Instruction::Mul:
1275 // We need to cast integer arithmetic so that it is always performed
1276 // as unsigned, to avoid undefined behavior on overflow.
1277 case Instruction::LShr:
1278 case Instruction::UDiv:
1279 case Instruction::URem:
1282 case Instruction::AShr:
1283 case Instruction::SDiv:
1284 case Instruction::SRem:
1286 typeIsSigned = true;
1290 // Write out the casted constant if we should, otherwise just write the
1294 printSimpleType(Out, OpTy, typeIsSigned);
1296 printConstant(CPV, false);
1299 printConstant(CPV, false);
1302 std::string CWriter::GetValueName(const Value *Operand) {
1304 // Resolve potential alias.
1305 if (const GlobalAlias *GA = dyn_cast<GlobalAlias>(Operand)) {
1306 if (const Value *V = GA->resolveAliasedGlobal(false))
1310 // Mangle globals with the standard mangler interface for LLC compatibility.
1311 if (const GlobalValue *GV = dyn_cast<GlobalValue>(Operand)) {
1312 SmallString<128> Str;
1313 Mang->getNameWithPrefix(Str, GV, false);
1314 return CBEMangle(Str.str().str());
1317 std::string Name = Operand->getName();
1319 if (Name.empty()) { // Assign unique names to local temporaries.
1320 unsigned &No = AnonValueNumbers[Operand];
1322 No = ++NextAnonValueNumber;
1323 Name = "tmp__" + utostr(No);
1326 std::string VarName;
1327 VarName.reserve(Name.capacity());
1329 for (std::string::iterator I = Name.begin(), E = Name.end();
1333 if (!((ch >= 'a' && ch <= 'z') || (ch >= 'A' && ch <= 'Z') ||
1334 (ch >= '0' && ch <= '9') || ch == '_')) {
1336 sprintf(buffer, "_%x_", ch);
1342 return "llvm_cbe_" + VarName;
1345 /// writeInstComputationInline - Emit the computation for the specified
1346 /// instruction inline, with no destination provided.
1347 void CWriter::writeInstComputationInline(Instruction &I) {
1348 // We can't currently support integer types other than 1, 8, 16, 32, 64.
1350 const Type *Ty = I.getType();
1351 if (Ty->isIntegerTy() && (Ty!=Type::getInt1Ty(I.getContext()) &&
1352 Ty!=Type::getInt8Ty(I.getContext()) &&
1353 Ty!=Type::getInt16Ty(I.getContext()) &&
1354 Ty!=Type::getInt32Ty(I.getContext()) &&
1355 Ty!=Type::getInt64Ty(I.getContext()))) {
1356 report_fatal_error("The C backend does not currently support integer "
1357 "types of widths other than 1, 8, 16, 32, 64.\n"
1358 "This is being tracked as PR 4158.");
1361 // If this is a non-trivial bool computation, make sure to truncate down to
1362 // a 1 bit value. This is important because we want "add i1 x, y" to return
1363 // "0" when x and y are true, not "2" for example.
1364 bool NeedBoolTrunc = false;
1365 if (I.getType() == Type::getInt1Ty(I.getContext()) &&
1366 !isa<ICmpInst>(I) && !isa<FCmpInst>(I))
1367 NeedBoolTrunc = true;
1379 void CWriter::writeOperandInternal(Value *Operand, bool Static) {
1380 if (Instruction *I = dyn_cast<Instruction>(Operand))
1381 // Should we inline this instruction to build a tree?
1382 if (isInlinableInst(*I) && !isDirectAlloca(I)) {
1384 writeInstComputationInline(*I);
1389 Constant* CPV = dyn_cast<Constant>(Operand);
1391 if (CPV && !isa<GlobalValue>(CPV))
1392 printConstant(CPV, Static);
1394 Out << GetValueName(Operand);
1397 void CWriter::writeOperand(Value *Operand, bool Static) {
1398 bool isAddressImplicit = isAddressExposed(Operand);
1399 if (isAddressImplicit)
1400 Out << "(&"; // Global variables are referenced as their addresses by llvm
1402 writeOperandInternal(Operand, Static);
1404 if (isAddressImplicit)
1408 // Some instructions need to have their result value casted back to the
1409 // original types because their operands were casted to the expected type.
1410 // This function takes care of detecting that case and printing the cast
1411 // for the Instruction.
1412 bool CWriter::writeInstructionCast(const Instruction &I) {
1413 const Type *Ty = I.getOperand(0)->getType();
1414 switch (I.getOpcode()) {
1415 case Instruction::Add:
1416 case Instruction::Sub:
1417 case Instruction::Mul:
1418 // We need to cast integer arithmetic so that it is always performed
1419 // as unsigned, to avoid undefined behavior on overflow.
1420 case Instruction::LShr:
1421 case Instruction::URem:
1422 case Instruction::UDiv:
1424 printSimpleType(Out, Ty, false);
1427 case Instruction::AShr:
1428 case Instruction::SRem:
1429 case Instruction::SDiv:
1431 printSimpleType(Out, Ty, true);
1439 // Write the operand with a cast to another type based on the Opcode being used.
1440 // This will be used in cases where an instruction has specific type
1441 // requirements (usually signedness) for its operands.
1442 void CWriter::writeOperandWithCast(Value* Operand, unsigned Opcode) {
1444 // Extract the operand's type, we'll need it.
1445 const Type* OpTy = Operand->getType();
1447 // Indicate whether to do the cast or not.
1448 bool shouldCast = false;
1450 // Indicate whether the cast should be to a signed type or not.
1451 bool castIsSigned = false;
1453 // Based on the Opcode for which this Operand is being written, determine
1454 // the new type to which the operand should be casted by setting the value
1455 // of OpTy. If we change OpTy, also set shouldCast to true.
1458 // for most instructions, it doesn't matter
1460 case Instruction::Add:
1461 case Instruction::Sub:
1462 case Instruction::Mul:
1463 // We need to cast integer arithmetic so that it is always performed
1464 // as unsigned, to avoid undefined behavior on overflow.
1465 case Instruction::LShr:
1466 case Instruction::UDiv:
1467 case Instruction::URem: // Cast to unsigned first
1469 castIsSigned = false;
1471 case Instruction::GetElementPtr:
1472 case Instruction::AShr:
1473 case Instruction::SDiv:
1474 case Instruction::SRem: // Cast to signed first
1476 castIsSigned = true;
1480 // Write out the casted operand if we should, otherwise just write the
1484 printSimpleType(Out, OpTy, castIsSigned);
1486 writeOperand(Operand);
1489 writeOperand(Operand);
1492 // Write the operand with a cast to another type based on the icmp predicate
1494 void CWriter::writeOperandWithCast(Value* Operand, const ICmpInst &Cmp) {
1495 // This has to do a cast to ensure the operand has the right signedness.
1496 // Also, if the operand is a pointer, we make sure to cast to an integer when
1497 // doing the comparison both for signedness and so that the C compiler doesn't
1498 // optimize things like "p < NULL" to false (p may contain an integer value
1500 bool shouldCast = Cmp.isRelational();
1502 // Write out the casted operand if we should, otherwise just write the
1505 writeOperand(Operand);
1509 // Should this be a signed comparison? If so, convert to signed.
1510 bool castIsSigned = Cmp.isSigned();
1512 // If the operand was a pointer, convert to a large integer type.
1513 const Type* OpTy = Operand->getType();
1514 if (OpTy->isPointerTy())
1515 OpTy = TD->getIntPtrType(Operand->getContext());
1518 printSimpleType(Out, OpTy, castIsSigned);
1520 writeOperand(Operand);
1524 // generateCompilerSpecificCode - This is where we add conditional compilation
1525 // directives to cater to specific compilers as need be.
1527 static void generateCompilerSpecificCode(formatted_raw_ostream& Out,
1528 const TargetData *TD) {
1529 // Alloca is hard to get, and we don't want to include stdlib.h here.
1530 Out << "/* get a declaration for alloca */\n"
1531 << "#if defined(__CYGWIN__) || defined(__MINGW32__)\n"
1532 << "#define alloca(x) __builtin_alloca((x))\n"
1533 << "#define _alloca(x) __builtin_alloca((x))\n"
1534 << "#elif defined(__APPLE__)\n"
1535 << "extern void *__builtin_alloca(unsigned long);\n"
1536 << "#define alloca(x) __builtin_alloca(x)\n"
1537 << "#define longjmp _longjmp\n"
1538 << "#define setjmp _setjmp\n"
1539 << "#elif defined(__sun__)\n"
1540 << "#if defined(__sparcv9)\n"
1541 << "extern void *__builtin_alloca(unsigned long);\n"
1543 << "extern void *__builtin_alloca(unsigned int);\n"
1545 << "#define alloca(x) __builtin_alloca(x)\n"
1546 << "#elif defined(__FreeBSD__) || defined(__NetBSD__) || defined(__OpenBSD__) || defined(__DragonFly__) || defined(__arm__)\n"
1547 << "#define alloca(x) __builtin_alloca(x)\n"
1548 << "#elif defined(_MSC_VER)\n"
1549 << "#define inline _inline\n"
1550 << "#define alloca(x) _alloca(x)\n"
1552 << "#include <alloca.h>\n"
1555 // We output GCC specific attributes to preserve 'linkonce'ness on globals.
1556 // If we aren't being compiled with GCC, just drop these attributes.
1557 Out << "#ifndef __GNUC__ /* Can only support \"linkonce\" vars with GCC */\n"
1558 << "#define __attribute__(X)\n"
1561 // On Mac OS X, "external weak" is spelled "__attribute__((weak_import))".
1562 Out << "#if defined(__GNUC__) && defined(__APPLE_CC__)\n"
1563 << "#define __EXTERNAL_WEAK__ __attribute__((weak_import))\n"
1564 << "#elif defined(__GNUC__)\n"
1565 << "#define __EXTERNAL_WEAK__ __attribute__((weak))\n"
1567 << "#define __EXTERNAL_WEAK__\n"
1570 // For now, turn off the weak linkage attribute on Mac OS X. (See above.)
1571 Out << "#if defined(__GNUC__) && defined(__APPLE_CC__)\n"
1572 << "#define __ATTRIBUTE_WEAK__\n"
1573 << "#elif defined(__GNUC__)\n"
1574 << "#define __ATTRIBUTE_WEAK__ __attribute__((weak))\n"
1576 << "#define __ATTRIBUTE_WEAK__\n"
1579 // Add hidden visibility support. FIXME: APPLE_CC?
1580 Out << "#if defined(__GNUC__)\n"
1581 << "#define __HIDDEN__ __attribute__((visibility(\"hidden\")))\n"
1584 // Define NaN and Inf as GCC builtins if using GCC, as 0 otherwise
1585 // From the GCC documentation:
1587 // double __builtin_nan (const char *str)
1589 // This is an implementation of the ISO C99 function nan.
1591 // Since ISO C99 defines this function in terms of strtod, which we do
1592 // not implement, a description of the parsing is in order. The string is
1593 // parsed as by strtol; that is, the base is recognized by leading 0 or
1594 // 0x prefixes. The number parsed is placed in the significand such that
1595 // the least significant bit of the number is at the least significant
1596 // bit of the significand. The number is truncated to fit the significand
1597 // field provided. The significand is forced to be a quiet NaN.
1599 // This function, if given a string literal, is evaluated early enough
1600 // that it is considered a compile-time constant.
1602 // float __builtin_nanf (const char *str)
1604 // Similar to __builtin_nan, except the return type is float.
1606 // double __builtin_inf (void)
1608 // Similar to __builtin_huge_val, except a warning is generated if the
1609 // target floating-point format does not support infinities. This
1610 // function is suitable for implementing the ISO C99 macro INFINITY.
1612 // float __builtin_inff (void)
1614 // Similar to __builtin_inf, except the return type is float.
1615 Out << "#ifdef __GNUC__\n"
1616 << "#define LLVM_NAN(NanStr) __builtin_nan(NanStr) /* Double */\n"
1617 << "#define LLVM_NANF(NanStr) __builtin_nanf(NanStr) /* Float */\n"
1618 << "#define LLVM_NANS(NanStr) __builtin_nans(NanStr) /* Double */\n"
1619 << "#define LLVM_NANSF(NanStr) __builtin_nansf(NanStr) /* Float */\n"
1620 << "#define LLVM_INF __builtin_inf() /* Double */\n"
1621 << "#define LLVM_INFF __builtin_inff() /* Float */\n"
1622 << "#define LLVM_PREFETCH(addr,rw,locality) "
1623 "__builtin_prefetch(addr,rw,locality)\n"
1624 << "#define __ATTRIBUTE_CTOR__ __attribute__((constructor))\n"
1625 << "#define __ATTRIBUTE_DTOR__ __attribute__((destructor))\n"
1626 << "#define LLVM_ASM __asm__\n"
1628 << "#define LLVM_NAN(NanStr) ((double)0.0) /* Double */\n"
1629 << "#define LLVM_NANF(NanStr) 0.0F /* Float */\n"
1630 << "#define LLVM_NANS(NanStr) ((double)0.0) /* Double */\n"
1631 << "#define LLVM_NANSF(NanStr) 0.0F /* Float */\n"
1632 << "#define LLVM_INF ((double)0.0) /* Double */\n"
1633 << "#define LLVM_INFF 0.0F /* Float */\n"
1634 << "#define LLVM_PREFETCH(addr,rw,locality) /* PREFETCH */\n"
1635 << "#define __ATTRIBUTE_CTOR__\n"
1636 << "#define __ATTRIBUTE_DTOR__\n"
1637 << "#define LLVM_ASM(X)\n"
1640 Out << "#if __GNUC__ < 4 /* Old GCC's, or compilers not GCC */ \n"
1641 << "#define __builtin_stack_save() 0 /* not implemented */\n"
1642 << "#define __builtin_stack_restore(X) /* noop */\n"
1645 // Output typedefs for 128-bit integers. If these are needed with a
1646 // 32-bit target or with a C compiler that doesn't support mode(TI),
1647 // more drastic measures will be needed.
1648 Out << "#if __GNUC__ && __LP64__ /* 128-bit integer types */\n"
1649 << "typedef int __attribute__((mode(TI))) llvmInt128;\n"
1650 << "typedef unsigned __attribute__((mode(TI))) llvmUInt128;\n"
1653 // Output target-specific code that should be inserted into main.
1654 Out << "#define CODE_FOR_MAIN() /* Any target-specific code for main()*/\n";
1657 /// FindStaticTors - Given a static ctor/dtor list, unpack its contents into
1658 /// the StaticTors set.
1659 static void FindStaticTors(GlobalVariable *GV, std::set<Function*> &StaticTors){
1660 ConstantArray *InitList = dyn_cast<ConstantArray>(GV->getInitializer());
1661 if (!InitList) return;
1663 for (unsigned i = 0, e = InitList->getNumOperands(); i != e; ++i)
1664 if (ConstantStruct *CS = dyn_cast<ConstantStruct>(InitList->getOperand(i))){
1665 if (CS->getNumOperands() != 2) return; // Not array of 2-element structs.
1667 if (CS->getOperand(1)->isNullValue())
1668 return; // Found a null terminator, exit printing.
1669 Constant *FP = CS->getOperand(1);
1670 if (ConstantExpr *CE = dyn_cast<ConstantExpr>(FP))
1672 FP = CE->getOperand(0);
1673 if (Function *F = dyn_cast<Function>(FP))
1674 StaticTors.insert(F);
1678 enum SpecialGlobalClass {
1680 GlobalCtors, GlobalDtors,
1684 /// getGlobalVariableClass - If this is a global that is specially recognized
1685 /// by LLVM, return a code that indicates how we should handle it.
1686 static SpecialGlobalClass getGlobalVariableClass(const GlobalVariable *GV) {
1687 // If this is a global ctors/dtors list, handle it now.
1688 if (GV->hasAppendingLinkage() && GV->use_empty()) {
1689 if (GV->getName() == "llvm.global_ctors")
1691 else if (GV->getName() == "llvm.global_dtors")
1695 // Otherwise, if it is other metadata, don't print it. This catches things
1696 // like debug information.
1697 if (GV->getSection() == "llvm.metadata")
1703 // PrintEscapedString - Print each character of the specified string, escaping
1704 // it if it is not printable or if it is an escape char.
1705 static void PrintEscapedString(const char *Str, unsigned Length,
1707 for (unsigned i = 0; i != Length; ++i) {
1708 unsigned char C = Str[i];
1709 if (isprint(C) && C != '\\' && C != '"')
1718 Out << "\\x" << hexdigit(C >> 4) << hexdigit(C & 0x0F);
1722 // PrintEscapedString - Print each character of the specified string, escaping
1723 // it if it is not printable or if it is an escape char.
1724 static void PrintEscapedString(const std::string &Str, raw_ostream &Out) {
1725 PrintEscapedString(Str.c_str(), Str.size(), Out);
1728 bool CWriter::doInitialization(Module &M) {
1729 FunctionPass::doInitialization(M);
1734 TD = new TargetData(&M);
1735 IL = new IntrinsicLowering(*TD);
1736 IL->AddPrototypes(M);
1739 std::string Triple = TheModule->getTargetTriple();
1741 Triple = llvm::sys::getHostTriple();
1744 if (const Target *Match = TargetRegistry::lookupTarget(Triple, E))
1745 TAsm = Match->createAsmInfo(Triple);
1747 TAsm = new CBEMCAsmInfo();
1748 TCtx = new MCContext(*TAsm);
1749 Mang = new Mangler(*TCtx, *TD);
1751 // Keep track of which functions are static ctors/dtors so they can have
1752 // an attribute added to their prototypes.
1753 std::set<Function*> StaticCtors, StaticDtors;
1754 for (Module::global_iterator I = M.global_begin(), E = M.global_end();
1756 switch (getGlobalVariableClass(I)) {
1759 FindStaticTors(I, StaticCtors);
1762 FindStaticTors(I, StaticDtors);
1767 // get declaration for alloca
1768 Out << "/* Provide Declarations */\n";
1769 Out << "#include <stdarg.h>\n"; // Varargs support
1770 Out << "#include <setjmp.h>\n"; // Unwind support
1771 generateCompilerSpecificCode(Out, TD);
1773 // Provide a definition for `bool' if not compiling with a C++ compiler.
1775 << "#ifndef __cplusplus\ntypedef unsigned char bool;\n#endif\n"
1777 << "\n\n/* Support for floating point constants */\n"
1778 << "typedef unsigned long long ConstantDoubleTy;\n"
1779 << "typedef unsigned int ConstantFloatTy;\n"
1780 << "typedef struct { unsigned long long f1; unsigned short f2; "
1781 "unsigned short pad[3]; } ConstantFP80Ty;\n"
1782 // This is used for both kinds of 128-bit long double; meaning differs.
1783 << "typedef struct { unsigned long long f1; unsigned long long f2; }"
1784 " ConstantFP128Ty;\n"
1785 << "\n\n/* Global Declarations */\n";
1787 // First output all the declarations for the program, because C requires
1788 // Functions & globals to be declared before they are used.
1790 if (!M.getModuleInlineAsm().empty()) {
1791 Out << "/* Module asm statements */\n"
1794 // Split the string into lines, to make it easier to read the .ll file.
1795 std::string Asm = M.getModuleInlineAsm();
1797 size_t NewLine = Asm.find_first_of('\n', CurPos);
1798 while (NewLine != std::string::npos) {
1799 // We found a newline, print the portion of the asm string from the
1800 // last newline up to this newline.
1802 PrintEscapedString(std::string(Asm.begin()+CurPos, Asm.begin()+NewLine),
1806 NewLine = Asm.find_first_of('\n', CurPos);
1809 PrintEscapedString(std::string(Asm.begin()+CurPos, Asm.end()), Out);
1811 << "/* End Module asm statements */\n";
1814 // Loop over the symbol table, emitting all named constants...
1815 printModuleTypes(M.getTypeSymbolTable());
1817 // Global variable declarations...
1818 if (!M.global_empty()) {
1819 Out << "\n/* External Global Variable Declarations */\n";
1820 for (Module::global_iterator I = M.global_begin(), E = M.global_end();
1823 if (I->hasExternalLinkage() || I->hasExternalWeakLinkage() ||
1824 I->hasCommonLinkage())
1826 else if (I->hasDLLImportLinkage())
1827 Out << "__declspec(dllimport) ";
1829 continue; // Internal Global
1831 // Thread Local Storage
1832 if (I->isThreadLocal())
1835 printType(Out, I->getType()->getElementType(), false, GetValueName(I));
1837 if (I->hasExternalWeakLinkage())
1838 Out << " __EXTERNAL_WEAK__";
1843 // Function declarations
1844 Out << "\n/* Function Declarations */\n";
1845 Out << "double fmod(double, double);\n"; // Support for FP rem
1846 Out << "float fmodf(float, float);\n";
1847 Out << "long double fmodl(long double, long double);\n";
1849 for (Module::iterator I = M.begin(), E = M.end(); I != E; ++I) {
1850 // Don't print declarations for intrinsic functions.
1851 if (!I->isIntrinsic() && I->getName() != "setjmp" &&
1852 I->getName() != "longjmp" && I->getName() != "_setjmp") {
1853 if (I->hasExternalWeakLinkage())
1855 printFunctionSignature(I, true);
1856 if (I->hasWeakLinkage() || I->hasLinkOnceLinkage())
1857 Out << " __ATTRIBUTE_WEAK__";
1858 if (I->hasExternalWeakLinkage())
1859 Out << " __EXTERNAL_WEAK__";
1860 if (StaticCtors.count(I))
1861 Out << " __ATTRIBUTE_CTOR__";
1862 if (StaticDtors.count(I))
1863 Out << " __ATTRIBUTE_DTOR__";
1864 if (I->hasHiddenVisibility())
1865 Out << " __HIDDEN__";
1867 if (I->hasName() && I->getName()[0] == 1)
1868 Out << " LLVM_ASM(\"" << I->getName().substr(1) << "\")";
1874 // Output the global variable declarations
1875 if (!M.global_empty()) {
1876 Out << "\n\n/* Global Variable Declarations */\n";
1877 for (Module::global_iterator I = M.global_begin(), E = M.global_end();
1879 if (!I->isDeclaration()) {
1880 // Ignore special globals, such as debug info.
1881 if (getGlobalVariableClass(I))
1884 if (I->hasLocalLinkage())
1889 // Thread Local Storage
1890 if (I->isThreadLocal())
1893 printType(Out, I->getType()->getElementType(), false,
1896 if (I->hasLinkOnceLinkage())
1897 Out << " __attribute__((common))";
1898 else if (I->hasCommonLinkage()) // FIXME is this right?
1899 Out << " __ATTRIBUTE_WEAK__";
1900 else if (I->hasWeakLinkage())
1901 Out << " __ATTRIBUTE_WEAK__";
1902 else if (I->hasExternalWeakLinkage())
1903 Out << " __EXTERNAL_WEAK__";
1904 if (I->hasHiddenVisibility())
1905 Out << " __HIDDEN__";
1910 // Output the global variable definitions and contents...
1911 if (!M.global_empty()) {
1912 Out << "\n\n/* Global Variable Definitions and Initialization */\n";
1913 for (Module::global_iterator I = M.global_begin(), E = M.global_end();
1915 if (!I->isDeclaration()) {
1916 // Ignore special globals, such as debug info.
1917 if (getGlobalVariableClass(I))
1920 if (I->hasLocalLinkage())
1922 else if (I->hasDLLImportLinkage())
1923 Out << "__declspec(dllimport) ";
1924 else if (I->hasDLLExportLinkage())
1925 Out << "__declspec(dllexport) ";
1927 // Thread Local Storage
1928 if (I->isThreadLocal())
1931 printType(Out, I->getType()->getElementType(), false,
1933 if (I->hasLinkOnceLinkage())
1934 Out << " __attribute__((common))";
1935 else if (I->hasWeakLinkage())
1936 Out << " __ATTRIBUTE_WEAK__";
1937 else if (I->hasCommonLinkage())
1938 Out << " __ATTRIBUTE_WEAK__";
1940 if (I->hasHiddenVisibility())
1941 Out << " __HIDDEN__";
1943 // If the initializer is not null, emit the initializer. If it is null,
1944 // we try to avoid emitting large amounts of zeros. The problem with
1945 // this, however, occurs when the variable has weak linkage. In this
1946 // case, the assembler will complain about the variable being both weak
1947 // and common, so we disable this optimization.
1948 // FIXME common linkage should avoid this problem.
1949 if (!I->getInitializer()->isNullValue()) {
1951 writeOperand(I->getInitializer(), true);
1952 } else if (I->hasWeakLinkage()) {
1953 // We have to specify an initializer, but it doesn't have to be
1954 // complete. If the value is an aggregate, print out { 0 }, and let
1955 // the compiler figure out the rest of the zeros.
1957 if (I->getInitializer()->getType()->isStructTy() ||
1958 I->getInitializer()->getType()->isVectorTy()) {
1960 } else if (I->getInitializer()->getType()->isArrayTy()) {
1961 // As with structs and vectors, but with an extra set of braces
1962 // because arrays are wrapped in structs.
1965 // Just print it out normally.
1966 writeOperand(I->getInitializer(), true);
1974 Out << "\n\n/* Function Bodies */\n";
1976 // Emit some helper functions for dealing with FCMP instruction's
1978 Out << "static inline int llvm_fcmp_ord(double X, double Y) { ";
1979 Out << "return X == X && Y == Y; }\n";
1980 Out << "static inline int llvm_fcmp_uno(double X, double Y) { ";
1981 Out << "return X != X || Y != Y; }\n";
1982 Out << "static inline int llvm_fcmp_ueq(double X, double Y) { ";
1983 Out << "return X == Y || llvm_fcmp_uno(X, Y); }\n";
1984 Out << "static inline int llvm_fcmp_une(double X, double Y) { ";
1985 Out << "return X != Y; }\n";
1986 Out << "static inline int llvm_fcmp_ult(double X, double Y) { ";
1987 Out << "return X < Y || llvm_fcmp_uno(X, Y); }\n";
1988 Out << "static inline int llvm_fcmp_ugt(double X, double Y) { ";
1989 Out << "return X > Y || llvm_fcmp_uno(X, Y); }\n";
1990 Out << "static inline int llvm_fcmp_ule(double X, double Y) { ";
1991 Out << "return X <= Y || llvm_fcmp_uno(X, Y); }\n";
1992 Out << "static inline int llvm_fcmp_uge(double X, double Y) { ";
1993 Out << "return X >= Y || llvm_fcmp_uno(X, Y); }\n";
1994 Out << "static inline int llvm_fcmp_oeq(double X, double Y) { ";
1995 Out << "return X == Y ; }\n";
1996 Out << "static inline int llvm_fcmp_one(double X, double Y) { ";
1997 Out << "return X != Y && llvm_fcmp_ord(X, Y); }\n";
1998 Out << "static inline int llvm_fcmp_olt(double X, double Y) { ";
1999 Out << "return X < Y ; }\n";
2000 Out << "static inline int llvm_fcmp_ogt(double X, double Y) { ";
2001 Out << "return X > Y ; }\n";
2002 Out << "static inline int llvm_fcmp_ole(double X, double Y) { ";
2003 Out << "return X <= Y ; }\n";
2004 Out << "static inline int llvm_fcmp_oge(double X, double Y) { ";
2005 Out << "return X >= Y ; }\n";
2010 /// Output all floating point constants that cannot be printed accurately...
2011 void CWriter::printFloatingPointConstants(Function &F) {
2012 // Scan the module for floating point constants. If any FP constant is used
2013 // in the function, we want to redirect it here so that we do not depend on
2014 // the precision of the printed form, unless the printed form preserves
2017 for (constant_iterator I = constant_begin(&F), E = constant_end(&F);
2019 printFloatingPointConstants(*I);
2024 void CWriter::printFloatingPointConstants(const Constant *C) {
2025 // If this is a constant expression, recursively check for constant fp values.
2026 if (const ConstantExpr *CE = dyn_cast<ConstantExpr>(C)) {
2027 for (unsigned i = 0, e = CE->getNumOperands(); i != e; ++i)
2028 printFloatingPointConstants(CE->getOperand(i));
2032 // Otherwise, check for a FP constant that we need to print.
2033 const ConstantFP *FPC = dyn_cast<ConstantFP>(C);
2035 // Do not put in FPConstantMap if safe.
2036 isFPCSafeToPrint(FPC) ||
2037 // Already printed this constant?
2038 FPConstantMap.count(FPC))
2041 FPConstantMap[FPC] = FPCounter; // Number the FP constants
2043 if (FPC->getType() == Type::getDoubleTy(FPC->getContext())) {
2044 double Val = FPC->getValueAPF().convertToDouble();
2045 uint64_t i = FPC->getValueAPF().bitcastToAPInt().getZExtValue();
2046 Out << "static const ConstantDoubleTy FPConstant" << FPCounter++
2047 << " = 0x" << utohexstr(i)
2048 << "ULL; /* " << Val << " */\n";
2049 } else if (FPC->getType() == Type::getFloatTy(FPC->getContext())) {
2050 float Val = FPC->getValueAPF().convertToFloat();
2051 uint32_t i = (uint32_t)FPC->getValueAPF().bitcastToAPInt().
2053 Out << "static const ConstantFloatTy FPConstant" << FPCounter++
2054 << " = 0x" << utohexstr(i)
2055 << "U; /* " << Val << " */\n";
2056 } else if (FPC->getType() == Type::getX86_FP80Ty(FPC->getContext())) {
2057 // api needed to prevent premature destruction
2058 APInt api = FPC->getValueAPF().bitcastToAPInt();
2059 const uint64_t *p = api.getRawData();
2060 Out << "static const ConstantFP80Ty FPConstant" << FPCounter++
2061 << " = { 0x" << utohexstr(p[0])
2062 << "ULL, 0x" << utohexstr((uint16_t)p[1]) << ",{0,0,0}"
2063 << "}; /* Long double constant */\n";
2064 } else if (FPC->getType() == Type::getPPC_FP128Ty(FPC->getContext()) ||
2065 FPC->getType() == Type::getFP128Ty(FPC->getContext())) {
2066 APInt api = FPC->getValueAPF().bitcastToAPInt();
2067 const uint64_t *p = api.getRawData();
2068 Out << "static const ConstantFP128Ty FPConstant" << FPCounter++
2070 << utohexstr(p[0]) << ", 0x" << utohexstr(p[1])
2071 << "}; /* Long double constant */\n";
2074 llvm_unreachable("Unknown float type!");
2080 /// printSymbolTable - Run through symbol table looking for type names. If a
2081 /// type name is found, emit its declaration...
2083 void CWriter::printModuleTypes(const TypeSymbolTable &TST) {
2084 Out << "/* Helper union for bitcasts */\n";
2085 Out << "typedef union {\n";
2086 Out << " unsigned int Int32;\n";
2087 Out << " unsigned long long Int64;\n";
2088 Out << " float Float;\n";
2089 Out << " double Double;\n";
2090 Out << "} llvmBitCastUnion;\n";
2092 // We are only interested in the type plane of the symbol table.
2093 TypeSymbolTable::const_iterator I = TST.begin();
2094 TypeSymbolTable::const_iterator End = TST.end();
2096 // If there are no type names, exit early.
2097 if (I == End) return;
2099 // Print out forward declarations for structure types before anything else!
2100 Out << "/* Structure forward decls */\n";
2101 for (; I != End; ++I) {
2102 std::string Name = "struct " + CBEMangle("l_"+I->first);
2103 Out << Name << ";\n";
2104 TypeNames.insert(std::make_pair(I->second, Name));
2109 // Now we can print out typedefs. Above, we guaranteed that this can only be
2110 // for struct or opaque types.
2111 Out << "/* Typedefs */\n";
2112 for (I = TST.begin(); I != End; ++I) {
2113 std::string Name = CBEMangle("l_"+I->first);
2115 printType(Out, I->second, false, Name);
2121 // Keep track of which structures have been printed so far...
2122 std::set<const Type *> StructPrinted;
2124 // Loop over all structures then push them into the stack so they are
2125 // printed in the correct order.
2127 Out << "/* Structure contents */\n";
2128 for (I = TST.begin(); I != End; ++I)
2129 if (I->second->isStructTy() || I->second->isArrayTy())
2130 // Only print out used types!
2131 printContainedStructs(I->second, StructPrinted);
2134 // Push the struct onto the stack and recursively push all structs
2135 // this one depends on.
2137 // TODO: Make this work properly with vector types
2139 void CWriter::printContainedStructs(const Type *Ty,
2140 std::set<const Type*> &StructPrinted) {
2141 // Don't walk through pointers.
2142 if (Ty->isPointerTy() || Ty->isPrimitiveType() || Ty->isIntegerTy())
2145 // Print all contained types first.
2146 for (Type::subtype_iterator I = Ty->subtype_begin(),
2147 E = Ty->subtype_end(); I != E; ++I)
2148 printContainedStructs(*I, StructPrinted);
2150 if (Ty->isStructTy() || Ty->isArrayTy()) {
2151 // Check to see if we have already printed this struct.
2152 if (StructPrinted.insert(Ty).second) {
2153 // Print structure type out.
2154 std::string Name = TypeNames[Ty];
2155 printType(Out, Ty, false, Name, true);
2161 void CWriter::printFunctionSignature(const Function *F, bool Prototype) {
2162 /// isStructReturn - Should this function actually return a struct by-value?
2163 bool isStructReturn = F->hasStructRetAttr();
2165 if (F->hasLocalLinkage()) Out << "static ";
2166 if (F->hasDLLImportLinkage()) Out << "__declspec(dllimport) ";
2167 if (F->hasDLLExportLinkage()) Out << "__declspec(dllexport) ";
2168 switch (F->getCallingConv()) {
2169 case CallingConv::X86_StdCall:
2170 Out << "__attribute__((stdcall)) ";
2172 case CallingConv::X86_FastCall:
2173 Out << "__attribute__((fastcall)) ";
2175 case CallingConv::X86_ThisCall:
2176 Out << "__attribute__((thiscall)) ";
2182 // Loop over the arguments, printing them...
2183 const FunctionType *FT = cast<FunctionType>(F->getFunctionType());
2184 const AttrListPtr &PAL = F->getAttributes();
2187 raw_string_ostream FunctionInnards(tstr);
2189 // Print out the name...
2190 FunctionInnards << GetValueName(F) << '(';
2192 bool PrintedArg = false;
2193 if (!F->isDeclaration()) {
2194 if (!F->arg_empty()) {
2195 Function::const_arg_iterator I = F->arg_begin(), E = F->arg_end();
2198 // If this is a struct-return function, don't print the hidden
2199 // struct-return argument.
2200 if (isStructReturn) {
2201 assert(I != E && "Invalid struct return function!");
2206 std::string ArgName;
2207 for (; I != E; ++I) {
2208 if (PrintedArg) FunctionInnards << ", ";
2209 if (I->hasName() || !Prototype)
2210 ArgName = GetValueName(I);
2213 const Type *ArgTy = I->getType();
2214 if (PAL.paramHasAttr(Idx, Attribute::ByVal)) {
2215 ArgTy = cast<PointerType>(ArgTy)->getElementType();
2216 ByValParams.insert(I);
2218 printType(FunctionInnards, ArgTy,
2219 /*isSigned=*/PAL.paramHasAttr(Idx, Attribute::SExt),
2226 // Loop over the arguments, printing them.
2227 FunctionType::param_iterator I = FT->param_begin(), E = FT->param_end();
2230 // If this is a struct-return function, don't print the hidden
2231 // struct-return argument.
2232 if (isStructReturn) {
2233 assert(I != E && "Invalid struct return function!");
2238 for (; I != E; ++I) {
2239 if (PrintedArg) FunctionInnards << ", ";
2240 const Type *ArgTy = *I;
2241 if (PAL.paramHasAttr(Idx, Attribute::ByVal)) {
2242 assert(ArgTy->isPointerTy());
2243 ArgTy = cast<PointerType>(ArgTy)->getElementType();
2245 printType(FunctionInnards, ArgTy,
2246 /*isSigned=*/PAL.paramHasAttr(Idx, Attribute::SExt));
2252 if (!PrintedArg && FT->isVarArg()) {
2253 FunctionInnards << "int vararg_dummy_arg";
2257 // Finish printing arguments... if this is a vararg function, print the ...,
2258 // unless there are no known types, in which case, we just emit ().
2260 if (FT->isVarArg() && PrintedArg) {
2261 FunctionInnards << ",..."; // Output varargs portion of signature!
2262 } else if (!FT->isVarArg() && !PrintedArg) {
2263 FunctionInnards << "void"; // ret() -> ret(void) in C.
2265 FunctionInnards << ')';
2267 // Get the return tpe for the function.
2269 if (!isStructReturn)
2270 RetTy = F->getReturnType();
2272 // If this is a struct-return function, print the struct-return type.
2273 RetTy = cast<PointerType>(FT->getParamType(0))->getElementType();
2276 // Print out the return type and the signature built above.
2277 printType(Out, RetTy,
2278 /*isSigned=*/PAL.paramHasAttr(0, Attribute::SExt),
2279 FunctionInnards.str());
2282 static inline bool isFPIntBitCast(const Instruction &I) {
2283 if (!isa<BitCastInst>(I))
2285 const Type *SrcTy = I.getOperand(0)->getType();
2286 const Type *DstTy = I.getType();
2287 return (SrcTy->isFloatingPointTy() && DstTy->isIntegerTy()) ||
2288 (DstTy->isFloatingPointTy() && SrcTy->isIntegerTy());
2291 void CWriter::printFunction(Function &F) {
2292 /// isStructReturn - Should this function actually return a struct by-value?
2293 bool isStructReturn = F.hasStructRetAttr();
2295 printFunctionSignature(&F, false);
2298 // If this is a struct return function, handle the result with magic.
2299 if (isStructReturn) {
2300 const Type *StructTy =
2301 cast<PointerType>(F.arg_begin()->getType())->getElementType();
2303 printType(Out, StructTy, false, "StructReturn");
2304 Out << "; /* Struct return temporary */\n";
2307 printType(Out, F.arg_begin()->getType(), false,
2308 GetValueName(F.arg_begin()));
2309 Out << " = &StructReturn;\n";
2312 bool PrintedVar = false;
2314 // print local variable information for the function
2315 for (inst_iterator I = inst_begin(&F), E = inst_end(&F); I != E; ++I) {
2316 if (const AllocaInst *AI = isDirectAlloca(&*I)) {
2318 printType(Out, AI->getAllocatedType(), false, GetValueName(AI));
2319 Out << "; /* Address-exposed local */\n";
2321 } else if (I->getType() != Type::getVoidTy(F.getContext()) &&
2322 !isInlinableInst(*I)) {
2324 printType(Out, I->getType(), false, GetValueName(&*I));
2327 if (isa<PHINode>(*I)) { // Print out PHI node temporaries as well...
2329 printType(Out, I->getType(), false,
2330 GetValueName(&*I)+"__PHI_TEMPORARY");
2335 // We need a temporary for the BitCast to use so it can pluck a value out
2336 // of a union to do the BitCast. This is separate from the need for a
2337 // variable to hold the result of the BitCast.
2338 if (isFPIntBitCast(*I)) {
2339 Out << " llvmBitCastUnion " << GetValueName(&*I)
2340 << "__BITCAST_TEMPORARY;\n";
2348 if (F.hasExternalLinkage() && F.getName() == "main")
2349 Out << " CODE_FOR_MAIN();\n";
2351 // print the basic blocks
2352 for (Function::iterator BB = F.begin(), E = F.end(); BB != E; ++BB) {
2353 if (Loop *L = LI->getLoopFor(BB)) {
2354 if (L->getHeader() == BB && L->getParentLoop() == 0)
2357 printBasicBlock(BB);
2364 void CWriter::printLoop(Loop *L) {
2365 Out << " do { /* Syntactic loop '" << L->getHeader()->getName()
2366 << "' to make GCC happy */\n";
2367 for (unsigned i = 0, e = L->getBlocks().size(); i != e; ++i) {
2368 BasicBlock *BB = L->getBlocks()[i];
2369 Loop *BBLoop = LI->getLoopFor(BB);
2371 printBasicBlock(BB);
2372 else if (BB == BBLoop->getHeader() && BBLoop->getParentLoop() == L)
2375 Out << " } while (1); /* end of syntactic loop '"
2376 << L->getHeader()->getName() << "' */\n";
2379 void CWriter::printBasicBlock(BasicBlock *BB) {
2381 // Don't print the label for the basic block if there are no uses, or if
2382 // the only terminator use is the predecessor basic block's terminator.
2383 // We have to scan the use list because PHI nodes use basic blocks too but
2384 // do not require a label to be generated.
2386 bool NeedsLabel = false;
2387 for (pred_iterator PI = pred_begin(BB), E = pred_end(BB); PI != E; ++PI)
2388 if (isGotoCodeNecessary(*PI, BB)) {
2393 if (NeedsLabel) Out << GetValueName(BB) << ":\n";
2395 // Output all of the instructions in the basic block...
2396 for (BasicBlock::iterator II = BB->begin(), E = --BB->end(); II != E;
2398 if (!isInlinableInst(*II) && !isDirectAlloca(II)) {
2399 if (II->getType() != Type::getVoidTy(BB->getContext()) &&
2404 writeInstComputationInline(*II);
2409 // Don't emit prefix or suffix for the terminator.
2410 visit(*BB->getTerminator());
2414 // Specific Instruction type classes... note that all of the casts are
2415 // necessary because we use the instruction classes as opaque types...
2417 void CWriter::visitReturnInst(ReturnInst &I) {
2418 // If this is a struct return function, return the temporary struct.
2419 bool isStructReturn = I.getParent()->getParent()->hasStructRetAttr();
2421 if (isStructReturn) {
2422 Out << " return StructReturn;\n";
2426 // Don't output a void return if this is the last basic block in the function
2427 if (I.getNumOperands() == 0 &&
2428 &*--I.getParent()->getParent()->end() == I.getParent() &&
2429 !I.getParent()->size() == 1) {
2433 if (I.getNumOperands() > 1) {
2436 printType(Out, I.getParent()->getParent()->getReturnType());
2437 Out << " llvm_cbe_mrv_temp = {\n";
2438 for (unsigned i = 0, e = I.getNumOperands(); i != e; ++i) {
2440 writeOperand(I.getOperand(i));
2446 Out << " return llvm_cbe_mrv_temp;\n";
2452 if (I.getNumOperands()) {
2454 writeOperand(I.getOperand(0));
2459 void CWriter::visitSwitchInst(SwitchInst &SI) {
2462 writeOperand(SI.getOperand(0));
2463 Out << ") {\n default:\n";
2464 printPHICopiesForSuccessor (SI.getParent(), SI.getDefaultDest(), 2);
2465 printBranchToBlock(SI.getParent(), SI.getDefaultDest(), 2);
2467 for (unsigned i = 2, e = SI.getNumOperands(); i != e; i += 2) {
2469 writeOperand(SI.getOperand(i));
2471 BasicBlock *Succ = cast<BasicBlock>(SI.getOperand(i+1));
2472 printPHICopiesForSuccessor (SI.getParent(), Succ, 2);
2473 printBranchToBlock(SI.getParent(), Succ, 2);
2474 if (Function::iterator(Succ) == llvm::next(Function::iterator(SI.getParent())))
2480 void CWriter::visitIndirectBrInst(IndirectBrInst &IBI) {
2481 Out << " goto *(void*)(";
2482 writeOperand(IBI.getOperand(0));
2486 void CWriter::visitUnreachableInst(UnreachableInst &I) {
2487 Out << " /*UNREACHABLE*/;\n";
2490 bool CWriter::isGotoCodeNecessary(BasicBlock *From, BasicBlock *To) {
2491 /// FIXME: This should be reenabled, but loop reordering safe!!
2494 if (llvm::next(Function::iterator(From)) != Function::iterator(To))
2495 return true; // Not the direct successor, we need a goto.
2497 //isa<SwitchInst>(From->getTerminator())
2499 if (LI->getLoopFor(From) != LI->getLoopFor(To))
2504 void CWriter::printPHICopiesForSuccessor (BasicBlock *CurBlock,
2505 BasicBlock *Successor,
2507 for (BasicBlock::iterator I = Successor->begin(); isa<PHINode>(I); ++I) {
2508 PHINode *PN = cast<PHINode>(I);
2509 // Now we have to do the printing.
2510 Value *IV = PN->getIncomingValueForBlock(CurBlock);
2511 if (!isa<UndefValue>(IV)) {
2512 Out << std::string(Indent, ' ');
2513 Out << " " << GetValueName(I) << "__PHI_TEMPORARY = ";
2515 Out << "; /* for PHI node */\n";
2520 void CWriter::printBranchToBlock(BasicBlock *CurBB, BasicBlock *Succ,
2522 if (isGotoCodeNecessary(CurBB, Succ)) {
2523 Out << std::string(Indent, ' ') << " goto ";
2529 // Branch instruction printing - Avoid printing out a branch to a basic block
2530 // that immediately succeeds the current one.
2532 void CWriter::visitBranchInst(BranchInst &I) {
2534 if (I.isConditional()) {
2535 if (isGotoCodeNecessary(I.getParent(), I.getSuccessor(0))) {
2537 writeOperand(I.getCondition());
2540 printPHICopiesForSuccessor (I.getParent(), I.getSuccessor(0), 2);
2541 printBranchToBlock(I.getParent(), I.getSuccessor(0), 2);
2543 if (isGotoCodeNecessary(I.getParent(), I.getSuccessor(1))) {
2544 Out << " } else {\n";
2545 printPHICopiesForSuccessor (I.getParent(), I.getSuccessor(1), 2);
2546 printBranchToBlock(I.getParent(), I.getSuccessor(1), 2);
2549 // First goto not necessary, assume second one is...
2551 writeOperand(I.getCondition());
2554 printPHICopiesForSuccessor (I.getParent(), I.getSuccessor(1), 2);
2555 printBranchToBlock(I.getParent(), I.getSuccessor(1), 2);
2560 printPHICopiesForSuccessor (I.getParent(), I.getSuccessor(0), 0);
2561 printBranchToBlock(I.getParent(), I.getSuccessor(0), 0);
2566 // PHI nodes get copied into temporary values at the end of predecessor basic
2567 // blocks. We now need to copy these temporary values into the REAL value for
2569 void CWriter::visitPHINode(PHINode &I) {
2571 Out << "__PHI_TEMPORARY";
2575 void CWriter::visitBinaryOperator(Instruction &I) {
2576 // binary instructions, shift instructions, setCond instructions.
2577 assert(!I.getType()->isPointerTy());
2579 // We must cast the results of binary operations which might be promoted.
2580 bool needsCast = false;
2581 if ((I.getType() == Type::getInt8Ty(I.getContext())) ||
2582 (I.getType() == Type::getInt16Ty(I.getContext()))
2583 || (I.getType() == Type::getFloatTy(I.getContext()))) {
2586 printType(Out, I.getType(), false);
2590 // If this is a negation operation, print it out as such. For FP, we don't
2591 // want to print "-0.0 - X".
2592 if (BinaryOperator::isNeg(&I)) {
2594 writeOperand(BinaryOperator::getNegArgument(cast<BinaryOperator>(&I)));
2596 } else if (BinaryOperator::isFNeg(&I)) {
2598 writeOperand(BinaryOperator::getFNegArgument(cast<BinaryOperator>(&I)));
2600 } else if (I.getOpcode() == Instruction::FRem) {
2601 // Output a call to fmod/fmodf instead of emitting a%b
2602 if (I.getType() == Type::getFloatTy(I.getContext()))
2604 else if (I.getType() == Type::getDoubleTy(I.getContext()))
2606 else // all 3 flavors of long double
2608 writeOperand(I.getOperand(0));
2610 writeOperand(I.getOperand(1));
2614 // Write out the cast of the instruction's value back to the proper type
2616 bool NeedsClosingParens = writeInstructionCast(I);
2618 // Certain instructions require the operand to be forced to a specific type
2619 // so we use writeOperandWithCast here instead of writeOperand. Similarly
2620 // below for operand 1
2621 writeOperandWithCast(I.getOperand(0), I.getOpcode());
2623 switch (I.getOpcode()) {
2624 case Instruction::Add:
2625 case Instruction::FAdd: Out << " + "; break;
2626 case Instruction::Sub:
2627 case Instruction::FSub: Out << " - "; break;
2628 case Instruction::Mul:
2629 case Instruction::FMul: Out << " * "; break;
2630 case Instruction::URem:
2631 case Instruction::SRem:
2632 case Instruction::FRem: Out << " % "; break;
2633 case Instruction::UDiv:
2634 case Instruction::SDiv:
2635 case Instruction::FDiv: Out << " / "; break;
2636 case Instruction::And: Out << " & "; break;
2637 case Instruction::Or: Out << " | "; break;
2638 case Instruction::Xor: Out << " ^ "; break;
2639 case Instruction::Shl : Out << " << "; break;
2640 case Instruction::LShr:
2641 case Instruction::AShr: Out << " >> "; break;
2644 errs() << "Invalid operator type!" << I;
2646 llvm_unreachable(0);
2649 writeOperandWithCast(I.getOperand(1), I.getOpcode());
2650 if (NeedsClosingParens)
2659 void CWriter::visitICmpInst(ICmpInst &I) {
2660 // We must cast the results of icmp which might be promoted.
2661 bool needsCast = false;
2663 // Write out the cast of the instruction's value back to the proper type
2665 bool NeedsClosingParens = writeInstructionCast(I);
2667 // Certain icmp predicate require the operand to be forced to a specific type
2668 // so we use writeOperandWithCast here instead of writeOperand. Similarly
2669 // below for operand 1
2670 writeOperandWithCast(I.getOperand(0), I);
2672 switch (I.getPredicate()) {
2673 case ICmpInst::ICMP_EQ: Out << " == "; break;
2674 case ICmpInst::ICMP_NE: Out << " != "; break;
2675 case ICmpInst::ICMP_ULE:
2676 case ICmpInst::ICMP_SLE: Out << " <= "; break;
2677 case ICmpInst::ICMP_UGE:
2678 case ICmpInst::ICMP_SGE: Out << " >= "; break;
2679 case ICmpInst::ICMP_ULT:
2680 case ICmpInst::ICMP_SLT: Out << " < "; break;
2681 case ICmpInst::ICMP_UGT:
2682 case ICmpInst::ICMP_SGT: Out << " > "; break;
2685 errs() << "Invalid icmp predicate!" << I;
2687 llvm_unreachable(0);
2690 writeOperandWithCast(I.getOperand(1), I);
2691 if (NeedsClosingParens)
2699 void CWriter::visitFCmpInst(FCmpInst &I) {
2700 if (I.getPredicate() == FCmpInst::FCMP_FALSE) {
2704 if (I.getPredicate() == FCmpInst::FCMP_TRUE) {
2710 switch (I.getPredicate()) {
2711 default: llvm_unreachable("Illegal FCmp predicate");
2712 case FCmpInst::FCMP_ORD: op = "ord"; break;
2713 case FCmpInst::FCMP_UNO: op = "uno"; break;
2714 case FCmpInst::FCMP_UEQ: op = "ueq"; break;
2715 case FCmpInst::FCMP_UNE: op = "une"; break;
2716 case FCmpInst::FCMP_ULT: op = "ult"; break;
2717 case FCmpInst::FCMP_ULE: op = "ule"; break;
2718 case FCmpInst::FCMP_UGT: op = "ugt"; break;
2719 case FCmpInst::FCMP_UGE: op = "uge"; break;
2720 case FCmpInst::FCMP_OEQ: op = "oeq"; break;
2721 case FCmpInst::FCMP_ONE: op = "one"; break;
2722 case FCmpInst::FCMP_OLT: op = "olt"; break;
2723 case FCmpInst::FCMP_OLE: op = "ole"; break;
2724 case FCmpInst::FCMP_OGT: op = "ogt"; break;
2725 case FCmpInst::FCMP_OGE: op = "oge"; break;
2728 Out << "llvm_fcmp_" << op << "(";
2729 // Write the first operand
2730 writeOperand(I.getOperand(0));
2732 // Write the second operand
2733 writeOperand(I.getOperand(1));
2737 static const char * getFloatBitCastField(const Type *Ty) {
2738 switch (Ty->getTypeID()) {
2739 default: llvm_unreachable("Invalid Type");
2740 case Type::FloatTyID: return "Float";
2741 case Type::DoubleTyID: return "Double";
2742 case Type::IntegerTyID: {
2743 unsigned NumBits = cast<IntegerType>(Ty)->getBitWidth();
2752 void CWriter::visitCastInst(CastInst &I) {
2753 const Type *DstTy = I.getType();
2754 const Type *SrcTy = I.getOperand(0)->getType();
2755 if (isFPIntBitCast(I)) {
2757 // These int<->float and long<->double casts need to be handled specially
2758 Out << GetValueName(&I) << "__BITCAST_TEMPORARY."
2759 << getFloatBitCastField(I.getOperand(0)->getType()) << " = ";
2760 writeOperand(I.getOperand(0));
2761 Out << ", " << GetValueName(&I) << "__BITCAST_TEMPORARY."
2762 << getFloatBitCastField(I.getType());
2768 printCast(I.getOpcode(), SrcTy, DstTy);
2770 // Make a sext from i1 work by subtracting the i1 from 0 (an int).
2771 if (SrcTy == Type::getInt1Ty(I.getContext()) &&
2772 I.getOpcode() == Instruction::SExt)
2775 writeOperand(I.getOperand(0));
2777 if (DstTy == Type::getInt1Ty(I.getContext()) &&
2778 (I.getOpcode() == Instruction::Trunc ||
2779 I.getOpcode() == Instruction::FPToUI ||
2780 I.getOpcode() == Instruction::FPToSI ||
2781 I.getOpcode() == Instruction::PtrToInt)) {
2782 // Make sure we really get a trunc to bool by anding the operand with 1
2788 void CWriter::visitSelectInst(SelectInst &I) {
2790 writeOperand(I.getCondition());
2792 writeOperand(I.getTrueValue());
2794 writeOperand(I.getFalseValue());
2799 void CWriter::lowerIntrinsics(Function &F) {
2800 // This is used to keep track of intrinsics that get generated to a lowered
2801 // function. We must generate the prototypes before the function body which
2802 // will only be expanded on first use (by the loop below).
2803 std::vector<Function*> prototypesToGen;
2805 // Examine all the instructions in this function to find the intrinsics that
2806 // need to be lowered.
2807 for (Function::iterator BB = F.begin(), EE = F.end(); BB != EE; ++BB)
2808 for (BasicBlock::iterator I = BB->begin(), E = BB->end(); I != E; )
2809 if (CallInst *CI = dyn_cast<CallInst>(I++))
2810 if (Function *F = CI->getCalledFunction())
2811 switch (F->getIntrinsicID()) {
2812 case Intrinsic::not_intrinsic:
2813 case Intrinsic::memory_barrier:
2814 case Intrinsic::vastart:
2815 case Intrinsic::vacopy:
2816 case Intrinsic::vaend:
2817 case Intrinsic::returnaddress:
2818 case Intrinsic::frameaddress:
2819 case Intrinsic::setjmp:
2820 case Intrinsic::longjmp:
2821 case Intrinsic::prefetch:
2822 case Intrinsic::powi:
2823 case Intrinsic::x86_sse_cmp_ss:
2824 case Intrinsic::x86_sse_cmp_ps:
2825 case Intrinsic::x86_sse2_cmp_sd:
2826 case Intrinsic::x86_sse2_cmp_pd:
2827 case Intrinsic::ppc_altivec_lvsl:
2828 // We directly implement these intrinsics
2831 // If this is an intrinsic that directly corresponds to a GCC
2832 // builtin, we handle it.
2833 const char *BuiltinName = "";
2834 #define GET_GCC_BUILTIN_NAME
2835 #include "llvm/Intrinsics.gen"
2836 #undef GET_GCC_BUILTIN_NAME
2837 // If we handle it, don't lower it.
2838 if (BuiltinName[0]) break;
2840 // All other intrinsic calls we must lower.
2841 Instruction *Before = 0;
2842 if (CI != &BB->front())
2843 Before = prior(BasicBlock::iterator(CI));
2845 IL->LowerIntrinsicCall(CI);
2846 if (Before) { // Move iterator to instruction after call
2851 // If the intrinsic got lowered to another call, and that call has
2852 // a definition then we need to make sure its prototype is emitted
2853 // before any calls to it.
2854 if (CallInst *Call = dyn_cast<CallInst>(I))
2855 if (Function *NewF = Call->getCalledFunction())
2856 if (!NewF->isDeclaration())
2857 prototypesToGen.push_back(NewF);
2862 // We may have collected some prototypes to emit in the loop above.
2863 // Emit them now, before the function that uses them is emitted. But,
2864 // be careful not to emit them twice.
2865 std::vector<Function*>::iterator I = prototypesToGen.begin();
2866 std::vector<Function*>::iterator E = prototypesToGen.end();
2867 for ( ; I != E; ++I) {
2868 if (intrinsicPrototypesAlreadyGenerated.insert(*I).second) {
2870 printFunctionSignature(*I, true);
2876 void CWriter::visitCallInst(CallInst &I) {
2877 if (isa<InlineAsm>(I.getCalledValue()))
2878 return visitInlineAsm(I);
2880 bool WroteCallee = false;
2882 // Handle intrinsic function calls first...
2883 if (Function *F = I.getCalledFunction())
2884 if (Intrinsic::ID ID = (Intrinsic::ID)F->getIntrinsicID())
2885 if (visitBuiltinCall(I, ID, WroteCallee))
2888 Value *Callee = I.getCalledValue();
2890 const PointerType *PTy = cast<PointerType>(Callee->getType());
2891 const FunctionType *FTy = cast<FunctionType>(PTy->getElementType());
2893 // If this is a call to a struct-return function, assign to the first
2894 // parameter instead of passing it to the call.
2895 const AttrListPtr &PAL = I.getAttributes();
2896 bool hasByVal = I.hasByValArgument();
2897 bool isStructRet = I.hasStructRetAttr();
2899 writeOperandDeref(I.getArgOperand(0));
2903 if (I.isTailCall()) Out << " /*tail*/ ";
2906 // If this is an indirect call to a struct return function, we need to cast
2907 // the pointer. Ditto for indirect calls with byval arguments.
2908 bool NeedsCast = (hasByVal || isStructRet) && !isa<Function>(Callee);
2910 // GCC is a real PITA. It does not permit codegening casts of functions to
2911 // function pointers if they are in a call (it generates a trap instruction
2912 // instead!). We work around this by inserting a cast to void* in between
2913 // the function and the function pointer cast. Unfortunately, we can't just
2914 // form the constant expression here, because the folder will immediately
2917 // Note finally, that this is completely unsafe. ANSI C does not guarantee
2918 // that void* and function pointers have the same size. :( To deal with this
2919 // in the common case, we handle casts where the number of arguments passed
2922 if (ConstantExpr *CE = dyn_cast<ConstantExpr>(Callee))
2924 if (Function *RF = dyn_cast<Function>(CE->getOperand(0))) {
2930 // Ok, just cast the pointer type.
2933 printStructReturnPointerFunctionType(Out, PAL,
2934 cast<PointerType>(I.getCalledValue()->getType()));
2936 printType(Out, I.getCalledValue()->getType(), false, "", true, PAL);
2938 printType(Out, I.getCalledValue()->getType());
2941 writeOperand(Callee);
2942 if (NeedsCast) Out << ')';
2947 bool PrintedArg = false;
2948 if(FTy->isVarArg() && !FTy->getNumParams()) {
2949 Out << "0 /*dummy arg*/";
2953 unsigned NumDeclaredParams = FTy->getNumParams();
2955 CallSite::arg_iterator AI = CS.arg_begin(), AE = CS.arg_end();
2957 if (isStructRet) { // Skip struct return argument.
2963 for (; AI != AE; ++AI, ++ArgNo) {
2964 if (PrintedArg) Out << ", ";
2965 if (ArgNo < NumDeclaredParams &&
2966 (*AI)->getType() != FTy->getParamType(ArgNo)) {
2968 printType(Out, FTy->getParamType(ArgNo),
2969 /*isSigned=*/PAL.paramHasAttr(ArgNo+1, Attribute::SExt));
2972 // Check if the argument is expected to be passed by value.
2973 if (I.paramHasAttr(ArgNo+1, Attribute::ByVal))
2974 writeOperandDeref(*AI);
2982 /// visitBuiltinCall - Handle the call to the specified builtin. Returns true
2983 /// if the entire call is handled, return false if it wasn't handled, and
2984 /// optionally set 'WroteCallee' if the callee has already been printed out.
2985 bool CWriter::visitBuiltinCall(CallInst &I, Intrinsic::ID ID,
2986 bool &WroteCallee) {
2989 // If this is an intrinsic that directly corresponds to a GCC
2990 // builtin, we emit it here.
2991 const char *BuiltinName = "";
2992 Function *F = I.getCalledFunction();
2993 #define GET_GCC_BUILTIN_NAME
2994 #include "llvm/Intrinsics.gen"
2995 #undef GET_GCC_BUILTIN_NAME
2996 assert(BuiltinName[0] && "Unknown LLVM intrinsic!");
3002 case Intrinsic::memory_barrier:
3003 Out << "__sync_synchronize()";
3005 case Intrinsic::vastart:
3008 Out << "va_start(*(va_list*)";
3009 writeOperand(I.getArgOperand(0));
3011 // Output the last argument to the enclosing function.
3012 if (I.getParent()->getParent()->arg_empty())
3013 Out << "vararg_dummy_arg";
3015 writeOperand(--I.getParent()->getParent()->arg_end());
3018 case Intrinsic::vaend:
3019 if (!isa<ConstantPointerNull>(I.getArgOperand(0))) {
3020 Out << "0; va_end(*(va_list*)";
3021 writeOperand(I.getArgOperand(0));
3024 Out << "va_end(*(va_list*)0)";
3027 case Intrinsic::vacopy:
3029 Out << "va_copy(*(va_list*)";
3030 writeOperand(I.getArgOperand(0));
3031 Out << ", *(va_list*)";
3032 writeOperand(I.getArgOperand(1));
3035 case Intrinsic::returnaddress:
3036 Out << "__builtin_return_address(";
3037 writeOperand(I.getArgOperand(0));
3040 case Intrinsic::frameaddress:
3041 Out << "__builtin_frame_address(";
3042 writeOperand(I.getArgOperand(0));
3045 case Intrinsic::powi:
3046 Out << "__builtin_powi(";
3047 writeOperand(I.getArgOperand(0));
3049 writeOperand(I.getArgOperand(1));
3052 case Intrinsic::setjmp:
3053 Out << "setjmp(*(jmp_buf*)";
3054 writeOperand(I.getArgOperand(0));
3057 case Intrinsic::longjmp:
3058 Out << "longjmp(*(jmp_buf*)";
3059 writeOperand(I.getArgOperand(0));
3061 writeOperand(I.getArgOperand(1));
3064 case Intrinsic::prefetch:
3065 Out << "LLVM_PREFETCH((const void *)";
3066 writeOperand(I.getArgOperand(0));
3068 writeOperand(I.getArgOperand(1));
3070 writeOperand(I.getArgOperand(2));
3073 case Intrinsic::stacksave:
3074 // Emit this as: Val = 0; *((void**)&Val) = __builtin_stack_save()
3075 // to work around GCC bugs (see PR1809).
3076 Out << "0; *((void**)&" << GetValueName(&I)
3077 << ") = __builtin_stack_save()";
3079 case Intrinsic::x86_sse_cmp_ss:
3080 case Intrinsic::x86_sse_cmp_ps:
3081 case Intrinsic::x86_sse2_cmp_sd:
3082 case Intrinsic::x86_sse2_cmp_pd:
3084 printType(Out, I.getType());
3086 // Multiple GCC builtins multiplex onto this intrinsic.
3087 switch (cast<ConstantInt>(I.getArgOperand(2))->getZExtValue()) {
3088 default: llvm_unreachable("Invalid llvm.x86.sse.cmp!");
3089 case 0: Out << "__builtin_ia32_cmpeq"; break;
3090 case 1: Out << "__builtin_ia32_cmplt"; break;
3091 case 2: Out << "__builtin_ia32_cmple"; break;
3092 case 3: Out << "__builtin_ia32_cmpunord"; break;
3093 case 4: Out << "__builtin_ia32_cmpneq"; break;
3094 case 5: Out << "__builtin_ia32_cmpnlt"; break;
3095 case 6: Out << "__builtin_ia32_cmpnle"; break;
3096 case 7: Out << "__builtin_ia32_cmpord"; break;
3098 if (ID == Intrinsic::x86_sse_cmp_ps || ID == Intrinsic::x86_sse2_cmp_pd)
3102 if (ID == Intrinsic::x86_sse_cmp_ss || ID == Intrinsic::x86_sse_cmp_ps)
3108 writeOperand(I.getArgOperand(0));
3110 writeOperand(I.getArgOperand(1));
3113 case Intrinsic::ppc_altivec_lvsl:
3115 printType(Out, I.getType());
3117 Out << "__builtin_altivec_lvsl(0, (void*)";
3118 writeOperand(I.getArgOperand(0));
3124 //This converts the llvm constraint string to something gcc is expecting.
3125 //TODO: work out platform independent constraints and factor those out
3126 // of the per target tables
3127 // handle multiple constraint codes
3128 std::string CWriter::InterpretASMConstraint(InlineAsm::ConstraintInfo& c) {
3129 assert(c.Codes.size() == 1 && "Too many asm constraint codes to handle");
3131 // Grab the translation table from MCAsmInfo if it exists.
3132 const MCAsmInfo *TargetAsm;
3133 std::string Triple = TheModule->getTargetTriple();
3135 Triple = llvm::sys::getHostTriple();
3138 if (const Target *Match = TargetRegistry::lookupTarget(Triple, E))
3139 TargetAsm = Match->createAsmInfo(Triple);
3143 const char *const *table = TargetAsm->getAsmCBE();
3145 // Search the translation table if it exists.
3146 for (int i = 0; table && table[i]; i += 2)
3147 if (c.Codes[0] == table[i]) {
3152 // Default is identity.
3157 //TODO: import logic from AsmPrinter.cpp
3158 static std::string gccifyAsm(std::string asmstr) {
3159 for (std::string::size_type i = 0; i != asmstr.size(); ++i)
3160 if (asmstr[i] == '\n')
3161 asmstr.replace(i, 1, "\\n");
3162 else if (asmstr[i] == '\t')
3163 asmstr.replace(i, 1, "\\t");
3164 else if (asmstr[i] == '$') {
3165 if (asmstr[i + 1] == '{') {
3166 std::string::size_type a = asmstr.find_first_of(':', i + 1);
3167 std::string::size_type b = asmstr.find_first_of('}', i + 1);
3168 std::string n = "%" +
3169 asmstr.substr(a + 1, b - a - 1) +
3170 asmstr.substr(i + 2, a - i - 2);
3171 asmstr.replace(i, b - i + 1, n);
3174 asmstr.replace(i, 1, "%");
3176 else if (asmstr[i] == '%')//grr
3177 { asmstr.replace(i, 1, "%%"); ++i;}
3182 //TODO: assumptions about what consume arguments from the call are likely wrong
3183 // handle communitivity
3184 void CWriter::visitInlineAsm(CallInst &CI) {
3185 InlineAsm* as = cast<InlineAsm>(CI.getCalledValue());
3186 std::vector<InlineAsm::ConstraintInfo> Constraints = as->ParseConstraints();
3188 std::vector<std::pair<Value*, int> > ResultVals;
3189 if (CI.getType() == Type::getVoidTy(CI.getContext()))
3191 else if (const StructType *ST = dyn_cast<StructType>(CI.getType())) {
3192 for (unsigned i = 0, e = ST->getNumElements(); i != e; ++i)
3193 ResultVals.push_back(std::make_pair(&CI, (int)i));
3195 ResultVals.push_back(std::make_pair(&CI, -1));
3198 // Fix up the asm string for gcc and emit it.
3199 Out << "__asm__ volatile (\"" << gccifyAsm(as->getAsmString()) << "\"\n";
3202 unsigned ValueCount = 0;
3203 bool IsFirst = true;
3205 // Convert over all the output constraints.
3206 for (std::vector<InlineAsm::ConstraintInfo>::iterator I = Constraints.begin(),
3207 E = Constraints.end(); I != E; ++I) {
3209 if (I->Type != InlineAsm::isOutput) {
3211 continue; // Ignore non-output constraints.
3214 assert(I->Codes.size() == 1 && "Too many asm constraint codes to handle");
3215 std::string C = InterpretASMConstraint(*I);
3216 if (C.empty()) continue;
3227 if (ValueCount < ResultVals.size()) {
3228 DestVal = ResultVals[ValueCount].first;
3229 DestValNo = ResultVals[ValueCount].second;
3231 DestVal = CI.getArgOperand(ValueCount-ResultVals.size());
3233 if (I->isEarlyClobber)
3236 Out << "\"=" << C << "\"(" << GetValueName(DestVal);
3237 if (DestValNo != -1)
3238 Out << ".field" << DestValNo; // Multiple retvals.
3244 // Convert over all the input constraints.
3248 for (std::vector<InlineAsm::ConstraintInfo>::iterator I = Constraints.begin(),
3249 E = Constraints.end(); I != E; ++I) {
3250 if (I->Type != InlineAsm::isInput) {
3252 continue; // Ignore non-input constraints.
3255 assert(I->Codes.size() == 1 && "Too many asm constraint codes to handle");
3256 std::string C = InterpretASMConstraint(*I);
3257 if (C.empty()) continue;
3264 assert(ValueCount >= ResultVals.size() && "Input can't refer to result");
3265 Value *SrcVal = CI.getArgOperand(ValueCount-ResultVals.size());
3267 Out << "\"" << C << "\"(";
3269 writeOperand(SrcVal);
3271 writeOperandDeref(SrcVal);
3275 // Convert over the clobber constraints.
3277 for (std::vector<InlineAsm::ConstraintInfo>::iterator I = Constraints.begin(),
3278 E = Constraints.end(); I != E; ++I) {
3279 if (I->Type != InlineAsm::isClobber)
3280 continue; // Ignore non-input constraints.
3282 assert(I->Codes.size() == 1 && "Too many asm constraint codes to handle");
3283 std::string C = InterpretASMConstraint(*I);
3284 if (C.empty()) continue;
3291 Out << '\"' << C << '"';
3297 void CWriter::visitAllocaInst(AllocaInst &I) {
3299 printType(Out, I.getType());
3300 Out << ") alloca(sizeof(";
3301 printType(Out, I.getType()->getElementType());
3303 if (I.isArrayAllocation()) {
3305 writeOperand(I.getOperand(0));
3310 void CWriter::printGEPExpression(Value *Ptr, gep_type_iterator I,
3311 gep_type_iterator E, bool Static) {
3313 // If there are no indices, just print out the pointer.
3319 // Find out if the last index is into a vector. If so, we have to print this
3320 // specially. Since vectors can't have elements of indexable type, only the
3321 // last index could possibly be of a vector element.
3322 const VectorType *LastIndexIsVector = 0;
3324 for (gep_type_iterator TmpI = I; TmpI != E; ++TmpI)
3325 LastIndexIsVector = dyn_cast<VectorType>(*TmpI);
3330 // If the last index is into a vector, we can't print it as &a[i][j] because
3331 // we can't index into a vector with j in GCC. Instead, emit this as
3332 // (((float*)&a[i])+j)
3333 if (LastIndexIsVector) {
3335 printType(Out, PointerType::getUnqual(LastIndexIsVector->getElementType()));
3341 // If the first index is 0 (very typical) we can do a number of
3342 // simplifications to clean up the code.
3343 Value *FirstOp = I.getOperand();
3344 if (!isa<Constant>(FirstOp) || !cast<Constant>(FirstOp)->isNullValue()) {
3345 // First index isn't simple, print it the hard way.
3348 ++I; // Skip the zero index.
3350 // Okay, emit the first operand. If Ptr is something that is already address
3351 // exposed, like a global, avoid emitting (&foo)[0], just emit foo instead.
3352 if (isAddressExposed(Ptr)) {
3353 writeOperandInternal(Ptr, Static);
3354 } else if (I != E && (*I)->isStructTy()) {
3355 // If we didn't already emit the first operand, see if we can print it as
3356 // P->f instead of "P[0].f"
3358 Out << "->field" << cast<ConstantInt>(I.getOperand())->getZExtValue();
3359 ++I; // eat the struct index as well.
3361 // Instead of emitting P[0][1], emit (*P)[1], which is more idiomatic.
3368 for (; I != E; ++I) {
3369 if ((*I)->isStructTy()) {
3370 Out << ".field" << cast<ConstantInt>(I.getOperand())->getZExtValue();
3371 } else if ((*I)->isArrayTy()) {
3373 writeOperandWithCast(I.getOperand(), Instruction::GetElementPtr);
3375 } else if (!(*I)->isVectorTy()) {
3377 writeOperandWithCast(I.getOperand(), Instruction::GetElementPtr);
3380 // If the last index is into a vector, then print it out as "+j)". This
3381 // works with the 'LastIndexIsVector' code above.
3382 if (isa<Constant>(I.getOperand()) &&
3383 cast<Constant>(I.getOperand())->isNullValue()) {
3384 Out << "))"; // avoid "+0".
3387 writeOperandWithCast(I.getOperand(), Instruction::GetElementPtr);
3395 void CWriter::writeMemoryAccess(Value *Operand, const Type *OperandType,
3396 bool IsVolatile, unsigned Alignment) {
3398 bool IsUnaligned = Alignment &&
3399 Alignment < TD->getABITypeAlignment(OperandType);
3403 if (IsVolatile || IsUnaligned) {
3406 Out << "struct __attribute__ ((packed, aligned(" << Alignment << "))) {";
3407 printType(Out, OperandType, false, IsUnaligned ? "data" : "volatile*");
3410 if (IsVolatile) Out << "volatile ";
3416 writeOperand(Operand);
3418 if (IsVolatile || IsUnaligned) {
3425 void CWriter::visitLoadInst(LoadInst &I) {
3426 writeMemoryAccess(I.getOperand(0), I.getType(), I.isVolatile(),
3431 void CWriter::visitStoreInst(StoreInst &I) {
3432 writeMemoryAccess(I.getPointerOperand(), I.getOperand(0)->getType(),
3433 I.isVolatile(), I.getAlignment());
3435 Value *Operand = I.getOperand(0);
3436 Constant *BitMask = 0;
3437 if (const IntegerType* ITy = dyn_cast<IntegerType>(Operand->getType()))
3438 if (!ITy->isPowerOf2ByteWidth())
3439 // We have a bit width that doesn't match an even power-of-2 byte
3440 // size. Consequently we must & the value with the type's bit mask
3441 BitMask = ConstantInt::get(ITy, ITy->getBitMask());
3444 writeOperand(Operand);
3447 printConstant(BitMask, false);
3452 void CWriter::visitGetElementPtrInst(GetElementPtrInst &I) {
3453 printGEPExpression(I.getPointerOperand(), gep_type_begin(I),
3454 gep_type_end(I), false);
3457 void CWriter::visitVAArgInst(VAArgInst &I) {
3458 Out << "va_arg(*(va_list*)";
3459 writeOperand(I.getOperand(0));
3461 printType(Out, I.getType());
3465 void CWriter::visitInsertElementInst(InsertElementInst &I) {
3466 const Type *EltTy = I.getType()->getElementType();
3467 writeOperand(I.getOperand(0));
3470 printType(Out, PointerType::getUnqual(EltTy));
3471 Out << ")(&" << GetValueName(&I) << "))[";
3472 writeOperand(I.getOperand(2));
3474 writeOperand(I.getOperand(1));
3478 void CWriter::visitExtractElementInst(ExtractElementInst &I) {
3479 // We know that our operand is not inlined.
3482 cast<VectorType>(I.getOperand(0)->getType())->getElementType();
3483 printType(Out, PointerType::getUnqual(EltTy));
3484 Out << ")(&" << GetValueName(I.getOperand(0)) << "))[";
3485 writeOperand(I.getOperand(1));
3489 void CWriter::visitShuffleVectorInst(ShuffleVectorInst &SVI) {
3491 printType(Out, SVI.getType());
3493 const VectorType *VT = SVI.getType();
3494 unsigned NumElts = VT->getNumElements();
3495 const Type *EltTy = VT->getElementType();
3497 for (unsigned i = 0; i != NumElts; ++i) {
3499 int SrcVal = SVI.getMaskValue(i);
3500 if ((unsigned)SrcVal >= NumElts*2) {
3501 Out << " 0/*undef*/ ";
3503 Value *Op = SVI.getOperand((unsigned)SrcVal >= NumElts);
3504 if (isa<Instruction>(Op)) {
3505 // Do an extractelement of this value from the appropriate input.
3507 printType(Out, PointerType::getUnqual(EltTy));
3508 Out << ")(&" << GetValueName(Op)
3509 << "))[" << (SrcVal & (NumElts-1)) << "]";
3510 } else if (isa<ConstantAggregateZero>(Op) || isa<UndefValue>(Op)) {
3513 printConstant(cast<ConstantVector>(Op)->getOperand(SrcVal &
3522 void CWriter::visitInsertValueInst(InsertValueInst &IVI) {
3523 // Start by copying the entire aggregate value into the result variable.
3524 writeOperand(IVI.getOperand(0));
3527 // Then do the insert to update the field.
3528 Out << GetValueName(&IVI);
3529 for (const unsigned *b = IVI.idx_begin(), *i = b, *e = IVI.idx_end();
3531 const Type *IndexedTy =
3532 ExtractValueInst::getIndexedType(IVI.getOperand(0)->getType(), b, i+1);
3533 if (IndexedTy->isArrayTy())
3534 Out << ".array[" << *i << "]";
3536 Out << ".field" << *i;
3539 writeOperand(IVI.getOperand(1));
3542 void CWriter::visitExtractValueInst(ExtractValueInst &EVI) {
3544 if (isa<UndefValue>(EVI.getOperand(0))) {
3546 printType(Out, EVI.getType());
3547 Out << ") 0/*UNDEF*/";
3549 Out << GetValueName(EVI.getOperand(0));
3550 for (const unsigned *b = EVI.idx_begin(), *i = b, *e = EVI.idx_end();
3552 const Type *IndexedTy =
3553 ExtractValueInst::getIndexedType(EVI.getOperand(0)->getType(), b, i+1);
3554 if (IndexedTy->isArrayTy())
3555 Out << ".array[" << *i << "]";
3557 Out << ".field" << *i;
3563 //===----------------------------------------------------------------------===//
3564 // External Interface declaration
3565 //===----------------------------------------------------------------------===//
3567 bool CTargetMachine::addPassesToEmitFile(PassManagerBase &PM,
3568 formatted_raw_ostream &o,
3569 CodeGenFileType FileType,
3570 CodeGenOpt::Level OptLevel,
3571 bool DisableVerify) {
3572 if (FileType != TargetMachine::CGFT_AssemblyFile) return true;
3574 PM.add(createGCLoweringPass());
3575 PM.add(createLowerInvokePass());
3576 PM.add(createCFGSimplificationPass()); // clean up after lower invoke.
3577 PM.add(new CBackendNameAllUsedStructsAndMergeFunctions());
3578 PM.add(new CWriter(o));
3579 PM.add(createGCInfoDeleter());