1 //===-- CBackend.cpp - Library for converting LLVM code to C --------------===//
3 // The LLVM Compiler Infrastructure
5 // This file is distributed under the University of Illinois Open Source
6 // License. See LICENSE.TXT for details.
8 //===----------------------------------------------------------------------===//
10 // This library converts LLVM code to C code, compilable by GCC and other C
13 //===----------------------------------------------------------------------===//
15 #include "CTargetMachine.h"
16 #include "llvm/CallingConv.h"
17 #include "llvm/Constants.h"
18 #include "llvm/DerivedTypes.h"
19 #include "llvm/Module.h"
20 #include "llvm/Instructions.h"
21 #include "llvm/Pass.h"
22 #include "llvm/PassManager.h"
23 #include "llvm/TypeSymbolTable.h"
24 #include "llvm/Intrinsics.h"
25 #include "llvm/IntrinsicInst.h"
26 #include "llvm/InlineAsm.h"
27 #include "llvm/Analysis/ConstantsScanner.h"
28 #include "llvm/Analysis/FindUsedTypes.h"
29 #include "llvm/Analysis/LoopInfo.h"
30 #include "llvm/CodeGen/Passes.h"
31 #include "llvm/CodeGen/IntrinsicLowering.h"
32 #include "llvm/Transforms/Scalar.h"
33 #include "llvm/Target/TargetMachineRegistry.h"
34 #include "llvm/Target/TargetAsmInfo.h"
35 #include "llvm/Target/TargetData.h"
36 #include "llvm/Support/CallSite.h"
37 #include "llvm/Support/CFG.h"
38 #include "llvm/Support/GetElementPtrTypeIterator.h"
39 #include "llvm/Support/InstVisitor.h"
40 #include "llvm/Support/Mangler.h"
41 #include "llvm/Support/MathExtras.h"
42 #include "llvm/ADT/StringExtras.h"
43 #include "llvm/ADT/STLExtras.h"
44 #include "llvm/Support/MathExtras.h"
45 #include "llvm/Config/config.h"
50 // Register the target.
51 static RegisterTarget<CTargetMachine> X("c", " C backend");
54 /// CBackendNameAllUsedStructsAndMergeFunctions - This pass inserts names for
55 /// any unnamed structure types that are used by the program, and merges
56 /// external functions with the same name.
58 class CBackendNameAllUsedStructsAndMergeFunctions : public ModulePass {
61 CBackendNameAllUsedStructsAndMergeFunctions()
62 : ModulePass((intptr_t)&ID) {}
63 void getAnalysisUsage(AnalysisUsage &AU) const {
64 AU.addRequired<FindUsedTypes>();
67 virtual const char *getPassName() const {
68 return "C backend type canonicalizer";
71 virtual bool runOnModule(Module &M);
74 char CBackendNameAllUsedStructsAndMergeFunctions::ID = 0;
76 /// CWriter - This class is the main chunk of code that converts an LLVM
77 /// module to a C translation unit.
78 class CWriter : public FunctionPass, public InstVisitor<CWriter> {
80 IntrinsicLowering *IL;
83 const Module *TheModule;
84 const TargetAsmInfo* TAsm;
86 std::map<const Type *, std::string> TypeNames;
87 std::map<const ConstantFP *, unsigned> FPConstantMap;
88 std::set<Function*> intrinsicPrototypesAlreadyGenerated;
89 std::set<const Argument*> ByValParams;
93 explicit CWriter(std::ostream &o)
94 : FunctionPass((intptr_t)&ID), Out(o), IL(0), Mang(0), LI(0),
95 TheModule(0), TAsm(0), TD(0) {}
97 virtual const char *getPassName() const { return "C backend"; }
99 void getAnalysisUsage(AnalysisUsage &AU) const {
100 AU.addRequired<LoopInfo>();
101 AU.setPreservesAll();
104 virtual bool doInitialization(Module &M);
106 bool runOnFunction(Function &F) {
107 LI = &getAnalysis<LoopInfo>();
109 // Get rid of intrinsics we can't handle.
112 // Output all floating point constants that cannot be printed accurately.
113 printFloatingPointConstants(F);
119 virtual bool doFinalization(Module &M) {
122 FPConstantMap.clear();
125 intrinsicPrototypesAlreadyGenerated.clear();
129 std::ostream &printType(std::ostream &Out, const Type *Ty,
130 bool isSigned = false,
131 const std::string &VariableName = "",
132 bool IgnoreName = false,
133 const PAListPtr &PAL = PAListPtr());
134 std::ostream &printSimpleType(std::ostream &Out, const Type *Ty,
136 const std::string &NameSoFar = "");
138 void printStructReturnPointerFunctionType(std::ostream &Out,
139 const PAListPtr &PAL,
140 const PointerType *Ty);
142 /// writeOperandDeref - Print the result of dereferencing the specified
143 /// operand with '*'. This is equivalent to printing '*' then using
144 /// writeOperand, but avoids excess syntax in some cases.
145 void writeOperandDeref(Value *Operand) {
146 if (isAddressExposed(Operand)) {
147 // Already something with an address exposed.
148 writeOperandInternal(Operand);
151 writeOperand(Operand);
156 void writeOperand(Value *Operand);
157 void writeOperandRaw(Value *Operand);
158 void writeInstComputationInline(Instruction &I);
159 void writeOperandInternal(Value *Operand);
160 void writeOperandWithCast(Value* Operand, unsigned Opcode);
161 void writeOperandWithCast(Value* Operand, const ICmpInst &I);
162 bool writeInstructionCast(const Instruction &I);
164 void writeMemoryAccess(Value *Operand, const Type *OperandType,
165 bool IsVolatile, unsigned Alignment);
168 std::string InterpretASMConstraint(InlineAsm::ConstraintInfo& c);
170 void lowerIntrinsics(Function &F);
172 void printModule(Module *M);
173 void printModuleTypes(const TypeSymbolTable &ST);
174 void printContainedStructs(const Type *Ty, std::set<const Type *> &);
175 void printFloatingPointConstants(Function &F);
176 void printFunctionSignature(const Function *F, bool Prototype);
178 void printFunction(Function &);
179 void printBasicBlock(BasicBlock *BB);
180 void printLoop(Loop *L);
182 void printCast(unsigned opcode, const Type *SrcTy, const Type *DstTy);
183 void printConstant(Constant *CPV);
184 void printConstantWithCast(Constant *CPV, unsigned Opcode);
185 bool printConstExprCast(const ConstantExpr *CE);
186 void printConstantArray(ConstantArray *CPA);
187 void printConstantVector(ConstantVector *CV);
189 /// isAddressExposed - Return true if the specified value's name needs to
190 /// have its address taken in order to get a C value of the correct type.
191 /// This happens for global variables, byval parameters, and direct allocas.
192 bool isAddressExposed(const Value *V) const {
193 if (const Argument *A = dyn_cast<Argument>(V))
194 return ByValParams.count(A);
195 return isa<GlobalVariable>(V) || isDirectAlloca(V);
198 // isInlinableInst - Attempt to inline instructions into their uses to build
199 // trees as much as possible. To do this, we have to consistently decide
200 // what is acceptable to inline, so that variable declarations don't get
201 // printed and an extra copy of the expr is not emitted.
203 static bool isInlinableInst(const Instruction &I) {
204 // Always inline cmp instructions, even if they are shared by multiple
205 // expressions. GCC generates horrible code if we don't.
209 // Must be an expression, must be used exactly once. If it is dead, we
210 // emit it inline where it would go.
211 if (I.getType() == Type::VoidTy || !I.hasOneUse() ||
212 isa<TerminatorInst>(I) || isa<CallInst>(I) || isa<PHINode>(I) ||
213 isa<LoadInst>(I) || isa<VAArgInst>(I) || isa<InsertElementInst>(I) ||
214 isa<InsertValueInst>(I))
215 // Don't inline a load across a store or other bad things!
218 // Must not be used in inline asm, extractelement, or shufflevector.
220 const Instruction &User = cast<Instruction>(*I.use_back());
221 if (isInlineAsm(User) || isa<ExtractElementInst>(User) ||
222 isa<ShuffleVectorInst>(User))
226 // Only inline instruction it if it's use is in the same BB as the inst.
227 return I.getParent() == cast<Instruction>(I.use_back())->getParent();
230 // isDirectAlloca - Define fixed sized allocas in the entry block as direct
231 // variables which are accessed with the & operator. This causes GCC to
232 // generate significantly better code than to emit alloca calls directly.
234 static const AllocaInst *isDirectAlloca(const Value *V) {
235 const AllocaInst *AI = dyn_cast<AllocaInst>(V);
236 if (!AI) return false;
237 if (AI->isArrayAllocation())
238 return 0; // FIXME: we can also inline fixed size array allocas!
239 if (AI->getParent() != &AI->getParent()->getParent()->getEntryBlock())
244 // isInlineAsm - Check if the instruction is a call to an inline asm chunk
245 static bool isInlineAsm(const Instruction& I) {
246 if (isa<CallInst>(&I) && isa<InlineAsm>(I.getOperand(0)))
251 // Instruction visitation functions
252 friend class InstVisitor<CWriter>;
254 void visitReturnInst(ReturnInst &I);
255 void visitBranchInst(BranchInst &I);
256 void visitSwitchInst(SwitchInst &I);
257 void visitInvokeInst(InvokeInst &I) {
258 assert(0 && "Lowerinvoke pass didn't work!");
261 void visitUnwindInst(UnwindInst &I) {
262 assert(0 && "Lowerinvoke pass didn't work!");
264 void visitUnreachableInst(UnreachableInst &I);
266 void visitPHINode(PHINode &I);
267 void visitBinaryOperator(Instruction &I);
268 void visitICmpInst(ICmpInst &I);
269 void visitFCmpInst(FCmpInst &I);
271 void visitCastInst (CastInst &I);
272 void visitSelectInst(SelectInst &I);
273 void visitCallInst (CallInst &I);
274 void visitInlineAsm(CallInst &I);
275 bool visitBuiltinCall(CallInst &I, Intrinsic::ID ID, bool &WroteCallee);
277 void visitMallocInst(MallocInst &I);
278 void visitAllocaInst(AllocaInst &I);
279 void visitFreeInst (FreeInst &I);
280 void visitLoadInst (LoadInst &I);
281 void visitStoreInst (StoreInst &I);
282 void visitGetElementPtrInst(GetElementPtrInst &I);
283 void visitVAArgInst (VAArgInst &I);
285 void visitInsertElementInst(InsertElementInst &I);
286 void visitExtractElementInst(ExtractElementInst &I);
287 void visitShuffleVectorInst(ShuffleVectorInst &SVI);
289 void visitInsertValueInst(InsertValueInst &I);
290 void visitExtractValueInst(ExtractValueInst &I);
292 void visitInstruction(Instruction &I) {
293 cerr << "C Writer does not know about " << I;
297 void outputLValue(Instruction *I) {
298 Out << " " << GetValueName(I) << " = ";
301 bool isGotoCodeNecessary(BasicBlock *From, BasicBlock *To);
302 void printPHICopiesForSuccessor(BasicBlock *CurBlock,
303 BasicBlock *Successor, unsigned Indent);
304 void printBranchToBlock(BasicBlock *CurBlock, BasicBlock *SuccBlock,
306 void printGEPExpression(Value *Ptr, gep_type_iterator I,
307 gep_type_iterator E);
309 std::string GetValueName(const Value *Operand);
313 char CWriter::ID = 0;
315 /// This method inserts names for any unnamed structure types that are used by
316 /// the program, and removes names from structure types that are not used by the
319 bool CBackendNameAllUsedStructsAndMergeFunctions::runOnModule(Module &M) {
320 // Get a set of types that are used by the program...
321 std::set<const Type *> UT = getAnalysis<FindUsedTypes>().getTypes();
323 // Loop over the module symbol table, removing types from UT that are
324 // already named, and removing names for types that are not used.
326 TypeSymbolTable &TST = M.getTypeSymbolTable();
327 for (TypeSymbolTable::iterator TI = TST.begin(), TE = TST.end();
329 TypeSymbolTable::iterator I = TI++;
331 // If this isn't a struct or array type, remove it from our set of types
332 // to name. This simplifies emission later.
333 if (!isa<StructType>(I->second) && !isa<OpaqueType>(I->second) &&
334 !isa<ArrayType>(I->second)) {
337 // If this is not used, remove it from the symbol table.
338 std::set<const Type *>::iterator UTI = UT.find(I->second);
342 UT.erase(UTI); // Only keep one name for this type.
346 // UT now contains types that are not named. Loop over it, naming
349 bool Changed = false;
350 unsigned RenameCounter = 0;
351 for (std::set<const Type *>::const_iterator I = UT.begin(), E = UT.end();
353 if (isa<StructType>(*I) || isa<ArrayType>(*I)) {
354 while (M.addTypeName("unnamed"+utostr(RenameCounter), *I))
360 // Loop over all external functions and globals. If we have two with
361 // identical names, merge them.
362 // FIXME: This code should disappear when we don't allow values with the same
363 // names when they have different types!
364 std::map<std::string, GlobalValue*> ExtSymbols;
365 for (Module::iterator I = M.begin(), E = M.end(); I != E;) {
367 if (GV->isDeclaration() && GV->hasName()) {
368 std::pair<std::map<std::string, GlobalValue*>::iterator, bool> X
369 = ExtSymbols.insert(std::make_pair(GV->getName(), GV));
371 // Found a conflict, replace this global with the previous one.
372 GlobalValue *OldGV = X.first->second;
373 GV->replaceAllUsesWith(ConstantExpr::getBitCast(OldGV, GV->getType()));
374 GV->eraseFromParent();
379 // Do the same for globals.
380 for (Module::global_iterator I = M.global_begin(), E = M.global_end();
382 GlobalVariable *GV = I++;
383 if (GV->isDeclaration() && GV->hasName()) {
384 std::pair<std::map<std::string, GlobalValue*>::iterator, bool> X
385 = ExtSymbols.insert(std::make_pair(GV->getName(), GV));
387 // Found a conflict, replace this global with the previous one.
388 GlobalValue *OldGV = X.first->second;
389 GV->replaceAllUsesWith(ConstantExpr::getBitCast(OldGV, GV->getType()));
390 GV->eraseFromParent();
399 /// printStructReturnPointerFunctionType - This is like printType for a struct
400 /// return type, except, instead of printing the type as void (*)(Struct*, ...)
401 /// print it as "Struct (*)(...)", for struct return functions.
402 void CWriter::printStructReturnPointerFunctionType(std::ostream &Out,
403 const PAListPtr &PAL,
404 const PointerType *TheTy) {
405 const FunctionType *FTy = cast<FunctionType>(TheTy->getElementType());
406 std::stringstream FunctionInnards;
407 FunctionInnards << " (*) (";
408 bool PrintedType = false;
410 FunctionType::param_iterator I = FTy->param_begin(), E = FTy->param_end();
411 const Type *RetTy = cast<PointerType>(I->get())->getElementType();
413 for (++I, ++Idx; I != E; ++I, ++Idx) {
415 FunctionInnards << ", ";
416 const Type *ArgTy = *I;
417 if (PAL.paramHasAttr(Idx, ParamAttr::ByVal)) {
418 assert(isa<PointerType>(ArgTy));
419 ArgTy = cast<PointerType>(ArgTy)->getElementType();
421 printType(FunctionInnards, ArgTy,
422 /*isSigned=*/PAL.paramHasAttr(Idx, ParamAttr::SExt), "");
425 if (FTy->isVarArg()) {
427 FunctionInnards << ", ...";
428 } else if (!PrintedType) {
429 FunctionInnards << "void";
431 FunctionInnards << ')';
432 std::string tstr = FunctionInnards.str();
433 printType(Out, RetTy,
434 /*isSigned=*/PAL.paramHasAttr(0, ParamAttr::SExt), tstr);
438 CWriter::printSimpleType(std::ostream &Out, const Type *Ty, bool isSigned,
439 const std::string &NameSoFar) {
440 assert((Ty->isPrimitiveType() || Ty->isInteger() || isa<VectorType>(Ty)) &&
441 "Invalid type for printSimpleType");
442 switch (Ty->getTypeID()) {
443 case Type::VoidTyID: return Out << "void " << NameSoFar;
444 case Type::IntegerTyID: {
445 unsigned NumBits = cast<IntegerType>(Ty)->getBitWidth();
447 return Out << "bool " << NameSoFar;
448 else if (NumBits <= 8)
449 return Out << (isSigned?"signed":"unsigned") << " char " << NameSoFar;
450 else if (NumBits <= 16)
451 return Out << (isSigned?"signed":"unsigned") << " short " << NameSoFar;
452 else if (NumBits <= 32)
453 return Out << (isSigned?"signed":"unsigned") << " int " << NameSoFar;
454 else if (NumBits <= 64)
455 return Out << (isSigned?"signed":"unsigned") << " long long "<< NameSoFar;
457 assert(NumBits <= 128 && "Bit widths > 128 not implemented yet");
458 return Out << (isSigned?"llvmInt128":"llvmUInt128") << " " << NameSoFar;
461 case Type::FloatTyID: return Out << "float " << NameSoFar;
462 case Type::DoubleTyID: return Out << "double " << NameSoFar;
463 // Lacking emulation of FP80 on PPC, etc., we assume whichever of these is
464 // present matches host 'long double'.
465 case Type::X86_FP80TyID:
466 case Type::PPC_FP128TyID:
467 case Type::FP128TyID: return Out << "long double " << NameSoFar;
469 case Type::VectorTyID: {
470 const VectorType *VTy = cast<VectorType>(Ty);
471 return printSimpleType(Out, VTy->getElementType(), isSigned,
472 " __attribute__((vector_size(" +
473 utostr(TD->getABITypeSize(VTy)) + " ))) " + NameSoFar);
477 cerr << "Unknown primitive type: " << *Ty << "\n";
482 // Pass the Type* and the variable name and this prints out the variable
485 std::ostream &CWriter::printType(std::ostream &Out, const Type *Ty,
486 bool isSigned, const std::string &NameSoFar,
487 bool IgnoreName, const PAListPtr &PAL) {
488 if (Ty->isPrimitiveType() || Ty->isInteger() || isa<VectorType>(Ty)) {
489 printSimpleType(Out, Ty, isSigned, NameSoFar);
493 // Check to see if the type is named.
494 if (!IgnoreName || isa<OpaqueType>(Ty)) {
495 std::map<const Type *, std::string>::iterator I = TypeNames.find(Ty);
496 if (I != TypeNames.end()) return Out << I->second << ' ' << NameSoFar;
499 switch (Ty->getTypeID()) {
500 case Type::FunctionTyID: {
501 const FunctionType *FTy = cast<FunctionType>(Ty);
502 std::stringstream FunctionInnards;
503 FunctionInnards << " (" << NameSoFar << ") (";
505 for (FunctionType::param_iterator I = FTy->param_begin(),
506 E = FTy->param_end(); I != E; ++I) {
507 const Type *ArgTy = *I;
508 if (PAL.paramHasAttr(Idx, ParamAttr::ByVal)) {
509 assert(isa<PointerType>(ArgTy));
510 ArgTy = cast<PointerType>(ArgTy)->getElementType();
512 if (I != FTy->param_begin())
513 FunctionInnards << ", ";
514 printType(FunctionInnards, ArgTy,
515 /*isSigned=*/PAL.paramHasAttr(Idx, ParamAttr::SExt), "");
518 if (FTy->isVarArg()) {
519 if (FTy->getNumParams())
520 FunctionInnards << ", ...";
521 } else if (!FTy->getNumParams()) {
522 FunctionInnards << "void";
524 FunctionInnards << ')';
525 std::string tstr = FunctionInnards.str();
526 printType(Out, FTy->getReturnType(),
527 /*isSigned=*/PAL.paramHasAttr(0, ParamAttr::SExt), tstr);
530 case Type::StructTyID: {
531 const StructType *STy = cast<StructType>(Ty);
532 Out << NameSoFar + " {\n";
534 for (StructType::element_iterator I = STy->element_begin(),
535 E = STy->element_end(); I != E; ++I) {
537 printType(Out, *I, false, "field" + utostr(Idx++));
542 Out << " __attribute__ ((packed))";
546 case Type::PointerTyID: {
547 const PointerType *PTy = cast<PointerType>(Ty);
548 std::string ptrName = "*" + NameSoFar;
550 if (isa<ArrayType>(PTy->getElementType()) ||
551 isa<VectorType>(PTy->getElementType()))
552 ptrName = "(" + ptrName + ")";
555 // Must be a function ptr cast!
556 return printType(Out, PTy->getElementType(), false, ptrName, true, PAL);
557 return printType(Out, PTy->getElementType(), false, ptrName);
560 case Type::ArrayTyID: {
561 const ArrayType *ATy = cast<ArrayType>(Ty);
562 unsigned NumElements = ATy->getNumElements();
563 if (NumElements == 0) NumElements = 1;
564 // Arrays are wrapped in structs to allow them to have normal
565 // value semantics (avoiding the array "decay").
566 Out << NameSoFar << " { ";
567 printType(Out, ATy->getElementType(), false,
568 "array[" + utostr(NumElements) + "]");
572 case Type::OpaqueTyID: {
573 static int Count = 0;
574 std::string TyName = "struct opaque_" + itostr(Count++);
575 assert(TypeNames.find(Ty) == TypeNames.end());
576 TypeNames[Ty] = TyName;
577 return Out << TyName << ' ' << NameSoFar;
580 assert(0 && "Unhandled case in getTypeProps!");
587 void CWriter::printConstantArray(ConstantArray *CPA) {
589 // As a special case, print the array as a string if it is an array of
590 // ubytes or an array of sbytes with positive values.
592 const Type *ETy = CPA->getType()->getElementType();
593 bool isString = (ETy == Type::Int8Ty || ETy == Type::Int8Ty);
595 // Make sure the last character is a null char, as automatically added by C
596 if (isString && (CPA->getNumOperands() == 0 ||
597 !cast<Constant>(*(CPA->op_end()-1))->isNullValue()))
602 // Keep track of whether the last number was a hexadecimal escape
603 bool LastWasHex = false;
605 // Do not include the last character, which we know is null
606 for (unsigned i = 0, e = CPA->getNumOperands()-1; i != e; ++i) {
607 unsigned char C = cast<ConstantInt>(CPA->getOperand(i))->getZExtValue();
609 // Print it out literally if it is a printable character. The only thing
610 // to be careful about is when the last letter output was a hex escape
611 // code, in which case we have to be careful not to print out hex digits
612 // explicitly (the C compiler thinks it is a continuation of the previous
613 // character, sheesh...)
615 if (isprint(C) && (!LastWasHex || !isxdigit(C))) {
617 if (C == '"' || C == '\\')
624 case '\n': Out << "\\n"; break;
625 case '\t': Out << "\\t"; break;
626 case '\r': Out << "\\r"; break;
627 case '\v': Out << "\\v"; break;
628 case '\a': Out << "\\a"; break;
629 case '\"': Out << "\\\""; break;
630 case '\'': Out << "\\\'"; break;
633 Out << (char)(( C/16 < 10) ? ( C/16 +'0') : ( C/16 -10+'A'));
634 Out << (char)(((C&15) < 10) ? ((C&15)+'0') : ((C&15)-10+'A'));
643 if (CPA->getNumOperands()) {
645 printConstant(cast<Constant>(CPA->getOperand(0)));
646 for (unsigned i = 1, e = CPA->getNumOperands(); i != e; ++i) {
648 printConstant(cast<Constant>(CPA->getOperand(i)));
655 void CWriter::printConstantVector(ConstantVector *CP) {
657 if (CP->getNumOperands()) {
659 printConstant(cast<Constant>(CP->getOperand(0)));
660 for (unsigned i = 1, e = CP->getNumOperands(); i != e; ++i) {
662 printConstant(cast<Constant>(CP->getOperand(i)));
668 // isFPCSafeToPrint - Returns true if we may assume that CFP may be written out
669 // textually as a double (rather than as a reference to a stack-allocated
670 // variable). We decide this by converting CFP to a string and back into a
671 // double, and then checking whether the conversion results in a bit-equal
672 // double to the original value of CFP. This depends on us and the target C
673 // compiler agreeing on the conversion process (which is pretty likely since we
674 // only deal in IEEE FP).
676 static bool isFPCSafeToPrint(const ConstantFP *CFP) {
677 // Do long doubles in hex for now.
678 if (CFP->getType()!=Type::FloatTy && CFP->getType()!=Type::DoubleTy)
680 APFloat APF = APFloat(CFP->getValueAPF()); // copy
681 if (CFP->getType()==Type::FloatTy)
682 APF.convert(APFloat::IEEEdouble, APFloat::rmNearestTiesToEven);
683 #if HAVE_PRINTF_A && ENABLE_CBE_PRINTF_A
685 sprintf(Buffer, "%a", APF.convertToDouble());
686 if (!strncmp(Buffer, "0x", 2) ||
687 !strncmp(Buffer, "-0x", 3) ||
688 !strncmp(Buffer, "+0x", 3))
689 return APF.bitwiseIsEqual(APFloat(atof(Buffer)));
692 std::string StrVal = ftostr(APF);
694 while (StrVal[0] == ' ')
695 StrVal.erase(StrVal.begin());
697 // Check to make sure that the stringized number is not some string like "Inf"
698 // or NaN. Check that the string matches the "[-+]?[0-9]" regex.
699 if ((StrVal[0] >= '0' && StrVal[0] <= '9') ||
700 ((StrVal[0] == '-' || StrVal[0] == '+') &&
701 (StrVal[1] >= '0' && StrVal[1] <= '9')))
702 // Reparse stringized version!
703 return APF.bitwiseIsEqual(APFloat(atof(StrVal.c_str())));
708 /// Print out the casting for a cast operation. This does the double casting
709 /// necessary for conversion to the destination type, if necessary.
710 /// @brief Print a cast
711 void CWriter::printCast(unsigned opc, const Type *SrcTy, const Type *DstTy) {
712 // Print the destination type cast
714 case Instruction::UIToFP:
715 case Instruction::SIToFP:
716 case Instruction::IntToPtr:
717 case Instruction::Trunc:
718 case Instruction::BitCast:
719 case Instruction::FPExt:
720 case Instruction::FPTrunc: // For these the DstTy sign doesn't matter
722 printType(Out, DstTy);
725 case Instruction::ZExt:
726 case Instruction::PtrToInt:
727 case Instruction::FPToUI: // For these, make sure we get an unsigned dest
729 printSimpleType(Out, DstTy, false);
732 case Instruction::SExt:
733 case Instruction::FPToSI: // For these, make sure we get a signed dest
735 printSimpleType(Out, DstTy, true);
739 assert(0 && "Invalid cast opcode");
742 // Print the source type cast
744 case Instruction::UIToFP:
745 case Instruction::ZExt:
747 printSimpleType(Out, SrcTy, false);
750 case Instruction::SIToFP:
751 case Instruction::SExt:
753 printSimpleType(Out, SrcTy, true);
756 case Instruction::IntToPtr:
757 case Instruction::PtrToInt:
758 // Avoid "cast to pointer from integer of different size" warnings
759 Out << "(unsigned long)";
761 case Instruction::Trunc:
762 case Instruction::BitCast:
763 case Instruction::FPExt:
764 case Instruction::FPTrunc:
765 case Instruction::FPToSI:
766 case Instruction::FPToUI:
767 break; // These don't need a source cast.
769 assert(0 && "Invalid cast opcode");
774 // printConstant - The LLVM Constant to C Constant converter.
775 void CWriter::printConstant(Constant *CPV) {
776 if (const ConstantExpr *CE = dyn_cast<ConstantExpr>(CPV)) {
777 switch (CE->getOpcode()) {
778 case Instruction::Trunc:
779 case Instruction::ZExt:
780 case Instruction::SExt:
781 case Instruction::FPTrunc:
782 case Instruction::FPExt:
783 case Instruction::UIToFP:
784 case Instruction::SIToFP:
785 case Instruction::FPToUI:
786 case Instruction::FPToSI:
787 case Instruction::PtrToInt:
788 case Instruction::IntToPtr:
789 case Instruction::BitCast:
791 printCast(CE->getOpcode(), CE->getOperand(0)->getType(), CE->getType());
792 if (CE->getOpcode() == Instruction::SExt &&
793 CE->getOperand(0)->getType() == Type::Int1Ty) {
794 // Make sure we really sext from bool here by subtracting from 0
797 printConstant(CE->getOperand(0));
798 if (CE->getType() == Type::Int1Ty &&
799 (CE->getOpcode() == Instruction::Trunc ||
800 CE->getOpcode() == Instruction::FPToUI ||
801 CE->getOpcode() == Instruction::FPToSI ||
802 CE->getOpcode() == Instruction::PtrToInt)) {
803 // Make sure we really truncate to bool here by anding with 1
809 case Instruction::GetElementPtr:
811 printGEPExpression(CE->getOperand(0), gep_type_begin(CPV),
815 case Instruction::Select:
817 printConstant(CE->getOperand(0));
819 printConstant(CE->getOperand(1));
821 printConstant(CE->getOperand(2));
824 case Instruction::Add:
825 case Instruction::Sub:
826 case Instruction::Mul:
827 case Instruction::SDiv:
828 case Instruction::UDiv:
829 case Instruction::FDiv:
830 case Instruction::URem:
831 case Instruction::SRem:
832 case Instruction::FRem:
833 case Instruction::And:
834 case Instruction::Or:
835 case Instruction::Xor:
836 case Instruction::ICmp:
837 case Instruction::Shl:
838 case Instruction::LShr:
839 case Instruction::AShr:
842 bool NeedsClosingParens = printConstExprCast(CE);
843 printConstantWithCast(CE->getOperand(0), CE->getOpcode());
844 switch (CE->getOpcode()) {
845 case Instruction::Add: Out << " + "; break;
846 case Instruction::Sub: Out << " - "; break;
847 case Instruction::Mul: Out << " * "; break;
848 case Instruction::URem:
849 case Instruction::SRem:
850 case Instruction::FRem: Out << " % "; break;
851 case Instruction::UDiv:
852 case Instruction::SDiv:
853 case Instruction::FDiv: Out << " / "; break;
854 case Instruction::And: Out << " & "; break;
855 case Instruction::Or: Out << " | "; break;
856 case Instruction::Xor: Out << " ^ "; break;
857 case Instruction::Shl: Out << " << "; break;
858 case Instruction::LShr:
859 case Instruction::AShr: Out << " >> "; break;
860 case Instruction::ICmp:
861 switch (CE->getPredicate()) {
862 case ICmpInst::ICMP_EQ: Out << " == "; break;
863 case ICmpInst::ICMP_NE: Out << " != "; break;
864 case ICmpInst::ICMP_SLT:
865 case ICmpInst::ICMP_ULT: Out << " < "; break;
866 case ICmpInst::ICMP_SLE:
867 case ICmpInst::ICMP_ULE: Out << " <= "; break;
868 case ICmpInst::ICMP_SGT:
869 case ICmpInst::ICMP_UGT: Out << " > "; break;
870 case ICmpInst::ICMP_SGE:
871 case ICmpInst::ICMP_UGE: Out << " >= "; break;
872 default: assert(0 && "Illegal ICmp predicate");
875 default: assert(0 && "Illegal opcode here!");
877 printConstantWithCast(CE->getOperand(1), CE->getOpcode());
878 if (NeedsClosingParens)
883 case Instruction::FCmp: {
885 bool NeedsClosingParens = printConstExprCast(CE);
886 if (CE->getPredicate() == FCmpInst::FCMP_FALSE)
888 else if (CE->getPredicate() == FCmpInst::FCMP_TRUE)
892 switch (CE->getPredicate()) {
893 default: assert(0 && "Illegal FCmp predicate");
894 case FCmpInst::FCMP_ORD: op = "ord"; break;
895 case FCmpInst::FCMP_UNO: op = "uno"; break;
896 case FCmpInst::FCMP_UEQ: op = "ueq"; break;
897 case FCmpInst::FCMP_UNE: op = "une"; break;
898 case FCmpInst::FCMP_ULT: op = "ult"; break;
899 case FCmpInst::FCMP_ULE: op = "ule"; break;
900 case FCmpInst::FCMP_UGT: op = "ugt"; break;
901 case FCmpInst::FCMP_UGE: op = "uge"; break;
902 case FCmpInst::FCMP_OEQ: op = "oeq"; break;
903 case FCmpInst::FCMP_ONE: op = "one"; break;
904 case FCmpInst::FCMP_OLT: op = "olt"; break;
905 case FCmpInst::FCMP_OLE: op = "ole"; break;
906 case FCmpInst::FCMP_OGT: op = "ogt"; break;
907 case FCmpInst::FCMP_OGE: op = "oge"; break;
909 Out << "llvm_fcmp_" << op << "(";
910 printConstantWithCast(CE->getOperand(0), CE->getOpcode());
912 printConstantWithCast(CE->getOperand(1), CE->getOpcode());
915 if (NeedsClosingParens)
921 cerr << "CWriter Error: Unhandled constant expression: "
925 } else if (isa<UndefValue>(CPV) && CPV->getType()->isSingleValueType()) {
927 printType(Out, CPV->getType()); // sign doesn't matter
929 if (!isa<VectorType>(CPV->getType())) {
937 if (ConstantInt *CI = dyn_cast<ConstantInt>(CPV)) {
938 const Type* Ty = CI->getType();
939 if (Ty == Type::Int1Ty)
940 Out << (CI->getZExtValue() ? '1' : '0');
941 else if (Ty == Type::Int32Ty)
942 Out << CI->getZExtValue() << 'u';
943 else if (Ty->getPrimitiveSizeInBits() > 32)
944 Out << CI->getZExtValue() << "ull";
947 printSimpleType(Out, Ty, false) << ')';
948 if (CI->isMinValue(true))
949 Out << CI->getZExtValue() << 'u';
951 Out << CI->getSExtValue();
957 switch (CPV->getType()->getTypeID()) {
958 case Type::FloatTyID:
959 case Type::DoubleTyID:
960 case Type::X86_FP80TyID:
961 case Type::PPC_FP128TyID:
962 case Type::FP128TyID: {
963 ConstantFP *FPC = cast<ConstantFP>(CPV);
964 std::map<const ConstantFP*, unsigned>::iterator I = FPConstantMap.find(FPC);
965 if (I != FPConstantMap.end()) {
966 // Because of FP precision problems we must load from a stack allocated
967 // value that holds the value in hex.
968 Out << "(*(" << (FPC->getType() == Type::FloatTy ? "float" :
969 FPC->getType() == Type::DoubleTy ? "double" :
971 << "*)&FPConstant" << I->second << ')';
973 assert(FPC->getType() == Type::FloatTy ||
974 FPC->getType() == Type::DoubleTy);
975 double V = FPC->getType() == Type::FloatTy ?
976 FPC->getValueAPF().convertToFloat() :
977 FPC->getValueAPF().convertToDouble();
981 // FIXME the actual NaN bits should be emitted.
982 // The prefix for a quiet NaN is 0x7FF8. For a signalling NaN,
984 const unsigned long QuietNaN = 0x7ff8UL;
985 //const unsigned long SignalNaN = 0x7ff4UL;
987 // We need to grab the first part of the FP #
990 uint64_t ll = DoubleToBits(V);
991 sprintf(Buffer, "0x%llx", static_cast<long long>(ll));
993 std::string Num(&Buffer[0], &Buffer[6]);
994 unsigned long Val = strtoul(Num.c_str(), 0, 16);
996 if (FPC->getType() == Type::FloatTy)
997 Out << "LLVM_NAN" << (Val == QuietNaN ? "" : "S") << "F(\""
998 << Buffer << "\") /*nan*/ ";
1000 Out << "LLVM_NAN" << (Val == QuietNaN ? "" : "S") << "(\""
1001 << Buffer << "\") /*nan*/ ";
1002 } else if (IsInf(V)) {
1004 if (V < 0) Out << '-';
1005 Out << "LLVM_INF" << (FPC->getType() == Type::FloatTy ? "F" : "")
1009 #if HAVE_PRINTF_A && ENABLE_CBE_PRINTF_A
1010 // Print out the constant as a floating point number.
1012 sprintf(Buffer, "%a", V);
1015 Num = ftostr(FPC->getValueAPF());
1023 case Type::ArrayTyID:
1024 Out << "{ "; // Arrays are wrapped in struct types.
1025 if (ConstantArray *CA = dyn_cast<ConstantArray>(CPV)) {
1026 printConstantArray(CA);
1028 assert(isa<ConstantAggregateZero>(CPV) || isa<UndefValue>(CPV));
1029 const ArrayType *AT = cast<ArrayType>(CPV->getType());
1031 if (AT->getNumElements()) {
1033 Constant *CZ = Constant::getNullValue(AT->getElementType());
1035 for (unsigned i = 1, e = AT->getNumElements(); i != e; ++i) {
1042 Out << " }"; // Arrays are wrapped in struct types.
1045 case Type::VectorTyID:
1046 // Use C99 compound expression literal initializer syntax.
1048 printType(Out, CPV->getType());
1050 if (ConstantVector *CV = dyn_cast<ConstantVector>(CPV)) {
1051 printConstantVector(CV);
1053 assert(isa<ConstantAggregateZero>(CPV) || isa<UndefValue>(CPV));
1054 const VectorType *VT = cast<VectorType>(CPV->getType());
1056 Constant *CZ = Constant::getNullValue(VT->getElementType());
1058 for (unsigned i = 1, e = VT->getNumElements(); i != e; ++i) {
1066 case Type::StructTyID:
1067 if (isa<ConstantAggregateZero>(CPV) || isa<UndefValue>(CPV)) {
1068 const StructType *ST = cast<StructType>(CPV->getType());
1070 if (ST->getNumElements()) {
1072 printConstant(Constant::getNullValue(ST->getElementType(0)));
1073 for (unsigned i = 1, e = ST->getNumElements(); i != e; ++i) {
1075 printConstant(Constant::getNullValue(ST->getElementType(i)));
1081 if (CPV->getNumOperands()) {
1083 printConstant(cast<Constant>(CPV->getOperand(0)));
1084 for (unsigned i = 1, e = CPV->getNumOperands(); i != e; ++i) {
1086 printConstant(cast<Constant>(CPV->getOperand(i)));
1093 case Type::PointerTyID:
1094 if (isa<ConstantPointerNull>(CPV)) {
1096 printType(Out, CPV->getType()); // sign doesn't matter
1097 Out << ")/*NULL*/0)";
1099 } else if (GlobalValue *GV = dyn_cast<GlobalValue>(CPV)) {
1105 cerr << "Unknown constant type: " << *CPV << "\n";
1110 // Some constant expressions need to be casted back to the original types
1111 // because their operands were casted to the expected type. This function takes
1112 // care of detecting that case and printing the cast for the ConstantExpr.
1113 bool CWriter::printConstExprCast(const ConstantExpr* CE) {
1114 bool NeedsExplicitCast = false;
1115 const Type *Ty = CE->getOperand(0)->getType();
1116 bool TypeIsSigned = false;
1117 switch (CE->getOpcode()) {
1118 case Instruction::Add:
1119 case Instruction::Sub:
1120 case Instruction::Mul:
1121 // We need to cast integer arithmetic so that it is always performed
1122 // as unsigned, to avoid undefined behavior on overflow.
1123 if (!Ty->isIntOrIntVector()) break;
1125 case Instruction::LShr:
1126 case Instruction::URem:
1127 case Instruction::UDiv: NeedsExplicitCast = true; break;
1128 case Instruction::AShr:
1129 case Instruction::SRem:
1130 case Instruction::SDiv: NeedsExplicitCast = true; TypeIsSigned = true; break;
1131 case Instruction::SExt:
1133 NeedsExplicitCast = true;
1134 TypeIsSigned = true;
1136 case Instruction::ZExt:
1137 case Instruction::Trunc:
1138 case Instruction::FPTrunc:
1139 case Instruction::FPExt:
1140 case Instruction::UIToFP:
1141 case Instruction::SIToFP:
1142 case Instruction::FPToUI:
1143 case Instruction::FPToSI:
1144 case Instruction::PtrToInt:
1145 case Instruction::IntToPtr:
1146 case Instruction::BitCast:
1148 NeedsExplicitCast = true;
1152 if (NeedsExplicitCast) {
1154 if (Ty->isInteger() && Ty != Type::Int1Ty)
1155 printSimpleType(Out, Ty, TypeIsSigned);
1157 printType(Out, Ty); // not integer, sign doesn't matter
1160 return NeedsExplicitCast;
1163 // Print a constant assuming that it is the operand for a given Opcode. The
1164 // opcodes that care about sign need to cast their operands to the expected
1165 // type before the operation proceeds. This function does the casting.
1166 void CWriter::printConstantWithCast(Constant* CPV, unsigned Opcode) {
1168 // Extract the operand's type, we'll need it.
1169 const Type* OpTy = CPV->getType();
1171 // Indicate whether to do the cast or not.
1172 bool shouldCast = false;
1173 bool typeIsSigned = false;
1175 // Based on the Opcode for which this Constant is being written, determine
1176 // the new type to which the operand should be casted by setting the value
1177 // of OpTy. If we change OpTy, also set shouldCast to true so it gets
1181 // for most instructions, it doesn't matter
1183 case Instruction::Add:
1184 case Instruction::Sub:
1185 case Instruction::Mul:
1186 // We need to cast integer arithmetic so that it is always performed
1187 // as unsigned, to avoid undefined behavior on overflow.
1188 if (!OpTy->isIntOrIntVector()) break;
1190 case Instruction::LShr:
1191 case Instruction::UDiv:
1192 case Instruction::URem:
1195 case Instruction::AShr:
1196 case Instruction::SDiv:
1197 case Instruction::SRem:
1199 typeIsSigned = true;
1203 // Write out the casted constant if we should, otherwise just write the
1207 printSimpleType(Out, OpTy, typeIsSigned);
1215 std::string CWriter::GetValueName(const Value *Operand) {
1218 if (!isa<GlobalValue>(Operand) && Operand->getName() != "") {
1219 std::string VarName;
1221 Name = Operand->getName();
1222 VarName.reserve(Name.capacity());
1224 for (std::string::iterator I = Name.begin(), E = Name.end();
1228 if (!((ch >= 'a' && ch <= 'z') || (ch >= 'A' && ch <= 'Z') ||
1229 (ch >= '0' && ch <= '9') || ch == '_')) {
1231 sprintf(buffer, "_%x_", ch);
1237 Name = "llvm_cbe_" + VarName;
1239 Name = Mang->getValueName(Operand);
1245 /// writeInstComputationInline - Emit the computation for the specified
1246 /// instruction inline, with no destination provided.
1247 void CWriter::writeInstComputationInline(Instruction &I) {
1248 // If this is a non-trivial bool computation, make sure to truncate down to
1249 // a 1 bit value. This is important because we want "add i1 x, y" to return
1250 // "0" when x and y are true, not "2" for example.
1251 bool NeedBoolTrunc = false;
1252 if (I.getType() == Type::Int1Ty && !isa<ICmpInst>(I) && !isa<FCmpInst>(I))
1253 NeedBoolTrunc = true;
1265 void CWriter::writeOperandInternal(Value *Operand) {
1266 if (Instruction *I = dyn_cast<Instruction>(Operand))
1267 // Should we inline this instruction to build a tree?
1268 if (isInlinableInst(*I) && !isDirectAlloca(I)) {
1270 writeInstComputationInline(*I);
1275 Constant* CPV = dyn_cast<Constant>(Operand);
1277 if (CPV && !isa<GlobalValue>(CPV))
1280 Out << GetValueName(Operand);
1283 void CWriter::writeOperandRaw(Value *Operand) {
1284 Constant* CPV = dyn_cast<Constant>(Operand);
1285 if (CPV && !isa<GlobalValue>(CPV)) {
1288 Out << GetValueName(Operand);
1292 void CWriter::writeOperand(Value *Operand) {
1293 bool isAddressImplicit = isAddressExposed(Operand);
1294 if (isAddressImplicit)
1295 Out << "(&"; // Global variables are referenced as their addresses by llvm
1297 writeOperandInternal(Operand);
1299 if (isAddressImplicit)
1303 // Some instructions need to have their result value casted back to the
1304 // original types because their operands were casted to the expected type.
1305 // This function takes care of detecting that case and printing the cast
1306 // for the Instruction.
1307 bool CWriter::writeInstructionCast(const Instruction &I) {
1308 const Type *Ty = I.getOperand(0)->getType();
1309 switch (I.getOpcode()) {
1310 case Instruction::Add:
1311 case Instruction::Sub:
1312 case Instruction::Mul:
1313 // We need to cast integer arithmetic so that it is always performed
1314 // as unsigned, to avoid undefined behavior on overflow.
1315 if (!Ty->isIntOrIntVector()) break;
1317 case Instruction::LShr:
1318 case Instruction::URem:
1319 case Instruction::UDiv:
1321 printSimpleType(Out, Ty, false);
1324 case Instruction::AShr:
1325 case Instruction::SRem:
1326 case Instruction::SDiv:
1328 printSimpleType(Out, Ty, true);
1336 // Write the operand with a cast to another type based on the Opcode being used.
1337 // This will be used in cases where an instruction has specific type
1338 // requirements (usually signedness) for its operands.
1339 void CWriter::writeOperandWithCast(Value* Operand, unsigned Opcode) {
1341 // Extract the operand's type, we'll need it.
1342 const Type* OpTy = Operand->getType();
1344 // Indicate whether to do the cast or not.
1345 bool shouldCast = false;
1347 // Indicate whether the cast should be to a signed type or not.
1348 bool castIsSigned = false;
1350 // Based on the Opcode for which this Operand is being written, determine
1351 // the new type to which the operand should be casted by setting the value
1352 // of OpTy. If we change OpTy, also set shouldCast to true.
1355 // for most instructions, it doesn't matter
1357 case Instruction::Add:
1358 case Instruction::Sub:
1359 case Instruction::Mul:
1360 // We need to cast integer arithmetic so that it is always performed
1361 // as unsigned, to avoid undefined behavior on overflow.
1362 if (!OpTy->isIntOrIntVector()) break;
1364 case Instruction::LShr:
1365 case Instruction::UDiv:
1366 case Instruction::URem: // Cast to unsigned first
1368 castIsSigned = false;
1370 case Instruction::GetElementPtr:
1371 case Instruction::AShr:
1372 case Instruction::SDiv:
1373 case Instruction::SRem: // Cast to signed first
1375 castIsSigned = true;
1379 // Write out the casted operand if we should, otherwise just write the
1383 printSimpleType(Out, OpTy, castIsSigned);
1385 writeOperand(Operand);
1388 writeOperand(Operand);
1391 // Write the operand with a cast to another type based on the icmp predicate
1393 void CWriter::writeOperandWithCast(Value* Operand, const ICmpInst &Cmp) {
1394 // This has to do a cast to ensure the operand has the right signedness.
1395 // Also, if the operand is a pointer, we make sure to cast to an integer when
1396 // doing the comparison both for signedness and so that the C compiler doesn't
1397 // optimize things like "p < NULL" to false (p may contain an integer value
1399 bool shouldCast = Cmp.isRelational();
1401 // Write out the casted operand if we should, otherwise just write the
1404 writeOperand(Operand);
1408 // Should this be a signed comparison? If so, convert to signed.
1409 bool castIsSigned = Cmp.isSignedPredicate();
1411 // If the operand was a pointer, convert to a large integer type.
1412 const Type* OpTy = Operand->getType();
1413 if (isa<PointerType>(OpTy))
1414 OpTy = TD->getIntPtrType();
1417 printSimpleType(Out, OpTy, castIsSigned);
1419 writeOperand(Operand);
1423 // generateCompilerSpecificCode - This is where we add conditional compilation
1424 // directives to cater to specific compilers as need be.
1426 static void generateCompilerSpecificCode(std::ostream& Out,
1427 const TargetData *TD) {
1428 // Alloca is hard to get, and we don't want to include stdlib.h here.
1429 Out << "/* get a declaration for alloca */\n"
1430 << "#if defined(__CYGWIN__) || defined(__MINGW32__)\n"
1431 << "#define alloca(x) __builtin_alloca((x))\n"
1432 << "#define _alloca(x) __builtin_alloca((x))\n"
1433 << "#elif defined(__APPLE__)\n"
1434 << "extern void *__builtin_alloca(unsigned long);\n"
1435 << "#define alloca(x) __builtin_alloca(x)\n"
1436 << "#define longjmp _longjmp\n"
1437 << "#define setjmp _setjmp\n"
1438 << "#elif defined(__sun__)\n"
1439 << "#if defined(__sparcv9)\n"
1440 << "extern void *__builtin_alloca(unsigned long);\n"
1442 << "extern void *__builtin_alloca(unsigned int);\n"
1444 << "#define alloca(x) __builtin_alloca(x)\n"
1445 << "#elif defined(__FreeBSD__) || defined(__NetBSD__) || defined(__OpenBSD__) || defined(__DragonFly__)\n"
1446 << "#define alloca(x) __builtin_alloca(x)\n"
1447 << "#elif defined(_MSC_VER)\n"
1448 << "#define inline _inline\n"
1449 << "#define alloca(x) _alloca(x)\n"
1451 << "#include <alloca.h>\n"
1454 // We output GCC specific attributes to preserve 'linkonce'ness on globals.
1455 // If we aren't being compiled with GCC, just drop these attributes.
1456 Out << "#ifndef __GNUC__ /* Can only support \"linkonce\" vars with GCC */\n"
1457 << "#define __attribute__(X)\n"
1460 // On Mac OS X, "external weak" is spelled "__attribute__((weak_import))".
1461 Out << "#if defined(__GNUC__) && defined(__APPLE_CC__)\n"
1462 << "#define __EXTERNAL_WEAK__ __attribute__((weak_import))\n"
1463 << "#elif defined(__GNUC__)\n"
1464 << "#define __EXTERNAL_WEAK__ __attribute__((weak))\n"
1466 << "#define __EXTERNAL_WEAK__\n"
1469 // For now, turn off the weak linkage attribute on Mac OS X. (See above.)
1470 Out << "#if defined(__GNUC__) && defined(__APPLE_CC__)\n"
1471 << "#define __ATTRIBUTE_WEAK__\n"
1472 << "#elif defined(__GNUC__)\n"
1473 << "#define __ATTRIBUTE_WEAK__ __attribute__((weak))\n"
1475 << "#define __ATTRIBUTE_WEAK__\n"
1478 // Add hidden visibility support. FIXME: APPLE_CC?
1479 Out << "#if defined(__GNUC__)\n"
1480 << "#define __HIDDEN__ __attribute__((visibility(\"hidden\")))\n"
1483 // Define NaN and Inf as GCC builtins if using GCC, as 0 otherwise
1484 // From the GCC documentation:
1486 // double __builtin_nan (const char *str)
1488 // This is an implementation of the ISO C99 function nan.
1490 // Since ISO C99 defines this function in terms of strtod, which we do
1491 // not implement, a description of the parsing is in order. The string is
1492 // parsed as by strtol; that is, the base is recognized by leading 0 or
1493 // 0x prefixes. The number parsed is placed in the significand such that
1494 // the least significant bit of the number is at the least significant
1495 // bit of the significand. The number is truncated to fit the significand
1496 // field provided. The significand is forced to be a quiet NaN.
1498 // This function, if given a string literal, is evaluated early enough
1499 // that it is considered a compile-time constant.
1501 // float __builtin_nanf (const char *str)
1503 // Similar to __builtin_nan, except the return type is float.
1505 // double __builtin_inf (void)
1507 // Similar to __builtin_huge_val, except a warning is generated if the
1508 // target floating-point format does not support infinities. This
1509 // function is suitable for implementing the ISO C99 macro INFINITY.
1511 // float __builtin_inff (void)
1513 // Similar to __builtin_inf, except the return type is float.
1514 Out << "#ifdef __GNUC__\n"
1515 << "#define LLVM_NAN(NanStr) __builtin_nan(NanStr) /* Double */\n"
1516 << "#define LLVM_NANF(NanStr) __builtin_nanf(NanStr) /* Float */\n"
1517 << "#define LLVM_NANS(NanStr) __builtin_nans(NanStr) /* Double */\n"
1518 << "#define LLVM_NANSF(NanStr) __builtin_nansf(NanStr) /* Float */\n"
1519 << "#define LLVM_INF __builtin_inf() /* Double */\n"
1520 << "#define LLVM_INFF __builtin_inff() /* Float */\n"
1521 << "#define LLVM_PREFETCH(addr,rw,locality) "
1522 "__builtin_prefetch(addr,rw,locality)\n"
1523 << "#define __ATTRIBUTE_CTOR__ __attribute__((constructor))\n"
1524 << "#define __ATTRIBUTE_DTOR__ __attribute__((destructor))\n"
1525 << "#define LLVM_ASM __asm__\n"
1527 << "#define LLVM_NAN(NanStr) ((double)0.0) /* Double */\n"
1528 << "#define LLVM_NANF(NanStr) 0.0F /* Float */\n"
1529 << "#define LLVM_NANS(NanStr) ((double)0.0) /* Double */\n"
1530 << "#define LLVM_NANSF(NanStr) 0.0F /* Float */\n"
1531 << "#define LLVM_INF ((double)0.0) /* Double */\n"
1532 << "#define LLVM_INFF 0.0F /* Float */\n"
1533 << "#define LLVM_PREFETCH(addr,rw,locality) /* PREFETCH */\n"
1534 << "#define __ATTRIBUTE_CTOR__\n"
1535 << "#define __ATTRIBUTE_DTOR__\n"
1536 << "#define LLVM_ASM(X)\n"
1539 Out << "#if __GNUC__ < 4 /* Old GCC's, or compilers not GCC */ \n"
1540 << "#define __builtin_stack_save() 0 /* not implemented */\n"
1541 << "#define __builtin_stack_restore(X) /* noop */\n"
1544 // Output typedefs for 128-bit integers. If these are needed with a
1545 // 32-bit target or with a C compiler that doesn't support mode(TI),
1546 // more drastic measures will be needed.
1547 Out << "#if __GNUC__ && __LP64__ /* 128-bit integer types */\n"
1548 << "typedef int __attribute__((mode(TI))) llvmInt128;\n"
1549 << "typedef unsigned __attribute__((mode(TI))) llvmUInt128;\n"
1552 // Output target-specific code that should be inserted into main.
1553 Out << "#define CODE_FOR_MAIN() /* Any target-specific code for main()*/\n";
1556 /// FindStaticTors - Given a static ctor/dtor list, unpack its contents into
1557 /// the StaticTors set.
1558 static void FindStaticTors(GlobalVariable *GV, std::set<Function*> &StaticTors){
1559 ConstantArray *InitList = dyn_cast<ConstantArray>(GV->getInitializer());
1560 if (!InitList) return;
1562 for (unsigned i = 0, e = InitList->getNumOperands(); i != e; ++i)
1563 if (ConstantStruct *CS = dyn_cast<ConstantStruct>(InitList->getOperand(i))){
1564 if (CS->getNumOperands() != 2) return; // Not array of 2-element structs.
1566 if (CS->getOperand(1)->isNullValue())
1567 return; // Found a null terminator, exit printing.
1568 Constant *FP = CS->getOperand(1);
1569 if (ConstantExpr *CE = dyn_cast<ConstantExpr>(FP))
1571 FP = CE->getOperand(0);
1572 if (Function *F = dyn_cast<Function>(FP))
1573 StaticTors.insert(F);
1577 enum SpecialGlobalClass {
1579 GlobalCtors, GlobalDtors,
1583 /// getGlobalVariableClass - If this is a global that is specially recognized
1584 /// by LLVM, return a code that indicates how we should handle it.
1585 static SpecialGlobalClass getGlobalVariableClass(const GlobalVariable *GV) {
1586 // If this is a global ctors/dtors list, handle it now.
1587 if (GV->hasAppendingLinkage() && GV->use_empty()) {
1588 if (GV->getName() == "llvm.global_ctors")
1590 else if (GV->getName() == "llvm.global_dtors")
1594 // Otherwise, it it is other metadata, don't print it. This catches things
1595 // like debug information.
1596 if (GV->getSection() == "llvm.metadata")
1603 bool CWriter::doInitialization(Module &M) {
1607 TD = new TargetData(&M);
1608 IL = new IntrinsicLowering(*TD);
1609 IL->AddPrototypes(M);
1611 // Ensure that all structure types have names...
1612 Mang = new Mangler(M);
1613 Mang->markCharUnacceptable('.');
1615 // Keep track of which functions are static ctors/dtors so they can have
1616 // an attribute added to their prototypes.
1617 std::set<Function*> StaticCtors, StaticDtors;
1618 for (Module::global_iterator I = M.global_begin(), E = M.global_end();
1620 switch (getGlobalVariableClass(I)) {
1623 FindStaticTors(I, StaticCtors);
1626 FindStaticTors(I, StaticDtors);
1631 // get declaration for alloca
1632 Out << "/* Provide Declarations */\n";
1633 Out << "#include <stdarg.h>\n"; // Varargs support
1634 Out << "#include <setjmp.h>\n"; // Unwind support
1635 generateCompilerSpecificCode(Out, TD);
1637 // Provide a definition for `bool' if not compiling with a C++ compiler.
1639 << "#ifndef __cplusplus\ntypedef unsigned char bool;\n#endif\n"
1641 << "\n\n/* Support for floating point constants */\n"
1642 << "typedef unsigned long long ConstantDoubleTy;\n"
1643 << "typedef unsigned int ConstantFloatTy;\n"
1644 << "typedef struct { unsigned long long f1; unsigned short f2; "
1645 "unsigned short pad[3]; } ConstantFP80Ty;\n"
1646 // This is used for both kinds of 128-bit long double; meaning differs.
1647 << "typedef struct { unsigned long long f1; unsigned long long f2; }"
1648 " ConstantFP128Ty;\n"
1649 << "\n\n/* Global Declarations */\n";
1651 // First output all the declarations for the program, because C requires
1652 // Functions & globals to be declared before they are used.
1655 // Loop over the symbol table, emitting all named constants...
1656 printModuleTypes(M.getTypeSymbolTable());
1658 // Global variable declarations...
1659 if (!M.global_empty()) {
1660 Out << "\n/* External Global Variable Declarations */\n";
1661 for (Module::global_iterator I = M.global_begin(), E = M.global_end();
1664 if (I->hasExternalLinkage() || I->hasExternalWeakLinkage() ||
1665 I->hasCommonLinkage())
1667 else if (I->hasDLLImportLinkage())
1668 Out << "__declspec(dllimport) ";
1670 continue; // Internal Global
1672 // Thread Local Storage
1673 if (I->isThreadLocal())
1676 printType(Out, I->getType()->getElementType(), false, GetValueName(I));
1678 if (I->hasExternalWeakLinkage())
1679 Out << " __EXTERNAL_WEAK__";
1684 // Function declarations
1685 Out << "\n/* Function Declarations */\n";
1686 Out << "double fmod(double, double);\n"; // Support for FP rem
1687 Out << "float fmodf(float, float);\n";
1688 Out << "long double fmodl(long double, long double);\n";
1690 for (Module::iterator I = M.begin(), E = M.end(); I != E; ++I) {
1691 // Don't print declarations for intrinsic functions.
1692 if (!I->isIntrinsic() && I->getName() != "setjmp" &&
1693 I->getName() != "longjmp" && I->getName() != "_setjmp") {
1694 if (I->hasExternalWeakLinkage())
1696 printFunctionSignature(I, true);
1697 if (I->hasWeakLinkage() || I->hasLinkOnceLinkage())
1698 Out << " __ATTRIBUTE_WEAK__";
1699 if (I->hasExternalWeakLinkage())
1700 Out << " __EXTERNAL_WEAK__";
1701 if (StaticCtors.count(I))
1702 Out << " __ATTRIBUTE_CTOR__";
1703 if (StaticDtors.count(I))
1704 Out << " __ATTRIBUTE_DTOR__";
1705 if (I->hasHiddenVisibility())
1706 Out << " __HIDDEN__";
1708 if (I->hasName() && I->getName()[0] == 1)
1709 Out << " LLVM_ASM(\"" << I->getName().c_str()+1 << "\")";
1715 // Output the global variable declarations
1716 if (!M.global_empty()) {
1717 Out << "\n\n/* Global Variable Declarations */\n";
1718 for (Module::global_iterator I = M.global_begin(), E = M.global_end();
1720 if (!I->isDeclaration()) {
1721 // Ignore special globals, such as debug info.
1722 if (getGlobalVariableClass(I))
1725 if (I->hasInternalLinkage())
1730 // Thread Local Storage
1731 if (I->isThreadLocal())
1734 printType(Out, I->getType()->getElementType(), false,
1737 if (I->hasLinkOnceLinkage())
1738 Out << " __attribute__((common))";
1739 else if (I->hasCommonLinkage()) // FIXME is this right?
1740 Out << " __ATTRIBUTE_WEAK__";
1741 else if (I->hasWeakLinkage())
1742 Out << " __ATTRIBUTE_WEAK__";
1743 else if (I->hasExternalWeakLinkage())
1744 Out << " __EXTERNAL_WEAK__";
1745 if (I->hasHiddenVisibility())
1746 Out << " __HIDDEN__";
1751 // Output the global variable definitions and contents...
1752 if (!M.global_empty()) {
1753 Out << "\n\n/* Global Variable Definitions and Initialization */\n";
1754 for (Module::global_iterator I = M.global_begin(), E = M.global_end();
1756 if (!I->isDeclaration()) {
1757 // Ignore special globals, such as debug info.
1758 if (getGlobalVariableClass(I))
1761 if (I->hasInternalLinkage())
1763 else if (I->hasDLLImportLinkage())
1764 Out << "__declspec(dllimport) ";
1765 else if (I->hasDLLExportLinkage())
1766 Out << "__declspec(dllexport) ";
1768 // Thread Local Storage
1769 if (I->isThreadLocal())
1772 printType(Out, I->getType()->getElementType(), false,
1774 if (I->hasLinkOnceLinkage())
1775 Out << " __attribute__((common))";
1776 else if (I->hasWeakLinkage())
1777 Out << " __ATTRIBUTE_WEAK__";
1778 else if (I->hasCommonLinkage())
1779 Out << " __ATTRIBUTE_WEAK__";
1781 if (I->hasHiddenVisibility())
1782 Out << " __HIDDEN__";
1784 // If the initializer is not null, emit the initializer. If it is null,
1785 // we try to avoid emitting large amounts of zeros. The problem with
1786 // this, however, occurs when the variable has weak linkage. In this
1787 // case, the assembler will complain about the variable being both weak
1788 // and common, so we disable this optimization.
1789 // FIXME common linkage should avoid this problem.
1790 if (!I->getInitializer()->isNullValue()) {
1792 writeOperand(I->getInitializer());
1793 } else if (I->hasWeakLinkage()) {
1794 // We have to specify an initializer, but it doesn't have to be
1795 // complete. If the value is an aggregate, print out { 0 }, and let
1796 // the compiler figure out the rest of the zeros.
1798 if (isa<StructType>(I->getInitializer()->getType()) ||
1799 isa<VectorType>(I->getInitializer()->getType())) {
1801 } else if (isa<ArrayType>(I->getInitializer()->getType())) {
1802 // As with structs and vectors, but with an extra set of braces
1803 // because arrays are wrapped in structs.
1806 // Just print it out normally.
1807 writeOperand(I->getInitializer());
1815 Out << "\n\n/* Function Bodies */\n";
1817 // Emit some helper functions for dealing with FCMP instruction's
1819 Out << "static inline int llvm_fcmp_ord(double X, double Y) { ";
1820 Out << "return X == X && Y == Y; }\n";
1821 Out << "static inline int llvm_fcmp_uno(double X, double Y) { ";
1822 Out << "return X != X || Y != Y; }\n";
1823 Out << "static inline int llvm_fcmp_ueq(double X, double Y) { ";
1824 Out << "return X == Y || llvm_fcmp_uno(X, Y); }\n";
1825 Out << "static inline int llvm_fcmp_une(double X, double Y) { ";
1826 Out << "return X != Y; }\n";
1827 Out << "static inline int llvm_fcmp_ult(double X, double Y) { ";
1828 Out << "return X < Y || llvm_fcmp_uno(X, Y); }\n";
1829 Out << "static inline int llvm_fcmp_ugt(double X, double Y) { ";
1830 Out << "return X > Y || llvm_fcmp_uno(X, Y); }\n";
1831 Out << "static inline int llvm_fcmp_ule(double X, double Y) { ";
1832 Out << "return X <= Y || llvm_fcmp_uno(X, Y); }\n";
1833 Out << "static inline int llvm_fcmp_uge(double X, double Y) { ";
1834 Out << "return X >= Y || llvm_fcmp_uno(X, Y); }\n";
1835 Out << "static inline int llvm_fcmp_oeq(double X, double Y) { ";
1836 Out << "return X == Y ; }\n";
1837 Out << "static inline int llvm_fcmp_one(double X, double Y) { ";
1838 Out << "return X != Y && llvm_fcmp_ord(X, Y); }\n";
1839 Out << "static inline int llvm_fcmp_olt(double X, double Y) { ";
1840 Out << "return X < Y ; }\n";
1841 Out << "static inline int llvm_fcmp_ogt(double X, double Y) { ";
1842 Out << "return X > Y ; }\n";
1843 Out << "static inline int llvm_fcmp_ole(double X, double Y) { ";
1844 Out << "return X <= Y ; }\n";
1845 Out << "static inline int llvm_fcmp_oge(double X, double Y) { ";
1846 Out << "return X >= Y ; }\n";
1851 /// Output all floating point constants that cannot be printed accurately...
1852 void CWriter::printFloatingPointConstants(Function &F) {
1853 // Scan the module for floating point constants. If any FP constant is used
1854 // in the function, we want to redirect it here so that we do not depend on
1855 // the precision of the printed form, unless the printed form preserves
1858 static unsigned FPCounter = 0;
1859 for (constant_iterator I = constant_begin(&F), E = constant_end(&F);
1861 if (const ConstantFP *FPC = dyn_cast<ConstantFP>(*I))
1862 if (!isFPCSafeToPrint(FPC) && // Do not put in FPConstantMap if safe.
1863 !FPConstantMap.count(FPC)) {
1864 FPConstantMap[FPC] = FPCounter; // Number the FP constants
1866 if (FPC->getType() == Type::DoubleTy) {
1867 double Val = FPC->getValueAPF().convertToDouble();
1868 uint64_t i = FPC->getValueAPF().convertToAPInt().getZExtValue();
1869 Out << "static const ConstantDoubleTy FPConstant" << FPCounter++
1870 << " = 0x" << std::hex << i << std::dec
1871 << "ULL; /* " << Val << " */\n";
1872 } else if (FPC->getType() == Type::FloatTy) {
1873 float Val = FPC->getValueAPF().convertToFloat();
1874 uint32_t i = (uint32_t)FPC->getValueAPF().convertToAPInt().
1876 Out << "static const ConstantFloatTy FPConstant" << FPCounter++
1877 << " = 0x" << std::hex << i << std::dec
1878 << "U; /* " << Val << " */\n";
1879 } else if (FPC->getType() == Type::X86_FP80Ty) {
1880 // api needed to prevent premature destruction
1881 APInt api = FPC->getValueAPF().convertToAPInt();
1882 const uint64_t *p = api.getRawData();
1883 Out << "static const ConstantFP80Ty FPConstant" << FPCounter++
1884 << " = { 0x" << std::hex
1885 << ((uint16_t)p[1] | (p[0] & 0xffffffffffffLL)<<16)
1886 << "ULL, 0x" << (uint16_t)(p[0] >> 48) << ",{0,0,0}"
1887 << "}; /* Long double constant */\n" << std::dec;
1888 } else if (FPC->getType() == Type::PPC_FP128Ty) {
1889 APInt api = FPC->getValueAPF().convertToAPInt();
1890 const uint64_t *p = api.getRawData();
1891 Out << "static const ConstantFP128Ty FPConstant" << FPCounter++
1892 << " = { 0x" << std::hex
1893 << p[0] << ", 0x" << p[1]
1894 << "}; /* Long double constant */\n" << std::dec;
1897 assert(0 && "Unknown float type!");
1904 /// printSymbolTable - Run through symbol table looking for type names. If a
1905 /// type name is found, emit its declaration...
1907 void CWriter::printModuleTypes(const TypeSymbolTable &TST) {
1908 Out << "/* Helper union for bitcasts */\n";
1909 Out << "typedef union {\n";
1910 Out << " unsigned int Int32;\n";
1911 Out << " unsigned long long Int64;\n";
1912 Out << " float Float;\n";
1913 Out << " double Double;\n";
1914 Out << "} llvmBitCastUnion;\n";
1916 // We are only interested in the type plane of the symbol table.
1917 TypeSymbolTable::const_iterator I = TST.begin();
1918 TypeSymbolTable::const_iterator End = TST.end();
1920 // If there are no type names, exit early.
1921 if (I == End) return;
1923 // Print out forward declarations for structure types before anything else!
1924 Out << "/* Structure forward decls */\n";
1925 for (; I != End; ++I) {
1926 std::string Name = "struct l_" + Mang->makeNameProper(I->first);
1927 Out << Name << ";\n";
1928 TypeNames.insert(std::make_pair(I->second, Name));
1933 // Now we can print out typedefs. Above, we guaranteed that this can only be
1934 // for struct or opaque types.
1935 Out << "/* Typedefs */\n";
1936 for (I = TST.begin(); I != End; ++I) {
1937 std::string Name = "l_" + Mang->makeNameProper(I->first);
1939 printType(Out, I->second, false, Name);
1945 // Keep track of which structures have been printed so far...
1946 std::set<const Type *> StructPrinted;
1948 // Loop over all structures then push them into the stack so they are
1949 // printed in the correct order.
1951 Out << "/* Structure contents */\n";
1952 for (I = TST.begin(); I != End; ++I)
1953 if (isa<StructType>(I->second) || isa<ArrayType>(I->second))
1954 // Only print out used types!
1955 printContainedStructs(I->second, StructPrinted);
1958 // Push the struct onto the stack and recursively push all structs
1959 // this one depends on.
1961 // TODO: Make this work properly with vector types
1963 void CWriter::printContainedStructs(const Type *Ty,
1964 std::set<const Type*> &StructPrinted) {
1965 // Don't walk through pointers.
1966 if (isa<PointerType>(Ty) || Ty->isPrimitiveType() || Ty->isInteger()) return;
1968 // Print all contained types first.
1969 for (Type::subtype_iterator I = Ty->subtype_begin(),
1970 E = Ty->subtype_end(); I != E; ++I)
1971 printContainedStructs(*I, StructPrinted);
1973 if (isa<StructType>(Ty) || isa<ArrayType>(Ty)) {
1974 // Check to see if we have already printed this struct.
1975 if (StructPrinted.insert(Ty).second) {
1976 // Print structure type out.
1977 std::string Name = TypeNames[Ty];
1978 printType(Out, Ty, false, Name, true);
1984 void CWriter::printFunctionSignature(const Function *F, bool Prototype) {
1985 /// isStructReturn - Should this function actually return a struct by-value?
1986 bool isStructReturn = F->hasStructRetAttr();
1988 if (F->hasInternalLinkage()) Out << "static ";
1989 if (F->hasDLLImportLinkage()) Out << "__declspec(dllimport) ";
1990 if (F->hasDLLExportLinkage()) Out << "__declspec(dllexport) ";
1991 switch (F->getCallingConv()) {
1992 case CallingConv::X86_StdCall:
1993 Out << "__stdcall ";
1995 case CallingConv::X86_FastCall:
1996 Out << "__fastcall ";
2000 // Loop over the arguments, printing them...
2001 const FunctionType *FT = cast<FunctionType>(F->getFunctionType());
2002 const PAListPtr &PAL = F->getParamAttrs();
2004 std::stringstream FunctionInnards;
2006 // Print out the name...
2007 FunctionInnards << GetValueName(F) << '(';
2009 bool PrintedArg = false;
2010 if (!F->isDeclaration()) {
2011 if (!F->arg_empty()) {
2012 Function::const_arg_iterator I = F->arg_begin(), E = F->arg_end();
2015 // If this is a struct-return function, don't print the hidden
2016 // struct-return argument.
2017 if (isStructReturn) {
2018 assert(I != E && "Invalid struct return function!");
2023 std::string ArgName;
2024 for (; I != E; ++I) {
2025 if (PrintedArg) FunctionInnards << ", ";
2026 if (I->hasName() || !Prototype)
2027 ArgName = GetValueName(I);
2030 const Type *ArgTy = I->getType();
2031 if (PAL.paramHasAttr(Idx, ParamAttr::ByVal)) {
2032 ArgTy = cast<PointerType>(ArgTy)->getElementType();
2033 ByValParams.insert(I);
2035 printType(FunctionInnards, ArgTy,
2036 /*isSigned=*/PAL.paramHasAttr(Idx, ParamAttr::SExt),
2043 // Loop over the arguments, printing them.
2044 FunctionType::param_iterator I = FT->param_begin(), E = FT->param_end();
2047 // If this is a struct-return function, don't print the hidden
2048 // struct-return argument.
2049 if (isStructReturn) {
2050 assert(I != E && "Invalid struct return function!");
2055 for (; I != E; ++I) {
2056 if (PrintedArg) FunctionInnards << ", ";
2057 const Type *ArgTy = *I;
2058 if (PAL.paramHasAttr(Idx, ParamAttr::ByVal)) {
2059 assert(isa<PointerType>(ArgTy));
2060 ArgTy = cast<PointerType>(ArgTy)->getElementType();
2062 printType(FunctionInnards, ArgTy,
2063 /*isSigned=*/PAL.paramHasAttr(Idx, ParamAttr::SExt));
2069 // Finish printing arguments... if this is a vararg function, print the ...,
2070 // unless there are no known types, in which case, we just emit ().
2072 if (FT->isVarArg() && PrintedArg) {
2073 if (PrintedArg) FunctionInnards << ", ";
2074 FunctionInnards << "..."; // Output varargs portion of signature!
2075 } else if (!FT->isVarArg() && !PrintedArg) {
2076 FunctionInnards << "void"; // ret() -> ret(void) in C.
2078 FunctionInnards << ')';
2080 // Get the return tpe for the function.
2082 if (!isStructReturn)
2083 RetTy = F->getReturnType();
2085 // If this is a struct-return function, print the struct-return type.
2086 RetTy = cast<PointerType>(FT->getParamType(0))->getElementType();
2089 // Print out the return type and the signature built above.
2090 printType(Out, RetTy,
2091 /*isSigned=*/PAL.paramHasAttr(0, ParamAttr::SExt),
2092 FunctionInnards.str());
2095 static inline bool isFPIntBitCast(const Instruction &I) {
2096 if (!isa<BitCastInst>(I))
2098 const Type *SrcTy = I.getOperand(0)->getType();
2099 const Type *DstTy = I.getType();
2100 return (SrcTy->isFloatingPoint() && DstTy->isInteger()) ||
2101 (DstTy->isFloatingPoint() && SrcTy->isInteger());
2104 void CWriter::printFunction(Function &F) {
2105 /// isStructReturn - Should this function actually return a struct by-value?
2106 bool isStructReturn = F.hasStructRetAttr();
2108 printFunctionSignature(&F, false);
2111 // If this is a struct return function, handle the result with magic.
2112 if (isStructReturn) {
2113 const Type *StructTy =
2114 cast<PointerType>(F.arg_begin()->getType())->getElementType();
2116 printType(Out, StructTy, false, "StructReturn");
2117 Out << "; /* Struct return temporary */\n";
2120 printType(Out, F.arg_begin()->getType(), false,
2121 GetValueName(F.arg_begin()));
2122 Out << " = &StructReturn;\n";
2125 bool PrintedVar = false;
2127 // print local variable information for the function
2128 for (inst_iterator I = inst_begin(&F), E = inst_end(&F); I != E; ++I) {
2129 if (const AllocaInst *AI = isDirectAlloca(&*I)) {
2131 printType(Out, AI->getAllocatedType(), false, GetValueName(AI));
2132 Out << "; /* Address-exposed local */\n";
2134 } else if (I->getType() != Type::VoidTy && !isInlinableInst(*I)) {
2136 printType(Out, I->getType(), false, GetValueName(&*I));
2139 if (isa<PHINode>(*I)) { // Print out PHI node temporaries as well...
2141 printType(Out, I->getType(), false,
2142 GetValueName(&*I)+"__PHI_TEMPORARY");
2147 // We need a temporary for the BitCast to use so it can pluck a value out
2148 // of a union to do the BitCast. This is separate from the need for a
2149 // variable to hold the result of the BitCast.
2150 if (isFPIntBitCast(*I)) {
2151 Out << " llvmBitCastUnion " << GetValueName(&*I)
2152 << "__BITCAST_TEMPORARY;\n";
2160 if (F.hasExternalLinkage() && F.getName() == "main")
2161 Out << " CODE_FOR_MAIN();\n";
2163 // print the basic blocks
2164 for (Function::iterator BB = F.begin(), E = F.end(); BB != E; ++BB) {
2165 if (Loop *L = LI->getLoopFor(BB)) {
2166 if (L->getHeader() == BB && L->getParentLoop() == 0)
2169 printBasicBlock(BB);
2176 void CWriter::printLoop(Loop *L) {
2177 Out << " do { /* Syntactic loop '" << L->getHeader()->getName()
2178 << "' to make GCC happy */\n";
2179 for (unsigned i = 0, e = L->getBlocks().size(); i != e; ++i) {
2180 BasicBlock *BB = L->getBlocks()[i];
2181 Loop *BBLoop = LI->getLoopFor(BB);
2183 printBasicBlock(BB);
2184 else if (BB == BBLoop->getHeader() && BBLoop->getParentLoop() == L)
2187 Out << " } while (1); /* end of syntactic loop '"
2188 << L->getHeader()->getName() << "' */\n";
2191 void CWriter::printBasicBlock(BasicBlock *BB) {
2193 // Don't print the label for the basic block if there are no uses, or if
2194 // the only terminator use is the predecessor basic block's terminator.
2195 // We have to scan the use list because PHI nodes use basic blocks too but
2196 // do not require a label to be generated.
2198 bool NeedsLabel = false;
2199 for (pred_iterator PI = pred_begin(BB), E = pred_end(BB); PI != E; ++PI)
2200 if (isGotoCodeNecessary(*PI, BB)) {
2205 if (NeedsLabel) Out << GetValueName(BB) << ":\n";
2207 // Output all of the instructions in the basic block...
2208 for (BasicBlock::iterator II = BB->begin(), E = --BB->end(); II != E;
2210 if (!isInlinableInst(*II) && !isDirectAlloca(II)) {
2211 if (II->getType() != Type::VoidTy && !isInlineAsm(*II))
2215 writeInstComputationInline(*II);
2220 // Don't emit prefix or suffix for the terminator.
2221 visit(*BB->getTerminator());
2225 // Specific Instruction type classes... note that all of the casts are
2226 // necessary because we use the instruction classes as opaque types...
2228 void CWriter::visitReturnInst(ReturnInst &I) {
2229 // If this is a struct return function, return the temporary struct.
2230 bool isStructReturn = I.getParent()->getParent()->hasStructRetAttr();
2232 if (isStructReturn) {
2233 Out << " return StructReturn;\n";
2237 // Don't output a void return if this is the last basic block in the function
2238 if (I.getNumOperands() == 0 &&
2239 &*--I.getParent()->getParent()->end() == I.getParent() &&
2240 !I.getParent()->size() == 1) {
2244 if (I.getNumOperands() > 1) {
2247 printType(Out, I.getParent()->getParent()->getReturnType());
2248 Out << " llvm_cbe_mrv_temp = {\n";
2249 for (unsigned i = 0, e = I.getNumOperands(); i != e; ++i) {
2251 writeOperand(I.getOperand(i));
2257 Out << " return llvm_cbe_mrv_temp;\n";
2263 if (I.getNumOperands()) {
2265 writeOperand(I.getOperand(0));
2270 void CWriter::visitSwitchInst(SwitchInst &SI) {
2273 writeOperand(SI.getOperand(0));
2274 Out << ") {\n default:\n";
2275 printPHICopiesForSuccessor (SI.getParent(), SI.getDefaultDest(), 2);
2276 printBranchToBlock(SI.getParent(), SI.getDefaultDest(), 2);
2278 for (unsigned i = 2, e = SI.getNumOperands(); i != e; i += 2) {
2280 writeOperand(SI.getOperand(i));
2282 BasicBlock *Succ = cast<BasicBlock>(SI.getOperand(i+1));
2283 printPHICopiesForSuccessor (SI.getParent(), Succ, 2);
2284 printBranchToBlock(SI.getParent(), Succ, 2);
2285 if (Function::iterator(Succ) == next(Function::iterator(SI.getParent())))
2291 void CWriter::visitUnreachableInst(UnreachableInst &I) {
2292 Out << " /*UNREACHABLE*/;\n";
2295 bool CWriter::isGotoCodeNecessary(BasicBlock *From, BasicBlock *To) {
2296 /// FIXME: This should be reenabled, but loop reordering safe!!
2299 if (next(Function::iterator(From)) != Function::iterator(To))
2300 return true; // Not the direct successor, we need a goto.
2302 //isa<SwitchInst>(From->getTerminator())
2304 if (LI->getLoopFor(From) != LI->getLoopFor(To))
2309 void CWriter::printPHICopiesForSuccessor (BasicBlock *CurBlock,
2310 BasicBlock *Successor,
2312 for (BasicBlock::iterator I = Successor->begin(); isa<PHINode>(I); ++I) {
2313 PHINode *PN = cast<PHINode>(I);
2314 // Now we have to do the printing.
2315 Value *IV = PN->getIncomingValueForBlock(CurBlock);
2316 if (!isa<UndefValue>(IV)) {
2317 Out << std::string(Indent, ' ');
2318 Out << " " << GetValueName(I) << "__PHI_TEMPORARY = ";
2320 Out << "; /* for PHI node */\n";
2325 void CWriter::printBranchToBlock(BasicBlock *CurBB, BasicBlock *Succ,
2327 if (isGotoCodeNecessary(CurBB, Succ)) {
2328 Out << std::string(Indent, ' ') << " goto ";
2334 // Branch instruction printing - Avoid printing out a branch to a basic block
2335 // that immediately succeeds the current one.
2337 void CWriter::visitBranchInst(BranchInst &I) {
2339 if (I.isConditional()) {
2340 if (isGotoCodeNecessary(I.getParent(), I.getSuccessor(0))) {
2342 writeOperand(I.getCondition());
2345 printPHICopiesForSuccessor (I.getParent(), I.getSuccessor(0), 2);
2346 printBranchToBlock(I.getParent(), I.getSuccessor(0), 2);
2348 if (isGotoCodeNecessary(I.getParent(), I.getSuccessor(1))) {
2349 Out << " } else {\n";
2350 printPHICopiesForSuccessor (I.getParent(), I.getSuccessor(1), 2);
2351 printBranchToBlock(I.getParent(), I.getSuccessor(1), 2);
2354 // First goto not necessary, assume second one is...
2356 writeOperand(I.getCondition());
2359 printPHICopiesForSuccessor (I.getParent(), I.getSuccessor(1), 2);
2360 printBranchToBlock(I.getParent(), I.getSuccessor(1), 2);
2365 printPHICopiesForSuccessor (I.getParent(), I.getSuccessor(0), 0);
2366 printBranchToBlock(I.getParent(), I.getSuccessor(0), 0);
2371 // PHI nodes get copied into temporary values at the end of predecessor basic
2372 // blocks. We now need to copy these temporary values into the REAL value for
2374 void CWriter::visitPHINode(PHINode &I) {
2376 Out << "__PHI_TEMPORARY";
2380 void CWriter::visitBinaryOperator(Instruction &I) {
2381 // binary instructions, shift instructions, setCond instructions.
2382 assert(!isa<PointerType>(I.getType()));
2384 // We must cast the results of binary operations which might be promoted.
2385 bool needsCast = false;
2386 if ((I.getType() == Type::Int8Ty) || (I.getType() == Type::Int16Ty)
2387 || (I.getType() == Type::FloatTy)) {
2390 printType(Out, I.getType(), false);
2394 // If this is a negation operation, print it out as such. For FP, we don't
2395 // want to print "-0.0 - X".
2396 if (BinaryOperator::isNeg(&I)) {
2398 writeOperand(BinaryOperator::getNegArgument(cast<BinaryOperator>(&I)));
2400 } else if (I.getOpcode() == Instruction::FRem) {
2401 // Output a call to fmod/fmodf instead of emitting a%b
2402 if (I.getType() == Type::FloatTy)
2404 else if (I.getType() == Type::DoubleTy)
2406 else // all 3 flavors of long double
2408 writeOperand(I.getOperand(0));
2410 writeOperand(I.getOperand(1));
2414 // Write out the cast of the instruction's value back to the proper type
2416 bool NeedsClosingParens = writeInstructionCast(I);
2418 // Certain instructions require the operand to be forced to a specific type
2419 // so we use writeOperandWithCast here instead of writeOperand. Similarly
2420 // below for operand 1
2421 writeOperandWithCast(I.getOperand(0), I.getOpcode());
2423 switch (I.getOpcode()) {
2424 case Instruction::Add: Out << " + "; break;
2425 case Instruction::Sub: Out << " - "; break;
2426 case Instruction::Mul: Out << " * "; break;
2427 case Instruction::URem:
2428 case Instruction::SRem:
2429 case Instruction::FRem: Out << " % "; break;
2430 case Instruction::UDiv:
2431 case Instruction::SDiv:
2432 case Instruction::FDiv: Out << " / "; break;
2433 case Instruction::And: Out << " & "; break;
2434 case Instruction::Or: Out << " | "; break;
2435 case Instruction::Xor: Out << " ^ "; break;
2436 case Instruction::Shl : Out << " << "; break;
2437 case Instruction::LShr:
2438 case Instruction::AShr: Out << " >> "; break;
2439 default: cerr << "Invalid operator type!" << I; abort();
2442 writeOperandWithCast(I.getOperand(1), I.getOpcode());
2443 if (NeedsClosingParens)
2452 void CWriter::visitICmpInst(ICmpInst &I) {
2453 // We must cast the results of icmp which might be promoted.
2454 bool needsCast = false;
2456 // Write out the cast of the instruction's value back to the proper type
2458 bool NeedsClosingParens = writeInstructionCast(I);
2460 // Certain icmp predicate require the operand to be forced to a specific type
2461 // so we use writeOperandWithCast here instead of writeOperand. Similarly
2462 // below for operand 1
2463 writeOperandWithCast(I.getOperand(0), I);
2465 switch (I.getPredicate()) {
2466 case ICmpInst::ICMP_EQ: Out << " == "; break;
2467 case ICmpInst::ICMP_NE: Out << " != "; break;
2468 case ICmpInst::ICMP_ULE:
2469 case ICmpInst::ICMP_SLE: Out << " <= "; break;
2470 case ICmpInst::ICMP_UGE:
2471 case ICmpInst::ICMP_SGE: Out << " >= "; break;
2472 case ICmpInst::ICMP_ULT:
2473 case ICmpInst::ICMP_SLT: Out << " < "; break;
2474 case ICmpInst::ICMP_UGT:
2475 case ICmpInst::ICMP_SGT: Out << " > "; break;
2476 default: cerr << "Invalid icmp predicate!" << I; abort();
2479 writeOperandWithCast(I.getOperand(1), I);
2480 if (NeedsClosingParens)
2488 void CWriter::visitFCmpInst(FCmpInst &I) {
2489 if (I.getPredicate() == FCmpInst::FCMP_FALSE) {
2493 if (I.getPredicate() == FCmpInst::FCMP_TRUE) {
2499 switch (I.getPredicate()) {
2500 default: assert(0 && "Illegal FCmp predicate");
2501 case FCmpInst::FCMP_ORD: op = "ord"; break;
2502 case FCmpInst::FCMP_UNO: op = "uno"; break;
2503 case FCmpInst::FCMP_UEQ: op = "ueq"; break;
2504 case FCmpInst::FCMP_UNE: op = "une"; break;
2505 case FCmpInst::FCMP_ULT: op = "ult"; break;
2506 case FCmpInst::FCMP_ULE: op = "ule"; break;
2507 case FCmpInst::FCMP_UGT: op = "ugt"; break;
2508 case FCmpInst::FCMP_UGE: op = "uge"; break;
2509 case FCmpInst::FCMP_OEQ: op = "oeq"; break;
2510 case FCmpInst::FCMP_ONE: op = "one"; break;
2511 case FCmpInst::FCMP_OLT: op = "olt"; break;
2512 case FCmpInst::FCMP_OLE: op = "ole"; break;
2513 case FCmpInst::FCMP_OGT: op = "ogt"; break;
2514 case FCmpInst::FCMP_OGE: op = "oge"; break;
2517 Out << "llvm_fcmp_" << op << "(";
2518 // Write the first operand
2519 writeOperand(I.getOperand(0));
2521 // Write the second operand
2522 writeOperand(I.getOperand(1));
2526 static const char * getFloatBitCastField(const Type *Ty) {
2527 switch (Ty->getTypeID()) {
2528 default: assert(0 && "Invalid Type");
2529 case Type::FloatTyID: return "Float";
2530 case Type::DoubleTyID: return "Double";
2531 case Type::IntegerTyID: {
2532 unsigned NumBits = cast<IntegerType>(Ty)->getBitWidth();
2541 void CWriter::visitCastInst(CastInst &I) {
2542 const Type *DstTy = I.getType();
2543 const Type *SrcTy = I.getOperand(0)->getType();
2544 if (isFPIntBitCast(I)) {
2546 // These int<->float and long<->double casts need to be handled specially
2547 Out << GetValueName(&I) << "__BITCAST_TEMPORARY."
2548 << getFloatBitCastField(I.getOperand(0)->getType()) << " = ";
2549 writeOperand(I.getOperand(0));
2550 Out << ", " << GetValueName(&I) << "__BITCAST_TEMPORARY."
2551 << getFloatBitCastField(I.getType());
2557 printCast(I.getOpcode(), SrcTy, DstTy);
2559 // Make a sext from i1 work by subtracting the i1 from 0 (an int).
2560 if (SrcTy == Type::Int1Ty && I.getOpcode() == Instruction::SExt)
2563 writeOperand(I.getOperand(0));
2565 if (DstTy == Type::Int1Ty &&
2566 (I.getOpcode() == Instruction::Trunc ||
2567 I.getOpcode() == Instruction::FPToUI ||
2568 I.getOpcode() == Instruction::FPToSI ||
2569 I.getOpcode() == Instruction::PtrToInt)) {
2570 // Make sure we really get a trunc to bool by anding the operand with 1
2576 void CWriter::visitSelectInst(SelectInst &I) {
2578 writeOperand(I.getCondition());
2580 writeOperand(I.getTrueValue());
2582 writeOperand(I.getFalseValue());
2587 void CWriter::lowerIntrinsics(Function &F) {
2588 // This is used to keep track of intrinsics that get generated to a lowered
2589 // function. We must generate the prototypes before the function body which
2590 // will only be expanded on first use (by the loop below).
2591 std::vector<Function*> prototypesToGen;
2593 // Examine all the instructions in this function to find the intrinsics that
2594 // need to be lowered.
2595 for (Function::iterator BB = F.begin(), EE = F.end(); BB != EE; ++BB)
2596 for (BasicBlock::iterator I = BB->begin(), E = BB->end(); I != E; )
2597 if (CallInst *CI = dyn_cast<CallInst>(I++))
2598 if (Function *F = CI->getCalledFunction())
2599 switch (F->getIntrinsicID()) {
2600 case Intrinsic::not_intrinsic:
2601 case Intrinsic::memory_barrier:
2602 case Intrinsic::vastart:
2603 case Intrinsic::vacopy:
2604 case Intrinsic::vaend:
2605 case Intrinsic::returnaddress:
2606 case Intrinsic::frameaddress:
2607 case Intrinsic::setjmp:
2608 case Intrinsic::longjmp:
2609 case Intrinsic::prefetch:
2610 case Intrinsic::dbg_stoppoint:
2611 case Intrinsic::powi:
2612 case Intrinsic::x86_sse_cmp_ss:
2613 case Intrinsic::x86_sse_cmp_ps:
2614 case Intrinsic::x86_sse2_cmp_sd:
2615 case Intrinsic::x86_sse2_cmp_pd:
2616 case Intrinsic::ppc_altivec_lvsl:
2617 // We directly implement these intrinsics
2620 // If this is an intrinsic that directly corresponds to a GCC
2621 // builtin, we handle it.
2622 const char *BuiltinName = "";
2623 #define GET_GCC_BUILTIN_NAME
2624 #include "llvm/Intrinsics.gen"
2625 #undef GET_GCC_BUILTIN_NAME
2626 // If we handle it, don't lower it.
2627 if (BuiltinName[0]) break;
2629 // All other intrinsic calls we must lower.
2630 Instruction *Before = 0;
2631 if (CI != &BB->front())
2632 Before = prior(BasicBlock::iterator(CI));
2634 IL->LowerIntrinsicCall(CI);
2635 if (Before) { // Move iterator to instruction after call
2640 // If the intrinsic got lowered to another call, and that call has
2641 // a definition then we need to make sure its prototype is emitted
2642 // before any calls to it.
2643 if (CallInst *Call = dyn_cast<CallInst>(I))
2644 if (Function *NewF = Call->getCalledFunction())
2645 if (!NewF->isDeclaration())
2646 prototypesToGen.push_back(NewF);
2651 // We may have collected some prototypes to emit in the loop above.
2652 // Emit them now, before the function that uses them is emitted. But,
2653 // be careful not to emit them twice.
2654 std::vector<Function*>::iterator I = prototypesToGen.begin();
2655 std::vector<Function*>::iterator E = prototypesToGen.end();
2656 for ( ; I != E; ++I) {
2657 if (intrinsicPrototypesAlreadyGenerated.insert(*I).second) {
2659 printFunctionSignature(*I, true);
2665 void CWriter::visitCallInst(CallInst &I) {
2666 if (isa<InlineAsm>(I.getOperand(0)))
2667 return visitInlineAsm(I);
2669 bool WroteCallee = false;
2671 // Handle intrinsic function calls first...
2672 if (Function *F = I.getCalledFunction())
2673 if (Intrinsic::ID ID = (Intrinsic::ID)F->getIntrinsicID())
2674 if (visitBuiltinCall(I, ID, WroteCallee))
2677 Value *Callee = I.getCalledValue();
2679 const PointerType *PTy = cast<PointerType>(Callee->getType());
2680 const FunctionType *FTy = cast<FunctionType>(PTy->getElementType());
2682 // If this is a call to a struct-return function, assign to the first
2683 // parameter instead of passing it to the call.
2684 const PAListPtr &PAL = I.getParamAttrs();
2685 bool hasByVal = I.hasByValArgument();
2686 bool isStructRet = I.hasStructRetAttr();
2688 writeOperandDeref(I.getOperand(1));
2692 if (I.isTailCall()) Out << " /*tail*/ ";
2695 // If this is an indirect call to a struct return function, we need to cast
2696 // the pointer. Ditto for indirect calls with byval arguments.
2697 bool NeedsCast = (hasByVal || isStructRet) && !isa<Function>(Callee);
2699 // GCC is a real PITA. It does not permit codegening casts of functions to
2700 // function pointers if they are in a call (it generates a trap instruction
2701 // instead!). We work around this by inserting a cast to void* in between
2702 // the function and the function pointer cast. Unfortunately, we can't just
2703 // form the constant expression here, because the folder will immediately
2706 // Note finally, that this is completely unsafe. ANSI C does not guarantee
2707 // that void* and function pointers have the same size. :( To deal with this
2708 // in the common case, we handle casts where the number of arguments passed
2711 if (ConstantExpr *CE = dyn_cast<ConstantExpr>(Callee))
2713 if (Function *RF = dyn_cast<Function>(CE->getOperand(0))) {
2719 // Ok, just cast the pointer type.
2722 printStructReturnPointerFunctionType(Out, PAL,
2723 cast<PointerType>(I.getCalledValue()->getType()));
2725 printType(Out, I.getCalledValue()->getType(), false, "", true, PAL);
2727 printType(Out, I.getCalledValue()->getType());
2730 writeOperand(Callee);
2731 if (NeedsCast) Out << ')';
2736 unsigned NumDeclaredParams = FTy->getNumParams();
2738 CallSite::arg_iterator AI = I.op_begin()+1, AE = I.op_end();
2740 if (isStructRet) { // Skip struct return argument.
2745 bool PrintedArg = false;
2746 for (; AI != AE; ++AI, ++ArgNo) {
2747 if (PrintedArg) Out << ", ";
2748 if (ArgNo < NumDeclaredParams &&
2749 (*AI)->getType() != FTy->getParamType(ArgNo)) {
2751 printType(Out, FTy->getParamType(ArgNo),
2752 /*isSigned=*/PAL.paramHasAttr(ArgNo+1, ParamAttr::SExt));
2755 // Check if the argument is expected to be passed by value.
2756 if (I.paramHasAttr(ArgNo+1, ParamAttr::ByVal))
2757 writeOperandDeref(*AI);
2765 /// visitBuiltinCall - Handle the call to the specified builtin. Returns true
2766 /// if the entire call is handled, return false it it wasn't handled, and
2767 /// optionally set 'WroteCallee' if the callee has already been printed out.
2768 bool CWriter::visitBuiltinCall(CallInst &I, Intrinsic::ID ID,
2769 bool &WroteCallee) {
2772 // If this is an intrinsic that directly corresponds to a GCC
2773 // builtin, we emit it here.
2774 const char *BuiltinName = "";
2775 Function *F = I.getCalledFunction();
2776 #define GET_GCC_BUILTIN_NAME
2777 #include "llvm/Intrinsics.gen"
2778 #undef GET_GCC_BUILTIN_NAME
2779 assert(BuiltinName[0] && "Unknown LLVM intrinsic!");
2785 case Intrinsic::memory_barrier:
2786 Out << "__sync_synchronize()";
2788 case Intrinsic::vastart:
2791 Out << "va_start(*(va_list*)";
2792 writeOperand(I.getOperand(1));
2794 // Output the last argument to the enclosing function.
2795 if (I.getParent()->getParent()->arg_empty()) {
2796 cerr << "The C backend does not currently support zero "
2797 << "argument varargs functions, such as '"
2798 << I.getParent()->getParent()->getName() << "'!\n";
2801 writeOperand(--I.getParent()->getParent()->arg_end());
2804 case Intrinsic::vaend:
2805 if (!isa<ConstantPointerNull>(I.getOperand(1))) {
2806 Out << "0; va_end(*(va_list*)";
2807 writeOperand(I.getOperand(1));
2810 Out << "va_end(*(va_list*)0)";
2813 case Intrinsic::vacopy:
2815 Out << "va_copy(*(va_list*)";
2816 writeOperand(I.getOperand(1));
2817 Out << ", *(va_list*)";
2818 writeOperand(I.getOperand(2));
2821 case Intrinsic::returnaddress:
2822 Out << "__builtin_return_address(";
2823 writeOperand(I.getOperand(1));
2826 case Intrinsic::frameaddress:
2827 Out << "__builtin_frame_address(";
2828 writeOperand(I.getOperand(1));
2831 case Intrinsic::powi:
2832 Out << "__builtin_powi(";
2833 writeOperand(I.getOperand(1));
2835 writeOperand(I.getOperand(2));
2838 case Intrinsic::setjmp:
2839 Out << "setjmp(*(jmp_buf*)";
2840 writeOperand(I.getOperand(1));
2843 case Intrinsic::longjmp:
2844 Out << "longjmp(*(jmp_buf*)";
2845 writeOperand(I.getOperand(1));
2847 writeOperand(I.getOperand(2));
2850 case Intrinsic::prefetch:
2851 Out << "LLVM_PREFETCH((const void *)";
2852 writeOperand(I.getOperand(1));
2854 writeOperand(I.getOperand(2));
2856 writeOperand(I.getOperand(3));
2859 case Intrinsic::stacksave:
2860 // Emit this as: Val = 0; *((void**)&Val) = __builtin_stack_save()
2861 // to work around GCC bugs (see PR1809).
2862 Out << "0; *((void**)&" << GetValueName(&I)
2863 << ") = __builtin_stack_save()";
2865 case Intrinsic::dbg_stoppoint: {
2866 // If we use writeOperand directly we get a "u" suffix which is rejected
2868 DbgStopPointInst &SPI = cast<DbgStopPointInst>(I);
2871 << " \"" << SPI.getDirectory()
2872 << SPI.getFileName() << "\"\n";
2875 case Intrinsic::x86_sse_cmp_ss:
2876 case Intrinsic::x86_sse_cmp_ps:
2877 case Intrinsic::x86_sse2_cmp_sd:
2878 case Intrinsic::x86_sse2_cmp_pd:
2880 printType(Out, I.getType());
2882 // Multiple GCC builtins multiplex onto this intrinsic.
2883 switch (cast<ConstantInt>(I.getOperand(3))->getZExtValue()) {
2884 default: assert(0 && "Invalid llvm.x86.sse.cmp!");
2885 case 0: Out << "__builtin_ia32_cmpeq"; break;
2886 case 1: Out << "__builtin_ia32_cmplt"; break;
2887 case 2: Out << "__builtin_ia32_cmple"; break;
2888 case 3: Out << "__builtin_ia32_cmpunord"; break;
2889 case 4: Out << "__builtin_ia32_cmpneq"; break;
2890 case 5: Out << "__builtin_ia32_cmpnlt"; break;
2891 case 6: Out << "__builtin_ia32_cmpnle"; break;
2892 case 7: Out << "__builtin_ia32_cmpord"; break;
2894 if (ID == Intrinsic::x86_sse_cmp_ps || ID == Intrinsic::x86_sse2_cmp_pd)
2898 if (ID == Intrinsic::x86_sse_cmp_ss || ID == Intrinsic::x86_sse_cmp_ps)
2904 writeOperand(I.getOperand(1));
2906 writeOperand(I.getOperand(2));
2909 case Intrinsic::ppc_altivec_lvsl:
2911 printType(Out, I.getType());
2913 Out << "__builtin_altivec_lvsl(0, (void*)";
2914 writeOperand(I.getOperand(1));
2920 //This converts the llvm constraint string to something gcc is expecting.
2921 //TODO: work out platform independent constraints and factor those out
2922 // of the per target tables
2923 // handle multiple constraint codes
2924 std::string CWriter::InterpretASMConstraint(InlineAsm::ConstraintInfo& c) {
2926 assert(c.Codes.size() == 1 && "Too many asm constraint codes to handle");
2928 const char *const *table = 0;
2930 //Grab the translation table from TargetAsmInfo if it exists
2933 const TargetMachineRegistry::entry* Match =
2934 TargetMachineRegistry::getClosestStaticTargetForModule(*TheModule, E);
2936 //Per platform Target Machines don't exist, so create it
2937 // this must be done only once
2938 const TargetMachine* TM = Match->CtorFn(*TheModule, "");
2939 TAsm = TM->getTargetAsmInfo();
2943 table = TAsm->getAsmCBE();
2945 //Search the translation table if it exists
2946 for (int i = 0; table && table[i]; i += 2)
2947 if (c.Codes[0] == table[i])
2950 //default is identity
2954 //TODO: import logic from AsmPrinter.cpp
2955 static std::string gccifyAsm(std::string asmstr) {
2956 for (std::string::size_type i = 0; i != asmstr.size(); ++i)
2957 if (asmstr[i] == '\n')
2958 asmstr.replace(i, 1, "\\n");
2959 else if (asmstr[i] == '\t')
2960 asmstr.replace(i, 1, "\\t");
2961 else if (asmstr[i] == '$') {
2962 if (asmstr[i + 1] == '{') {
2963 std::string::size_type a = asmstr.find_first_of(':', i + 1);
2964 std::string::size_type b = asmstr.find_first_of('}', i + 1);
2965 std::string n = "%" +
2966 asmstr.substr(a + 1, b - a - 1) +
2967 asmstr.substr(i + 2, a - i - 2);
2968 asmstr.replace(i, b - i + 1, n);
2971 asmstr.replace(i, 1, "%");
2973 else if (asmstr[i] == '%')//grr
2974 { asmstr.replace(i, 1, "%%"); ++i;}
2979 //TODO: assumptions about what consume arguments from the call are likely wrong
2980 // handle communitivity
2981 void CWriter::visitInlineAsm(CallInst &CI) {
2982 InlineAsm* as = cast<InlineAsm>(CI.getOperand(0));
2983 std::vector<InlineAsm::ConstraintInfo> Constraints = as->ParseConstraints();
2985 std::vector<std::pair<Value*, int> > ResultVals;
2986 if (CI.getType() == Type::VoidTy)
2988 else if (const StructType *ST = dyn_cast<StructType>(CI.getType())) {
2989 for (unsigned i = 0, e = ST->getNumElements(); i != e; ++i)
2990 ResultVals.push_back(std::make_pair(&CI, (int)i));
2992 ResultVals.push_back(std::make_pair(&CI, -1));
2995 // Fix up the asm string for gcc and emit it.
2996 Out << "__asm__ volatile (\"" << gccifyAsm(as->getAsmString()) << "\"\n";
2999 unsigned ValueCount = 0;
3000 bool IsFirst = true;
3002 // Convert over all the output constraints.
3003 for (std::vector<InlineAsm::ConstraintInfo>::iterator I = Constraints.begin(),
3004 E = Constraints.end(); I != E; ++I) {
3006 if (I->Type != InlineAsm::isOutput) {
3008 continue; // Ignore non-output constraints.
3011 assert(I->Codes.size() == 1 && "Too many asm constraint codes to handle");
3012 std::string C = InterpretASMConstraint(*I);
3013 if (C.empty()) continue;
3024 if (ValueCount < ResultVals.size()) {
3025 DestVal = ResultVals[ValueCount].first;
3026 DestValNo = ResultVals[ValueCount].second;
3028 DestVal = CI.getOperand(ValueCount-ResultVals.size()+1);
3030 if (I->isEarlyClobber)
3033 Out << "\"=" << C << "\"(" << GetValueName(DestVal);
3034 if (DestValNo != -1)
3035 Out << ".field" << DestValNo; // Multiple retvals.
3041 // Convert over all the input constraints.
3045 for (std::vector<InlineAsm::ConstraintInfo>::iterator I = Constraints.begin(),
3046 E = Constraints.end(); I != E; ++I) {
3047 if (I->Type != InlineAsm::isInput) {
3049 continue; // Ignore non-input constraints.
3052 assert(I->Codes.size() == 1 && "Too many asm constraint codes to handle");
3053 std::string C = InterpretASMConstraint(*I);
3054 if (C.empty()) continue;
3061 assert(ValueCount >= ResultVals.size() && "Input can't refer to result");
3062 Value *SrcVal = CI.getOperand(ValueCount-ResultVals.size()+1);
3064 Out << "\"" << C << "\"(";
3066 writeOperand(SrcVal);
3068 writeOperandDeref(SrcVal);
3072 // Convert over the clobber constraints.
3075 for (std::vector<InlineAsm::ConstraintInfo>::iterator I = Constraints.begin(),
3076 E = Constraints.end(); I != E; ++I) {
3077 if (I->Type != InlineAsm::isClobber)
3078 continue; // Ignore non-input constraints.
3080 assert(I->Codes.size() == 1 && "Too many asm constraint codes to handle");
3081 std::string C = InterpretASMConstraint(*I);
3082 if (C.empty()) continue;
3089 Out << '\"' << C << '"';
3095 void CWriter::visitMallocInst(MallocInst &I) {
3096 assert(0 && "lowerallocations pass didn't work!");
3099 void CWriter::visitAllocaInst(AllocaInst &I) {
3101 printType(Out, I.getType());
3102 Out << ") alloca(sizeof(";
3103 printType(Out, I.getType()->getElementType());
3105 if (I.isArrayAllocation()) {
3107 writeOperand(I.getOperand(0));
3112 void CWriter::visitFreeInst(FreeInst &I) {
3113 assert(0 && "lowerallocations pass didn't work!");
3116 void CWriter::printGEPExpression(Value *Ptr, gep_type_iterator I,
3117 gep_type_iterator E) {
3119 // If there are no indices, just print out the pointer.
3125 // Find out if the last index is into a vector. If so, we have to print this
3126 // specially. Since vectors can't have elements of indexable type, only the
3127 // last index could possibly be of a vector element.
3128 const VectorType *LastIndexIsVector = 0;
3130 for (gep_type_iterator TmpI = I; TmpI != E; ++TmpI)
3131 LastIndexIsVector = dyn_cast<VectorType>(*TmpI);
3136 // If the last index is into a vector, we can't print it as &a[i][j] because
3137 // we can't index into a vector with j in GCC. Instead, emit this as
3138 // (((float*)&a[i])+j)
3139 if (LastIndexIsVector) {
3141 printType(Out, PointerType::getUnqual(LastIndexIsVector->getElementType()));
3147 // If the first index is 0 (very typical) we can do a number of
3148 // simplifications to clean up the code.
3149 Value *FirstOp = I.getOperand();
3150 if (!isa<Constant>(FirstOp) || !cast<Constant>(FirstOp)->isNullValue()) {
3151 // First index isn't simple, print it the hard way.
3154 ++I; // Skip the zero index.
3156 // Okay, emit the first operand. If Ptr is something that is already address
3157 // exposed, like a global, avoid emitting (&foo)[0], just emit foo instead.
3158 if (isAddressExposed(Ptr)) {
3159 writeOperandInternal(Ptr);
3160 } else if (I != E && isa<StructType>(*I)) {
3161 // If we didn't already emit the first operand, see if we can print it as
3162 // P->f instead of "P[0].f"
3164 Out << "->field" << cast<ConstantInt>(I.getOperand())->getZExtValue();
3165 ++I; // eat the struct index as well.
3167 // Instead of emitting P[0][1], emit (*P)[1], which is more idiomatic.
3174 for (; I != E; ++I) {
3175 if (isa<StructType>(*I)) {
3176 Out << ".field" << cast<ConstantInt>(I.getOperand())->getZExtValue();
3177 } else if (isa<ArrayType>(*I)) {
3179 writeOperandWithCast(I.getOperand(), Instruction::GetElementPtr);
3181 } else if (!isa<VectorType>(*I)) {
3183 writeOperandWithCast(I.getOperand(), Instruction::GetElementPtr);
3186 // If the last index is into a vector, then print it out as "+j)". This
3187 // works with the 'LastIndexIsVector' code above.
3188 if (isa<Constant>(I.getOperand()) &&
3189 cast<Constant>(I.getOperand())->isNullValue()) {
3190 Out << "))"; // avoid "+0".
3193 writeOperandWithCast(I.getOperand(), Instruction::GetElementPtr);
3201 void CWriter::writeMemoryAccess(Value *Operand, const Type *OperandType,
3202 bool IsVolatile, unsigned Alignment) {
3204 bool IsUnaligned = Alignment &&
3205 Alignment < TD->getABITypeAlignment(OperandType);
3209 if (IsVolatile || IsUnaligned) {
3212 Out << "struct __attribute__ ((packed, aligned(" << Alignment << "))) {";
3213 printType(Out, OperandType, false, IsUnaligned ? "data" : "volatile*");
3216 if (IsVolatile) Out << "volatile ";
3222 writeOperand(Operand);
3224 if (IsVolatile || IsUnaligned) {
3231 void CWriter::visitLoadInst(LoadInst &I) {
3232 writeMemoryAccess(I.getOperand(0), I.getType(), I.isVolatile(),
3237 void CWriter::visitStoreInst(StoreInst &I) {
3238 writeMemoryAccess(I.getPointerOperand(), I.getOperand(0)->getType(),
3239 I.isVolatile(), I.getAlignment());
3241 Value *Operand = I.getOperand(0);
3242 Constant *BitMask = 0;
3243 if (const IntegerType* ITy = dyn_cast<IntegerType>(Operand->getType()))
3244 if (!ITy->isPowerOf2ByteWidth())
3245 // We have a bit width that doesn't match an even power-of-2 byte
3246 // size. Consequently we must & the value with the type's bit mask
3247 BitMask = ConstantInt::get(ITy, ITy->getBitMask());
3250 writeOperand(Operand);
3253 printConstant(BitMask);
3258 void CWriter::visitGetElementPtrInst(GetElementPtrInst &I) {
3259 printGEPExpression(I.getPointerOperand(), gep_type_begin(I),
3263 void CWriter::visitVAArgInst(VAArgInst &I) {
3264 Out << "va_arg(*(va_list*)";
3265 writeOperand(I.getOperand(0));
3267 printType(Out, I.getType());
3271 void CWriter::visitInsertElementInst(InsertElementInst &I) {
3272 const Type *EltTy = I.getType()->getElementType();
3273 writeOperand(I.getOperand(0));
3276 printType(Out, PointerType::getUnqual(EltTy));
3277 Out << ")(&" << GetValueName(&I) << "))[";
3278 writeOperand(I.getOperand(2));
3280 writeOperand(I.getOperand(1));
3284 void CWriter::visitExtractElementInst(ExtractElementInst &I) {
3285 // We know that our operand is not inlined.
3288 cast<VectorType>(I.getOperand(0)->getType())->getElementType();
3289 printType(Out, PointerType::getUnqual(EltTy));
3290 Out << ")(&" << GetValueName(I.getOperand(0)) << "))[";
3291 writeOperand(I.getOperand(1));
3295 void CWriter::visitShuffleVectorInst(ShuffleVectorInst &SVI) {
3297 printType(Out, SVI.getType());
3299 const VectorType *VT = SVI.getType();
3300 unsigned NumElts = VT->getNumElements();
3301 const Type *EltTy = VT->getElementType();
3303 for (unsigned i = 0; i != NumElts; ++i) {
3305 int SrcVal = SVI.getMaskValue(i);
3306 if ((unsigned)SrcVal >= NumElts*2) {
3307 Out << " 0/*undef*/ ";
3309 Value *Op = SVI.getOperand((unsigned)SrcVal >= NumElts);
3310 if (isa<Instruction>(Op)) {
3311 // Do an extractelement of this value from the appropriate input.
3313 printType(Out, PointerType::getUnqual(EltTy));
3314 Out << ")(&" << GetValueName(Op)
3315 << "))[" << (SrcVal & (NumElts-1)) << "]";
3316 } else if (isa<ConstantAggregateZero>(Op) || isa<UndefValue>(Op)) {
3319 printConstant(cast<ConstantVector>(Op)->getOperand(SrcVal &
3327 void CWriter::visitInsertValueInst(InsertValueInst &IVI) {
3328 // Start by copying the entire aggregate value into the result variable.
3329 writeOperand(IVI.getOperand(0));
3332 // Then do the insert to update the field.
3333 Out << GetValueName(&IVI);
3334 for (const unsigned *b = IVI.idx_begin(), *i = b, *e = IVI.idx_end();
3336 const Type *IndexedTy =
3337 ExtractValueInst::getIndexedType(IVI.getOperand(0)->getType(), b, i+1);
3338 if (isa<ArrayType>(IndexedTy))
3339 Out << ".array[" << *i << "]";
3341 Out << ".field" << *i;
3344 writeOperand(IVI.getOperand(1));
3347 void CWriter::visitExtractValueInst(ExtractValueInst &EVI) {
3349 if (isa<UndefValue>(EVI.getOperand(0))) {
3351 printType(Out, EVI.getType());
3352 Out << ") 0/*UNDEF*/";
3354 Out << GetValueName(EVI.getOperand(0));
3355 for (const unsigned *b = EVI.idx_begin(), *i = b, *e = EVI.idx_end();
3357 const Type *IndexedTy =
3358 ExtractValueInst::getIndexedType(EVI.getOperand(0)->getType(), b, i+1);
3359 if (isa<ArrayType>(IndexedTy))
3360 Out << ".array[" << *i << "]";
3362 Out << ".field" << *i;
3368 //===----------------------------------------------------------------------===//
3369 // External Interface declaration
3370 //===----------------------------------------------------------------------===//
3372 bool CTargetMachine::addPassesToEmitWholeFile(PassManager &PM,
3374 CodeGenFileType FileType,
3376 if (FileType != TargetMachine::AssemblyFile) return true;
3378 PM.add(createGCLoweringPass());
3379 PM.add(createLowerAllocationsPass(true));
3380 PM.add(createLowerInvokePass());
3381 PM.add(createCFGSimplificationPass()); // clean up after lower invoke.
3382 PM.add(new CBackendNameAllUsedStructsAndMergeFunctions());
3383 PM.add(new CWriter(o));
3384 PM.add(createCollectorMetadataDeleter());