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"
53 // Some ms header decided to define setjmp as _setjmp, undo this for this file.
59 extern "C" void LLVMInitializeCBackendTarget() {
60 // Register the target.
61 RegisterTargetMachine<CTargetMachine> X(TheCBackendTarget);
65 class CBEMCAsmInfo : public MCAsmInfo {
69 PrivateGlobalPrefix = "";
72 /// CBackendNameAllUsedStructsAndMergeFunctions - This pass inserts names for
73 /// any unnamed structure types that are used by the program, and merges
74 /// external functions with the same name.
76 class CBackendNameAllUsedStructsAndMergeFunctions : public ModulePass {
79 CBackendNameAllUsedStructsAndMergeFunctions()
81 void getAnalysisUsage(AnalysisUsage &AU) const {
82 AU.addRequired<FindUsedTypes>();
85 virtual const char *getPassName() const {
86 return "C backend type canonicalizer";
89 virtual bool runOnModule(Module &M);
92 char CBackendNameAllUsedStructsAndMergeFunctions::ID = 0;
94 /// CWriter - This class is the main chunk of code that converts an LLVM
95 /// module to a C translation unit.
96 class CWriter : public FunctionPass, public InstVisitor<CWriter> {
97 formatted_raw_ostream &Out;
98 IntrinsicLowering *IL;
101 const Module *TheModule;
102 const MCAsmInfo* TAsm;
104 const TargetData* TD;
105 std::map<const Type *, std::string> TypeNames;
106 std::map<const ConstantFP *, unsigned> FPConstantMap;
107 std::set<Function*> intrinsicPrototypesAlreadyGenerated;
108 std::set<const Argument*> ByValParams;
110 unsigned OpaqueCounter;
111 DenseMap<const Value*, unsigned> AnonValueNumbers;
112 unsigned NextAnonValueNumber;
116 explicit CWriter(formatted_raw_ostream &o)
117 : FunctionPass(ID), Out(o), IL(0), Mang(0), LI(0),
118 TheModule(0), TAsm(0), TCtx(0), TD(0), OpaqueCounter(0),
119 NextAnonValueNumber(0) {
123 virtual const char *getPassName() const { return "C backend"; }
125 void getAnalysisUsage(AnalysisUsage &AU) const {
126 AU.addRequired<LoopInfo>();
127 AU.setPreservesAll();
130 virtual bool doInitialization(Module &M);
132 bool runOnFunction(Function &F) {
133 // Do not codegen any 'available_externally' functions at all, they have
134 // definitions outside the translation unit.
135 if (F.hasAvailableExternallyLinkage())
138 LI = &getAnalysis<LoopInfo>();
140 // Get rid of intrinsics we can't handle.
143 // Output all floating point constants that cannot be printed accurately.
144 printFloatingPointConstants(F);
150 virtual bool doFinalization(Module &M) {
157 FPConstantMap.clear();
160 intrinsicPrototypesAlreadyGenerated.clear();
164 raw_ostream &printType(raw_ostream &Out, const Type *Ty,
165 bool isSigned = false,
166 const std::string &VariableName = "",
167 bool IgnoreName = false,
168 const AttrListPtr &PAL = AttrListPtr());
169 raw_ostream &printSimpleType(raw_ostream &Out, const Type *Ty,
171 const std::string &NameSoFar = "");
173 void printStructReturnPointerFunctionType(raw_ostream &Out,
174 const AttrListPtr &PAL,
175 const PointerType *Ty);
177 /// writeOperandDeref - Print the result of dereferencing the specified
178 /// operand with '*'. This is equivalent to printing '*' then using
179 /// writeOperand, but avoids excess syntax in some cases.
180 void writeOperandDeref(Value *Operand) {
181 if (isAddressExposed(Operand)) {
182 // Already something with an address exposed.
183 writeOperandInternal(Operand);
186 writeOperand(Operand);
191 void writeOperand(Value *Operand, bool Static = false);
192 void writeInstComputationInline(Instruction &I);
193 void writeOperandInternal(Value *Operand, bool Static = false);
194 void writeOperandWithCast(Value* Operand, unsigned Opcode);
195 void writeOperandWithCast(Value* Operand, const ICmpInst &I);
196 bool writeInstructionCast(const Instruction &I);
198 void writeMemoryAccess(Value *Operand, const Type *OperandType,
199 bool IsVolatile, unsigned Alignment);
202 std::string InterpretASMConstraint(InlineAsm::ConstraintInfo& c);
204 void lowerIntrinsics(Function &F);
206 void printModuleTypes(const TypeSymbolTable &ST);
207 void printContainedStructs(const Type *Ty, std::set<const Type *> &);
208 void printFloatingPointConstants(Function &F);
209 void printFloatingPointConstants(const Constant *C);
210 void printFunctionSignature(const Function *F, bool Prototype);
212 void printFunction(Function &);
213 void printBasicBlock(BasicBlock *BB);
214 void printLoop(Loop *L);
216 void printCast(unsigned opcode, const Type *SrcTy, const Type *DstTy);
217 void printConstant(Constant *CPV, bool Static);
218 void printConstantWithCast(Constant *CPV, unsigned Opcode);
219 bool printConstExprCast(const ConstantExpr *CE, bool Static);
220 void printConstantArray(ConstantArray *CPA, bool Static);
221 void printConstantVector(ConstantVector *CV, bool Static);
223 /// isAddressExposed - Return true if the specified value's name needs to
224 /// have its address taken in order to get a C value of the correct type.
225 /// This happens for global variables, byval parameters, and direct allocas.
226 bool isAddressExposed(const Value *V) const {
227 if (const Argument *A = dyn_cast<Argument>(V))
228 return ByValParams.count(A);
229 return isa<GlobalVariable>(V) || isDirectAlloca(V);
232 // isInlinableInst - Attempt to inline instructions into their uses to build
233 // trees as much as possible. To do this, we have to consistently decide
234 // what is acceptable to inline, so that variable declarations don't get
235 // printed and an extra copy of the expr is not emitted.
237 static bool isInlinableInst(const Instruction &I) {
238 // Always inline cmp instructions, even if they are shared by multiple
239 // expressions. GCC generates horrible code if we don't.
243 // Must be an expression, must be used exactly once. If it is dead, we
244 // emit it inline where it would go.
245 if (I.getType() == Type::getVoidTy(I.getContext()) || !I.hasOneUse() ||
246 isa<TerminatorInst>(I) || isa<CallInst>(I) || isa<PHINode>(I) ||
247 isa<LoadInst>(I) || isa<VAArgInst>(I) || isa<InsertElementInst>(I) ||
248 isa<InsertValueInst>(I))
249 // Don't inline a load across a store or other bad things!
252 // Must not be used in inline asm, extractelement, or shufflevector.
254 const Instruction &User = cast<Instruction>(*I.use_back());
255 if (isInlineAsm(User) || isa<ExtractElementInst>(User) ||
256 isa<ShuffleVectorInst>(User))
260 // Only inline instruction it if it's use is in the same BB as the inst.
261 return I.getParent() == cast<Instruction>(I.use_back())->getParent();
264 // isDirectAlloca - Define fixed sized allocas in the entry block as direct
265 // variables which are accessed with the & operator. This causes GCC to
266 // generate significantly better code than to emit alloca calls directly.
268 static const AllocaInst *isDirectAlloca(const Value *V) {
269 const AllocaInst *AI = dyn_cast<AllocaInst>(V);
271 if (AI->isArrayAllocation())
272 return 0; // FIXME: we can also inline fixed size array allocas!
273 if (AI->getParent() != &AI->getParent()->getParent()->getEntryBlock())
278 // isInlineAsm - Check if the instruction is a call to an inline asm chunk
279 static bool isInlineAsm(const Instruction& I) {
280 if (const CallInst *CI = dyn_cast<CallInst>(&I))
281 return isa<InlineAsm>(CI->getCalledValue());
285 // Instruction visitation functions
286 friend class InstVisitor<CWriter>;
288 void visitReturnInst(ReturnInst &I);
289 void visitBranchInst(BranchInst &I);
290 void visitSwitchInst(SwitchInst &I);
291 void visitIndirectBrInst(IndirectBrInst &I);
292 void visitInvokeInst(InvokeInst &I) {
293 llvm_unreachable("Lowerinvoke pass didn't work!");
296 void visitUnwindInst(UnwindInst &I) {
297 llvm_unreachable("Lowerinvoke pass didn't work!");
299 void visitUnreachableInst(UnreachableInst &I);
301 void visitPHINode(PHINode &I);
302 void visitBinaryOperator(Instruction &I);
303 void visitICmpInst(ICmpInst &I);
304 void visitFCmpInst(FCmpInst &I);
306 void visitCastInst (CastInst &I);
307 void visitSelectInst(SelectInst &I);
308 void visitCallInst (CallInst &I);
309 void visitInlineAsm(CallInst &I);
310 bool visitBuiltinCall(CallInst &I, Intrinsic::ID ID, bool &WroteCallee);
312 void visitAllocaInst(AllocaInst &I);
313 void visitLoadInst (LoadInst &I);
314 void visitStoreInst (StoreInst &I);
315 void visitGetElementPtrInst(GetElementPtrInst &I);
316 void visitVAArgInst (VAArgInst &I);
318 void visitInsertElementInst(InsertElementInst &I);
319 void visitExtractElementInst(ExtractElementInst &I);
320 void visitShuffleVectorInst(ShuffleVectorInst &SVI);
322 void visitInsertValueInst(InsertValueInst &I);
323 void visitExtractValueInst(ExtractValueInst &I);
325 void visitInstruction(Instruction &I) {
327 errs() << "C Writer does not know about " << I;
332 void outputLValue(Instruction *I) {
333 Out << " " << GetValueName(I) << " = ";
336 bool isGotoCodeNecessary(BasicBlock *From, BasicBlock *To);
337 void printPHICopiesForSuccessor(BasicBlock *CurBlock,
338 BasicBlock *Successor, unsigned Indent);
339 void printBranchToBlock(BasicBlock *CurBlock, BasicBlock *SuccBlock,
341 void printGEPExpression(Value *Ptr, gep_type_iterator I,
342 gep_type_iterator E, bool Static);
344 std::string GetValueName(const Value *Operand);
348 char CWriter::ID = 0;
351 static std::string CBEMangle(const std::string &S) {
354 for (unsigned i = 0, e = S.size(); i != e; ++i)
355 if (isalnum(S[i]) || S[i] == '_') {
359 Result += 'A'+(S[i]&15);
360 Result += 'A'+((S[i]>>4)&15);
367 /// This method inserts names for any unnamed structure types that are used by
368 /// the program, and removes names from structure types that are not used by the
371 bool CBackendNameAllUsedStructsAndMergeFunctions::runOnModule(Module &M) {
372 // Get a set of types that are used by the program...
373 std::set<const Type *> UT = getAnalysis<FindUsedTypes>().getTypes();
375 // Loop over the module symbol table, removing types from UT that are
376 // already named, and removing names for types that are not used.
378 TypeSymbolTable &TST = M.getTypeSymbolTable();
379 for (TypeSymbolTable::iterator TI = TST.begin(), TE = TST.end();
381 TypeSymbolTable::iterator I = TI++;
383 // If this isn't a struct or array type, remove it from our set of types
384 // to name. This simplifies emission later.
385 if (!I->second->isStructTy() && !I->second->isOpaqueTy() &&
386 !I->second->isArrayTy()) {
389 // If this is not used, remove it from the symbol table.
390 std::set<const Type *>::iterator UTI = UT.find(I->second);
394 UT.erase(UTI); // Only keep one name for this type.
398 // UT now contains types that are not named. Loop over it, naming
401 bool Changed = false;
402 unsigned RenameCounter = 0;
403 for (std::set<const Type *>::const_iterator I = UT.begin(), E = UT.end();
405 if ((*I)->isStructTy() || (*I)->isArrayTy()) {
406 while (M.addTypeName("unnamed"+utostr(RenameCounter), *I))
412 // Loop over all external functions and globals. If we have two with
413 // identical names, merge them.
414 // FIXME: This code should disappear when we don't allow values with the same
415 // names when they have different types!
416 std::map<std::string, GlobalValue*> ExtSymbols;
417 for (Module::iterator I = M.begin(), E = M.end(); I != E;) {
419 if (GV->isDeclaration() && GV->hasName()) {
420 std::pair<std::map<std::string, GlobalValue*>::iterator, bool> X
421 = ExtSymbols.insert(std::make_pair(GV->getName(), GV));
423 // Found a conflict, replace this global with the previous one.
424 GlobalValue *OldGV = X.first->second;
425 GV->replaceAllUsesWith(ConstantExpr::getBitCast(OldGV, GV->getType()));
426 GV->eraseFromParent();
431 // Do the same for globals.
432 for (Module::global_iterator I = M.global_begin(), E = M.global_end();
434 GlobalVariable *GV = I++;
435 if (GV->isDeclaration() && GV->hasName()) {
436 std::pair<std::map<std::string, GlobalValue*>::iterator, bool> X
437 = ExtSymbols.insert(std::make_pair(GV->getName(), GV));
439 // Found a conflict, replace this global with the previous one.
440 GlobalValue *OldGV = X.first->second;
441 GV->replaceAllUsesWith(ConstantExpr::getBitCast(OldGV, GV->getType()));
442 GV->eraseFromParent();
451 /// printStructReturnPointerFunctionType - This is like printType for a struct
452 /// return type, except, instead of printing the type as void (*)(Struct*, ...)
453 /// print it as "Struct (*)(...)", for struct return functions.
454 void CWriter::printStructReturnPointerFunctionType(raw_ostream &Out,
455 const AttrListPtr &PAL,
456 const PointerType *TheTy) {
457 const FunctionType *FTy = cast<FunctionType>(TheTy->getElementType());
459 raw_string_ostream FunctionInnards(tstr);
460 FunctionInnards << " (*) (";
461 bool PrintedType = false;
463 FunctionType::param_iterator I = FTy->param_begin(), E = FTy->param_end();
464 const Type *RetTy = cast<PointerType>(I->get())->getElementType();
466 for (++I, ++Idx; I != E; ++I, ++Idx) {
468 FunctionInnards << ", ";
469 const Type *ArgTy = *I;
470 if (PAL.paramHasAttr(Idx, Attribute::ByVal)) {
471 assert(ArgTy->isPointerTy());
472 ArgTy = cast<PointerType>(ArgTy)->getElementType();
474 printType(FunctionInnards, ArgTy,
475 /*isSigned=*/PAL.paramHasAttr(Idx, Attribute::SExt), "");
478 if (FTy->isVarArg()) {
480 FunctionInnards << " int"; //dummy argument for empty vararg functs
481 FunctionInnards << ", ...";
482 } else if (!PrintedType) {
483 FunctionInnards << "void";
485 FunctionInnards << ')';
486 printType(Out, RetTy,
487 /*isSigned=*/PAL.paramHasAttr(0, Attribute::SExt), FunctionInnards.str());
491 CWriter::printSimpleType(raw_ostream &Out, const Type *Ty, bool isSigned,
492 const std::string &NameSoFar) {
493 assert((Ty->isPrimitiveType() || Ty->isIntegerTy() || Ty->isVectorTy()) &&
494 "Invalid type for printSimpleType");
495 switch (Ty->getTypeID()) {
496 case Type::VoidTyID: return Out << "void " << NameSoFar;
497 case Type::IntegerTyID: {
498 unsigned NumBits = cast<IntegerType>(Ty)->getBitWidth();
500 return Out << "bool " << NameSoFar;
501 else if (NumBits <= 8)
502 return Out << (isSigned?"signed":"unsigned") << " char " << NameSoFar;
503 else if (NumBits <= 16)
504 return Out << (isSigned?"signed":"unsigned") << " short " << NameSoFar;
505 else if (NumBits <= 32)
506 return Out << (isSigned?"signed":"unsigned") << " int " << NameSoFar;
507 else if (NumBits <= 64)
508 return Out << (isSigned?"signed":"unsigned") << " long long "<< NameSoFar;
510 assert(NumBits <= 128 && "Bit widths > 128 not implemented yet");
511 return Out << (isSigned?"llvmInt128":"llvmUInt128") << " " << NameSoFar;
514 case Type::FloatTyID: return Out << "float " << NameSoFar;
515 case Type::DoubleTyID: return Out << "double " << NameSoFar;
516 // Lacking emulation of FP80 on PPC, etc., we assume whichever of these is
517 // present matches host 'long double'.
518 case Type::X86_FP80TyID:
519 case Type::PPC_FP128TyID:
520 case Type::FP128TyID: return Out << "long double " << NameSoFar;
522 case Type::X86_MMXTyID:
523 return printSimpleType(Out, Type::getInt32Ty(Ty->getContext()), isSigned,
524 " __attribute__((vector_size(64))) " + NameSoFar);
526 case Type::VectorTyID: {
527 const VectorType *VTy = cast<VectorType>(Ty);
528 return printSimpleType(Out, VTy->getElementType(), isSigned,
529 " __attribute__((vector_size(" +
530 utostr(TD->getTypeAllocSize(VTy)) + " ))) " + NameSoFar);
535 errs() << "Unknown primitive type: " << *Ty << "\n";
541 // Pass the Type* and the variable name and this prints out the variable
544 raw_ostream &CWriter::printType(raw_ostream &Out, const Type *Ty,
545 bool isSigned, const std::string &NameSoFar,
546 bool IgnoreName, const AttrListPtr &PAL) {
547 if (Ty->isPrimitiveType() || Ty->isIntegerTy() || Ty->isVectorTy()) {
548 printSimpleType(Out, Ty, isSigned, NameSoFar);
552 // Check to see if the type is named.
553 if (!IgnoreName || Ty->isOpaqueTy()) {
554 std::map<const Type *, std::string>::iterator I = TypeNames.find(Ty);
555 if (I != TypeNames.end()) return Out << I->second << ' ' << NameSoFar;
558 switch (Ty->getTypeID()) {
559 case Type::FunctionTyID: {
560 const FunctionType *FTy = cast<FunctionType>(Ty);
562 raw_string_ostream FunctionInnards(tstr);
563 FunctionInnards << " (" << NameSoFar << ") (";
565 for (FunctionType::param_iterator I = FTy->param_begin(),
566 E = FTy->param_end(); I != E; ++I) {
567 const Type *ArgTy = *I;
568 if (PAL.paramHasAttr(Idx, Attribute::ByVal)) {
569 assert(ArgTy->isPointerTy());
570 ArgTy = cast<PointerType>(ArgTy)->getElementType();
572 if (I != FTy->param_begin())
573 FunctionInnards << ", ";
574 printType(FunctionInnards, ArgTy,
575 /*isSigned=*/PAL.paramHasAttr(Idx, Attribute::SExt), "");
578 if (FTy->isVarArg()) {
579 if (!FTy->getNumParams())
580 FunctionInnards << " int"; //dummy argument for empty vaarg functs
581 FunctionInnards << ", ...";
582 } else if (!FTy->getNumParams()) {
583 FunctionInnards << "void";
585 FunctionInnards << ')';
586 printType(Out, FTy->getReturnType(),
587 /*isSigned=*/PAL.paramHasAttr(0, Attribute::SExt), FunctionInnards.str());
590 case Type::StructTyID: {
591 const StructType *STy = cast<StructType>(Ty);
592 Out << NameSoFar + " {\n";
594 for (StructType::element_iterator I = STy->element_begin(),
595 E = STy->element_end(); I != E; ++I) {
597 printType(Out, *I, false, "field" + utostr(Idx++));
602 Out << " __attribute__ ((packed))";
606 case Type::PointerTyID: {
607 const PointerType *PTy = cast<PointerType>(Ty);
608 std::string ptrName = "*" + NameSoFar;
610 if (PTy->getElementType()->isArrayTy() ||
611 PTy->getElementType()->isVectorTy())
612 ptrName = "(" + ptrName + ")";
615 // Must be a function ptr cast!
616 return printType(Out, PTy->getElementType(), false, ptrName, true, PAL);
617 return printType(Out, PTy->getElementType(), false, ptrName);
620 case Type::ArrayTyID: {
621 const ArrayType *ATy = cast<ArrayType>(Ty);
622 unsigned NumElements = ATy->getNumElements();
623 if (NumElements == 0) NumElements = 1;
624 // Arrays are wrapped in structs to allow them to have normal
625 // value semantics (avoiding the array "decay").
626 Out << NameSoFar << " { ";
627 printType(Out, ATy->getElementType(), false,
628 "array[" + utostr(NumElements) + "]");
632 case Type::OpaqueTyID: {
633 std::string TyName = "struct opaque_" + itostr(OpaqueCounter++);
634 assert(TypeNames.find(Ty) == TypeNames.end());
635 TypeNames[Ty] = TyName;
636 return Out << TyName << ' ' << NameSoFar;
639 llvm_unreachable("Unhandled case in getTypeProps!");
645 void CWriter::printConstantArray(ConstantArray *CPA, bool Static) {
647 // As a special case, print the array as a string if it is an array of
648 // ubytes or an array of sbytes with positive values.
650 const Type *ETy = CPA->getType()->getElementType();
651 bool isString = (ETy == Type::getInt8Ty(CPA->getContext()) ||
652 ETy == Type::getInt8Ty(CPA->getContext()));
654 // Make sure the last character is a null char, as automatically added by C
655 if (isString && (CPA->getNumOperands() == 0 ||
656 !cast<Constant>(*(CPA->op_end()-1))->isNullValue()))
661 // Keep track of whether the last number was a hexadecimal escape
662 bool LastWasHex = false;
664 // Do not include the last character, which we know is null
665 for (unsigned i = 0, e = CPA->getNumOperands()-1; i != e; ++i) {
666 unsigned char C = cast<ConstantInt>(CPA->getOperand(i))->getZExtValue();
668 // Print it out literally if it is a printable character. The only thing
669 // to be careful about is when the last letter output was a hex escape
670 // code, in which case we have to be careful not to print out hex digits
671 // explicitly (the C compiler thinks it is a continuation of the previous
672 // character, sheesh...)
674 if (isprint(C) && (!LastWasHex || !isxdigit(C))) {
676 if (C == '"' || C == '\\')
677 Out << "\\" << (char)C;
683 case '\n': Out << "\\n"; break;
684 case '\t': Out << "\\t"; break;
685 case '\r': Out << "\\r"; break;
686 case '\v': Out << "\\v"; break;
687 case '\a': Out << "\\a"; break;
688 case '\"': Out << "\\\""; break;
689 case '\'': Out << "\\\'"; break;
692 Out << (char)(( C/16 < 10) ? ( C/16 +'0') : ( C/16 -10+'A'));
693 Out << (char)(((C&15) < 10) ? ((C&15)+'0') : ((C&15)-10+'A'));
702 if (CPA->getNumOperands()) {
704 printConstant(cast<Constant>(CPA->getOperand(0)), Static);
705 for (unsigned i = 1, e = CPA->getNumOperands(); i != e; ++i) {
707 printConstant(cast<Constant>(CPA->getOperand(i)), Static);
714 void CWriter::printConstantVector(ConstantVector *CP, bool Static) {
716 if (CP->getNumOperands()) {
718 printConstant(cast<Constant>(CP->getOperand(0)), Static);
719 for (unsigned i = 1, e = CP->getNumOperands(); i != e; ++i) {
721 printConstant(cast<Constant>(CP->getOperand(i)), Static);
727 // isFPCSafeToPrint - Returns true if we may assume that CFP may be written out
728 // textually as a double (rather than as a reference to a stack-allocated
729 // variable). We decide this by converting CFP to a string and back into a
730 // double, and then checking whether the conversion results in a bit-equal
731 // double to the original value of CFP. This depends on us and the target C
732 // compiler agreeing on the conversion process (which is pretty likely since we
733 // only deal in IEEE FP).
735 static bool isFPCSafeToPrint(const ConstantFP *CFP) {
737 // Do long doubles in hex for now.
738 if (CFP->getType() != Type::getFloatTy(CFP->getContext()) &&
739 CFP->getType() != Type::getDoubleTy(CFP->getContext()))
741 APFloat APF = APFloat(CFP->getValueAPF()); // copy
742 if (CFP->getType() == Type::getFloatTy(CFP->getContext()))
743 APF.convert(APFloat::IEEEdouble, APFloat::rmNearestTiesToEven, &ignored);
744 #if HAVE_PRINTF_A && ENABLE_CBE_PRINTF_A
746 sprintf(Buffer, "%a", APF.convertToDouble());
747 if (!strncmp(Buffer, "0x", 2) ||
748 !strncmp(Buffer, "-0x", 3) ||
749 !strncmp(Buffer, "+0x", 3))
750 return APF.bitwiseIsEqual(APFloat(atof(Buffer)));
753 std::string StrVal = ftostr(APF);
755 while (StrVal[0] == ' ')
756 StrVal.erase(StrVal.begin());
758 // Check to make sure that the stringized number is not some string like "Inf"
759 // or NaN. Check that the string matches the "[-+]?[0-9]" regex.
760 if ((StrVal[0] >= '0' && StrVal[0] <= '9') ||
761 ((StrVal[0] == '-' || StrVal[0] == '+') &&
762 (StrVal[1] >= '0' && StrVal[1] <= '9')))
763 // Reparse stringized version!
764 return APF.bitwiseIsEqual(APFloat(atof(StrVal.c_str())));
769 /// Print out the casting for a cast operation. This does the double casting
770 /// necessary for conversion to the destination type, if necessary.
771 /// @brief Print a cast
772 void CWriter::printCast(unsigned opc, const Type *SrcTy, const Type *DstTy) {
773 // Print the destination type cast
775 case Instruction::UIToFP:
776 case Instruction::SIToFP:
777 case Instruction::IntToPtr:
778 case Instruction::Trunc:
779 case Instruction::BitCast:
780 case Instruction::FPExt:
781 case Instruction::FPTrunc: // For these the DstTy sign doesn't matter
783 printType(Out, DstTy);
786 case Instruction::ZExt:
787 case Instruction::PtrToInt:
788 case Instruction::FPToUI: // For these, make sure we get an unsigned dest
790 printSimpleType(Out, DstTy, false);
793 case Instruction::SExt:
794 case Instruction::FPToSI: // For these, make sure we get a signed dest
796 printSimpleType(Out, DstTy, true);
800 llvm_unreachable("Invalid cast opcode");
803 // Print the source type cast
805 case Instruction::UIToFP:
806 case Instruction::ZExt:
808 printSimpleType(Out, SrcTy, false);
811 case Instruction::SIToFP:
812 case Instruction::SExt:
814 printSimpleType(Out, SrcTy, true);
817 case Instruction::IntToPtr:
818 case Instruction::PtrToInt:
819 // Avoid "cast to pointer from integer of different size" warnings
820 Out << "(unsigned long)";
822 case Instruction::Trunc:
823 case Instruction::BitCast:
824 case Instruction::FPExt:
825 case Instruction::FPTrunc:
826 case Instruction::FPToSI:
827 case Instruction::FPToUI:
828 break; // These don't need a source cast.
830 llvm_unreachable("Invalid cast opcode");
835 // printConstant - The LLVM Constant to C Constant converter.
836 void CWriter::printConstant(Constant *CPV, bool Static) {
837 if (const ConstantExpr *CE = dyn_cast<ConstantExpr>(CPV)) {
838 switch (CE->getOpcode()) {
839 case Instruction::Trunc:
840 case Instruction::ZExt:
841 case Instruction::SExt:
842 case Instruction::FPTrunc:
843 case Instruction::FPExt:
844 case Instruction::UIToFP:
845 case Instruction::SIToFP:
846 case Instruction::FPToUI:
847 case Instruction::FPToSI:
848 case Instruction::PtrToInt:
849 case Instruction::IntToPtr:
850 case Instruction::BitCast:
852 printCast(CE->getOpcode(), CE->getOperand(0)->getType(), CE->getType());
853 if (CE->getOpcode() == Instruction::SExt &&
854 CE->getOperand(0)->getType() == Type::getInt1Ty(CPV->getContext())) {
855 // Make sure we really sext from bool here by subtracting from 0
858 printConstant(CE->getOperand(0), Static);
859 if (CE->getType() == Type::getInt1Ty(CPV->getContext()) &&
860 (CE->getOpcode() == Instruction::Trunc ||
861 CE->getOpcode() == Instruction::FPToUI ||
862 CE->getOpcode() == Instruction::FPToSI ||
863 CE->getOpcode() == Instruction::PtrToInt)) {
864 // Make sure we really truncate to bool here by anding with 1
870 case Instruction::GetElementPtr:
872 printGEPExpression(CE->getOperand(0), gep_type_begin(CPV),
873 gep_type_end(CPV), Static);
876 case Instruction::Select:
878 printConstant(CE->getOperand(0), Static);
880 printConstant(CE->getOperand(1), Static);
882 printConstant(CE->getOperand(2), Static);
885 case Instruction::Add:
886 case Instruction::FAdd:
887 case Instruction::Sub:
888 case Instruction::FSub:
889 case Instruction::Mul:
890 case Instruction::FMul:
891 case Instruction::SDiv:
892 case Instruction::UDiv:
893 case Instruction::FDiv:
894 case Instruction::URem:
895 case Instruction::SRem:
896 case Instruction::FRem:
897 case Instruction::And:
898 case Instruction::Or:
899 case Instruction::Xor:
900 case Instruction::ICmp:
901 case Instruction::Shl:
902 case Instruction::LShr:
903 case Instruction::AShr:
906 bool NeedsClosingParens = printConstExprCast(CE, Static);
907 printConstantWithCast(CE->getOperand(0), CE->getOpcode());
908 switch (CE->getOpcode()) {
909 case Instruction::Add:
910 case Instruction::FAdd: Out << " + "; break;
911 case Instruction::Sub:
912 case Instruction::FSub: Out << " - "; break;
913 case Instruction::Mul:
914 case Instruction::FMul: Out << " * "; break;
915 case Instruction::URem:
916 case Instruction::SRem:
917 case Instruction::FRem: Out << " % "; break;
918 case Instruction::UDiv:
919 case Instruction::SDiv:
920 case Instruction::FDiv: Out << " / "; break;
921 case Instruction::And: Out << " & "; break;
922 case Instruction::Or: Out << " | "; break;
923 case Instruction::Xor: Out << " ^ "; break;
924 case Instruction::Shl: Out << " << "; break;
925 case Instruction::LShr:
926 case Instruction::AShr: Out << " >> "; break;
927 case Instruction::ICmp:
928 switch (CE->getPredicate()) {
929 case ICmpInst::ICMP_EQ: Out << " == "; break;
930 case ICmpInst::ICMP_NE: Out << " != "; break;
931 case ICmpInst::ICMP_SLT:
932 case ICmpInst::ICMP_ULT: Out << " < "; break;
933 case ICmpInst::ICMP_SLE:
934 case ICmpInst::ICMP_ULE: Out << " <= "; break;
935 case ICmpInst::ICMP_SGT:
936 case ICmpInst::ICMP_UGT: Out << " > "; break;
937 case ICmpInst::ICMP_SGE:
938 case ICmpInst::ICMP_UGE: Out << " >= "; break;
939 default: llvm_unreachable("Illegal ICmp predicate");
942 default: llvm_unreachable("Illegal opcode here!");
944 printConstantWithCast(CE->getOperand(1), CE->getOpcode());
945 if (NeedsClosingParens)
950 case Instruction::FCmp: {
952 bool NeedsClosingParens = printConstExprCast(CE, Static);
953 if (CE->getPredicate() == FCmpInst::FCMP_FALSE)
955 else if (CE->getPredicate() == FCmpInst::FCMP_TRUE)
959 switch (CE->getPredicate()) {
960 default: llvm_unreachable("Illegal FCmp predicate");
961 case FCmpInst::FCMP_ORD: op = "ord"; break;
962 case FCmpInst::FCMP_UNO: op = "uno"; break;
963 case FCmpInst::FCMP_UEQ: op = "ueq"; break;
964 case FCmpInst::FCMP_UNE: op = "une"; break;
965 case FCmpInst::FCMP_ULT: op = "ult"; break;
966 case FCmpInst::FCMP_ULE: op = "ule"; break;
967 case FCmpInst::FCMP_UGT: op = "ugt"; break;
968 case FCmpInst::FCMP_UGE: op = "uge"; break;
969 case FCmpInst::FCMP_OEQ: op = "oeq"; break;
970 case FCmpInst::FCMP_ONE: op = "one"; break;
971 case FCmpInst::FCMP_OLT: op = "olt"; break;
972 case FCmpInst::FCMP_OLE: op = "ole"; break;
973 case FCmpInst::FCMP_OGT: op = "ogt"; break;
974 case FCmpInst::FCMP_OGE: op = "oge"; break;
976 Out << "llvm_fcmp_" << op << "(";
977 printConstantWithCast(CE->getOperand(0), CE->getOpcode());
979 printConstantWithCast(CE->getOperand(1), CE->getOpcode());
982 if (NeedsClosingParens)
989 errs() << "CWriter Error: Unhandled constant expression: "
994 } else if (isa<UndefValue>(CPV) && CPV->getType()->isSingleValueType()) {
996 printType(Out, CPV->getType()); // sign doesn't matter
998 if (!CPV->getType()->isVectorTy()) {
1006 if (ConstantInt *CI = dyn_cast<ConstantInt>(CPV)) {
1007 const Type* Ty = CI->getType();
1008 if (Ty == Type::getInt1Ty(CPV->getContext()))
1009 Out << (CI->getZExtValue() ? '1' : '0');
1010 else if (Ty == Type::getInt32Ty(CPV->getContext()))
1011 Out << CI->getZExtValue() << 'u';
1012 else if (Ty->getPrimitiveSizeInBits() > 32)
1013 Out << CI->getZExtValue() << "ull";
1016 printSimpleType(Out, Ty, false) << ')';
1017 if (CI->isMinValue(true))
1018 Out << CI->getZExtValue() << 'u';
1020 Out << CI->getSExtValue();
1026 switch (CPV->getType()->getTypeID()) {
1027 case Type::FloatTyID:
1028 case Type::DoubleTyID:
1029 case Type::X86_FP80TyID:
1030 case Type::PPC_FP128TyID:
1031 case Type::FP128TyID: {
1032 ConstantFP *FPC = cast<ConstantFP>(CPV);
1033 std::map<const ConstantFP*, unsigned>::iterator I = FPConstantMap.find(FPC);
1034 if (I != FPConstantMap.end()) {
1035 // Because of FP precision problems we must load from a stack allocated
1036 // value that holds the value in hex.
1037 Out << "(*(" << (FPC->getType() == Type::getFloatTy(CPV->getContext()) ?
1039 FPC->getType() == Type::getDoubleTy(CPV->getContext()) ?
1042 << "*)&FPConstant" << I->second << ')';
1045 if (FPC->getType() == Type::getFloatTy(CPV->getContext()))
1046 V = FPC->getValueAPF().convertToFloat();
1047 else if (FPC->getType() == Type::getDoubleTy(CPV->getContext()))
1048 V = FPC->getValueAPF().convertToDouble();
1050 // Long double. Convert the number to double, discarding precision.
1051 // This is not awesome, but it at least makes the CBE output somewhat
1053 APFloat Tmp = FPC->getValueAPF();
1055 Tmp.convert(APFloat::IEEEdouble, APFloat::rmTowardZero, &LosesInfo);
1056 V = Tmp.convertToDouble();
1062 // FIXME the actual NaN bits should be emitted.
1063 // The prefix for a quiet NaN is 0x7FF8. For a signalling NaN,
1065 const unsigned long QuietNaN = 0x7ff8UL;
1066 //const unsigned long SignalNaN = 0x7ff4UL;
1068 // We need to grab the first part of the FP #
1071 uint64_t ll = DoubleToBits(V);
1072 sprintf(Buffer, "0x%llx", static_cast<long long>(ll));
1074 std::string Num(&Buffer[0], &Buffer[6]);
1075 unsigned long Val = strtoul(Num.c_str(), 0, 16);
1077 if (FPC->getType() == Type::getFloatTy(FPC->getContext()))
1078 Out << "LLVM_NAN" << (Val == QuietNaN ? "" : "S") << "F(\""
1079 << Buffer << "\") /*nan*/ ";
1081 Out << "LLVM_NAN" << (Val == QuietNaN ? "" : "S") << "(\""
1082 << Buffer << "\") /*nan*/ ";
1083 } else if (IsInf(V)) {
1085 if (V < 0) Out << '-';
1086 Out << "LLVM_INF" <<
1087 (FPC->getType() == Type::getFloatTy(FPC->getContext()) ? "F" : "")
1091 #if HAVE_PRINTF_A && ENABLE_CBE_PRINTF_A
1092 // Print out the constant as a floating point number.
1094 sprintf(Buffer, "%a", V);
1097 Num = ftostr(FPC->getValueAPF());
1105 case Type::ArrayTyID:
1106 // Use C99 compound expression literal initializer syntax.
1109 printType(Out, CPV->getType());
1112 Out << "{ "; // Arrays are wrapped in struct types.
1113 if (ConstantArray *CA = dyn_cast<ConstantArray>(CPV)) {
1114 printConstantArray(CA, Static);
1116 assert(isa<ConstantAggregateZero>(CPV) || isa<UndefValue>(CPV));
1117 const ArrayType *AT = cast<ArrayType>(CPV->getType());
1119 if (AT->getNumElements()) {
1121 Constant *CZ = Constant::getNullValue(AT->getElementType());
1122 printConstant(CZ, Static);
1123 for (unsigned i = 1, e = AT->getNumElements(); i != e; ++i) {
1125 printConstant(CZ, Static);
1130 Out << " }"; // Arrays are wrapped in struct types.
1133 case Type::VectorTyID:
1134 // Use C99 compound expression literal initializer syntax.
1137 printType(Out, CPV->getType());
1140 if (ConstantVector *CV = dyn_cast<ConstantVector>(CPV)) {
1141 printConstantVector(CV, Static);
1143 assert(isa<ConstantAggregateZero>(CPV) || isa<UndefValue>(CPV));
1144 const VectorType *VT = cast<VectorType>(CPV->getType());
1146 Constant *CZ = Constant::getNullValue(VT->getElementType());
1147 printConstant(CZ, Static);
1148 for (unsigned i = 1, e = VT->getNumElements(); i != e; ++i) {
1150 printConstant(CZ, Static);
1156 case Type::StructTyID:
1157 // Use C99 compound expression literal initializer syntax.
1160 printType(Out, CPV->getType());
1163 if (isa<ConstantAggregateZero>(CPV) || isa<UndefValue>(CPV)) {
1164 const StructType *ST = cast<StructType>(CPV->getType());
1166 if (ST->getNumElements()) {
1168 printConstant(Constant::getNullValue(ST->getElementType(0)), Static);
1169 for (unsigned i = 1, e = ST->getNumElements(); i != e; ++i) {
1171 printConstant(Constant::getNullValue(ST->getElementType(i)), Static);
1177 if (CPV->getNumOperands()) {
1179 printConstant(cast<Constant>(CPV->getOperand(0)), Static);
1180 for (unsigned i = 1, e = CPV->getNumOperands(); i != e; ++i) {
1182 printConstant(cast<Constant>(CPV->getOperand(i)), Static);
1189 case Type::PointerTyID:
1190 if (isa<ConstantPointerNull>(CPV)) {
1192 printType(Out, CPV->getType()); // sign doesn't matter
1193 Out << ")/*NULL*/0)";
1195 } else if (GlobalValue *GV = dyn_cast<GlobalValue>(CPV)) {
1196 writeOperand(GV, Static);
1202 errs() << "Unknown constant type: " << *CPV << "\n";
1204 llvm_unreachable(0);
1208 // Some constant expressions need to be casted back to the original types
1209 // because their operands were casted to the expected type. This function takes
1210 // care of detecting that case and printing the cast for the ConstantExpr.
1211 bool CWriter::printConstExprCast(const ConstantExpr* CE, bool Static) {
1212 bool NeedsExplicitCast = false;
1213 const Type *Ty = CE->getOperand(0)->getType();
1214 bool TypeIsSigned = false;
1215 switch (CE->getOpcode()) {
1216 case Instruction::Add:
1217 case Instruction::Sub:
1218 case Instruction::Mul:
1219 // We need to cast integer arithmetic so that it is always performed
1220 // as unsigned, to avoid undefined behavior on overflow.
1221 case Instruction::LShr:
1222 case Instruction::URem:
1223 case Instruction::UDiv: NeedsExplicitCast = true; break;
1224 case Instruction::AShr:
1225 case Instruction::SRem:
1226 case Instruction::SDiv: NeedsExplicitCast = true; TypeIsSigned = true; break;
1227 case Instruction::SExt:
1229 NeedsExplicitCast = true;
1230 TypeIsSigned = true;
1232 case Instruction::ZExt:
1233 case Instruction::Trunc:
1234 case Instruction::FPTrunc:
1235 case Instruction::FPExt:
1236 case Instruction::UIToFP:
1237 case Instruction::SIToFP:
1238 case Instruction::FPToUI:
1239 case Instruction::FPToSI:
1240 case Instruction::PtrToInt:
1241 case Instruction::IntToPtr:
1242 case Instruction::BitCast:
1244 NeedsExplicitCast = true;
1248 if (NeedsExplicitCast) {
1250 if (Ty->isIntegerTy() && Ty != Type::getInt1Ty(Ty->getContext()))
1251 printSimpleType(Out, Ty, TypeIsSigned);
1253 printType(Out, Ty); // not integer, sign doesn't matter
1256 return NeedsExplicitCast;
1259 // Print a constant assuming that it is the operand for a given Opcode. The
1260 // opcodes that care about sign need to cast their operands to the expected
1261 // type before the operation proceeds. This function does the casting.
1262 void CWriter::printConstantWithCast(Constant* CPV, unsigned Opcode) {
1264 // Extract the operand's type, we'll need it.
1265 const Type* OpTy = CPV->getType();
1267 // Indicate whether to do the cast or not.
1268 bool shouldCast = false;
1269 bool typeIsSigned = false;
1271 // Based on the Opcode for which this Constant is being written, determine
1272 // the new type to which the operand should be casted by setting the value
1273 // of OpTy. If we change OpTy, also set shouldCast to true so it gets
1277 // for most instructions, it doesn't matter
1279 case Instruction::Add:
1280 case Instruction::Sub:
1281 case Instruction::Mul:
1282 // We need to cast integer arithmetic so that it is always performed
1283 // as unsigned, to avoid undefined behavior on overflow.
1284 case Instruction::LShr:
1285 case Instruction::UDiv:
1286 case Instruction::URem:
1289 case Instruction::AShr:
1290 case Instruction::SDiv:
1291 case Instruction::SRem:
1293 typeIsSigned = true;
1297 // Write out the casted constant if we should, otherwise just write the
1301 printSimpleType(Out, OpTy, typeIsSigned);
1303 printConstant(CPV, false);
1306 printConstant(CPV, false);
1309 std::string CWriter::GetValueName(const Value *Operand) {
1311 // Resolve potential alias.
1312 if (const GlobalAlias *GA = dyn_cast<GlobalAlias>(Operand)) {
1313 if (const Value *V = GA->resolveAliasedGlobal(false))
1317 // Mangle globals with the standard mangler interface for LLC compatibility.
1318 if (const GlobalValue *GV = dyn_cast<GlobalValue>(Operand)) {
1319 SmallString<128> Str;
1320 Mang->getNameWithPrefix(Str, GV, false);
1321 return CBEMangle(Str.str().str());
1324 std::string Name = Operand->getName();
1326 if (Name.empty()) { // Assign unique names to local temporaries.
1327 unsigned &No = AnonValueNumbers[Operand];
1329 No = ++NextAnonValueNumber;
1330 Name = "tmp__" + utostr(No);
1333 std::string VarName;
1334 VarName.reserve(Name.capacity());
1336 for (std::string::iterator I = Name.begin(), E = Name.end();
1340 if (!((ch >= 'a' && ch <= 'z') || (ch >= 'A' && ch <= 'Z') ||
1341 (ch >= '0' && ch <= '9') || ch == '_')) {
1343 sprintf(buffer, "_%x_", ch);
1349 return "llvm_cbe_" + VarName;
1352 /// writeInstComputationInline - Emit the computation for the specified
1353 /// instruction inline, with no destination provided.
1354 void CWriter::writeInstComputationInline(Instruction &I) {
1355 // We can't currently support integer types other than 1, 8, 16, 32, 64.
1357 const Type *Ty = I.getType();
1358 if (Ty->isIntegerTy() && (Ty!=Type::getInt1Ty(I.getContext()) &&
1359 Ty!=Type::getInt8Ty(I.getContext()) &&
1360 Ty!=Type::getInt16Ty(I.getContext()) &&
1361 Ty!=Type::getInt32Ty(I.getContext()) &&
1362 Ty!=Type::getInt64Ty(I.getContext()))) {
1363 report_fatal_error("The C backend does not currently support integer "
1364 "types of widths other than 1, 8, 16, 32, 64.\n"
1365 "This is being tracked as PR 4158.");
1368 // If this is a non-trivial bool computation, make sure to truncate down to
1369 // a 1 bit value. This is important because we want "add i1 x, y" to return
1370 // "0" when x and y are true, not "2" for example.
1371 bool NeedBoolTrunc = false;
1372 if (I.getType() == Type::getInt1Ty(I.getContext()) &&
1373 !isa<ICmpInst>(I) && !isa<FCmpInst>(I))
1374 NeedBoolTrunc = true;
1386 void CWriter::writeOperandInternal(Value *Operand, bool Static) {
1387 if (Instruction *I = dyn_cast<Instruction>(Operand))
1388 // Should we inline this instruction to build a tree?
1389 if (isInlinableInst(*I) && !isDirectAlloca(I)) {
1391 writeInstComputationInline(*I);
1396 Constant* CPV = dyn_cast<Constant>(Operand);
1398 if (CPV && !isa<GlobalValue>(CPV))
1399 printConstant(CPV, Static);
1401 Out << GetValueName(Operand);
1404 void CWriter::writeOperand(Value *Operand, bool Static) {
1405 bool isAddressImplicit = isAddressExposed(Operand);
1406 if (isAddressImplicit)
1407 Out << "(&"; // Global variables are referenced as their addresses by llvm
1409 writeOperandInternal(Operand, Static);
1411 if (isAddressImplicit)
1415 // Some instructions need to have their result value casted back to the
1416 // original types because their operands were casted to the expected type.
1417 // This function takes care of detecting that case and printing the cast
1418 // for the Instruction.
1419 bool CWriter::writeInstructionCast(const Instruction &I) {
1420 const Type *Ty = I.getOperand(0)->getType();
1421 switch (I.getOpcode()) {
1422 case Instruction::Add:
1423 case Instruction::Sub:
1424 case Instruction::Mul:
1425 // We need to cast integer arithmetic so that it is always performed
1426 // as unsigned, to avoid undefined behavior on overflow.
1427 case Instruction::LShr:
1428 case Instruction::URem:
1429 case Instruction::UDiv:
1431 printSimpleType(Out, Ty, false);
1434 case Instruction::AShr:
1435 case Instruction::SRem:
1436 case Instruction::SDiv:
1438 printSimpleType(Out, Ty, true);
1446 // Write the operand with a cast to another type based on the Opcode being used.
1447 // This will be used in cases where an instruction has specific type
1448 // requirements (usually signedness) for its operands.
1449 void CWriter::writeOperandWithCast(Value* Operand, unsigned Opcode) {
1451 // Extract the operand's type, we'll need it.
1452 const Type* OpTy = Operand->getType();
1454 // Indicate whether to do the cast or not.
1455 bool shouldCast = false;
1457 // Indicate whether the cast should be to a signed type or not.
1458 bool castIsSigned = false;
1460 // Based on the Opcode for which this Operand is being written, determine
1461 // the new type to which the operand should be casted by setting the value
1462 // of OpTy. If we change OpTy, also set shouldCast to true.
1465 // for most instructions, it doesn't matter
1467 case Instruction::Add:
1468 case Instruction::Sub:
1469 case Instruction::Mul:
1470 // We need to cast integer arithmetic so that it is always performed
1471 // as unsigned, to avoid undefined behavior on overflow.
1472 case Instruction::LShr:
1473 case Instruction::UDiv:
1474 case Instruction::URem: // Cast to unsigned first
1476 castIsSigned = false;
1478 case Instruction::GetElementPtr:
1479 case Instruction::AShr:
1480 case Instruction::SDiv:
1481 case Instruction::SRem: // Cast to signed first
1483 castIsSigned = true;
1487 // Write out the casted operand if we should, otherwise just write the
1491 printSimpleType(Out, OpTy, castIsSigned);
1493 writeOperand(Operand);
1496 writeOperand(Operand);
1499 // Write the operand with a cast to another type based on the icmp predicate
1501 void CWriter::writeOperandWithCast(Value* Operand, const ICmpInst &Cmp) {
1502 // This has to do a cast to ensure the operand has the right signedness.
1503 // Also, if the operand is a pointer, we make sure to cast to an integer when
1504 // doing the comparison both for signedness and so that the C compiler doesn't
1505 // optimize things like "p < NULL" to false (p may contain an integer value
1507 bool shouldCast = Cmp.isRelational();
1509 // Write out the casted operand if we should, otherwise just write the
1512 writeOperand(Operand);
1516 // Should this be a signed comparison? If so, convert to signed.
1517 bool castIsSigned = Cmp.isSigned();
1519 // If the operand was a pointer, convert to a large integer type.
1520 const Type* OpTy = Operand->getType();
1521 if (OpTy->isPointerTy())
1522 OpTy = TD->getIntPtrType(Operand->getContext());
1525 printSimpleType(Out, OpTy, castIsSigned);
1527 writeOperand(Operand);
1531 // generateCompilerSpecificCode - This is where we add conditional compilation
1532 // directives to cater to specific compilers as need be.
1534 static void generateCompilerSpecificCode(formatted_raw_ostream& Out,
1535 const TargetData *TD) {
1536 // Alloca is hard to get, and we don't want to include stdlib.h here.
1537 Out << "/* get a declaration for alloca */\n"
1538 << "#if defined(__CYGWIN__) || defined(__MINGW32__)\n"
1539 << "#define alloca(x) __builtin_alloca((x))\n"
1540 << "#define _alloca(x) __builtin_alloca((x))\n"
1541 << "#elif defined(__APPLE__)\n"
1542 << "extern void *__builtin_alloca(unsigned long);\n"
1543 << "#define alloca(x) __builtin_alloca(x)\n"
1544 << "#define longjmp _longjmp\n"
1545 << "#define setjmp _setjmp\n"
1546 << "#elif defined(__sun__)\n"
1547 << "#if defined(__sparcv9)\n"
1548 << "extern void *__builtin_alloca(unsigned long);\n"
1550 << "extern void *__builtin_alloca(unsigned int);\n"
1552 << "#define alloca(x) __builtin_alloca(x)\n"
1553 << "#elif defined(__FreeBSD__) || defined(__NetBSD__) || defined(__OpenBSD__) || defined(__DragonFly__) || defined(__arm__)\n"
1554 << "#define alloca(x) __builtin_alloca(x)\n"
1555 << "#elif defined(_MSC_VER)\n"
1556 << "#define inline _inline\n"
1557 << "#define alloca(x) _alloca(x)\n"
1559 << "#include <alloca.h>\n"
1562 // We output GCC specific attributes to preserve 'linkonce'ness on globals.
1563 // If we aren't being compiled with GCC, just drop these attributes.
1564 Out << "#ifndef __GNUC__ /* Can only support \"linkonce\" vars with GCC */\n"
1565 << "#define __attribute__(X)\n"
1568 // On Mac OS X, "external weak" is spelled "__attribute__((weak_import))".
1569 Out << "#if defined(__GNUC__) && defined(__APPLE_CC__)\n"
1570 << "#define __EXTERNAL_WEAK__ __attribute__((weak_import))\n"
1571 << "#elif defined(__GNUC__)\n"
1572 << "#define __EXTERNAL_WEAK__ __attribute__((weak))\n"
1574 << "#define __EXTERNAL_WEAK__\n"
1577 // For now, turn off the weak linkage attribute on Mac OS X. (See above.)
1578 Out << "#if defined(__GNUC__) && defined(__APPLE_CC__)\n"
1579 << "#define __ATTRIBUTE_WEAK__\n"
1580 << "#elif defined(__GNUC__)\n"
1581 << "#define __ATTRIBUTE_WEAK__ __attribute__((weak))\n"
1583 << "#define __ATTRIBUTE_WEAK__\n"
1586 // Add hidden visibility support. FIXME: APPLE_CC?
1587 Out << "#if defined(__GNUC__)\n"
1588 << "#define __HIDDEN__ __attribute__((visibility(\"hidden\")))\n"
1591 // Define NaN and Inf as GCC builtins if using GCC, as 0 otherwise
1592 // From the GCC documentation:
1594 // double __builtin_nan (const char *str)
1596 // This is an implementation of the ISO C99 function nan.
1598 // Since ISO C99 defines this function in terms of strtod, which we do
1599 // not implement, a description of the parsing is in order. The string is
1600 // parsed as by strtol; that is, the base is recognized by leading 0 or
1601 // 0x prefixes. The number parsed is placed in the significand such that
1602 // the least significant bit of the number is at the least significant
1603 // bit of the significand. The number is truncated to fit the significand
1604 // field provided. The significand is forced to be a quiet NaN.
1606 // This function, if given a string literal, is evaluated early enough
1607 // that it is considered a compile-time constant.
1609 // float __builtin_nanf (const char *str)
1611 // Similar to __builtin_nan, except the return type is float.
1613 // double __builtin_inf (void)
1615 // Similar to __builtin_huge_val, except a warning is generated if the
1616 // target floating-point format does not support infinities. This
1617 // function is suitable for implementing the ISO C99 macro INFINITY.
1619 // float __builtin_inff (void)
1621 // Similar to __builtin_inf, except the return type is float.
1622 Out << "#ifdef __GNUC__\n"
1623 << "#define LLVM_NAN(NanStr) __builtin_nan(NanStr) /* Double */\n"
1624 << "#define LLVM_NANF(NanStr) __builtin_nanf(NanStr) /* Float */\n"
1625 << "#define LLVM_NANS(NanStr) __builtin_nans(NanStr) /* Double */\n"
1626 << "#define LLVM_NANSF(NanStr) __builtin_nansf(NanStr) /* Float */\n"
1627 << "#define LLVM_INF __builtin_inf() /* Double */\n"
1628 << "#define LLVM_INFF __builtin_inff() /* Float */\n"
1629 << "#define LLVM_PREFETCH(addr,rw,locality) "
1630 "__builtin_prefetch(addr,rw,locality)\n"
1631 << "#define __ATTRIBUTE_CTOR__ __attribute__((constructor))\n"
1632 << "#define __ATTRIBUTE_DTOR__ __attribute__((destructor))\n"
1633 << "#define LLVM_ASM __asm__\n"
1635 << "#define LLVM_NAN(NanStr) ((double)0.0) /* Double */\n"
1636 << "#define LLVM_NANF(NanStr) 0.0F /* Float */\n"
1637 << "#define LLVM_NANS(NanStr) ((double)0.0) /* Double */\n"
1638 << "#define LLVM_NANSF(NanStr) 0.0F /* Float */\n"
1639 << "#define LLVM_INF ((double)0.0) /* Double */\n"
1640 << "#define LLVM_INFF 0.0F /* Float */\n"
1641 << "#define LLVM_PREFETCH(addr,rw,locality) /* PREFETCH */\n"
1642 << "#define __ATTRIBUTE_CTOR__\n"
1643 << "#define __ATTRIBUTE_DTOR__\n"
1644 << "#define LLVM_ASM(X)\n"
1647 Out << "#if __GNUC__ < 4 /* Old GCC's, or compilers not GCC */ \n"
1648 << "#define __builtin_stack_save() 0 /* not implemented */\n"
1649 << "#define __builtin_stack_restore(X) /* noop */\n"
1652 // Output typedefs for 128-bit integers. If these are needed with a
1653 // 32-bit target or with a C compiler that doesn't support mode(TI),
1654 // more drastic measures will be needed.
1655 Out << "#if __GNUC__ && __LP64__ /* 128-bit integer types */\n"
1656 << "typedef int __attribute__((mode(TI))) llvmInt128;\n"
1657 << "typedef unsigned __attribute__((mode(TI))) llvmUInt128;\n"
1660 // Output target-specific code that should be inserted into main.
1661 Out << "#define CODE_FOR_MAIN() /* Any target-specific code for main()*/\n";
1664 /// FindStaticTors - Given a static ctor/dtor list, unpack its contents into
1665 /// the StaticTors set.
1666 static void FindStaticTors(GlobalVariable *GV, std::set<Function*> &StaticTors){
1667 ConstantArray *InitList = dyn_cast<ConstantArray>(GV->getInitializer());
1668 if (!InitList) return;
1670 for (unsigned i = 0, e = InitList->getNumOperands(); i != e; ++i)
1671 if (ConstantStruct *CS = dyn_cast<ConstantStruct>(InitList->getOperand(i))){
1672 if (CS->getNumOperands() != 2) return; // Not array of 2-element structs.
1674 if (CS->getOperand(1)->isNullValue())
1675 return; // Found a null terminator, exit printing.
1676 Constant *FP = CS->getOperand(1);
1677 if (ConstantExpr *CE = dyn_cast<ConstantExpr>(FP))
1679 FP = CE->getOperand(0);
1680 if (Function *F = dyn_cast<Function>(FP))
1681 StaticTors.insert(F);
1685 enum SpecialGlobalClass {
1687 GlobalCtors, GlobalDtors,
1691 /// getGlobalVariableClass - If this is a global that is specially recognized
1692 /// by LLVM, return a code that indicates how we should handle it.
1693 static SpecialGlobalClass getGlobalVariableClass(const GlobalVariable *GV) {
1694 // If this is a global ctors/dtors list, handle it now.
1695 if (GV->hasAppendingLinkage() && GV->use_empty()) {
1696 if (GV->getName() == "llvm.global_ctors")
1698 else if (GV->getName() == "llvm.global_dtors")
1702 // Otherwise, if it is other metadata, don't print it. This catches things
1703 // like debug information.
1704 if (GV->getSection() == "llvm.metadata")
1710 // PrintEscapedString - Print each character of the specified string, escaping
1711 // it if it is not printable or if it is an escape char.
1712 static void PrintEscapedString(const char *Str, unsigned Length,
1714 for (unsigned i = 0; i != Length; ++i) {
1715 unsigned char C = Str[i];
1716 if (isprint(C) && C != '\\' && C != '"')
1725 Out << "\\x" << hexdigit(C >> 4) << hexdigit(C & 0x0F);
1729 // PrintEscapedString - Print each character of the specified string, escaping
1730 // it if it is not printable or if it is an escape char.
1731 static void PrintEscapedString(const std::string &Str, raw_ostream &Out) {
1732 PrintEscapedString(Str.c_str(), Str.size(), Out);
1735 bool CWriter::doInitialization(Module &M) {
1736 FunctionPass::doInitialization(M);
1741 TD = new TargetData(&M);
1742 IL = new IntrinsicLowering(*TD);
1743 IL->AddPrototypes(M);
1746 std::string Triple = TheModule->getTargetTriple();
1748 Triple = llvm::sys::getHostTriple();
1751 if (const Target *Match = TargetRegistry::lookupTarget(Triple, E))
1752 TAsm = Match->createAsmInfo(Triple);
1754 TAsm = new CBEMCAsmInfo();
1755 TCtx = new MCContext(*TAsm);
1756 Mang = new Mangler(*TCtx, *TD);
1758 // Keep track of which functions are static ctors/dtors so they can have
1759 // an attribute added to their prototypes.
1760 std::set<Function*> StaticCtors, StaticDtors;
1761 for (Module::global_iterator I = M.global_begin(), E = M.global_end();
1763 switch (getGlobalVariableClass(I)) {
1766 FindStaticTors(I, StaticCtors);
1769 FindStaticTors(I, StaticDtors);
1774 // get declaration for alloca
1775 Out << "/* Provide Declarations */\n";
1776 Out << "#include <stdarg.h>\n"; // Varargs support
1777 Out << "#include <setjmp.h>\n"; // Unwind support
1778 generateCompilerSpecificCode(Out, TD);
1780 // Provide a definition for `bool' if not compiling with a C++ compiler.
1782 << "#ifndef __cplusplus\ntypedef unsigned char bool;\n#endif\n"
1784 << "\n\n/* Support for floating point constants */\n"
1785 << "typedef unsigned long long ConstantDoubleTy;\n"
1786 << "typedef unsigned int ConstantFloatTy;\n"
1787 << "typedef struct { unsigned long long f1; unsigned short f2; "
1788 "unsigned short pad[3]; } ConstantFP80Ty;\n"
1789 // This is used for both kinds of 128-bit long double; meaning differs.
1790 << "typedef struct { unsigned long long f1; unsigned long long f2; }"
1791 " ConstantFP128Ty;\n"
1792 << "\n\n/* Global Declarations */\n";
1794 // First output all the declarations for the program, because C requires
1795 // Functions & globals to be declared before they are used.
1797 if (!M.getModuleInlineAsm().empty()) {
1798 Out << "/* Module asm statements */\n"
1801 // Split the string into lines, to make it easier to read the .ll file.
1802 std::string Asm = M.getModuleInlineAsm();
1804 size_t NewLine = Asm.find_first_of('\n', CurPos);
1805 while (NewLine != std::string::npos) {
1806 // We found a newline, print the portion of the asm string from the
1807 // last newline up to this newline.
1809 PrintEscapedString(std::string(Asm.begin()+CurPos, Asm.begin()+NewLine),
1813 NewLine = Asm.find_first_of('\n', CurPos);
1816 PrintEscapedString(std::string(Asm.begin()+CurPos, Asm.end()), Out);
1818 << "/* End Module asm statements */\n";
1821 // Loop over the symbol table, emitting all named constants...
1822 printModuleTypes(M.getTypeSymbolTable());
1824 // Global variable declarations...
1825 if (!M.global_empty()) {
1826 Out << "\n/* External Global Variable Declarations */\n";
1827 for (Module::global_iterator I = M.global_begin(), E = M.global_end();
1830 if (I->hasExternalLinkage() || I->hasExternalWeakLinkage() ||
1831 I->hasCommonLinkage())
1833 else if (I->hasDLLImportLinkage())
1834 Out << "__declspec(dllimport) ";
1836 continue; // Internal Global
1838 // Thread Local Storage
1839 if (I->isThreadLocal())
1842 printType(Out, I->getType()->getElementType(), false, GetValueName(I));
1844 if (I->hasExternalWeakLinkage())
1845 Out << " __EXTERNAL_WEAK__";
1850 // Function declarations
1851 Out << "\n/* Function Declarations */\n";
1852 Out << "double fmod(double, double);\n"; // Support for FP rem
1853 Out << "float fmodf(float, float);\n";
1854 Out << "long double fmodl(long double, long double);\n";
1856 for (Module::iterator I = M.begin(), E = M.end(); I != E; ++I) {
1857 // Don't print declarations for intrinsic functions.
1858 if (!I->isIntrinsic() && I->getName() != "setjmp" &&
1859 I->getName() != "longjmp" && I->getName() != "_setjmp") {
1860 if (I->hasExternalWeakLinkage())
1862 printFunctionSignature(I, true);
1863 if (I->hasWeakLinkage() || I->hasLinkOnceLinkage())
1864 Out << " __ATTRIBUTE_WEAK__";
1865 if (I->hasExternalWeakLinkage())
1866 Out << " __EXTERNAL_WEAK__";
1867 if (StaticCtors.count(I))
1868 Out << " __ATTRIBUTE_CTOR__";
1869 if (StaticDtors.count(I))
1870 Out << " __ATTRIBUTE_DTOR__";
1871 if (I->hasHiddenVisibility())
1872 Out << " __HIDDEN__";
1874 if (I->hasName() && I->getName()[0] == 1)
1875 Out << " LLVM_ASM(\"" << I->getName().substr(1) << "\")";
1881 // Output the global variable declarations
1882 if (!M.global_empty()) {
1883 Out << "\n\n/* Global Variable Declarations */\n";
1884 for (Module::global_iterator I = M.global_begin(), E = M.global_end();
1886 if (!I->isDeclaration()) {
1887 // Ignore special globals, such as debug info.
1888 if (getGlobalVariableClass(I))
1891 if (I->hasLocalLinkage())
1896 // Thread Local Storage
1897 if (I->isThreadLocal())
1900 printType(Out, I->getType()->getElementType(), false,
1903 if (I->hasLinkOnceLinkage())
1904 Out << " __attribute__((common))";
1905 else if (I->hasCommonLinkage()) // FIXME is this right?
1906 Out << " __ATTRIBUTE_WEAK__";
1907 else if (I->hasWeakLinkage())
1908 Out << " __ATTRIBUTE_WEAK__";
1909 else if (I->hasExternalWeakLinkage())
1910 Out << " __EXTERNAL_WEAK__";
1911 if (I->hasHiddenVisibility())
1912 Out << " __HIDDEN__";
1917 // Output the global variable definitions and contents...
1918 if (!M.global_empty()) {
1919 Out << "\n\n/* Global Variable Definitions and Initialization */\n";
1920 for (Module::global_iterator I = M.global_begin(), E = M.global_end();
1922 if (!I->isDeclaration()) {
1923 // Ignore special globals, such as debug info.
1924 if (getGlobalVariableClass(I))
1927 if (I->hasLocalLinkage())
1929 else if (I->hasDLLImportLinkage())
1930 Out << "__declspec(dllimport) ";
1931 else if (I->hasDLLExportLinkage())
1932 Out << "__declspec(dllexport) ";
1934 // Thread Local Storage
1935 if (I->isThreadLocal())
1938 printType(Out, I->getType()->getElementType(), false,
1940 if (I->hasLinkOnceLinkage())
1941 Out << " __attribute__((common))";
1942 else if (I->hasWeakLinkage())
1943 Out << " __ATTRIBUTE_WEAK__";
1944 else if (I->hasCommonLinkage())
1945 Out << " __ATTRIBUTE_WEAK__";
1947 if (I->hasHiddenVisibility())
1948 Out << " __HIDDEN__";
1950 // If the initializer is not null, emit the initializer. If it is null,
1951 // we try to avoid emitting large amounts of zeros. The problem with
1952 // this, however, occurs when the variable has weak linkage. In this
1953 // case, the assembler will complain about the variable being both weak
1954 // and common, so we disable this optimization.
1955 // FIXME common linkage should avoid this problem.
1956 if (!I->getInitializer()->isNullValue()) {
1958 writeOperand(I->getInitializer(), true);
1959 } else if (I->hasWeakLinkage()) {
1960 // We have to specify an initializer, but it doesn't have to be
1961 // complete. If the value is an aggregate, print out { 0 }, and let
1962 // the compiler figure out the rest of the zeros.
1964 if (I->getInitializer()->getType()->isStructTy() ||
1965 I->getInitializer()->getType()->isVectorTy()) {
1967 } else if (I->getInitializer()->getType()->isArrayTy()) {
1968 // As with structs and vectors, but with an extra set of braces
1969 // because arrays are wrapped in structs.
1972 // Just print it out normally.
1973 writeOperand(I->getInitializer(), true);
1981 Out << "\n\n/* Function Bodies */\n";
1983 // Emit some helper functions for dealing with FCMP instruction's
1985 Out << "static inline int llvm_fcmp_ord(double X, double Y) { ";
1986 Out << "return X == X && Y == Y; }\n";
1987 Out << "static inline int llvm_fcmp_uno(double X, double Y) { ";
1988 Out << "return X != X || Y != Y; }\n";
1989 Out << "static inline int llvm_fcmp_ueq(double X, double Y) { ";
1990 Out << "return X == Y || llvm_fcmp_uno(X, Y); }\n";
1991 Out << "static inline int llvm_fcmp_une(double X, double Y) { ";
1992 Out << "return X != Y; }\n";
1993 Out << "static inline int llvm_fcmp_ult(double X, double Y) { ";
1994 Out << "return X < Y || llvm_fcmp_uno(X, Y); }\n";
1995 Out << "static inline int llvm_fcmp_ugt(double X, double Y) { ";
1996 Out << "return X > Y || llvm_fcmp_uno(X, Y); }\n";
1997 Out << "static inline int llvm_fcmp_ule(double X, double Y) { ";
1998 Out << "return X <= Y || llvm_fcmp_uno(X, Y); }\n";
1999 Out << "static inline int llvm_fcmp_uge(double X, double Y) { ";
2000 Out << "return X >= Y || llvm_fcmp_uno(X, Y); }\n";
2001 Out << "static inline int llvm_fcmp_oeq(double X, double Y) { ";
2002 Out << "return X == Y ; }\n";
2003 Out << "static inline int llvm_fcmp_one(double X, double Y) { ";
2004 Out << "return X != Y && llvm_fcmp_ord(X, Y); }\n";
2005 Out << "static inline int llvm_fcmp_olt(double X, double Y) { ";
2006 Out << "return X < Y ; }\n";
2007 Out << "static inline int llvm_fcmp_ogt(double X, double Y) { ";
2008 Out << "return X > Y ; }\n";
2009 Out << "static inline int llvm_fcmp_ole(double X, double Y) { ";
2010 Out << "return X <= Y ; }\n";
2011 Out << "static inline int llvm_fcmp_oge(double X, double Y) { ";
2012 Out << "return X >= Y ; }\n";
2017 /// Output all floating point constants that cannot be printed accurately...
2018 void CWriter::printFloatingPointConstants(Function &F) {
2019 // Scan the module for floating point constants. If any FP constant is used
2020 // in the function, we want to redirect it here so that we do not depend on
2021 // the precision of the printed form, unless the printed form preserves
2024 for (constant_iterator I = constant_begin(&F), E = constant_end(&F);
2026 printFloatingPointConstants(*I);
2031 void CWriter::printFloatingPointConstants(const Constant *C) {
2032 // If this is a constant expression, recursively check for constant fp values.
2033 if (const ConstantExpr *CE = dyn_cast<ConstantExpr>(C)) {
2034 for (unsigned i = 0, e = CE->getNumOperands(); i != e; ++i)
2035 printFloatingPointConstants(CE->getOperand(i));
2039 // Otherwise, check for a FP constant that we need to print.
2040 const ConstantFP *FPC = dyn_cast<ConstantFP>(C);
2042 // Do not put in FPConstantMap if safe.
2043 isFPCSafeToPrint(FPC) ||
2044 // Already printed this constant?
2045 FPConstantMap.count(FPC))
2048 FPConstantMap[FPC] = FPCounter; // Number the FP constants
2050 if (FPC->getType() == Type::getDoubleTy(FPC->getContext())) {
2051 double Val = FPC->getValueAPF().convertToDouble();
2052 uint64_t i = FPC->getValueAPF().bitcastToAPInt().getZExtValue();
2053 Out << "static const ConstantDoubleTy FPConstant" << FPCounter++
2054 << " = 0x" << utohexstr(i)
2055 << "ULL; /* " << Val << " */\n";
2056 } else if (FPC->getType() == Type::getFloatTy(FPC->getContext())) {
2057 float Val = FPC->getValueAPF().convertToFloat();
2058 uint32_t i = (uint32_t)FPC->getValueAPF().bitcastToAPInt().
2060 Out << "static const ConstantFloatTy FPConstant" << FPCounter++
2061 << " = 0x" << utohexstr(i)
2062 << "U; /* " << Val << " */\n";
2063 } else if (FPC->getType() == Type::getX86_FP80Ty(FPC->getContext())) {
2064 // api needed to prevent premature destruction
2065 APInt api = FPC->getValueAPF().bitcastToAPInt();
2066 const uint64_t *p = api.getRawData();
2067 Out << "static const ConstantFP80Ty FPConstant" << FPCounter++
2068 << " = { 0x" << utohexstr(p[0])
2069 << "ULL, 0x" << utohexstr((uint16_t)p[1]) << ",{0,0,0}"
2070 << "}; /* Long double constant */\n";
2071 } else if (FPC->getType() == Type::getPPC_FP128Ty(FPC->getContext()) ||
2072 FPC->getType() == Type::getFP128Ty(FPC->getContext())) {
2073 APInt api = FPC->getValueAPF().bitcastToAPInt();
2074 const uint64_t *p = api.getRawData();
2075 Out << "static const ConstantFP128Ty FPConstant" << FPCounter++
2077 << utohexstr(p[0]) << ", 0x" << utohexstr(p[1])
2078 << "}; /* Long double constant */\n";
2081 llvm_unreachable("Unknown float type!");
2087 /// printSymbolTable - Run through symbol table looking for type names. If a
2088 /// type name is found, emit its declaration...
2090 void CWriter::printModuleTypes(const TypeSymbolTable &TST) {
2091 Out << "/* Helper union for bitcasts */\n";
2092 Out << "typedef union {\n";
2093 Out << " unsigned int Int32;\n";
2094 Out << " unsigned long long Int64;\n";
2095 Out << " float Float;\n";
2096 Out << " double Double;\n";
2097 Out << "} llvmBitCastUnion;\n";
2099 // We are only interested in the type plane of the symbol table.
2100 TypeSymbolTable::const_iterator I = TST.begin();
2101 TypeSymbolTable::const_iterator End = TST.end();
2103 // If there are no type names, exit early.
2104 if (I == End) return;
2106 // Print out forward declarations for structure types before anything else!
2107 Out << "/* Structure forward decls */\n";
2108 for (; I != End; ++I) {
2109 std::string Name = "struct " + CBEMangle("l_"+I->first);
2110 Out << Name << ";\n";
2111 TypeNames.insert(std::make_pair(I->second, Name));
2116 // Now we can print out typedefs. Above, we guaranteed that this can only be
2117 // for struct or opaque types.
2118 Out << "/* Typedefs */\n";
2119 for (I = TST.begin(); I != End; ++I) {
2120 std::string Name = CBEMangle("l_"+I->first);
2122 printType(Out, I->second, false, Name);
2128 // Keep track of which structures have been printed so far...
2129 std::set<const Type *> StructPrinted;
2131 // Loop over all structures then push them into the stack so they are
2132 // printed in the correct order.
2134 Out << "/* Structure contents */\n";
2135 for (I = TST.begin(); I != End; ++I)
2136 if (I->second->isStructTy() || I->second->isArrayTy())
2137 // Only print out used types!
2138 printContainedStructs(I->second, StructPrinted);
2141 // Push the struct onto the stack and recursively push all structs
2142 // this one depends on.
2144 // TODO: Make this work properly with vector types
2146 void CWriter::printContainedStructs(const Type *Ty,
2147 std::set<const Type*> &StructPrinted) {
2148 // Don't walk through pointers.
2149 if (Ty->isPointerTy() || Ty->isPrimitiveType() || Ty->isIntegerTy())
2152 // Print all contained types first.
2153 for (Type::subtype_iterator I = Ty->subtype_begin(),
2154 E = Ty->subtype_end(); I != E; ++I)
2155 printContainedStructs(*I, StructPrinted);
2157 if (Ty->isStructTy() || Ty->isArrayTy()) {
2158 // Check to see if we have already printed this struct.
2159 if (StructPrinted.insert(Ty).second) {
2160 // Print structure type out.
2161 std::string Name = TypeNames[Ty];
2162 printType(Out, Ty, false, Name, true);
2168 void CWriter::printFunctionSignature(const Function *F, bool Prototype) {
2169 /// isStructReturn - Should this function actually return a struct by-value?
2170 bool isStructReturn = F->hasStructRetAttr();
2172 if (F->hasLocalLinkage()) Out << "static ";
2173 if (F->hasDLLImportLinkage()) Out << "__declspec(dllimport) ";
2174 if (F->hasDLLExportLinkage()) Out << "__declspec(dllexport) ";
2175 switch (F->getCallingConv()) {
2176 case CallingConv::X86_StdCall:
2177 Out << "__attribute__((stdcall)) ";
2179 case CallingConv::X86_FastCall:
2180 Out << "__attribute__((fastcall)) ";
2182 case CallingConv::X86_ThisCall:
2183 Out << "__attribute__((thiscall)) ";
2189 // Loop over the arguments, printing them...
2190 const FunctionType *FT = cast<FunctionType>(F->getFunctionType());
2191 const AttrListPtr &PAL = F->getAttributes();
2194 raw_string_ostream FunctionInnards(tstr);
2196 // Print out the name...
2197 FunctionInnards << GetValueName(F) << '(';
2199 bool PrintedArg = false;
2200 if (!F->isDeclaration()) {
2201 if (!F->arg_empty()) {
2202 Function::const_arg_iterator I = F->arg_begin(), E = F->arg_end();
2205 // If this is a struct-return function, don't print the hidden
2206 // struct-return argument.
2207 if (isStructReturn) {
2208 assert(I != E && "Invalid struct return function!");
2213 std::string ArgName;
2214 for (; I != E; ++I) {
2215 if (PrintedArg) FunctionInnards << ", ";
2216 if (I->hasName() || !Prototype)
2217 ArgName = GetValueName(I);
2220 const Type *ArgTy = I->getType();
2221 if (PAL.paramHasAttr(Idx, Attribute::ByVal)) {
2222 ArgTy = cast<PointerType>(ArgTy)->getElementType();
2223 ByValParams.insert(I);
2225 printType(FunctionInnards, ArgTy,
2226 /*isSigned=*/PAL.paramHasAttr(Idx, Attribute::SExt),
2233 // Loop over the arguments, printing them.
2234 FunctionType::param_iterator I = FT->param_begin(), E = FT->param_end();
2237 // If this is a struct-return function, don't print the hidden
2238 // struct-return argument.
2239 if (isStructReturn) {
2240 assert(I != E && "Invalid struct return function!");
2245 for (; I != E; ++I) {
2246 if (PrintedArg) FunctionInnards << ", ";
2247 const Type *ArgTy = *I;
2248 if (PAL.paramHasAttr(Idx, Attribute::ByVal)) {
2249 assert(ArgTy->isPointerTy());
2250 ArgTy = cast<PointerType>(ArgTy)->getElementType();
2252 printType(FunctionInnards, ArgTy,
2253 /*isSigned=*/PAL.paramHasAttr(Idx, Attribute::SExt));
2259 if (!PrintedArg && FT->isVarArg()) {
2260 FunctionInnards << "int vararg_dummy_arg";
2264 // Finish printing arguments... if this is a vararg function, print the ...,
2265 // unless there are no known types, in which case, we just emit ().
2267 if (FT->isVarArg() && PrintedArg) {
2268 FunctionInnards << ",..."; // Output varargs portion of signature!
2269 } else if (!FT->isVarArg() && !PrintedArg) {
2270 FunctionInnards << "void"; // ret() -> ret(void) in C.
2272 FunctionInnards << ')';
2274 // Get the return tpe for the function.
2276 if (!isStructReturn)
2277 RetTy = F->getReturnType();
2279 // If this is a struct-return function, print the struct-return type.
2280 RetTy = cast<PointerType>(FT->getParamType(0))->getElementType();
2283 // Print out the return type and the signature built above.
2284 printType(Out, RetTy,
2285 /*isSigned=*/PAL.paramHasAttr(0, Attribute::SExt),
2286 FunctionInnards.str());
2289 static inline bool isFPIntBitCast(const Instruction &I) {
2290 if (!isa<BitCastInst>(I))
2292 const Type *SrcTy = I.getOperand(0)->getType();
2293 const Type *DstTy = I.getType();
2294 return (SrcTy->isFloatingPointTy() && DstTy->isIntegerTy()) ||
2295 (DstTy->isFloatingPointTy() && SrcTy->isIntegerTy());
2298 void CWriter::printFunction(Function &F) {
2299 /// isStructReturn - Should this function actually return a struct by-value?
2300 bool isStructReturn = F.hasStructRetAttr();
2302 printFunctionSignature(&F, false);
2305 // If this is a struct return function, handle the result with magic.
2306 if (isStructReturn) {
2307 const Type *StructTy =
2308 cast<PointerType>(F.arg_begin()->getType())->getElementType();
2310 printType(Out, StructTy, false, "StructReturn");
2311 Out << "; /* Struct return temporary */\n";
2314 printType(Out, F.arg_begin()->getType(), false,
2315 GetValueName(F.arg_begin()));
2316 Out << " = &StructReturn;\n";
2319 bool PrintedVar = false;
2321 // print local variable information for the function
2322 for (inst_iterator I = inst_begin(&F), E = inst_end(&F); I != E; ++I) {
2323 if (const AllocaInst *AI = isDirectAlloca(&*I)) {
2325 printType(Out, AI->getAllocatedType(), false, GetValueName(AI));
2326 Out << "; /* Address-exposed local */\n";
2328 } else if (I->getType() != Type::getVoidTy(F.getContext()) &&
2329 !isInlinableInst(*I)) {
2331 printType(Out, I->getType(), false, GetValueName(&*I));
2334 if (isa<PHINode>(*I)) { // Print out PHI node temporaries as well...
2336 printType(Out, I->getType(), false,
2337 GetValueName(&*I)+"__PHI_TEMPORARY");
2342 // We need a temporary for the BitCast to use so it can pluck a value out
2343 // of a union to do the BitCast. This is separate from the need for a
2344 // variable to hold the result of the BitCast.
2345 if (isFPIntBitCast(*I)) {
2346 Out << " llvmBitCastUnion " << GetValueName(&*I)
2347 << "__BITCAST_TEMPORARY;\n";
2355 if (F.hasExternalLinkage() && F.getName() == "main")
2356 Out << " CODE_FOR_MAIN();\n";
2358 // print the basic blocks
2359 for (Function::iterator BB = F.begin(), E = F.end(); BB != E; ++BB) {
2360 if (Loop *L = LI->getLoopFor(BB)) {
2361 if (L->getHeader() == BB && L->getParentLoop() == 0)
2364 printBasicBlock(BB);
2371 void CWriter::printLoop(Loop *L) {
2372 Out << " do { /* Syntactic loop '" << L->getHeader()->getName()
2373 << "' to make GCC happy */\n";
2374 for (unsigned i = 0, e = L->getBlocks().size(); i != e; ++i) {
2375 BasicBlock *BB = L->getBlocks()[i];
2376 Loop *BBLoop = LI->getLoopFor(BB);
2378 printBasicBlock(BB);
2379 else if (BB == BBLoop->getHeader() && BBLoop->getParentLoop() == L)
2382 Out << " } while (1); /* end of syntactic loop '"
2383 << L->getHeader()->getName() << "' */\n";
2386 void CWriter::printBasicBlock(BasicBlock *BB) {
2388 // Don't print the label for the basic block if there are no uses, or if
2389 // the only terminator use is the predecessor basic block's terminator.
2390 // We have to scan the use list because PHI nodes use basic blocks too but
2391 // do not require a label to be generated.
2393 bool NeedsLabel = false;
2394 for (pred_iterator PI = pred_begin(BB), E = pred_end(BB); PI != E; ++PI)
2395 if (isGotoCodeNecessary(*PI, BB)) {
2400 if (NeedsLabel) Out << GetValueName(BB) << ":\n";
2402 // Output all of the instructions in the basic block...
2403 for (BasicBlock::iterator II = BB->begin(), E = --BB->end(); II != E;
2405 if (!isInlinableInst(*II) && !isDirectAlloca(II)) {
2406 if (II->getType() != Type::getVoidTy(BB->getContext()) &&
2411 writeInstComputationInline(*II);
2416 // Don't emit prefix or suffix for the terminator.
2417 visit(*BB->getTerminator());
2421 // Specific Instruction type classes... note that all of the casts are
2422 // necessary because we use the instruction classes as opaque types...
2424 void CWriter::visitReturnInst(ReturnInst &I) {
2425 // If this is a struct return function, return the temporary struct.
2426 bool isStructReturn = I.getParent()->getParent()->hasStructRetAttr();
2428 if (isStructReturn) {
2429 Out << " return StructReturn;\n";
2433 // Don't output a void return if this is the last basic block in the function
2434 if (I.getNumOperands() == 0 &&
2435 &*--I.getParent()->getParent()->end() == I.getParent() &&
2436 !I.getParent()->size() == 1) {
2440 if (I.getNumOperands() > 1) {
2443 printType(Out, I.getParent()->getParent()->getReturnType());
2444 Out << " llvm_cbe_mrv_temp = {\n";
2445 for (unsigned i = 0, e = I.getNumOperands(); i != e; ++i) {
2447 writeOperand(I.getOperand(i));
2453 Out << " return llvm_cbe_mrv_temp;\n";
2459 if (I.getNumOperands()) {
2461 writeOperand(I.getOperand(0));
2466 void CWriter::visitSwitchInst(SwitchInst &SI) {
2469 writeOperand(SI.getOperand(0));
2470 Out << ") {\n default:\n";
2471 printPHICopiesForSuccessor (SI.getParent(), SI.getDefaultDest(), 2);
2472 printBranchToBlock(SI.getParent(), SI.getDefaultDest(), 2);
2474 for (unsigned i = 2, e = SI.getNumOperands(); i != e; i += 2) {
2476 writeOperand(SI.getOperand(i));
2478 BasicBlock *Succ = cast<BasicBlock>(SI.getOperand(i+1));
2479 printPHICopiesForSuccessor (SI.getParent(), Succ, 2);
2480 printBranchToBlock(SI.getParent(), Succ, 2);
2481 if (Function::iterator(Succ) == llvm::next(Function::iterator(SI.getParent())))
2487 void CWriter::visitIndirectBrInst(IndirectBrInst &IBI) {
2488 Out << " goto *(void*)(";
2489 writeOperand(IBI.getOperand(0));
2493 void CWriter::visitUnreachableInst(UnreachableInst &I) {
2494 Out << " /*UNREACHABLE*/;\n";
2497 bool CWriter::isGotoCodeNecessary(BasicBlock *From, BasicBlock *To) {
2498 /// FIXME: This should be reenabled, but loop reordering safe!!
2501 if (llvm::next(Function::iterator(From)) != Function::iterator(To))
2502 return true; // Not the direct successor, we need a goto.
2504 //isa<SwitchInst>(From->getTerminator())
2506 if (LI->getLoopFor(From) != LI->getLoopFor(To))
2511 void CWriter::printPHICopiesForSuccessor (BasicBlock *CurBlock,
2512 BasicBlock *Successor,
2514 for (BasicBlock::iterator I = Successor->begin(); isa<PHINode>(I); ++I) {
2515 PHINode *PN = cast<PHINode>(I);
2516 // Now we have to do the printing.
2517 Value *IV = PN->getIncomingValueForBlock(CurBlock);
2518 if (!isa<UndefValue>(IV)) {
2519 Out << std::string(Indent, ' ');
2520 Out << " " << GetValueName(I) << "__PHI_TEMPORARY = ";
2522 Out << "; /* for PHI node */\n";
2527 void CWriter::printBranchToBlock(BasicBlock *CurBB, BasicBlock *Succ,
2529 if (isGotoCodeNecessary(CurBB, Succ)) {
2530 Out << std::string(Indent, ' ') << " goto ";
2536 // Branch instruction printing - Avoid printing out a branch to a basic block
2537 // that immediately succeeds the current one.
2539 void CWriter::visitBranchInst(BranchInst &I) {
2541 if (I.isConditional()) {
2542 if (isGotoCodeNecessary(I.getParent(), I.getSuccessor(0))) {
2544 writeOperand(I.getCondition());
2547 printPHICopiesForSuccessor (I.getParent(), I.getSuccessor(0), 2);
2548 printBranchToBlock(I.getParent(), I.getSuccessor(0), 2);
2550 if (isGotoCodeNecessary(I.getParent(), I.getSuccessor(1))) {
2551 Out << " } else {\n";
2552 printPHICopiesForSuccessor (I.getParent(), I.getSuccessor(1), 2);
2553 printBranchToBlock(I.getParent(), I.getSuccessor(1), 2);
2556 // First goto not necessary, assume second one is...
2558 writeOperand(I.getCondition());
2561 printPHICopiesForSuccessor (I.getParent(), I.getSuccessor(1), 2);
2562 printBranchToBlock(I.getParent(), I.getSuccessor(1), 2);
2567 printPHICopiesForSuccessor (I.getParent(), I.getSuccessor(0), 0);
2568 printBranchToBlock(I.getParent(), I.getSuccessor(0), 0);
2573 // PHI nodes get copied into temporary values at the end of predecessor basic
2574 // blocks. We now need to copy these temporary values into the REAL value for
2576 void CWriter::visitPHINode(PHINode &I) {
2578 Out << "__PHI_TEMPORARY";
2582 void CWriter::visitBinaryOperator(Instruction &I) {
2583 // binary instructions, shift instructions, setCond instructions.
2584 assert(!I.getType()->isPointerTy());
2586 // We must cast the results of binary operations which might be promoted.
2587 bool needsCast = false;
2588 if ((I.getType() == Type::getInt8Ty(I.getContext())) ||
2589 (I.getType() == Type::getInt16Ty(I.getContext()))
2590 || (I.getType() == Type::getFloatTy(I.getContext()))) {
2593 printType(Out, I.getType(), false);
2597 // If this is a negation operation, print it out as such. For FP, we don't
2598 // want to print "-0.0 - X".
2599 if (BinaryOperator::isNeg(&I)) {
2601 writeOperand(BinaryOperator::getNegArgument(cast<BinaryOperator>(&I)));
2603 } else if (BinaryOperator::isFNeg(&I)) {
2605 writeOperand(BinaryOperator::getFNegArgument(cast<BinaryOperator>(&I)));
2607 } else if (I.getOpcode() == Instruction::FRem) {
2608 // Output a call to fmod/fmodf instead of emitting a%b
2609 if (I.getType() == Type::getFloatTy(I.getContext()))
2611 else if (I.getType() == Type::getDoubleTy(I.getContext()))
2613 else // all 3 flavors of long double
2615 writeOperand(I.getOperand(0));
2617 writeOperand(I.getOperand(1));
2621 // Write out the cast of the instruction's value back to the proper type
2623 bool NeedsClosingParens = writeInstructionCast(I);
2625 // Certain instructions require the operand to be forced to a specific type
2626 // so we use writeOperandWithCast here instead of writeOperand. Similarly
2627 // below for operand 1
2628 writeOperandWithCast(I.getOperand(0), I.getOpcode());
2630 switch (I.getOpcode()) {
2631 case Instruction::Add:
2632 case Instruction::FAdd: Out << " + "; break;
2633 case Instruction::Sub:
2634 case Instruction::FSub: Out << " - "; break;
2635 case Instruction::Mul:
2636 case Instruction::FMul: Out << " * "; break;
2637 case Instruction::URem:
2638 case Instruction::SRem:
2639 case Instruction::FRem: Out << " % "; break;
2640 case Instruction::UDiv:
2641 case Instruction::SDiv:
2642 case Instruction::FDiv: Out << " / "; break;
2643 case Instruction::And: Out << " & "; break;
2644 case Instruction::Or: Out << " | "; break;
2645 case Instruction::Xor: Out << " ^ "; break;
2646 case Instruction::Shl : Out << " << "; break;
2647 case Instruction::LShr:
2648 case Instruction::AShr: Out << " >> "; break;
2651 errs() << "Invalid operator type!" << I;
2653 llvm_unreachable(0);
2656 writeOperandWithCast(I.getOperand(1), I.getOpcode());
2657 if (NeedsClosingParens)
2666 void CWriter::visitICmpInst(ICmpInst &I) {
2667 // We must cast the results of icmp which might be promoted.
2668 bool needsCast = false;
2670 // Write out the cast of the instruction's value back to the proper type
2672 bool NeedsClosingParens = writeInstructionCast(I);
2674 // Certain icmp predicate require the operand to be forced to a specific type
2675 // so we use writeOperandWithCast here instead of writeOperand. Similarly
2676 // below for operand 1
2677 writeOperandWithCast(I.getOperand(0), I);
2679 switch (I.getPredicate()) {
2680 case ICmpInst::ICMP_EQ: Out << " == "; break;
2681 case ICmpInst::ICMP_NE: Out << " != "; break;
2682 case ICmpInst::ICMP_ULE:
2683 case ICmpInst::ICMP_SLE: Out << " <= "; break;
2684 case ICmpInst::ICMP_UGE:
2685 case ICmpInst::ICMP_SGE: Out << " >= "; break;
2686 case ICmpInst::ICMP_ULT:
2687 case ICmpInst::ICMP_SLT: Out << " < "; break;
2688 case ICmpInst::ICMP_UGT:
2689 case ICmpInst::ICMP_SGT: Out << " > "; break;
2692 errs() << "Invalid icmp predicate!" << I;
2694 llvm_unreachable(0);
2697 writeOperandWithCast(I.getOperand(1), I);
2698 if (NeedsClosingParens)
2706 void CWriter::visitFCmpInst(FCmpInst &I) {
2707 if (I.getPredicate() == FCmpInst::FCMP_FALSE) {
2711 if (I.getPredicate() == FCmpInst::FCMP_TRUE) {
2717 switch (I.getPredicate()) {
2718 default: llvm_unreachable("Illegal FCmp predicate");
2719 case FCmpInst::FCMP_ORD: op = "ord"; break;
2720 case FCmpInst::FCMP_UNO: op = "uno"; break;
2721 case FCmpInst::FCMP_UEQ: op = "ueq"; break;
2722 case FCmpInst::FCMP_UNE: op = "une"; break;
2723 case FCmpInst::FCMP_ULT: op = "ult"; break;
2724 case FCmpInst::FCMP_ULE: op = "ule"; break;
2725 case FCmpInst::FCMP_UGT: op = "ugt"; break;
2726 case FCmpInst::FCMP_UGE: op = "uge"; break;
2727 case FCmpInst::FCMP_OEQ: op = "oeq"; break;
2728 case FCmpInst::FCMP_ONE: op = "one"; break;
2729 case FCmpInst::FCMP_OLT: op = "olt"; break;
2730 case FCmpInst::FCMP_OLE: op = "ole"; break;
2731 case FCmpInst::FCMP_OGT: op = "ogt"; break;
2732 case FCmpInst::FCMP_OGE: op = "oge"; break;
2735 Out << "llvm_fcmp_" << op << "(";
2736 // Write the first operand
2737 writeOperand(I.getOperand(0));
2739 // Write the second operand
2740 writeOperand(I.getOperand(1));
2744 static const char * getFloatBitCastField(const Type *Ty) {
2745 switch (Ty->getTypeID()) {
2746 default: llvm_unreachable("Invalid Type");
2747 case Type::FloatTyID: return "Float";
2748 case Type::DoubleTyID: return "Double";
2749 case Type::IntegerTyID: {
2750 unsigned NumBits = cast<IntegerType>(Ty)->getBitWidth();
2759 void CWriter::visitCastInst(CastInst &I) {
2760 const Type *DstTy = I.getType();
2761 const Type *SrcTy = I.getOperand(0)->getType();
2762 if (isFPIntBitCast(I)) {
2764 // These int<->float and long<->double casts need to be handled specially
2765 Out << GetValueName(&I) << "__BITCAST_TEMPORARY."
2766 << getFloatBitCastField(I.getOperand(0)->getType()) << " = ";
2767 writeOperand(I.getOperand(0));
2768 Out << ", " << GetValueName(&I) << "__BITCAST_TEMPORARY."
2769 << getFloatBitCastField(I.getType());
2775 printCast(I.getOpcode(), SrcTy, DstTy);
2777 // Make a sext from i1 work by subtracting the i1 from 0 (an int).
2778 if (SrcTy == Type::getInt1Ty(I.getContext()) &&
2779 I.getOpcode() == Instruction::SExt)
2782 writeOperand(I.getOperand(0));
2784 if (DstTy == Type::getInt1Ty(I.getContext()) &&
2785 (I.getOpcode() == Instruction::Trunc ||
2786 I.getOpcode() == Instruction::FPToUI ||
2787 I.getOpcode() == Instruction::FPToSI ||
2788 I.getOpcode() == Instruction::PtrToInt)) {
2789 // Make sure we really get a trunc to bool by anding the operand with 1
2795 void CWriter::visitSelectInst(SelectInst &I) {
2797 writeOperand(I.getCondition());
2799 writeOperand(I.getTrueValue());
2801 writeOperand(I.getFalseValue());
2806 void CWriter::lowerIntrinsics(Function &F) {
2807 // This is used to keep track of intrinsics that get generated to a lowered
2808 // function. We must generate the prototypes before the function body which
2809 // will only be expanded on first use (by the loop below).
2810 std::vector<Function*> prototypesToGen;
2812 // Examine all the instructions in this function to find the intrinsics that
2813 // need to be lowered.
2814 for (Function::iterator BB = F.begin(), EE = F.end(); BB != EE; ++BB)
2815 for (BasicBlock::iterator I = BB->begin(), E = BB->end(); I != E; )
2816 if (CallInst *CI = dyn_cast<CallInst>(I++))
2817 if (Function *F = CI->getCalledFunction())
2818 switch (F->getIntrinsicID()) {
2819 case Intrinsic::not_intrinsic:
2820 case Intrinsic::memory_barrier:
2821 case Intrinsic::vastart:
2822 case Intrinsic::vacopy:
2823 case Intrinsic::vaend:
2824 case Intrinsic::returnaddress:
2825 case Intrinsic::frameaddress:
2826 case Intrinsic::setjmp:
2827 case Intrinsic::longjmp:
2828 case Intrinsic::prefetch:
2829 case Intrinsic::powi:
2830 case Intrinsic::x86_sse_cmp_ss:
2831 case Intrinsic::x86_sse_cmp_ps:
2832 case Intrinsic::x86_sse2_cmp_sd:
2833 case Intrinsic::x86_sse2_cmp_pd:
2834 case Intrinsic::ppc_altivec_lvsl:
2835 // We directly implement these intrinsics
2838 // If this is an intrinsic that directly corresponds to a GCC
2839 // builtin, we handle it.
2840 const char *BuiltinName = "";
2841 #define GET_GCC_BUILTIN_NAME
2842 #include "llvm/Intrinsics.gen"
2843 #undef GET_GCC_BUILTIN_NAME
2844 // If we handle it, don't lower it.
2845 if (BuiltinName[0]) break;
2847 // All other intrinsic calls we must lower.
2848 Instruction *Before = 0;
2849 if (CI != &BB->front())
2850 Before = prior(BasicBlock::iterator(CI));
2852 IL->LowerIntrinsicCall(CI);
2853 if (Before) { // Move iterator to instruction after call
2858 // If the intrinsic got lowered to another call, and that call has
2859 // a definition then we need to make sure its prototype is emitted
2860 // before any calls to it.
2861 if (CallInst *Call = dyn_cast<CallInst>(I))
2862 if (Function *NewF = Call->getCalledFunction())
2863 if (!NewF->isDeclaration())
2864 prototypesToGen.push_back(NewF);
2869 // We may have collected some prototypes to emit in the loop above.
2870 // Emit them now, before the function that uses them is emitted. But,
2871 // be careful not to emit them twice.
2872 std::vector<Function*>::iterator I = prototypesToGen.begin();
2873 std::vector<Function*>::iterator E = prototypesToGen.end();
2874 for ( ; I != E; ++I) {
2875 if (intrinsicPrototypesAlreadyGenerated.insert(*I).second) {
2877 printFunctionSignature(*I, true);
2883 void CWriter::visitCallInst(CallInst &I) {
2884 if (isa<InlineAsm>(I.getCalledValue()))
2885 return visitInlineAsm(I);
2887 bool WroteCallee = false;
2889 // Handle intrinsic function calls first...
2890 if (Function *F = I.getCalledFunction())
2891 if (Intrinsic::ID ID = (Intrinsic::ID)F->getIntrinsicID())
2892 if (visitBuiltinCall(I, ID, WroteCallee))
2895 Value *Callee = I.getCalledValue();
2897 const PointerType *PTy = cast<PointerType>(Callee->getType());
2898 const FunctionType *FTy = cast<FunctionType>(PTy->getElementType());
2900 // If this is a call to a struct-return function, assign to the first
2901 // parameter instead of passing it to the call.
2902 const AttrListPtr &PAL = I.getAttributes();
2903 bool hasByVal = I.hasByValArgument();
2904 bool isStructRet = I.hasStructRetAttr();
2906 writeOperandDeref(I.getArgOperand(0));
2910 if (I.isTailCall()) Out << " /*tail*/ ";
2913 // If this is an indirect call to a struct return function, we need to cast
2914 // the pointer. Ditto for indirect calls with byval arguments.
2915 bool NeedsCast = (hasByVal || isStructRet) && !isa<Function>(Callee);
2917 // GCC is a real PITA. It does not permit codegening casts of functions to
2918 // function pointers if they are in a call (it generates a trap instruction
2919 // instead!). We work around this by inserting a cast to void* in between
2920 // the function and the function pointer cast. Unfortunately, we can't just
2921 // form the constant expression here, because the folder will immediately
2924 // Note finally, that this is completely unsafe. ANSI C does not guarantee
2925 // that void* and function pointers have the same size. :( To deal with this
2926 // in the common case, we handle casts where the number of arguments passed
2929 if (ConstantExpr *CE = dyn_cast<ConstantExpr>(Callee))
2931 if (Function *RF = dyn_cast<Function>(CE->getOperand(0))) {
2937 // Ok, just cast the pointer type.
2940 printStructReturnPointerFunctionType(Out, PAL,
2941 cast<PointerType>(I.getCalledValue()->getType()));
2943 printType(Out, I.getCalledValue()->getType(), false, "", true, PAL);
2945 printType(Out, I.getCalledValue()->getType());
2948 writeOperand(Callee);
2949 if (NeedsCast) Out << ')';
2954 bool PrintedArg = false;
2955 if(FTy->isVarArg() && !FTy->getNumParams()) {
2956 Out << "0 /*dummy arg*/";
2960 unsigned NumDeclaredParams = FTy->getNumParams();
2962 CallSite::arg_iterator AI = CS.arg_begin(), AE = CS.arg_end();
2964 if (isStructRet) { // Skip struct return argument.
2970 for (; AI != AE; ++AI, ++ArgNo) {
2971 if (PrintedArg) Out << ", ";
2972 if (ArgNo < NumDeclaredParams &&
2973 (*AI)->getType() != FTy->getParamType(ArgNo)) {
2975 printType(Out, FTy->getParamType(ArgNo),
2976 /*isSigned=*/PAL.paramHasAttr(ArgNo+1, Attribute::SExt));
2979 // Check if the argument is expected to be passed by value.
2980 if (I.paramHasAttr(ArgNo+1, Attribute::ByVal))
2981 writeOperandDeref(*AI);
2989 /// visitBuiltinCall - Handle the call to the specified builtin. Returns true
2990 /// if the entire call is handled, return false if it wasn't handled, and
2991 /// optionally set 'WroteCallee' if the callee has already been printed out.
2992 bool CWriter::visitBuiltinCall(CallInst &I, Intrinsic::ID ID,
2993 bool &WroteCallee) {
2996 // If this is an intrinsic that directly corresponds to a GCC
2997 // builtin, we emit it here.
2998 const char *BuiltinName = "";
2999 Function *F = I.getCalledFunction();
3000 #define GET_GCC_BUILTIN_NAME
3001 #include "llvm/Intrinsics.gen"
3002 #undef GET_GCC_BUILTIN_NAME
3003 assert(BuiltinName[0] && "Unknown LLVM intrinsic!");
3009 case Intrinsic::memory_barrier:
3010 Out << "__sync_synchronize()";
3012 case Intrinsic::vastart:
3015 Out << "va_start(*(va_list*)";
3016 writeOperand(I.getArgOperand(0));
3018 // Output the last argument to the enclosing function.
3019 if (I.getParent()->getParent()->arg_empty())
3020 Out << "vararg_dummy_arg";
3022 writeOperand(--I.getParent()->getParent()->arg_end());
3025 case Intrinsic::vaend:
3026 if (!isa<ConstantPointerNull>(I.getArgOperand(0))) {
3027 Out << "0; va_end(*(va_list*)";
3028 writeOperand(I.getArgOperand(0));
3031 Out << "va_end(*(va_list*)0)";
3034 case Intrinsic::vacopy:
3036 Out << "va_copy(*(va_list*)";
3037 writeOperand(I.getArgOperand(0));
3038 Out << ", *(va_list*)";
3039 writeOperand(I.getArgOperand(1));
3042 case Intrinsic::returnaddress:
3043 Out << "__builtin_return_address(";
3044 writeOperand(I.getArgOperand(0));
3047 case Intrinsic::frameaddress:
3048 Out << "__builtin_frame_address(";
3049 writeOperand(I.getArgOperand(0));
3052 case Intrinsic::powi:
3053 Out << "__builtin_powi(";
3054 writeOperand(I.getArgOperand(0));
3056 writeOperand(I.getArgOperand(1));
3059 case Intrinsic::setjmp:
3060 Out << "setjmp(*(jmp_buf*)";
3061 writeOperand(I.getArgOperand(0));
3064 case Intrinsic::longjmp:
3065 Out << "longjmp(*(jmp_buf*)";
3066 writeOperand(I.getArgOperand(0));
3068 writeOperand(I.getArgOperand(1));
3071 case Intrinsic::prefetch:
3072 Out << "LLVM_PREFETCH((const void *)";
3073 writeOperand(I.getArgOperand(0));
3075 writeOperand(I.getArgOperand(1));
3077 writeOperand(I.getArgOperand(2));
3080 case Intrinsic::stacksave:
3081 // Emit this as: Val = 0; *((void**)&Val) = __builtin_stack_save()
3082 // to work around GCC bugs (see PR1809).
3083 Out << "0; *((void**)&" << GetValueName(&I)
3084 << ") = __builtin_stack_save()";
3086 case Intrinsic::x86_sse_cmp_ss:
3087 case Intrinsic::x86_sse_cmp_ps:
3088 case Intrinsic::x86_sse2_cmp_sd:
3089 case Intrinsic::x86_sse2_cmp_pd:
3091 printType(Out, I.getType());
3093 // Multiple GCC builtins multiplex onto this intrinsic.
3094 switch (cast<ConstantInt>(I.getArgOperand(2))->getZExtValue()) {
3095 default: llvm_unreachable("Invalid llvm.x86.sse.cmp!");
3096 case 0: Out << "__builtin_ia32_cmpeq"; break;
3097 case 1: Out << "__builtin_ia32_cmplt"; break;
3098 case 2: Out << "__builtin_ia32_cmple"; break;
3099 case 3: Out << "__builtin_ia32_cmpunord"; break;
3100 case 4: Out << "__builtin_ia32_cmpneq"; break;
3101 case 5: Out << "__builtin_ia32_cmpnlt"; break;
3102 case 6: Out << "__builtin_ia32_cmpnle"; break;
3103 case 7: Out << "__builtin_ia32_cmpord"; break;
3105 if (ID == Intrinsic::x86_sse_cmp_ps || ID == Intrinsic::x86_sse2_cmp_pd)
3109 if (ID == Intrinsic::x86_sse_cmp_ss || ID == Intrinsic::x86_sse_cmp_ps)
3115 writeOperand(I.getArgOperand(0));
3117 writeOperand(I.getArgOperand(1));
3120 case Intrinsic::ppc_altivec_lvsl:
3122 printType(Out, I.getType());
3124 Out << "__builtin_altivec_lvsl(0, (void*)";
3125 writeOperand(I.getArgOperand(0));
3131 //This converts the llvm constraint string to something gcc is expecting.
3132 //TODO: work out platform independent constraints and factor those out
3133 // of the per target tables
3134 // handle multiple constraint codes
3135 std::string CWriter::InterpretASMConstraint(InlineAsm::ConstraintInfo& c) {
3136 assert(c.Codes.size() == 1 && "Too many asm constraint codes to handle");
3138 // Grab the translation table from MCAsmInfo if it exists.
3139 const MCAsmInfo *TargetAsm;
3140 std::string Triple = TheModule->getTargetTriple();
3142 Triple = llvm::sys::getHostTriple();
3145 if (const Target *Match = TargetRegistry::lookupTarget(Triple, E))
3146 TargetAsm = Match->createAsmInfo(Triple);
3150 const char *const *table = TargetAsm->getAsmCBE();
3152 // Search the translation table if it exists.
3153 for (int i = 0; table && table[i]; i += 2)
3154 if (c.Codes[0] == table[i]) {
3159 // Default is identity.
3164 //TODO: import logic from AsmPrinter.cpp
3165 static std::string gccifyAsm(std::string asmstr) {
3166 for (std::string::size_type i = 0; i != asmstr.size(); ++i)
3167 if (asmstr[i] == '\n')
3168 asmstr.replace(i, 1, "\\n");
3169 else if (asmstr[i] == '\t')
3170 asmstr.replace(i, 1, "\\t");
3171 else if (asmstr[i] == '$') {
3172 if (asmstr[i + 1] == '{') {
3173 std::string::size_type a = asmstr.find_first_of(':', i + 1);
3174 std::string::size_type b = asmstr.find_first_of('}', i + 1);
3175 std::string n = "%" +
3176 asmstr.substr(a + 1, b - a - 1) +
3177 asmstr.substr(i + 2, a - i - 2);
3178 asmstr.replace(i, b - i + 1, n);
3181 asmstr.replace(i, 1, "%");
3183 else if (asmstr[i] == '%')//grr
3184 { asmstr.replace(i, 1, "%%"); ++i;}
3189 //TODO: assumptions about what consume arguments from the call are likely wrong
3190 // handle communitivity
3191 void CWriter::visitInlineAsm(CallInst &CI) {
3192 InlineAsm* as = cast<InlineAsm>(CI.getCalledValue());
3193 std::vector<InlineAsm::ConstraintInfo> Constraints = as->ParseConstraints();
3195 std::vector<std::pair<Value*, int> > ResultVals;
3196 if (CI.getType() == Type::getVoidTy(CI.getContext()))
3198 else if (const StructType *ST = dyn_cast<StructType>(CI.getType())) {
3199 for (unsigned i = 0, e = ST->getNumElements(); i != e; ++i)
3200 ResultVals.push_back(std::make_pair(&CI, (int)i));
3202 ResultVals.push_back(std::make_pair(&CI, -1));
3205 // Fix up the asm string for gcc and emit it.
3206 Out << "__asm__ volatile (\"" << gccifyAsm(as->getAsmString()) << "\"\n";
3209 unsigned ValueCount = 0;
3210 bool IsFirst = true;
3212 // Convert over all the output constraints.
3213 for (std::vector<InlineAsm::ConstraintInfo>::iterator I = Constraints.begin(),
3214 E = Constraints.end(); I != E; ++I) {
3216 if (I->Type != InlineAsm::isOutput) {
3218 continue; // Ignore non-output constraints.
3221 assert(I->Codes.size() == 1 && "Too many asm constraint codes to handle");
3222 std::string C = InterpretASMConstraint(*I);
3223 if (C.empty()) continue;
3234 if (ValueCount < ResultVals.size()) {
3235 DestVal = ResultVals[ValueCount].first;
3236 DestValNo = ResultVals[ValueCount].second;
3238 DestVal = CI.getArgOperand(ValueCount-ResultVals.size());
3240 if (I->isEarlyClobber)
3243 Out << "\"=" << C << "\"(" << GetValueName(DestVal);
3244 if (DestValNo != -1)
3245 Out << ".field" << DestValNo; // Multiple retvals.
3251 // Convert over all the input constraints.
3255 for (std::vector<InlineAsm::ConstraintInfo>::iterator I = Constraints.begin(),
3256 E = Constraints.end(); I != E; ++I) {
3257 if (I->Type != InlineAsm::isInput) {
3259 continue; // Ignore non-input constraints.
3262 assert(I->Codes.size() == 1 && "Too many asm constraint codes to handle");
3263 std::string C = InterpretASMConstraint(*I);
3264 if (C.empty()) continue;
3271 assert(ValueCount >= ResultVals.size() && "Input can't refer to result");
3272 Value *SrcVal = CI.getArgOperand(ValueCount-ResultVals.size());
3274 Out << "\"" << C << "\"(";
3276 writeOperand(SrcVal);
3278 writeOperandDeref(SrcVal);
3282 // Convert over the clobber constraints.
3284 for (std::vector<InlineAsm::ConstraintInfo>::iterator I = Constraints.begin(),
3285 E = Constraints.end(); I != E; ++I) {
3286 if (I->Type != InlineAsm::isClobber)
3287 continue; // Ignore non-input constraints.
3289 assert(I->Codes.size() == 1 && "Too many asm constraint codes to handle");
3290 std::string C = InterpretASMConstraint(*I);
3291 if (C.empty()) continue;
3298 Out << '\"' << C << '"';
3304 void CWriter::visitAllocaInst(AllocaInst &I) {
3306 printType(Out, I.getType());
3307 Out << ") alloca(sizeof(";
3308 printType(Out, I.getType()->getElementType());
3310 if (I.isArrayAllocation()) {
3312 writeOperand(I.getOperand(0));
3317 void CWriter::printGEPExpression(Value *Ptr, gep_type_iterator I,
3318 gep_type_iterator E, bool Static) {
3320 // If there are no indices, just print out the pointer.
3326 // Find out if the last index is into a vector. If so, we have to print this
3327 // specially. Since vectors can't have elements of indexable type, only the
3328 // last index could possibly be of a vector element.
3329 const VectorType *LastIndexIsVector = 0;
3331 for (gep_type_iterator TmpI = I; TmpI != E; ++TmpI)
3332 LastIndexIsVector = dyn_cast<VectorType>(*TmpI);
3337 // If the last index is into a vector, we can't print it as &a[i][j] because
3338 // we can't index into a vector with j in GCC. Instead, emit this as
3339 // (((float*)&a[i])+j)
3340 if (LastIndexIsVector) {
3342 printType(Out, PointerType::getUnqual(LastIndexIsVector->getElementType()));
3348 // If the first index is 0 (very typical) we can do a number of
3349 // simplifications to clean up the code.
3350 Value *FirstOp = I.getOperand();
3351 if (!isa<Constant>(FirstOp) || !cast<Constant>(FirstOp)->isNullValue()) {
3352 // First index isn't simple, print it the hard way.
3355 ++I; // Skip the zero index.
3357 // Okay, emit the first operand. If Ptr is something that is already address
3358 // exposed, like a global, avoid emitting (&foo)[0], just emit foo instead.
3359 if (isAddressExposed(Ptr)) {
3360 writeOperandInternal(Ptr, Static);
3361 } else if (I != E && (*I)->isStructTy()) {
3362 // If we didn't already emit the first operand, see if we can print it as
3363 // P->f instead of "P[0].f"
3365 Out << "->field" << cast<ConstantInt>(I.getOperand())->getZExtValue();
3366 ++I; // eat the struct index as well.
3368 // Instead of emitting P[0][1], emit (*P)[1], which is more idiomatic.
3375 for (; I != E; ++I) {
3376 if ((*I)->isStructTy()) {
3377 Out << ".field" << cast<ConstantInt>(I.getOperand())->getZExtValue();
3378 } else if ((*I)->isArrayTy()) {
3380 writeOperandWithCast(I.getOperand(), Instruction::GetElementPtr);
3382 } else if (!(*I)->isVectorTy()) {
3384 writeOperandWithCast(I.getOperand(), Instruction::GetElementPtr);
3387 // If the last index is into a vector, then print it out as "+j)". This
3388 // works with the 'LastIndexIsVector' code above.
3389 if (isa<Constant>(I.getOperand()) &&
3390 cast<Constant>(I.getOperand())->isNullValue()) {
3391 Out << "))"; // avoid "+0".
3394 writeOperandWithCast(I.getOperand(), Instruction::GetElementPtr);
3402 void CWriter::writeMemoryAccess(Value *Operand, const Type *OperandType,
3403 bool IsVolatile, unsigned Alignment) {
3405 bool IsUnaligned = Alignment &&
3406 Alignment < TD->getABITypeAlignment(OperandType);
3410 if (IsVolatile || IsUnaligned) {
3413 Out << "struct __attribute__ ((packed, aligned(" << Alignment << "))) {";
3414 printType(Out, OperandType, false, IsUnaligned ? "data" : "volatile*");
3417 if (IsVolatile) Out << "volatile ";
3423 writeOperand(Operand);
3425 if (IsVolatile || IsUnaligned) {
3432 void CWriter::visitLoadInst(LoadInst &I) {
3433 writeMemoryAccess(I.getOperand(0), I.getType(), I.isVolatile(),
3438 void CWriter::visitStoreInst(StoreInst &I) {
3439 writeMemoryAccess(I.getPointerOperand(), I.getOperand(0)->getType(),
3440 I.isVolatile(), I.getAlignment());
3442 Value *Operand = I.getOperand(0);
3443 Constant *BitMask = 0;
3444 if (const IntegerType* ITy = dyn_cast<IntegerType>(Operand->getType()))
3445 if (!ITy->isPowerOf2ByteWidth())
3446 // We have a bit width that doesn't match an even power-of-2 byte
3447 // size. Consequently we must & the value with the type's bit mask
3448 BitMask = ConstantInt::get(ITy, ITy->getBitMask());
3451 writeOperand(Operand);
3454 printConstant(BitMask, false);
3459 void CWriter::visitGetElementPtrInst(GetElementPtrInst &I) {
3460 printGEPExpression(I.getPointerOperand(), gep_type_begin(I),
3461 gep_type_end(I), false);
3464 void CWriter::visitVAArgInst(VAArgInst &I) {
3465 Out << "va_arg(*(va_list*)";
3466 writeOperand(I.getOperand(0));
3468 printType(Out, I.getType());
3472 void CWriter::visitInsertElementInst(InsertElementInst &I) {
3473 const Type *EltTy = I.getType()->getElementType();
3474 writeOperand(I.getOperand(0));
3477 printType(Out, PointerType::getUnqual(EltTy));
3478 Out << ")(&" << GetValueName(&I) << "))[";
3479 writeOperand(I.getOperand(2));
3481 writeOperand(I.getOperand(1));
3485 void CWriter::visitExtractElementInst(ExtractElementInst &I) {
3486 // We know that our operand is not inlined.
3489 cast<VectorType>(I.getOperand(0)->getType())->getElementType();
3490 printType(Out, PointerType::getUnqual(EltTy));
3491 Out << ")(&" << GetValueName(I.getOperand(0)) << "))[";
3492 writeOperand(I.getOperand(1));
3496 void CWriter::visitShuffleVectorInst(ShuffleVectorInst &SVI) {
3498 printType(Out, SVI.getType());
3500 const VectorType *VT = SVI.getType();
3501 unsigned NumElts = VT->getNumElements();
3502 const Type *EltTy = VT->getElementType();
3504 for (unsigned i = 0; i != NumElts; ++i) {
3506 int SrcVal = SVI.getMaskValue(i);
3507 if ((unsigned)SrcVal >= NumElts*2) {
3508 Out << " 0/*undef*/ ";
3510 Value *Op = SVI.getOperand((unsigned)SrcVal >= NumElts);
3511 if (isa<Instruction>(Op)) {
3512 // Do an extractelement of this value from the appropriate input.
3514 printType(Out, PointerType::getUnqual(EltTy));
3515 Out << ")(&" << GetValueName(Op)
3516 << "))[" << (SrcVal & (NumElts-1)) << "]";
3517 } else if (isa<ConstantAggregateZero>(Op) || isa<UndefValue>(Op)) {
3520 printConstant(cast<ConstantVector>(Op)->getOperand(SrcVal &
3529 void CWriter::visitInsertValueInst(InsertValueInst &IVI) {
3530 // Start by copying the entire aggregate value into the result variable.
3531 writeOperand(IVI.getOperand(0));
3534 // Then do the insert to update the field.
3535 Out << GetValueName(&IVI);
3536 for (const unsigned *b = IVI.idx_begin(), *i = b, *e = IVI.idx_end();
3538 const Type *IndexedTy =
3539 ExtractValueInst::getIndexedType(IVI.getOperand(0)->getType(), b, i+1);
3540 if (IndexedTy->isArrayTy())
3541 Out << ".array[" << *i << "]";
3543 Out << ".field" << *i;
3546 writeOperand(IVI.getOperand(1));
3549 void CWriter::visitExtractValueInst(ExtractValueInst &EVI) {
3551 if (isa<UndefValue>(EVI.getOperand(0))) {
3553 printType(Out, EVI.getType());
3554 Out << ") 0/*UNDEF*/";
3556 Out << GetValueName(EVI.getOperand(0));
3557 for (const unsigned *b = EVI.idx_begin(), *i = b, *e = EVI.idx_end();
3559 const Type *IndexedTy =
3560 ExtractValueInst::getIndexedType(EVI.getOperand(0)->getType(), b, i+1);
3561 if (IndexedTy->isArrayTy())
3562 Out << ".array[" << *i << "]";
3564 Out << ".field" << *i;
3570 //===----------------------------------------------------------------------===//
3571 // External Interface declaration
3572 //===----------------------------------------------------------------------===//
3574 bool CTargetMachine::addPassesToEmitFile(PassManagerBase &PM,
3575 formatted_raw_ostream &o,
3576 CodeGenFileType FileType,
3577 CodeGenOpt::Level OptLevel,
3578 bool DisableVerify) {
3579 if (FileType != TargetMachine::CGFT_AssemblyFile) return true;
3581 PM.add(createGCLoweringPass());
3582 PM.add(createLowerInvokePass());
3583 PM.add(createCFGSimplificationPass()); // clean up after lower invoke.
3584 PM.add(new CBackendNameAllUsedStructsAndMergeFunctions());
3585 PM.add(new CWriter(o));
3586 PM.add(createGCInfoDeleter());