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, bool Static = false);
157 void writeInstComputationInline(Instruction &I);
158 void writeOperandInternal(Value *Operand, bool Static = false);
159 void writeOperandWithCast(Value* Operand, unsigned Opcode);
160 void writeOperandWithCast(Value* Operand, const ICmpInst &I);
161 bool writeInstructionCast(const Instruction &I);
163 void writeMemoryAccess(Value *Operand, const Type *OperandType,
164 bool IsVolatile, unsigned Alignment);
167 std::string InterpretASMConstraint(InlineAsm::ConstraintInfo& c);
169 void lowerIntrinsics(Function &F);
171 void printModule(Module *M);
172 void printModuleTypes(const TypeSymbolTable &ST);
173 void printContainedStructs(const Type *Ty, std::set<const Type *> &);
174 void printFloatingPointConstants(Function &F);
175 void printFunctionSignature(const Function *F, bool Prototype);
177 void printFunction(Function &);
178 void printBasicBlock(BasicBlock *BB);
179 void printLoop(Loop *L);
181 void printCast(unsigned opcode, const Type *SrcTy, const Type *DstTy);
182 void printConstant(Constant *CPV, bool Static);
183 void printConstantWithCast(Constant *CPV, unsigned Opcode);
184 bool printConstExprCast(const ConstantExpr *CE, bool Static);
185 void printConstantArray(ConstantArray *CPA, bool Static);
186 void printConstantVector(ConstantVector *CV, bool Static);
188 /// isAddressExposed - Return true if the specified value's name needs to
189 /// have its address taken in order to get a C value of the correct type.
190 /// This happens for global variables, byval parameters, and direct allocas.
191 bool isAddressExposed(const Value *V) const {
192 if (const Argument *A = dyn_cast<Argument>(V))
193 return ByValParams.count(A);
194 return isa<GlobalVariable>(V) || isDirectAlloca(V);
197 // isInlinableInst - Attempt to inline instructions into their uses to build
198 // trees as much as possible. To do this, we have to consistently decide
199 // what is acceptable to inline, so that variable declarations don't get
200 // printed and an extra copy of the expr is not emitted.
202 static bool isInlinableInst(const Instruction &I) {
203 // Always inline cmp instructions, even if they are shared by multiple
204 // expressions. GCC generates horrible code if we don't.
208 // Must be an expression, must be used exactly once. If it is dead, we
209 // emit it inline where it would go.
210 if (I.getType() == Type::VoidTy || !I.hasOneUse() ||
211 isa<TerminatorInst>(I) || isa<CallInst>(I) || isa<PHINode>(I) ||
212 isa<LoadInst>(I) || isa<VAArgInst>(I) || isa<InsertElementInst>(I) ||
213 isa<InsertValueInst>(I))
214 // Don't inline a load across a store or other bad things!
217 // Must not be used in inline asm, extractelement, or shufflevector.
219 const Instruction &User = cast<Instruction>(*I.use_back());
220 if (isInlineAsm(User) || isa<ExtractElementInst>(User) ||
221 isa<ShuffleVectorInst>(User))
225 // Only inline instruction it if it's use is in the same BB as the inst.
226 return I.getParent() == cast<Instruction>(I.use_back())->getParent();
229 // isDirectAlloca - Define fixed sized allocas in the entry block as direct
230 // variables which are accessed with the & operator. This causes GCC to
231 // generate significantly better code than to emit alloca calls directly.
233 static const AllocaInst *isDirectAlloca(const Value *V) {
234 const AllocaInst *AI = dyn_cast<AllocaInst>(V);
235 if (!AI) return false;
236 if (AI->isArrayAllocation())
237 return 0; // FIXME: we can also inline fixed size array allocas!
238 if (AI->getParent() != &AI->getParent()->getParent()->getEntryBlock())
243 // isInlineAsm - Check if the instruction is a call to an inline asm chunk
244 static bool isInlineAsm(const Instruction& I) {
245 if (isa<CallInst>(&I) && isa<InlineAsm>(I.getOperand(0)))
250 // Instruction visitation functions
251 friend class InstVisitor<CWriter>;
253 void visitReturnInst(ReturnInst &I);
254 void visitBranchInst(BranchInst &I);
255 void visitSwitchInst(SwitchInst &I);
256 void visitInvokeInst(InvokeInst &I) {
257 assert(0 && "Lowerinvoke pass didn't work!");
260 void visitUnwindInst(UnwindInst &I) {
261 assert(0 && "Lowerinvoke pass didn't work!");
263 void visitUnreachableInst(UnreachableInst &I);
265 void visitPHINode(PHINode &I);
266 void visitBinaryOperator(Instruction &I);
267 void visitICmpInst(ICmpInst &I);
268 void visitFCmpInst(FCmpInst &I);
270 void visitCastInst (CastInst &I);
271 void visitSelectInst(SelectInst &I);
272 void visitCallInst (CallInst &I);
273 void visitInlineAsm(CallInst &I);
274 bool visitBuiltinCall(CallInst &I, Intrinsic::ID ID, bool &WroteCallee);
276 void visitMallocInst(MallocInst &I);
277 void visitAllocaInst(AllocaInst &I);
278 void visitFreeInst (FreeInst &I);
279 void visitLoadInst (LoadInst &I);
280 void visitStoreInst (StoreInst &I);
281 void visitGetElementPtrInst(GetElementPtrInst &I);
282 void visitVAArgInst (VAArgInst &I);
284 void visitInsertElementInst(InsertElementInst &I);
285 void visitExtractElementInst(ExtractElementInst &I);
286 void visitShuffleVectorInst(ShuffleVectorInst &SVI);
288 void visitInsertValueInst(InsertValueInst &I);
289 void visitExtractValueInst(ExtractValueInst &I);
291 void visitInstruction(Instruction &I) {
292 cerr << "C Writer does not know about " << I;
296 void outputLValue(Instruction *I) {
297 Out << " " << GetValueName(I) << " = ";
300 bool isGotoCodeNecessary(BasicBlock *From, BasicBlock *To);
301 void printPHICopiesForSuccessor(BasicBlock *CurBlock,
302 BasicBlock *Successor, unsigned Indent);
303 void printBranchToBlock(BasicBlock *CurBlock, BasicBlock *SuccBlock,
305 void printGEPExpression(Value *Ptr, gep_type_iterator I,
306 gep_type_iterator E, bool Static);
308 std::string GetValueName(const Value *Operand);
312 char CWriter::ID = 0;
314 /// This method inserts names for any unnamed structure types that are used by
315 /// the program, and removes names from structure types that are not used by the
318 bool CBackendNameAllUsedStructsAndMergeFunctions::runOnModule(Module &M) {
319 // Get a set of types that are used by the program...
320 std::set<const Type *> UT = getAnalysis<FindUsedTypes>().getTypes();
322 // Loop over the module symbol table, removing types from UT that are
323 // already named, and removing names for types that are not used.
325 TypeSymbolTable &TST = M.getTypeSymbolTable();
326 for (TypeSymbolTable::iterator TI = TST.begin(), TE = TST.end();
328 TypeSymbolTable::iterator I = TI++;
330 // If this isn't a struct or array type, remove it from our set of types
331 // to name. This simplifies emission later.
332 if (!isa<StructType>(I->second) && !isa<OpaqueType>(I->second) &&
333 !isa<ArrayType>(I->second)) {
336 // If this is not used, remove it from the symbol table.
337 std::set<const Type *>::iterator UTI = UT.find(I->second);
341 UT.erase(UTI); // Only keep one name for this type.
345 // UT now contains types that are not named. Loop over it, naming
348 bool Changed = false;
349 unsigned RenameCounter = 0;
350 for (std::set<const Type *>::const_iterator I = UT.begin(), E = UT.end();
352 if (isa<StructType>(*I) || isa<ArrayType>(*I)) {
353 while (M.addTypeName("unnamed"+utostr(RenameCounter), *I))
359 // Loop over all external functions and globals. If we have two with
360 // identical names, merge them.
361 // FIXME: This code should disappear when we don't allow values with the same
362 // names when they have different types!
363 std::map<std::string, GlobalValue*> ExtSymbols;
364 for (Module::iterator I = M.begin(), E = M.end(); I != E;) {
366 if (GV->isDeclaration() && GV->hasName()) {
367 std::pair<std::map<std::string, GlobalValue*>::iterator, bool> X
368 = ExtSymbols.insert(std::make_pair(GV->getName(), GV));
370 // Found a conflict, replace this global with the previous one.
371 GlobalValue *OldGV = X.first->second;
372 GV->replaceAllUsesWith(ConstantExpr::getBitCast(OldGV, GV->getType()));
373 GV->eraseFromParent();
378 // Do the same for globals.
379 for (Module::global_iterator I = M.global_begin(), E = M.global_end();
381 GlobalVariable *GV = I++;
382 if (GV->isDeclaration() && GV->hasName()) {
383 std::pair<std::map<std::string, GlobalValue*>::iterator, bool> X
384 = ExtSymbols.insert(std::make_pair(GV->getName(), GV));
386 // Found a conflict, replace this global with the previous one.
387 GlobalValue *OldGV = X.first->second;
388 GV->replaceAllUsesWith(ConstantExpr::getBitCast(OldGV, GV->getType()));
389 GV->eraseFromParent();
398 /// printStructReturnPointerFunctionType - This is like printType for a struct
399 /// return type, except, instead of printing the type as void (*)(Struct*, ...)
400 /// print it as "Struct (*)(...)", for struct return functions.
401 void CWriter::printStructReturnPointerFunctionType(std::ostream &Out,
402 const PAListPtr &PAL,
403 const PointerType *TheTy) {
404 const FunctionType *FTy = cast<FunctionType>(TheTy->getElementType());
405 std::stringstream FunctionInnards;
406 FunctionInnards << " (*) (";
407 bool PrintedType = false;
409 FunctionType::param_iterator I = FTy->param_begin(), E = FTy->param_end();
410 const Type *RetTy = cast<PointerType>(I->get())->getElementType();
412 for (++I, ++Idx; I != E; ++I, ++Idx) {
414 FunctionInnards << ", ";
415 const Type *ArgTy = *I;
416 if (PAL.paramHasAttr(Idx, ParamAttr::ByVal)) {
417 assert(isa<PointerType>(ArgTy));
418 ArgTy = cast<PointerType>(ArgTy)->getElementType();
420 printType(FunctionInnards, ArgTy,
421 /*isSigned=*/PAL.paramHasAttr(Idx, ParamAttr::SExt), "");
424 if (FTy->isVarArg()) {
426 FunctionInnards << ", ...";
427 } else if (!PrintedType) {
428 FunctionInnards << "void";
430 FunctionInnards << ')';
431 std::string tstr = FunctionInnards.str();
432 printType(Out, RetTy,
433 /*isSigned=*/PAL.paramHasAttr(0, ParamAttr::SExt), tstr);
437 CWriter::printSimpleType(std::ostream &Out, const Type *Ty, bool isSigned,
438 const std::string &NameSoFar) {
439 assert((Ty->isPrimitiveType() || Ty->isInteger() || isa<VectorType>(Ty)) &&
440 "Invalid type for printSimpleType");
441 switch (Ty->getTypeID()) {
442 case Type::VoidTyID: return Out << "void " << NameSoFar;
443 case Type::IntegerTyID: {
444 unsigned NumBits = cast<IntegerType>(Ty)->getBitWidth();
446 return Out << "bool " << NameSoFar;
447 else if (NumBits <= 8)
448 return Out << (isSigned?"signed":"unsigned") << " char " << NameSoFar;
449 else if (NumBits <= 16)
450 return Out << (isSigned?"signed":"unsigned") << " short " << NameSoFar;
451 else if (NumBits <= 32)
452 return Out << (isSigned?"signed":"unsigned") << " int " << NameSoFar;
453 else if (NumBits <= 64)
454 return Out << (isSigned?"signed":"unsigned") << " long long "<< NameSoFar;
456 assert(NumBits <= 128 && "Bit widths > 128 not implemented yet");
457 return Out << (isSigned?"llvmInt128":"llvmUInt128") << " " << NameSoFar;
460 case Type::FloatTyID: return Out << "float " << NameSoFar;
461 case Type::DoubleTyID: return Out << "double " << NameSoFar;
462 // Lacking emulation of FP80 on PPC, etc., we assume whichever of these is
463 // present matches host 'long double'.
464 case Type::X86_FP80TyID:
465 case Type::PPC_FP128TyID:
466 case Type::FP128TyID: return Out << "long double " << NameSoFar;
468 case Type::VectorTyID: {
469 const VectorType *VTy = cast<VectorType>(Ty);
470 return printSimpleType(Out, VTy->getElementType(), isSigned,
471 " __attribute__((vector_size(" +
472 utostr(TD->getABITypeSize(VTy)) + " ))) " + NameSoFar);
476 cerr << "Unknown primitive type: " << *Ty << "\n";
481 // Pass the Type* and the variable name and this prints out the variable
484 std::ostream &CWriter::printType(std::ostream &Out, const Type *Ty,
485 bool isSigned, const std::string &NameSoFar,
486 bool IgnoreName, const PAListPtr &PAL) {
487 if (Ty->isPrimitiveType() || Ty->isInteger() || isa<VectorType>(Ty)) {
488 printSimpleType(Out, Ty, isSigned, NameSoFar);
492 // Check to see if the type is named.
493 if (!IgnoreName || isa<OpaqueType>(Ty)) {
494 std::map<const Type *, std::string>::iterator I = TypeNames.find(Ty);
495 if (I != TypeNames.end()) return Out << I->second << ' ' << NameSoFar;
498 switch (Ty->getTypeID()) {
499 case Type::FunctionTyID: {
500 const FunctionType *FTy = cast<FunctionType>(Ty);
501 std::stringstream FunctionInnards;
502 FunctionInnards << " (" << NameSoFar << ") (";
504 for (FunctionType::param_iterator I = FTy->param_begin(),
505 E = FTy->param_end(); I != E; ++I) {
506 const Type *ArgTy = *I;
507 if (PAL.paramHasAttr(Idx, ParamAttr::ByVal)) {
508 assert(isa<PointerType>(ArgTy));
509 ArgTy = cast<PointerType>(ArgTy)->getElementType();
511 if (I != FTy->param_begin())
512 FunctionInnards << ", ";
513 printType(FunctionInnards, ArgTy,
514 /*isSigned=*/PAL.paramHasAttr(Idx, ParamAttr::SExt), "");
517 if (FTy->isVarArg()) {
518 if (FTy->getNumParams())
519 FunctionInnards << ", ...";
520 } else if (!FTy->getNumParams()) {
521 FunctionInnards << "void";
523 FunctionInnards << ')';
524 std::string tstr = FunctionInnards.str();
525 printType(Out, FTy->getReturnType(),
526 /*isSigned=*/PAL.paramHasAttr(0, ParamAttr::SExt), tstr);
529 case Type::StructTyID: {
530 const StructType *STy = cast<StructType>(Ty);
531 Out << NameSoFar + " {\n";
533 for (StructType::element_iterator I = STy->element_begin(),
534 E = STy->element_end(); I != E; ++I) {
536 printType(Out, *I, false, "field" + utostr(Idx++));
541 Out << " __attribute__ ((packed))";
545 case Type::PointerTyID: {
546 const PointerType *PTy = cast<PointerType>(Ty);
547 std::string ptrName = "*" + NameSoFar;
549 if (isa<ArrayType>(PTy->getElementType()) ||
550 isa<VectorType>(PTy->getElementType()))
551 ptrName = "(" + ptrName + ")";
554 // Must be a function ptr cast!
555 return printType(Out, PTy->getElementType(), false, ptrName, true, PAL);
556 return printType(Out, PTy->getElementType(), false, ptrName);
559 case Type::ArrayTyID: {
560 const ArrayType *ATy = cast<ArrayType>(Ty);
561 unsigned NumElements = ATy->getNumElements();
562 if (NumElements == 0) NumElements = 1;
563 // Arrays are wrapped in structs to allow them to have normal
564 // value semantics (avoiding the array "decay").
565 Out << NameSoFar << " { ";
566 printType(Out, ATy->getElementType(), false,
567 "array[" + utostr(NumElements) + "]");
571 case Type::OpaqueTyID: {
572 static int Count = 0;
573 std::string TyName = "struct opaque_" + itostr(Count++);
574 assert(TypeNames.find(Ty) == TypeNames.end());
575 TypeNames[Ty] = TyName;
576 return Out << TyName << ' ' << NameSoFar;
579 assert(0 && "Unhandled case in getTypeProps!");
586 void CWriter::printConstantArray(ConstantArray *CPA, bool Static) {
588 // As a special case, print the array as a string if it is an array of
589 // ubytes or an array of sbytes with positive values.
591 const Type *ETy = CPA->getType()->getElementType();
592 bool isString = (ETy == Type::Int8Ty || ETy == Type::Int8Ty);
594 // Make sure the last character is a null char, as automatically added by C
595 if (isString && (CPA->getNumOperands() == 0 ||
596 !cast<Constant>(*(CPA->op_end()-1))->isNullValue()))
601 // Keep track of whether the last number was a hexadecimal escape
602 bool LastWasHex = false;
604 // Do not include the last character, which we know is null
605 for (unsigned i = 0, e = CPA->getNumOperands()-1; i != e; ++i) {
606 unsigned char C = cast<ConstantInt>(CPA->getOperand(i))->getZExtValue();
608 // Print it out literally if it is a printable character. The only thing
609 // to be careful about is when the last letter output was a hex escape
610 // code, in which case we have to be careful not to print out hex digits
611 // explicitly (the C compiler thinks it is a continuation of the previous
612 // character, sheesh...)
614 if (isprint(C) && (!LastWasHex || !isxdigit(C))) {
616 if (C == '"' || C == '\\')
623 case '\n': Out << "\\n"; break;
624 case '\t': Out << "\\t"; break;
625 case '\r': Out << "\\r"; break;
626 case '\v': Out << "\\v"; break;
627 case '\a': Out << "\\a"; break;
628 case '\"': Out << "\\\""; break;
629 case '\'': Out << "\\\'"; break;
632 Out << (char)(( C/16 < 10) ? ( C/16 +'0') : ( C/16 -10+'A'));
633 Out << (char)(((C&15) < 10) ? ((C&15)+'0') : ((C&15)-10+'A'));
642 if (CPA->getNumOperands()) {
644 printConstant(cast<Constant>(CPA->getOperand(0)), Static);
645 for (unsigned i = 1, e = CPA->getNumOperands(); i != e; ++i) {
647 printConstant(cast<Constant>(CPA->getOperand(i)), Static);
654 void CWriter::printConstantVector(ConstantVector *CP, bool Static) {
656 if (CP->getNumOperands()) {
658 printConstant(cast<Constant>(CP->getOperand(0)), Static);
659 for (unsigned i = 1, e = CP->getNumOperands(); i != e; ++i) {
661 printConstant(cast<Constant>(CP->getOperand(i)), Static);
667 // isFPCSafeToPrint - Returns true if we may assume that CFP may be written out
668 // textually as a double (rather than as a reference to a stack-allocated
669 // variable). We decide this by converting CFP to a string and back into a
670 // double, and then checking whether the conversion results in a bit-equal
671 // double to the original value of CFP. This depends on us and the target C
672 // compiler agreeing on the conversion process (which is pretty likely since we
673 // only deal in IEEE FP).
675 static bool isFPCSafeToPrint(const ConstantFP *CFP) {
676 // Do long doubles in hex for now.
677 if (CFP->getType()!=Type::FloatTy && CFP->getType()!=Type::DoubleTy)
679 APFloat APF = APFloat(CFP->getValueAPF()); // copy
680 if (CFP->getType()==Type::FloatTy)
681 APF.convert(APFloat::IEEEdouble, APFloat::rmNearestTiesToEven);
682 #if HAVE_PRINTF_A && ENABLE_CBE_PRINTF_A
684 sprintf(Buffer, "%a", APF.convertToDouble());
685 if (!strncmp(Buffer, "0x", 2) ||
686 !strncmp(Buffer, "-0x", 3) ||
687 !strncmp(Buffer, "+0x", 3))
688 return APF.bitwiseIsEqual(APFloat(atof(Buffer)));
691 std::string StrVal = ftostr(APF);
693 while (StrVal[0] == ' ')
694 StrVal.erase(StrVal.begin());
696 // Check to make sure that the stringized number is not some string like "Inf"
697 // or NaN. Check that the string matches the "[-+]?[0-9]" regex.
698 if ((StrVal[0] >= '0' && StrVal[0] <= '9') ||
699 ((StrVal[0] == '-' || StrVal[0] == '+') &&
700 (StrVal[1] >= '0' && StrVal[1] <= '9')))
701 // Reparse stringized version!
702 return APF.bitwiseIsEqual(APFloat(atof(StrVal.c_str())));
707 /// Print out the casting for a cast operation. This does the double casting
708 /// necessary for conversion to the destination type, if necessary.
709 /// @brief Print a cast
710 void CWriter::printCast(unsigned opc, const Type *SrcTy, const Type *DstTy) {
711 // Print the destination type cast
713 case Instruction::UIToFP:
714 case Instruction::SIToFP:
715 case Instruction::IntToPtr:
716 case Instruction::Trunc:
717 case Instruction::BitCast:
718 case Instruction::FPExt:
719 case Instruction::FPTrunc: // For these the DstTy sign doesn't matter
721 printType(Out, DstTy);
724 case Instruction::ZExt:
725 case Instruction::PtrToInt:
726 case Instruction::FPToUI: // For these, make sure we get an unsigned dest
728 printSimpleType(Out, DstTy, false);
731 case Instruction::SExt:
732 case Instruction::FPToSI: // For these, make sure we get a signed dest
734 printSimpleType(Out, DstTy, true);
738 assert(0 && "Invalid cast opcode");
741 // Print the source type cast
743 case Instruction::UIToFP:
744 case Instruction::ZExt:
746 printSimpleType(Out, SrcTy, false);
749 case Instruction::SIToFP:
750 case Instruction::SExt:
752 printSimpleType(Out, SrcTy, true);
755 case Instruction::IntToPtr:
756 case Instruction::PtrToInt:
757 // Avoid "cast to pointer from integer of different size" warnings
758 Out << "(unsigned long)";
760 case Instruction::Trunc:
761 case Instruction::BitCast:
762 case Instruction::FPExt:
763 case Instruction::FPTrunc:
764 case Instruction::FPToSI:
765 case Instruction::FPToUI:
766 break; // These don't need a source cast.
768 assert(0 && "Invalid cast opcode");
773 // printConstant - The LLVM Constant to C Constant converter.
774 void CWriter::printConstant(Constant *CPV, bool Static) {
775 if (const ConstantExpr *CE = dyn_cast<ConstantExpr>(CPV)) {
776 switch (CE->getOpcode()) {
777 case Instruction::Trunc:
778 case Instruction::ZExt:
779 case Instruction::SExt:
780 case Instruction::FPTrunc:
781 case Instruction::FPExt:
782 case Instruction::UIToFP:
783 case Instruction::SIToFP:
784 case Instruction::FPToUI:
785 case Instruction::FPToSI:
786 case Instruction::PtrToInt:
787 case Instruction::IntToPtr:
788 case Instruction::BitCast:
790 printCast(CE->getOpcode(), CE->getOperand(0)->getType(), CE->getType());
791 if (CE->getOpcode() == Instruction::SExt &&
792 CE->getOperand(0)->getType() == Type::Int1Ty) {
793 // Make sure we really sext from bool here by subtracting from 0
796 printConstant(CE->getOperand(0), Static);
797 if (CE->getType() == Type::Int1Ty &&
798 (CE->getOpcode() == Instruction::Trunc ||
799 CE->getOpcode() == Instruction::FPToUI ||
800 CE->getOpcode() == Instruction::FPToSI ||
801 CE->getOpcode() == Instruction::PtrToInt)) {
802 // Make sure we really truncate to bool here by anding with 1
808 case Instruction::GetElementPtr:
810 printGEPExpression(CE->getOperand(0), gep_type_begin(CPV),
811 gep_type_end(CPV), Static);
814 case Instruction::Select:
816 printConstant(CE->getOperand(0), Static);
818 printConstant(CE->getOperand(1), Static);
820 printConstant(CE->getOperand(2), Static);
823 case Instruction::Add:
824 case Instruction::Sub:
825 case Instruction::Mul:
826 case Instruction::SDiv:
827 case Instruction::UDiv:
828 case Instruction::FDiv:
829 case Instruction::URem:
830 case Instruction::SRem:
831 case Instruction::FRem:
832 case Instruction::And:
833 case Instruction::Or:
834 case Instruction::Xor:
835 case Instruction::ICmp:
836 case Instruction::Shl:
837 case Instruction::LShr:
838 case Instruction::AShr:
841 bool NeedsClosingParens = printConstExprCast(CE, Static);
842 printConstantWithCast(CE->getOperand(0), CE->getOpcode());
843 switch (CE->getOpcode()) {
844 case Instruction::Add: Out << " + "; break;
845 case Instruction::Sub: Out << " - "; break;
846 case Instruction::Mul: Out << " * "; break;
847 case Instruction::URem:
848 case Instruction::SRem:
849 case Instruction::FRem: Out << " % "; break;
850 case Instruction::UDiv:
851 case Instruction::SDiv:
852 case Instruction::FDiv: Out << " / "; break;
853 case Instruction::And: Out << " & "; break;
854 case Instruction::Or: Out << " | "; break;
855 case Instruction::Xor: Out << " ^ "; break;
856 case Instruction::Shl: Out << " << "; break;
857 case Instruction::LShr:
858 case Instruction::AShr: Out << " >> "; break;
859 case Instruction::ICmp:
860 switch (CE->getPredicate()) {
861 case ICmpInst::ICMP_EQ: Out << " == "; break;
862 case ICmpInst::ICMP_NE: Out << " != "; break;
863 case ICmpInst::ICMP_SLT:
864 case ICmpInst::ICMP_ULT: Out << " < "; break;
865 case ICmpInst::ICMP_SLE:
866 case ICmpInst::ICMP_ULE: Out << " <= "; break;
867 case ICmpInst::ICMP_SGT:
868 case ICmpInst::ICMP_UGT: Out << " > "; break;
869 case ICmpInst::ICMP_SGE:
870 case ICmpInst::ICMP_UGE: Out << " >= "; break;
871 default: assert(0 && "Illegal ICmp predicate");
874 default: assert(0 && "Illegal opcode here!");
876 printConstantWithCast(CE->getOperand(1), CE->getOpcode());
877 if (NeedsClosingParens)
882 case Instruction::FCmp: {
884 bool NeedsClosingParens = printConstExprCast(CE, Static);
885 if (CE->getPredicate() == FCmpInst::FCMP_FALSE)
887 else if (CE->getPredicate() == FCmpInst::FCMP_TRUE)
891 switch (CE->getPredicate()) {
892 default: assert(0 && "Illegal FCmp predicate");
893 case FCmpInst::FCMP_ORD: op = "ord"; break;
894 case FCmpInst::FCMP_UNO: op = "uno"; break;
895 case FCmpInst::FCMP_UEQ: op = "ueq"; break;
896 case FCmpInst::FCMP_UNE: op = "une"; break;
897 case FCmpInst::FCMP_ULT: op = "ult"; break;
898 case FCmpInst::FCMP_ULE: op = "ule"; break;
899 case FCmpInst::FCMP_UGT: op = "ugt"; break;
900 case FCmpInst::FCMP_UGE: op = "uge"; break;
901 case FCmpInst::FCMP_OEQ: op = "oeq"; break;
902 case FCmpInst::FCMP_ONE: op = "one"; break;
903 case FCmpInst::FCMP_OLT: op = "olt"; break;
904 case FCmpInst::FCMP_OLE: op = "ole"; break;
905 case FCmpInst::FCMP_OGT: op = "ogt"; break;
906 case FCmpInst::FCMP_OGE: op = "oge"; break;
908 Out << "llvm_fcmp_" << op << "(";
909 printConstantWithCast(CE->getOperand(0), CE->getOpcode());
911 printConstantWithCast(CE->getOperand(1), CE->getOpcode());
914 if (NeedsClosingParens)
920 cerr << "CWriter Error: Unhandled constant expression: "
924 } else if (isa<UndefValue>(CPV) && CPV->getType()->isSingleValueType()) {
926 printType(Out, CPV->getType()); // sign doesn't matter
928 if (!isa<VectorType>(CPV->getType())) {
936 if (ConstantInt *CI = dyn_cast<ConstantInt>(CPV)) {
937 const Type* Ty = CI->getType();
938 if (Ty == Type::Int1Ty)
939 Out << (CI->getZExtValue() ? '1' : '0');
940 else if (Ty == Type::Int32Ty)
941 Out << CI->getZExtValue() << 'u';
942 else if (Ty->getPrimitiveSizeInBits() > 32)
943 Out << CI->getZExtValue() << "ull";
946 printSimpleType(Out, Ty, false) << ')';
947 if (CI->isMinValue(true))
948 Out << CI->getZExtValue() << 'u';
950 Out << CI->getSExtValue();
956 switch (CPV->getType()->getTypeID()) {
957 case Type::FloatTyID:
958 case Type::DoubleTyID:
959 case Type::X86_FP80TyID:
960 case Type::PPC_FP128TyID:
961 case Type::FP128TyID: {
962 ConstantFP *FPC = cast<ConstantFP>(CPV);
963 std::map<const ConstantFP*, unsigned>::iterator I = FPConstantMap.find(FPC);
964 if (I != FPConstantMap.end()) {
965 // Because of FP precision problems we must load from a stack allocated
966 // value that holds the value in hex.
967 Out << "(*(" << (FPC->getType() == Type::FloatTy ? "float" :
968 FPC->getType() == Type::DoubleTy ? "double" :
970 << "*)&FPConstant" << I->second << ')';
972 assert(FPC->getType() == Type::FloatTy ||
973 FPC->getType() == Type::DoubleTy);
974 double V = FPC->getType() == Type::FloatTy ?
975 FPC->getValueAPF().convertToFloat() :
976 FPC->getValueAPF().convertToDouble();
980 // FIXME the actual NaN bits should be emitted.
981 // The prefix for a quiet NaN is 0x7FF8. For a signalling NaN,
983 const unsigned long QuietNaN = 0x7ff8UL;
984 //const unsigned long SignalNaN = 0x7ff4UL;
986 // We need to grab the first part of the FP #
989 uint64_t ll = DoubleToBits(V);
990 sprintf(Buffer, "0x%llx", static_cast<long long>(ll));
992 std::string Num(&Buffer[0], &Buffer[6]);
993 unsigned long Val = strtoul(Num.c_str(), 0, 16);
995 if (FPC->getType() == Type::FloatTy)
996 Out << "LLVM_NAN" << (Val == QuietNaN ? "" : "S") << "F(\""
997 << Buffer << "\") /*nan*/ ";
999 Out << "LLVM_NAN" << (Val == QuietNaN ? "" : "S") << "(\""
1000 << Buffer << "\") /*nan*/ ";
1001 } else if (IsInf(V)) {
1003 if (V < 0) Out << '-';
1004 Out << "LLVM_INF" << (FPC->getType() == Type::FloatTy ? "F" : "")
1008 #if HAVE_PRINTF_A && ENABLE_CBE_PRINTF_A
1009 // Print out the constant as a floating point number.
1011 sprintf(Buffer, "%a", V);
1014 Num = ftostr(FPC->getValueAPF());
1022 case Type::ArrayTyID:
1023 // Use C99 compound expression literal initializer syntax.
1026 printType(Out, CPV->getType());
1029 Out << "{ "; // Arrays are wrapped in struct types.
1030 if (ConstantArray *CA = dyn_cast<ConstantArray>(CPV)) {
1031 printConstantArray(CA, Static);
1033 assert(isa<ConstantAggregateZero>(CPV) || isa<UndefValue>(CPV));
1034 const ArrayType *AT = cast<ArrayType>(CPV->getType());
1036 if (AT->getNumElements()) {
1038 Constant *CZ = Constant::getNullValue(AT->getElementType());
1039 printConstant(CZ, Static);
1040 for (unsigned i = 1, e = AT->getNumElements(); i != e; ++i) {
1042 printConstant(CZ, Static);
1047 Out << " }"; // Arrays are wrapped in struct types.
1050 case Type::VectorTyID:
1051 // Use C99 compound expression literal initializer syntax.
1054 printType(Out, CPV->getType());
1057 if (ConstantVector *CV = dyn_cast<ConstantVector>(CPV)) {
1058 printConstantVector(CV, Static);
1060 assert(isa<ConstantAggregateZero>(CPV) || isa<UndefValue>(CPV));
1061 const VectorType *VT = cast<VectorType>(CPV->getType());
1063 Constant *CZ = Constant::getNullValue(VT->getElementType());
1064 printConstant(CZ, Static);
1065 for (unsigned i = 1, e = VT->getNumElements(); i != e; ++i) {
1067 printConstant(CZ, Static);
1073 case Type::StructTyID:
1074 // Use C99 compound expression literal initializer syntax.
1077 printType(Out, CPV->getType());
1080 if (isa<ConstantAggregateZero>(CPV) || isa<UndefValue>(CPV)) {
1081 const StructType *ST = cast<StructType>(CPV->getType());
1083 if (ST->getNumElements()) {
1085 printConstant(Constant::getNullValue(ST->getElementType(0)), Static);
1086 for (unsigned i = 1, e = ST->getNumElements(); i != e; ++i) {
1088 printConstant(Constant::getNullValue(ST->getElementType(i)), Static);
1094 if (CPV->getNumOperands()) {
1096 printConstant(cast<Constant>(CPV->getOperand(0)), Static);
1097 for (unsigned i = 1, e = CPV->getNumOperands(); i != e; ++i) {
1099 printConstant(cast<Constant>(CPV->getOperand(i)), Static);
1106 case Type::PointerTyID:
1107 if (isa<ConstantPointerNull>(CPV)) {
1109 printType(Out, CPV->getType()); // sign doesn't matter
1110 Out << ")/*NULL*/0)";
1112 } else if (GlobalValue *GV = dyn_cast<GlobalValue>(CPV)) {
1113 writeOperand(GV, Static);
1118 cerr << "Unknown constant type: " << *CPV << "\n";
1123 // Some constant expressions need to be casted back to the original types
1124 // because their operands were casted to the expected type. This function takes
1125 // care of detecting that case and printing the cast for the ConstantExpr.
1126 bool CWriter::printConstExprCast(const ConstantExpr* CE, bool Static) {
1127 bool NeedsExplicitCast = false;
1128 const Type *Ty = CE->getOperand(0)->getType();
1129 bool TypeIsSigned = false;
1130 switch (CE->getOpcode()) {
1131 case Instruction::Add:
1132 case Instruction::Sub:
1133 case Instruction::Mul:
1134 // We need to cast integer arithmetic so that it is always performed
1135 // as unsigned, to avoid undefined behavior on overflow.
1136 if (!Ty->isIntOrIntVector()) break;
1138 case Instruction::LShr:
1139 case Instruction::URem:
1140 case Instruction::UDiv: NeedsExplicitCast = true; break;
1141 case Instruction::AShr:
1142 case Instruction::SRem:
1143 case Instruction::SDiv: NeedsExplicitCast = true; TypeIsSigned = true; break;
1144 case Instruction::SExt:
1146 NeedsExplicitCast = true;
1147 TypeIsSigned = true;
1149 case Instruction::ZExt:
1150 case Instruction::Trunc:
1151 case Instruction::FPTrunc:
1152 case Instruction::FPExt:
1153 case Instruction::UIToFP:
1154 case Instruction::SIToFP:
1155 case Instruction::FPToUI:
1156 case Instruction::FPToSI:
1157 case Instruction::PtrToInt:
1158 case Instruction::IntToPtr:
1159 case Instruction::BitCast:
1161 NeedsExplicitCast = true;
1165 if (NeedsExplicitCast) {
1167 if (Ty->isInteger() && Ty != Type::Int1Ty)
1168 printSimpleType(Out, Ty, TypeIsSigned);
1170 printType(Out, Ty); // not integer, sign doesn't matter
1173 return NeedsExplicitCast;
1176 // Print a constant assuming that it is the operand for a given Opcode. The
1177 // opcodes that care about sign need to cast their operands to the expected
1178 // type before the operation proceeds. This function does the casting.
1179 void CWriter::printConstantWithCast(Constant* CPV, unsigned Opcode) {
1181 // Extract the operand's type, we'll need it.
1182 const Type* OpTy = CPV->getType();
1184 // Indicate whether to do the cast or not.
1185 bool shouldCast = false;
1186 bool typeIsSigned = false;
1188 // Based on the Opcode for which this Constant is being written, determine
1189 // the new type to which the operand should be casted by setting the value
1190 // of OpTy. If we change OpTy, also set shouldCast to true so it gets
1194 // for most instructions, it doesn't matter
1196 case Instruction::Add:
1197 case Instruction::Sub:
1198 case Instruction::Mul:
1199 // We need to cast integer arithmetic so that it is always performed
1200 // as unsigned, to avoid undefined behavior on overflow.
1201 if (!OpTy->isIntOrIntVector()) break;
1203 case Instruction::LShr:
1204 case Instruction::UDiv:
1205 case Instruction::URem:
1208 case Instruction::AShr:
1209 case Instruction::SDiv:
1210 case Instruction::SRem:
1212 typeIsSigned = true;
1216 // Write out the casted constant if we should, otherwise just write the
1220 printSimpleType(Out, OpTy, typeIsSigned);
1222 printConstant(CPV, false);
1225 printConstant(CPV, false);
1228 std::string CWriter::GetValueName(const Value *Operand) {
1231 if (!isa<GlobalValue>(Operand) && Operand->getName() != "") {
1232 std::string VarName;
1234 Name = Operand->getName();
1235 VarName.reserve(Name.capacity());
1237 for (std::string::iterator I = Name.begin(), E = Name.end();
1241 if (!((ch >= 'a' && ch <= 'z') || (ch >= 'A' && ch <= 'Z') ||
1242 (ch >= '0' && ch <= '9') || ch == '_')) {
1244 sprintf(buffer, "_%x_", ch);
1250 Name = "llvm_cbe_" + VarName;
1252 Name = Mang->getValueName(Operand);
1258 /// writeInstComputationInline - Emit the computation for the specified
1259 /// instruction inline, with no destination provided.
1260 void CWriter::writeInstComputationInline(Instruction &I) {
1261 // If this is a non-trivial bool computation, make sure to truncate down to
1262 // a 1 bit value. This is important because we want "add i1 x, y" to return
1263 // "0" when x and y are true, not "2" for example.
1264 bool NeedBoolTrunc = false;
1265 if (I.getType() == Type::Int1Ty && !isa<ICmpInst>(I) && !isa<FCmpInst>(I))
1266 NeedBoolTrunc = true;
1278 void CWriter::writeOperandInternal(Value *Operand, bool Static) {
1279 if (Instruction *I = dyn_cast<Instruction>(Operand))
1280 // Should we inline this instruction to build a tree?
1281 if (isInlinableInst(*I) && !isDirectAlloca(I)) {
1283 writeInstComputationInline(*I);
1288 Constant* CPV = dyn_cast<Constant>(Operand);
1290 if (CPV && !isa<GlobalValue>(CPV))
1291 printConstant(CPV, Static);
1293 Out << GetValueName(Operand);
1296 void CWriter::writeOperand(Value *Operand, bool Static) {
1297 bool isAddressImplicit = isAddressExposed(Operand);
1298 if (isAddressImplicit)
1299 Out << "(&"; // Global variables are referenced as their addresses by llvm
1301 writeOperandInternal(Operand, Static);
1303 if (isAddressImplicit)
1307 // Some instructions need to have their result value casted back to the
1308 // original types because their operands were casted to the expected type.
1309 // This function takes care of detecting that case and printing the cast
1310 // for the Instruction.
1311 bool CWriter::writeInstructionCast(const Instruction &I) {
1312 const Type *Ty = I.getOperand(0)->getType();
1313 switch (I.getOpcode()) {
1314 case Instruction::Add:
1315 case Instruction::Sub:
1316 case Instruction::Mul:
1317 // We need to cast integer arithmetic so that it is always performed
1318 // as unsigned, to avoid undefined behavior on overflow.
1319 if (!Ty->isIntOrIntVector()) break;
1321 case Instruction::LShr:
1322 case Instruction::URem:
1323 case Instruction::UDiv:
1325 printSimpleType(Out, Ty, false);
1328 case Instruction::AShr:
1329 case Instruction::SRem:
1330 case Instruction::SDiv:
1332 printSimpleType(Out, Ty, true);
1340 // Write the operand with a cast to another type based on the Opcode being used.
1341 // This will be used in cases where an instruction has specific type
1342 // requirements (usually signedness) for its operands.
1343 void CWriter::writeOperandWithCast(Value* Operand, unsigned Opcode) {
1345 // Extract the operand's type, we'll need it.
1346 const Type* OpTy = Operand->getType();
1348 // Indicate whether to do the cast or not.
1349 bool shouldCast = false;
1351 // Indicate whether the cast should be to a signed type or not.
1352 bool castIsSigned = false;
1354 // Based on the Opcode for which this Operand is being written, determine
1355 // the new type to which the operand should be casted by setting the value
1356 // of OpTy. If we change OpTy, also set shouldCast to true.
1359 // for most instructions, it doesn't matter
1361 case Instruction::Add:
1362 case Instruction::Sub:
1363 case Instruction::Mul:
1364 // We need to cast integer arithmetic so that it is always performed
1365 // as unsigned, to avoid undefined behavior on overflow.
1366 if (!OpTy->isIntOrIntVector()) break;
1368 case Instruction::LShr:
1369 case Instruction::UDiv:
1370 case Instruction::URem: // Cast to unsigned first
1372 castIsSigned = false;
1374 case Instruction::GetElementPtr:
1375 case Instruction::AShr:
1376 case Instruction::SDiv:
1377 case Instruction::SRem: // Cast to signed first
1379 castIsSigned = true;
1383 // Write out the casted operand if we should, otherwise just write the
1387 printSimpleType(Out, OpTy, castIsSigned);
1389 writeOperand(Operand);
1392 writeOperand(Operand);
1395 // Write the operand with a cast to another type based on the icmp predicate
1397 void CWriter::writeOperandWithCast(Value* Operand, const ICmpInst &Cmp) {
1398 // This has to do a cast to ensure the operand has the right signedness.
1399 // Also, if the operand is a pointer, we make sure to cast to an integer when
1400 // doing the comparison both for signedness and so that the C compiler doesn't
1401 // optimize things like "p < NULL" to false (p may contain an integer value
1403 bool shouldCast = Cmp.isRelational();
1405 // Write out the casted operand if we should, otherwise just write the
1408 writeOperand(Operand);
1412 // Should this be a signed comparison? If so, convert to signed.
1413 bool castIsSigned = Cmp.isSignedPredicate();
1415 // If the operand was a pointer, convert to a large integer type.
1416 const Type* OpTy = Operand->getType();
1417 if (isa<PointerType>(OpTy))
1418 OpTy = TD->getIntPtrType();
1421 printSimpleType(Out, OpTy, castIsSigned);
1423 writeOperand(Operand);
1427 // generateCompilerSpecificCode - This is where we add conditional compilation
1428 // directives to cater to specific compilers as need be.
1430 static void generateCompilerSpecificCode(std::ostream& Out,
1431 const TargetData *TD) {
1432 // Alloca is hard to get, and we don't want to include stdlib.h here.
1433 Out << "/* get a declaration for alloca */\n"
1434 << "#if defined(__CYGWIN__) || defined(__MINGW32__)\n"
1435 << "#define alloca(x) __builtin_alloca((x))\n"
1436 << "#define _alloca(x) __builtin_alloca((x))\n"
1437 << "#elif defined(__APPLE__)\n"
1438 << "extern void *__builtin_alloca(unsigned long);\n"
1439 << "#define alloca(x) __builtin_alloca(x)\n"
1440 << "#define longjmp _longjmp\n"
1441 << "#define setjmp _setjmp\n"
1442 << "#elif defined(__sun__)\n"
1443 << "#if defined(__sparcv9)\n"
1444 << "extern void *__builtin_alloca(unsigned long);\n"
1446 << "extern void *__builtin_alloca(unsigned int);\n"
1448 << "#define alloca(x) __builtin_alloca(x)\n"
1449 << "#elif defined(__FreeBSD__) || defined(__NetBSD__) || defined(__OpenBSD__) || defined(__DragonFly__)\n"
1450 << "#define alloca(x) __builtin_alloca(x)\n"
1451 << "#elif defined(_MSC_VER)\n"
1452 << "#define inline _inline\n"
1453 << "#define alloca(x) _alloca(x)\n"
1455 << "#include <alloca.h>\n"
1458 // We output GCC specific attributes to preserve 'linkonce'ness on globals.
1459 // If we aren't being compiled with GCC, just drop these attributes.
1460 Out << "#ifndef __GNUC__ /* Can only support \"linkonce\" vars with GCC */\n"
1461 << "#define __attribute__(X)\n"
1464 // On Mac OS X, "external weak" is spelled "__attribute__((weak_import))".
1465 Out << "#if defined(__GNUC__) && defined(__APPLE_CC__)\n"
1466 << "#define __EXTERNAL_WEAK__ __attribute__((weak_import))\n"
1467 << "#elif defined(__GNUC__)\n"
1468 << "#define __EXTERNAL_WEAK__ __attribute__((weak))\n"
1470 << "#define __EXTERNAL_WEAK__\n"
1473 // For now, turn off the weak linkage attribute on Mac OS X. (See above.)
1474 Out << "#if defined(__GNUC__) && defined(__APPLE_CC__)\n"
1475 << "#define __ATTRIBUTE_WEAK__\n"
1476 << "#elif defined(__GNUC__)\n"
1477 << "#define __ATTRIBUTE_WEAK__ __attribute__((weak))\n"
1479 << "#define __ATTRIBUTE_WEAK__\n"
1482 // Add hidden visibility support. FIXME: APPLE_CC?
1483 Out << "#if defined(__GNUC__)\n"
1484 << "#define __HIDDEN__ __attribute__((visibility(\"hidden\")))\n"
1487 // Define NaN and Inf as GCC builtins if using GCC, as 0 otherwise
1488 // From the GCC documentation:
1490 // double __builtin_nan (const char *str)
1492 // This is an implementation of the ISO C99 function nan.
1494 // Since ISO C99 defines this function in terms of strtod, which we do
1495 // not implement, a description of the parsing is in order. The string is
1496 // parsed as by strtol; that is, the base is recognized by leading 0 or
1497 // 0x prefixes. The number parsed is placed in the significand such that
1498 // the least significant bit of the number is at the least significant
1499 // bit of the significand. The number is truncated to fit the significand
1500 // field provided. The significand is forced to be a quiet NaN.
1502 // This function, if given a string literal, is evaluated early enough
1503 // that it is considered a compile-time constant.
1505 // float __builtin_nanf (const char *str)
1507 // Similar to __builtin_nan, except the return type is float.
1509 // double __builtin_inf (void)
1511 // Similar to __builtin_huge_val, except a warning is generated if the
1512 // target floating-point format does not support infinities. This
1513 // function is suitable for implementing the ISO C99 macro INFINITY.
1515 // float __builtin_inff (void)
1517 // Similar to __builtin_inf, except the return type is float.
1518 Out << "#ifdef __GNUC__\n"
1519 << "#define LLVM_NAN(NanStr) __builtin_nan(NanStr) /* Double */\n"
1520 << "#define LLVM_NANF(NanStr) __builtin_nanf(NanStr) /* Float */\n"
1521 << "#define LLVM_NANS(NanStr) __builtin_nans(NanStr) /* Double */\n"
1522 << "#define LLVM_NANSF(NanStr) __builtin_nansf(NanStr) /* Float */\n"
1523 << "#define LLVM_INF __builtin_inf() /* Double */\n"
1524 << "#define LLVM_INFF __builtin_inff() /* Float */\n"
1525 << "#define LLVM_PREFETCH(addr,rw,locality) "
1526 "__builtin_prefetch(addr,rw,locality)\n"
1527 << "#define __ATTRIBUTE_CTOR__ __attribute__((constructor))\n"
1528 << "#define __ATTRIBUTE_DTOR__ __attribute__((destructor))\n"
1529 << "#define LLVM_ASM __asm__\n"
1531 << "#define LLVM_NAN(NanStr) ((double)0.0) /* Double */\n"
1532 << "#define LLVM_NANF(NanStr) 0.0F /* Float */\n"
1533 << "#define LLVM_NANS(NanStr) ((double)0.0) /* Double */\n"
1534 << "#define LLVM_NANSF(NanStr) 0.0F /* Float */\n"
1535 << "#define LLVM_INF ((double)0.0) /* Double */\n"
1536 << "#define LLVM_INFF 0.0F /* Float */\n"
1537 << "#define LLVM_PREFETCH(addr,rw,locality) /* PREFETCH */\n"
1538 << "#define __ATTRIBUTE_CTOR__\n"
1539 << "#define __ATTRIBUTE_DTOR__\n"
1540 << "#define LLVM_ASM(X)\n"
1543 Out << "#if __GNUC__ < 4 /* Old GCC's, or compilers not GCC */ \n"
1544 << "#define __builtin_stack_save() 0 /* not implemented */\n"
1545 << "#define __builtin_stack_restore(X) /* noop */\n"
1548 // Output typedefs for 128-bit integers. If these are needed with a
1549 // 32-bit target or with a C compiler that doesn't support mode(TI),
1550 // more drastic measures will be needed.
1551 Out << "#if __GNUC__ && __LP64__ /* 128-bit integer types */\n"
1552 << "typedef int __attribute__((mode(TI))) llvmInt128;\n"
1553 << "typedef unsigned __attribute__((mode(TI))) llvmUInt128;\n"
1556 // Output target-specific code that should be inserted into main.
1557 Out << "#define CODE_FOR_MAIN() /* Any target-specific code for main()*/\n";
1560 /// FindStaticTors - Given a static ctor/dtor list, unpack its contents into
1561 /// the StaticTors set.
1562 static void FindStaticTors(GlobalVariable *GV, std::set<Function*> &StaticTors){
1563 ConstantArray *InitList = dyn_cast<ConstantArray>(GV->getInitializer());
1564 if (!InitList) return;
1566 for (unsigned i = 0, e = InitList->getNumOperands(); i != e; ++i)
1567 if (ConstantStruct *CS = dyn_cast<ConstantStruct>(InitList->getOperand(i))){
1568 if (CS->getNumOperands() != 2) return; // Not array of 2-element structs.
1570 if (CS->getOperand(1)->isNullValue())
1571 return; // Found a null terminator, exit printing.
1572 Constant *FP = CS->getOperand(1);
1573 if (ConstantExpr *CE = dyn_cast<ConstantExpr>(FP))
1575 FP = CE->getOperand(0);
1576 if (Function *F = dyn_cast<Function>(FP))
1577 StaticTors.insert(F);
1581 enum SpecialGlobalClass {
1583 GlobalCtors, GlobalDtors,
1587 /// getGlobalVariableClass - If this is a global that is specially recognized
1588 /// by LLVM, return a code that indicates how we should handle it.
1589 static SpecialGlobalClass getGlobalVariableClass(const GlobalVariable *GV) {
1590 // If this is a global ctors/dtors list, handle it now.
1591 if (GV->hasAppendingLinkage() && GV->use_empty()) {
1592 if (GV->getName() == "llvm.global_ctors")
1594 else if (GV->getName() == "llvm.global_dtors")
1598 // Otherwise, it it is other metadata, don't print it. This catches things
1599 // like debug information.
1600 if (GV->getSection() == "llvm.metadata")
1607 bool CWriter::doInitialization(Module &M) {
1611 TD = new TargetData(&M);
1612 IL = new IntrinsicLowering(*TD);
1613 IL->AddPrototypes(M);
1615 // Ensure that all structure types have names...
1616 Mang = new Mangler(M);
1617 Mang->markCharUnacceptable('.');
1619 // Keep track of which functions are static ctors/dtors so they can have
1620 // an attribute added to their prototypes.
1621 std::set<Function*> StaticCtors, StaticDtors;
1622 for (Module::global_iterator I = M.global_begin(), E = M.global_end();
1624 switch (getGlobalVariableClass(I)) {
1627 FindStaticTors(I, StaticCtors);
1630 FindStaticTors(I, StaticDtors);
1635 // get declaration for alloca
1636 Out << "/* Provide Declarations */\n";
1637 Out << "#include <stdarg.h>\n"; // Varargs support
1638 Out << "#include <setjmp.h>\n"; // Unwind support
1639 generateCompilerSpecificCode(Out, TD);
1641 // Provide a definition for `bool' if not compiling with a C++ compiler.
1643 << "#ifndef __cplusplus\ntypedef unsigned char bool;\n#endif\n"
1645 << "\n\n/* Support for floating point constants */\n"
1646 << "typedef unsigned long long ConstantDoubleTy;\n"
1647 << "typedef unsigned int ConstantFloatTy;\n"
1648 << "typedef struct { unsigned long long f1; unsigned short f2; "
1649 "unsigned short pad[3]; } ConstantFP80Ty;\n"
1650 // This is used for both kinds of 128-bit long double; meaning differs.
1651 << "typedef struct { unsigned long long f1; unsigned long long f2; }"
1652 " ConstantFP128Ty;\n"
1653 << "\n\n/* Global Declarations */\n";
1655 // First output all the declarations for the program, because C requires
1656 // Functions & globals to be declared before they are used.
1659 // Loop over the symbol table, emitting all named constants...
1660 printModuleTypes(M.getTypeSymbolTable());
1662 // Global variable declarations...
1663 if (!M.global_empty()) {
1664 Out << "\n/* External Global Variable Declarations */\n";
1665 for (Module::global_iterator I = M.global_begin(), E = M.global_end();
1668 if (I->hasExternalLinkage() || I->hasExternalWeakLinkage() ||
1669 I->hasCommonLinkage())
1671 else if (I->hasDLLImportLinkage())
1672 Out << "__declspec(dllimport) ";
1674 continue; // Internal Global
1676 // Thread Local Storage
1677 if (I->isThreadLocal())
1680 printType(Out, I->getType()->getElementType(), false, GetValueName(I));
1682 if (I->hasExternalWeakLinkage())
1683 Out << " __EXTERNAL_WEAK__";
1688 // Function declarations
1689 Out << "\n/* Function Declarations */\n";
1690 Out << "double fmod(double, double);\n"; // Support for FP rem
1691 Out << "float fmodf(float, float);\n";
1692 Out << "long double fmodl(long double, long double);\n";
1694 for (Module::iterator I = M.begin(), E = M.end(); I != E; ++I) {
1695 // Don't print declarations for intrinsic functions.
1696 if (!I->isIntrinsic() && I->getName() != "setjmp" &&
1697 I->getName() != "longjmp" && I->getName() != "_setjmp") {
1698 if (I->hasExternalWeakLinkage())
1700 printFunctionSignature(I, true);
1701 if (I->hasWeakLinkage() || I->hasLinkOnceLinkage())
1702 Out << " __ATTRIBUTE_WEAK__";
1703 if (I->hasExternalWeakLinkage())
1704 Out << " __EXTERNAL_WEAK__";
1705 if (StaticCtors.count(I))
1706 Out << " __ATTRIBUTE_CTOR__";
1707 if (StaticDtors.count(I))
1708 Out << " __ATTRIBUTE_DTOR__";
1709 if (I->hasHiddenVisibility())
1710 Out << " __HIDDEN__";
1712 if (I->hasName() && I->getName()[0] == 1)
1713 Out << " LLVM_ASM(\"" << I->getName().c_str()+1 << "\")";
1719 // Output the global variable declarations
1720 if (!M.global_empty()) {
1721 Out << "\n\n/* Global Variable Declarations */\n";
1722 for (Module::global_iterator I = M.global_begin(), E = M.global_end();
1724 if (!I->isDeclaration()) {
1725 // Ignore special globals, such as debug info.
1726 if (getGlobalVariableClass(I))
1729 if (I->hasInternalLinkage())
1734 // Thread Local Storage
1735 if (I->isThreadLocal())
1738 printType(Out, I->getType()->getElementType(), false,
1741 if (I->hasLinkOnceLinkage())
1742 Out << " __attribute__((common))";
1743 else if (I->hasCommonLinkage()) // FIXME is this right?
1744 Out << " __ATTRIBUTE_WEAK__";
1745 else if (I->hasWeakLinkage())
1746 Out << " __ATTRIBUTE_WEAK__";
1747 else if (I->hasExternalWeakLinkage())
1748 Out << " __EXTERNAL_WEAK__";
1749 if (I->hasHiddenVisibility())
1750 Out << " __HIDDEN__";
1755 // Output the global variable definitions and contents...
1756 if (!M.global_empty()) {
1757 Out << "\n\n/* Global Variable Definitions and Initialization */\n";
1758 for (Module::global_iterator I = M.global_begin(), E = M.global_end();
1760 if (!I->isDeclaration()) {
1761 // Ignore special globals, such as debug info.
1762 if (getGlobalVariableClass(I))
1765 if (I->hasInternalLinkage())
1767 else if (I->hasDLLImportLinkage())
1768 Out << "__declspec(dllimport) ";
1769 else if (I->hasDLLExportLinkage())
1770 Out << "__declspec(dllexport) ";
1772 // Thread Local Storage
1773 if (I->isThreadLocal())
1776 printType(Out, I->getType()->getElementType(), false,
1778 if (I->hasLinkOnceLinkage())
1779 Out << " __attribute__((common))";
1780 else if (I->hasWeakLinkage())
1781 Out << " __ATTRIBUTE_WEAK__";
1782 else if (I->hasCommonLinkage())
1783 Out << " __ATTRIBUTE_WEAK__";
1785 if (I->hasHiddenVisibility())
1786 Out << " __HIDDEN__";
1788 // If the initializer is not null, emit the initializer. If it is null,
1789 // we try to avoid emitting large amounts of zeros. The problem with
1790 // this, however, occurs when the variable has weak linkage. In this
1791 // case, the assembler will complain about the variable being both weak
1792 // and common, so we disable this optimization.
1793 // FIXME common linkage should avoid this problem.
1794 if (!I->getInitializer()->isNullValue()) {
1796 writeOperand(I->getInitializer(), true);
1797 } else if (I->hasWeakLinkage()) {
1798 // We have to specify an initializer, but it doesn't have to be
1799 // complete. If the value is an aggregate, print out { 0 }, and let
1800 // the compiler figure out the rest of the zeros.
1802 if (isa<StructType>(I->getInitializer()->getType()) ||
1803 isa<VectorType>(I->getInitializer()->getType())) {
1805 } else if (isa<ArrayType>(I->getInitializer()->getType())) {
1806 // As with structs and vectors, but with an extra set of braces
1807 // because arrays are wrapped in structs.
1810 // Just print it out normally.
1811 writeOperand(I->getInitializer(), true);
1819 Out << "\n\n/* Function Bodies */\n";
1821 // Emit some helper functions for dealing with FCMP instruction's
1823 Out << "static inline int llvm_fcmp_ord(double X, double Y) { ";
1824 Out << "return X == X && Y == Y; }\n";
1825 Out << "static inline int llvm_fcmp_uno(double X, double Y) { ";
1826 Out << "return X != X || Y != Y; }\n";
1827 Out << "static inline int llvm_fcmp_ueq(double X, double Y) { ";
1828 Out << "return X == Y || llvm_fcmp_uno(X, Y); }\n";
1829 Out << "static inline int llvm_fcmp_une(double X, double Y) { ";
1830 Out << "return X != Y; }\n";
1831 Out << "static inline int llvm_fcmp_ult(double X, double Y) { ";
1832 Out << "return X < Y || llvm_fcmp_uno(X, Y); }\n";
1833 Out << "static inline int llvm_fcmp_ugt(double X, double Y) { ";
1834 Out << "return X > Y || llvm_fcmp_uno(X, Y); }\n";
1835 Out << "static inline int llvm_fcmp_ule(double X, double Y) { ";
1836 Out << "return X <= Y || llvm_fcmp_uno(X, Y); }\n";
1837 Out << "static inline int llvm_fcmp_uge(double X, double Y) { ";
1838 Out << "return X >= Y || llvm_fcmp_uno(X, Y); }\n";
1839 Out << "static inline int llvm_fcmp_oeq(double X, double Y) { ";
1840 Out << "return X == Y ; }\n";
1841 Out << "static inline int llvm_fcmp_one(double X, double Y) { ";
1842 Out << "return X != Y && llvm_fcmp_ord(X, Y); }\n";
1843 Out << "static inline int llvm_fcmp_olt(double X, double Y) { ";
1844 Out << "return X < Y ; }\n";
1845 Out << "static inline int llvm_fcmp_ogt(double X, double Y) { ";
1846 Out << "return X > Y ; }\n";
1847 Out << "static inline int llvm_fcmp_ole(double X, double Y) { ";
1848 Out << "return X <= Y ; }\n";
1849 Out << "static inline int llvm_fcmp_oge(double X, double Y) { ";
1850 Out << "return X >= Y ; }\n";
1855 /// Output all floating point constants that cannot be printed accurately...
1856 void CWriter::printFloatingPointConstants(Function &F) {
1857 // Scan the module for floating point constants. If any FP constant is used
1858 // in the function, we want to redirect it here so that we do not depend on
1859 // the precision of the printed form, unless the printed form preserves
1862 static unsigned FPCounter = 0;
1863 for (constant_iterator I = constant_begin(&F), E = constant_end(&F);
1865 if (const ConstantFP *FPC = dyn_cast<ConstantFP>(*I))
1866 if (!isFPCSafeToPrint(FPC) && // Do not put in FPConstantMap if safe.
1867 !FPConstantMap.count(FPC)) {
1868 FPConstantMap[FPC] = FPCounter; // Number the FP constants
1870 if (FPC->getType() == Type::DoubleTy) {
1871 double Val = FPC->getValueAPF().convertToDouble();
1872 uint64_t i = FPC->getValueAPF().convertToAPInt().getZExtValue();
1873 Out << "static const ConstantDoubleTy FPConstant" << FPCounter++
1874 << " = 0x" << std::hex << i << std::dec
1875 << "ULL; /* " << Val << " */\n";
1876 } else if (FPC->getType() == Type::FloatTy) {
1877 float Val = FPC->getValueAPF().convertToFloat();
1878 uint32_t i = (uint32_t)FPC->getValueAPF().convertToAPInt().
1880 Out << "static const ConstantFloatTy FPConstant" << FPCounter++
1881 << " = 0x" << std::hex << i << std::dec
1882 << "U; /* " << Val << " */\n";
1883 } else if (FPC->getType() == Type::X86_FP80Ty) {
1884 // api needed to prevent premature destruction
1885 APInt api = FPC->getValueAPF().convertToAPInt();
1886 const uint64_t *p = api.getRawData();
1887 Out << "static const ConstantFP80Ty FPConstant" << FPCounter++
1888 << " = { 0x" << std::hex
1889 << ((uint16_t)p[1] | (p[0] & 0xffffffffffffLL)<<16)
1890 << "ULL, 0x" << (uint16_t)(p[0] >> 48) << ",{0,0,0}"
1891 << "}; /* Long double constant */\n" << std::dec;
1892 } else if (FPC->getType() == Type::PPC_FP128Ty) {
1893 APInt api = FPC->getValueAPF().convertToAPInt();
1894 const uint64_t *p = api.getRawData();
1895 Out << "static const ConstantFP128Ty FPConstant" << FPCounter++
1896 << " = { 0x" << std::hex
1897 << p[0] << ", 0x" << p[1]
1898 << "}; /* Long double constant */\n" << std::dec;
1901 assert(0 && "Unknown float type!");
1908 /// printSymbolTable - Run through symbol table looking for type names. If a
1909 /// type name is found, emit its declaration...
1911 void CWriter::printModuleTypes(const TypeSymbolTable &TST) {
1912 Out << "/* Helper union for bitcasts */\n";
1913 Out << "typedef union {\n";
1914 Out << " unsigned int Int32;\n";
1915 Out << " unsigned long long Int64;\n";
1916 Out << " float Float;\n";
1917 Out << " double Double;\n";
1918 Out << "} llvmBitCastUnion;\n";
1920 // We are only interested in the type plane of the symbol table.
1921 TypeSymbolTable::const_iterator I = TST.begin();
1922 TypeSymbolTable::const_iterator End = TST.end();
1924 // If there are no type names, exit early.
1925 if (I == End) return;
1927 // Print out forward declarations for structure types before anything else!
1928 Out << "/* Structure forward decls */\n";
1929 for (; I != End; ++I) {
1930 std::string Name = "struct l_" + Mang->makeNameProper(I->first);
1931 Out << Name << ";\n";
1932 TypeNames.insert(std::make_pair(I->second, Name));
1937 // Now we can print out typedefs. Above, we guaranteed that this can only be
1938 // for struct or opaque types.
1939 Out << "/* Typedefs */\n";
1940 for (I = TST.begin(); I != End; ++I) {
1941 std::string Name = "l_" + Mang->makeNameProper(I->first);
1943 printType(Out, I->second, false, Name);
1949 // Keep track of which structures have been printed so far...
1950 std::set<const Type *> StructPrinted;
1952 // Loop over all structures then push them into the stack so they are
1953 // printed in the correct order.
1955 Out << "/* Structure contents */\n";
1956 for (I = TST.begin(); I != End; ++I)
1957 if (isa<StructType>(I->second) || isa<ArrayType>(I->second))
1958 // Only print out used types!
1959 printContainedStructs(I->second, StructPrinted);
1962 // Push the struct onto the stack and recursively push all structs
1963 // this one depends on.
1965 // TODO: Make this work properly with vector types
1967 void CWriter::printContainedStructs(const Type *Ty,
1968 std::set<const Type*> &StructPrinted) {
1969 // Don't walk through pointers.
1970 if (isa<PointerType>(Ty) || Ty->isPrimitiveType() || Ty->isInteger()) return;
1972 // Print all contained types first.
1973 for (Type::subtype_iterator I = Ty->subtype_begin(),
1974 E = Ty->subtype_end(); I != E; ++I)
1975 printContainedStructs(*I, StructPrinted);
1977 if (isa<StructType>(Ty) || isa<ArrayType>(Ty)) {
1978 // Check to see if we have already printed this struct.
1979 if (StructPrinted.insert(Ty).second) {
1980 // Print structure type out.
1981 std::string Name = TypeNames[Ty];
1982 printType(Out, Ty, false, Name, true);
1988 void CWriter::printFunctionSignature(const Function *F, bool Prototype) {
1989 /// isStructReturn - Should this function actually return a struct by-value?
1990 bool isStructReturn = F->hasStructRetAttr();
1992 if (F->hasInternalLinkage()) Out << "static ";
1993 if (F->hasDLLImportLinkage()) Out << "__declspec(dllimport) ";
1994 if (F->hasDLLExportLinkage()) Out << "__declspec(dllexport) ";
1995 switch (F->getCallingConv()) {
1996 case CallingConv::X86_StdCall:
1997 Out << "__stdcall ";
1999 case CallingConv::X86_FastCall:
2000 Out << "__fastcall ";
2004 // Loop over the arguments, printing them...
2005 const FunctionType *FT = cast<FunctionType>(F->getFunctionType());
2006 const PAListPtr &PAL = F->getParamAttrs();
2008 std::stringstream FunctionInnards;
2010 // Print out the name...
2011 FunctionInnards << GetValueName(F) << '(';
2013 bool PrintedArg = false;
2014 if (!F->isDeclaration()) {
2015 if (!F->arg_empty()) {
2016 Function::const_arg_iterator I = F->arg_begin(), E = F->arg_end();
2019 // If this is a struct-return function, don't print the hidden
2020 // struct-return argument.
2021 if (isStructReturn) {
2022 assert(I != E && "Invalid struct return function!");
2027 std::string ArgName;
2028 for (; I != E; ++I) {
2029 if (PrintedArg) FunctionInnards << ", ";
2030 if (I->hasName() || !Prototype)
2031 ArgName = GetValueName(I);
2034 const Type *ArgTy = I->getType();
2035 if (PAL.paramHasAttr(Idx, ParamAttr::ByVal)) {
2036 ArgTy = cast<PointerType>(ArgTy)->getElementType();
2037 ByValParams.insert(I);
2039 printType(FunctionInnards, ArgTy,
2040 /*isSigned=*/PAL.paramHasAttr(Idx, ParamAttr::SExt),
2047 // Loop over the arguments, printing them.
2048 FunctionType::param_iterator I = FT->param_begin(), E = FT->param_end();
2051 // If this is a struct-return function, don't print the hidden
2052 // struct-return argument.
2053 if (isStructReturn) {
2054 assert(I != E && "Invalid struct return function!");
2059 for (; I != E; ++I) {
2060 if (PrintedArg) FunctionInnards << ", ";
2061 const Type *ArgTy = *I;
2062 if (PAL.paramHasAttr(Idx, ParamAttr::ByVal)) {
2063 assert(isa<PointerType>(ArgTy));
2064 ArgTy = cast<PointerType>(ArgTy)->getElementType();
2066 printType(FunctionInnards, ArgTy,
2067 /*isSigned=*/PAL.paramHasAttr(Idx, ParamAttr::SExt));
2073 // Finish printing arguments... if this is a vararg function, print the ...,
2074 // unless there are no known types, in which case, we just emit ().
2076 if (FT->isVarArg() && PrintedArg) {
2077 if (PrintedArg) FunctionInnards << ", ";
2078 FunctionInnards << "..."; // Output varargs portion of signature!
2079 } else if (!FT->isVarArg() && !PrintedArg) {
2080 FunctionInnards << "void"; // ret() -> ret(void) in C.
2082 FunctionInnards << ')';
2084 // Get the return tpe for the function.
2086 if (!isStructReturn)
2087 RetTy = F->getReturnType();
2089 // If this is a struct-return function, print the struct-return type.
2090 RetTy = cast<PointerType>(FT->getParamType(0))->getElementType();
2093 // Print out the return type and the signature built above.
2094 printType(Out, RetTy,
2095 /*isSigned=*/PAL.paramHasAttr(0, ParamAttr::SExt),
2096 FunctionInnards.str());
2099 static inline bool isFPIntBitCast(const Instruction &I) {
2100 if (!isa<BitCastInst>(I))
2102 const Type *SrcTy = I.getOperand(0)->getType();
2103 const Type *DstTy = I.getType();
2104 return (SrcTy->isFloatingPoint() && DstTy->isInteger()) ||
2105 (DstTy->isFloatingPoint() && SrcTy->isInteger());
2108 void CWriter::printFunction(Function &F) {
2109 /// isStructReturn - Should this function actually return a struct by-value?
2110 bool isStructReturn = F.hasStructRetAttr();
2112 printFunctionSignature(&F, false);
2115 // If this is a struct return function, handle the result with magic.
2116 if (isStructReturn) {
2117 const Type *StructTy =
2118 cast<PointerType>(F.arg_begin()->getType())->getElementType();
2120 printType(Out, StructTy, false, "StructReturn");
2121 Out << "; /* Struct return temporary */\n";
2124 printType(Out, F.arg_begin()->getType(), false,
2125 GetValueName(F.arg_begin()));
2126 Out << " = &StructReturn;\n";
2129 bool PrintedVar = false;
2131 // print local variable information for the function
2132 for (inst_iterator I = inst_begin(&F), E = inst_end(&F); I != E; ++I) {
2133 if (const AllocaInst *AI = isDirectAlloca(&*I)) {
2135 printType(Out, AI->getAllocatedType(), false, GetValueName(AI));
2136 Out << "; /* Address-exposed local */\n";
2138 } else if (I->getType() != Type::VoidTy && !isInlinableInst(*I)) {
2140 printType(Out, I->getType(), false, GetValueName(&*I));
2143 if (isa<PHINode>(*I)) { // Print out PHI node temporaries as well...
2145 printType(Out, I->getType(), false,
2146 GetValueName(&*I)+"__PHI_TEMPORARY");
2151 // We need a temporary for the BitCast to use so it can pluck a value out
2152 // of a union to do the BitCast. This is separate from the need for a
2153 // variable to hold the result of the BitCast.
2154 if (isFPIntBitCast(*I)) {
2155 Out << " llvmBitCastUnion " << GetValueName(&*I)
2156 << "__BITCAST_TEMPORARY;\n";
2164 if (F.hasExternalLinkage() && F.getName() == "main")
2165 Out << " CODE_FOR_MAIN();\n";
2167 // print the basic blocks
2168 for (Function::iterator BB = F.begin(), E = F.end(); BB != E; ++BB) {
2169 if (Loop *L = LI->getLoopFor(BB)) {
2170 if (L->getHeader() == BB && L->getParentLoop() == 0)
2173 printBasicBlock(BB);
2180 void CWriter::printLoop(Loop *L) {
2181 Out << " do { /* Syntactic loop '" << L->getHeader()->getName()
2182 << "' to make GCC happy */\n";
2183 for (unsigned i = 0, e = L->getBlocks().size(); i != e; ++i) {
2184 BasicBlock *BB = L->getBlocks()[i];
2185 Loop *BBLoop = LI->getLoopFor(BB);
2187 printBasicBlock(BB);
2188 else if (BB == BBLoop->getHeader() && BBLoop->getParentLoop() == L)
2191 Out << " } while (1); /* end of syntactic loop '"
2192 << L->getHeader()->getName() << "' */\n";
2195 void CWriter::printBasicBlock(BasicBlock *BB) {
2197 // Don't print the label for the basic block if there are no uses, or if
2198 // the only terminator use is the predecessor basic block's terminator.
2199 // We have to scan the use list because PHI nodes use basic blocks too but
2200 // do not require a label to be generated.
2202 bool NeedsLabel = false;
2203 for (pred_iterator PI = pred_begin(BB), E = pred_end(BB); PI != E; ++PI)
2204 if (isGotoCodeNecessary(*PI, BB)) {
2209 if (NeedsLabel) Out << GetValueName(BB) << ":\n";
2211 // Output all of the instructions in the basic block...
2212 for (BasicBlock::iterator II = BB->begin(), E = --BB->end(); II != E;
2214 if (!isInlinableInst(*II) && !isDirectAlloca(II)) {
2215 if (II->getType() != Type::VoidTy && !isInlineAsm(*II))
2219 writeInstComputationInline(*II);
2224 // Don't emit prefix or suffix for the terminator.
2225 visit(*BB->getTerminator());
2229 // Specific Instruction type classes... note that all of the casts are
2230 // necessary because we use the instruction classes as opaque types...
2232 void CWriter::visitReturnInst(ReturnInst &I) {
2233 // If this is a struct return function, return the temporary struct.
2234 bool isStructReturn = I.getParent()->getParent()->hasStructRetAttr();
2236 if (isStructReturn) {
2237 Out << " return StructReturn;\n";
2241 // Don't output a void return if this is the last basic block in the function
2242 if (I.getNumOperands() == 0 &&
2243 &*--I.getParent()->getParent()->end() == I.getParent() &&
2244 !I.getParent()->size() == 1) {
2248 if (I.getNumOperands() > 1) {
2251 printType(Out, I.getParent()->getParent()->getReturnType());
2252 Out << " llvm_cbe_mrv_temp = {\n";
2253 for (unsigned i = 0, e = I.getNumOperands(); i != e; ++i) {
2255 writeOperand(I.getOperand(i));
2261 Out << " return llvm_cbe_mrv_temp;\n";
2267 if (I.getNumOperands()) {
2269 writeOperand(I.getOperand(0));
2274 void CWriter::visitSwitchInst(SwitchInst &SI) {
2277 writeOperand(SI.getOperand(0));
2278 Out << ") {\n default:\n";
2279 printPHICopiesForSuccessor (SI.getParent(), SI.getDefaultDest(), 2);
2280 printBranchToBlock(SI.getParent(), SI.getDefaultDest(), 2);
2282 for (unsigned i = 2, e = SI.getNumOperands(); i != e; i += 2) {
2284 writeOperand(SI.getOperand(i));
2286 BasicBlock *Succ = cast<BasicBlock>(SI.getOperand(i+1));
2287 printPHICopiesForSuccessor (SI.getParent(), Succ, 2);
2288 printBranchToBlock(SI.getParent(), Succ, 2);
2289 if (Function::iterator(Succ) == next(Function::iterator(SI.getParent())))
2295 void CWriter::visitUnreachableInst(UnreachableInst &I) {
2296 Out << " /*UNREACHABLE*/;\n";
2299 bool CWriter::isGotoCodeNecessary(BasicBlock *From, BasicBlock *To) {
2300 /// FIXME: This should be reenabled, but loop reordering safe!!
2303 if (next(Function::iterator(From)) != Function::iterator(To))
2304 return true; // Not the direct successor, we need a goto.
2306 //isa<SwitchInst>(From->getTerminator())
2308 if (LI->getLoopFor(From) != LI->getLoopFor(To))
2313 void CWriter::printPHICopiesForSuccessor (BasicBlock *CurBlock,
2314 BasicBlock *Successor,
2316 for (BasicBlock::iterator I = Successor->begin(); isa<PHINode>(I); ++I) {
2317 PHINode *PN = cast<PHINode>(I);
2318 // Now we have to do the printing.
2319 Value *IV = PN->getIncomingValueForBlock(CurBlock);
2320 if (!isa<UndefValue>(IV)) {
2321 Out << std::string(Indent, ' ');
2322 Out << " " << GetValueName(I) << "__PHI_TEMPORARY = ";
2324 Out << "; /* for PHI node */\n";
2329 void CWriter::printBranchToBlock(BasicBlock *CurBB, BasicBlock *Succ,
2331 if (isGotoCodeNecessary(CurBB, Succ)) {
2332 Out << std::string(Indent, ' ') << " goto ";
2338 // Branch instruction printing - Avoid printing out a branch to a basic block
2339 // that immediately succeeds the current one.
2341 void CWriter::visitBranchInst(BranchInst &I) {
2343 if (I.isConditional()) {
2344 if (isGotoCodeNecessary(I.getParent(), I.getSuccessor(0))) {
2346 writeOperand(I.getCondition());
2349 printPHICopiesForSuccessor (I.getParent(), I.getSuccessor(0), 2);
2350 printBranchToBlock(I.getParent(), I.getSuccessor(0), 2);
2352 if (isGotoCodeNecessary(I.getParent(), I.getSuccessor(1))) {
2353 Out << " } else {\n";
2354 printPHICopiesForSuccessor (I.getParent(), I.getSuccessor(1), 2);
2355 printBranchToBlock(I.getParent(), I.getSuccessor(1), 2);
2358 // First goto not necessary, assume second one is...
2360 writeOperand(I.getCondition());
2363 printPHICopiesForSuccessor (I.getParent(), I.getSuccessor(1), 2);
2364 printBranchToBlock(I.getParent(), I.getSuccessor(1), 2);
2369 printPHICopiesForSuccessor (I.getParent(), I.getSuccessor(0), 0);
2370 printBranchToBlock(I.getParent(), I.getSuccessor(0), 0);
2375 // PHI nodes get copied into temporary values at the end of predecessor basic
2376 // blocks. We now need to copy these temporary values into the REAL value for
2378 void CWriter::visitPHINode(PHINode &I) {
2380 Out << "__PHI_TEMPORARY";
2384 void CWriter::visitBinaryOperator(Instruction &I) {
2385 // binary instructions, shift instructions, setCond instructions.
2386 assert(!isa<PointerType>(I.getType()));
2388 // We must cast the results of binary operations which might be promoted.
2389 bool needsCast = false;
2390 if ((I.getType() == Type::Int8Ty) || (I.getType() == Type::Int16Ty)
2391 || (I.getType() == Type::FloatTy)) {
2394 printType(Out, I.getType(), false);
2398 // If this is a negation operation, print it out as such. For FP, we don't
2399 // want to print "-0.0 - X".
2400 if (BinaryOperator::isNeg(&I)) {
2402 writeOperand(BinaryOperator::getNegArgument(cast<BinaryOperator>(&I)));
2404 } else if (I.getOpcode() == Instruction::FRem) {
2405 // Output a call to fmod/fmodf instead of emitting a%b
2406 if (I.getType() == Type::FloatTy)
2408 else if (I.getType() == Type::DoubleTy)
2410 else // all 3 flavors of long double
2412 writeOperand(I.getOperand(0));
2414 writeOperand(I.getOperand(1));
2418 // Write out the cast of the instruction's value back to the proper type
2420 bool NeedsClosingParens = writeInstructionCast(I);
2422 // Certain instructions require the operand to be forced to a specific type
2423 // so we use writeOperandWithCast here instead of writeOperand. Similarly
2424 // below for operand 1
2425 writeOperandWithCast(I.getOperand(0), I.getOpcode());
2427 switch (I.getOpcode()) {
2428 case Instruction::Add: Out << " + "; break;
2429 case Instruction::Sub: Out << " - "; break;
2430 case Instruction::Mul: Out << " * "; break;
2431 case Instruction::URem:
2432 case Instruction::SRem:
2433 case Instruction::FRem: Out << " % "; break;
2434 case Instruction::UDiv:
2435 case Instruction::SDiv:
2436 case Instruction::FDiv: Out << " / "; break;
2437 case Instruction::And: Out << " & "; break;
2438 case Instruction::Or: Out << " | "; break;
2439 case Instruction::Xor: Out << " ^ "; break;
2440 case Instruction::Shl : Out << " << "; break;
2441 case Instruction::LShr:
2442 case Instruction::AShr: Out << " >> "; break;
2443 default: cerr << "Invalid operator type!" << I; abort();
2446 writeOperandWithCast(I.getOperand(1), I.getOpcode());
2447 if (NeedsClosingParens)
2456 void CWriter::visitICmpInst(ICmpInst &I) {
2457 // We must cast the results of icmp which might be promoted.
2458 bool needsCast = false;
2460 // Write out the cast of the instruction's value back to the proper type
2462 bool NeedsClosingParens = writeInstructionCast(I);
2464 // Certain icmp predicate require the operand to be forced to a specific type
2465 // so we use writeOperandWithCast here instead of writeOperand. Similarly
2466 // below for operand 1
2467 writeOperandWithCast(I.getOperand(0), I);
2469 switch (I.getPredicate()) {
2470 case ICmpInst::ICMP_EQ: Out << " == "; break;
2471 case ICmpInst::ICMP_NE: Out << " != "; break;
2472 case ICmpInst::ICMP_ULE:
2473 case ICmpInst::ICMP_SLE: Out << " <= "; break;
2474 case ICmpInst::ICMP_UGE:
2475 case ICmpInst::ICMP_SGE: Out << " >= "; break;
2476 case ICmpInst::ICMP_ULT:
2477 case ICmpInst::ICMP_SLT: Out << " < "; break;
2478 case ICmpInst::ICMP_UGT:
2479 case ICmpInst::ICMP_SGT: Out << " > "; break;
2480 default: cerr << "Invalid icmp predicate!" << I; abort();
2483 writeOperandWithCast(I.getOperand(1), I);
2484 if (NeedsClosingParens)
2492 void CWriter::visitFCmpInst(FCmpInst &I) {
2493 if (I.getPredicate() == FCmpInst::FCMP_FALSE) {
2497 if (I.getPredicate() == FCmpInst::FCMP_TRUE) {
2503 switch (I.getPredicate()) {
2504 default: assert(0 && "Illegal FCmp predicate");
2505 case FCmpInst::FCMP_ORD: op = "ord"; break;
2506 case FCmpInst::FCMP_UNO: op = "uno"; break;
2507 case FCmpInst::FCMP_UEQ: op = "ueq"; break;
2508 case FCmpInst::FCMP_UNE: op = "une"; break;
2509 case FCmpInst::FCMP_ULT: op = "ult"; break;
2510 case FCmpInst::FCMP_ULE: op = "ule"; break;
2511 case FCmpInst::FCMP_UGT: op = "ugt"; break;
2512 case FCmpInst::FCMP_UGE: op = "uge"; break;
2513 case FCmpInst::FCMP_OEQ: op = "oeq"; break;
2514 case FCmpInst::FCMP_ONE: op = "one"; break;
2515 case FCmpInst::FCMP_OLT: op = "olt"; break;
2516 case FCmpInst::FCMP_OLE: op = "ole"; break;
2517 case FCmpInst::FCMP_OGT: op = "ogt"; break;
2518 case FCmpInst::FCMP_OGE: op = "oge"; break;
2521 Out << "llvm_fcmp_" << op << "(";
2522 // Write the first operand
2523 writeOperand(I.getOperand(0));
2525 // Write the second operand
2526 writeOperand(I.getOperand(1));
2530 static const char * getFloatBitCastField(const Type *Ty) {
2531 switch (Ty->getTypeID()) {
2532 default: assert(0 && "Invalid Type");
2533 case Type::FloatTyID: return "Float";
2534 case Type::DoubleTyID: return "Double";
2535 case Type::IntegerTyID: {
2536 unsigned NumBits = cast<IntegerType>(Ty)->getBitWidth();
2545 void CWriter::visitCastInst(CastInst &I) {
2546 const Type *DstTy = I.getType();
2547 const Type *SrcTy = I.getOperand(0)->getType();
2548 if (isFPIntBitCast(I)) {
2550 // These int<->float and long<->double casts need to be handled specially
2551 Out << GetValueName(&I) << "__BITCAST_TEMPORARY."
2552 << getFloatBitCastField(I.getOperand(0)->getType()) << " = ";
2553 writeOperand(I.getOperand(0));
2554 Out << ", " << GetValueName(&I) << "__BITCAST_TEMPORARY."
2555 << getFloatBitCastField(I.getType());
2561 printCast(I.getOpcode(), SrcTy, DstTy);
2563 // Make a sext from i1 work by subtracting the i1 from 0 (an int).
2564 if (SrcTy == Type::Int1Ty && I.getOpcode() == Instruction::SExt)
2567 writeOperand(I.getOperand(0));
2569 if (DstTy == Type::Int1Ty &&
2570 (I.getOpcode() == Instruction::Trunc ||
2571 I.getOpcode() == Instruction::FPToUI ||
2572 I.getOpcode() == Instruction::FPToSI ||
2573 I.getOpcode() == Instruction::PtrToInt)) {
2574 // Make sure we really get a trunc to bool by anding the operand with 1
2580 void CWriter::visitSelectInst(SelectInst &I) {
2582 writeOperand(I.getCondition());
2584 writeOperand(I.getTrueValue());
2586 writeOperand(I.getFalseValue());
2591 void CWriter::lowerIntrinsics(Function &F) {
2592 // This is used to keep track of intrinsics that get generated to a lowered
2593 // function. We must generate the prototypes before the function body which
2594 // will only be expanded on first use (by the loop below).
2595 std::vector<Function*> prototypesToGen;
2597 // Examine all the instructions in this function to find the intrinsics that
2598 // need to be lowered.
2599 for (Function::iterator BB = F.begin(), EE = F.end(); BB != EE; ++BB)
2600 for (BasicBlock::iterator I = BB->begin(), E = BB->end(); I != E; )
2601 if (CallInst *CI = dyn_cast<CallInst>(I++))
2602 if (Function *F = CI->getCalledFunction())
2603 switch (F->getIntrinsicID()) {
2604 case Intrinsic::not_intrinsic:
2605 case Intrinsic::memory_barrier:
2606 case Intrinsic::vastart:
2607 case Intrinsic::vacopy:
2608 case Intrinsic::vaend:
2609 case Intrinsic::returnaddress:
2610 case Intrinsic::frameaddress:
2611 case Intrinsic::setjmp:
2612 case Intrinsic::longjmp:
2613 case Intrinsic::prefetch:
2614 case Intrinsic::dbg_stoppoint:
2615 case Intrinsic::powi:
2616 case Intrinsic::x86_sse_cmp_ss:
2617 case Intrinsic::x86_sse_cmp_ps:
2618 case Intrinsic::x86_sse2_cmp_sd:
2619 case Intrinsic::x86_sse2_cmp_pd:
2620 case Intrinsic::ppc_altivec_lvsl:
2621 // We directly implement these intrinsics
2624 // If this is an intrinsic that directly corresponds to a GCC
2625 // builtin, we handle it.
2626 const char *BuiltinName = "";
2627 #define GET_GCC_BUILTIN_NAME
2628 #include "llvm/Intrinsics.gen"
2629 #undef GET_GCC_BUILTIN_NAME
2630 // If we handle it, don't lower it.
2631 if (BuiltinName[0]) break;
2633 // All other intrinsic calls we must lower.
2634 Instruction *Before = 0;
2635 if (CI != &BB->front())
2636 Before = prior(BasicBlock::iterator(CI));
2638 IL->LowerIntrinsicCall(CI);
2639 if (Before) { // Move iterator to instruction after call
2644 // If the intrinsic got lowered to another call, and that call has
2645 // a definition then we need to make sure its prototype is emitted
2646 // before any calls to it.
2647 if (CallInst *Call = dyn_cast<CallInst>(I))
2648 if (Function *NewF = Call->getCalledFunction())
2649 if (!NewF->isDeclaration())
2650 prototypesToGen.push_back(NewF);
2655 // We may have collected some prototypes to emit in the loop above.
2656 // Emit them now, before the function that uses them is emitted. But,
2657 // be careful not to emit them twice.
2658 std::vector<Function*>::iterator I = prototypesToGen.begin();
2659 std::vector<Function*>::iterator E = prototypesToGen.end();
2660 for ( ; I != E; ++I) {
2661 if (intrinsicPrototypesAlreadyGenerated.insert(*I).second) {
2663 printFunctionSignature(*I, true);
2669 void CWriter::visitCallInst(CallInst &I) {
2670 if (isa<InlineAsm>(I.getOperand(0)))
2671 return visitInlineAsm(I);
2673 bool WroteCallee = false;
2675 // Handle intrinsic function calls first...
2676 if (Function *F = I.getCalledFunction())
2677 if (Intrinsic::ID ID = (Intrinsic::ID)F->getIntrinsicID())
2678 if (visitBuiltinCall(I, ID, WroteCallee))
2681 Value *Callee = I.getCalledValue();
2683 const PointerType *PTy = cast<PointerType>(Callee->getType());
2684 const FunctionType *FTy = cast<FunctionType>(PTy->getElementType());
2686 // If this is a call to a struct-return function, assign to the first
2687 // parameter instead of passing it to the call.
2688 const PAListPtr &PAL = I.getParamAttrs();
2689 bool hasByVal = I.hasByValArgument();
2690 bool isStructRet = I.hasStructRetAttr();
2692 writeOperandDeref(I.getOperand(1));
2696 if (I.isTailCall()) Out << " /*tail*/ ";
2699 // If this is an indirect call to a struct return function, we need to cast
2700 // the pointer. Ditto for indirect calls with byval arguments.
2701 bool NeedsCast = (hasByVal || isStructRet) && !isa<Function>(Callee);
2703 // GCC is a real PITA. It does not permit codegening casts of functions to
2704 // function pointers if they are in a call (it generates a trap instruction
2705 // instead!). We work around this by inserting a cast to void* in between
2706 // the function and the function pointer cast. Unfortunately, we can't just
2707 // form the constant expression here, because the folder will immediately
2710 // Note finally, that this is completely unsafe. ANSI C does not guarantee
2711 // that void* and function pointers have the same size. :( To deal with this
2712 // in the common case, we handle casts where the number of arguments passed
2715 if (ConstantExpr *CE = dyn_cast<ConstantExpr>(Callee))
2717 if (Function *RF = dyn_cast<Function>(CE->getOperand(0))) {
2723 // Ok, just cast the pointer type.
2726 printStructReturnPointerFunctionType(Out, PAL,
2727 cast<PointerType>(I.getCalledValue()->getType()));
2729 printType(Out, I.getCalledValue()->getType(), false, "", true, PAL);
2731 printType(Out, I.getCalledValue()->getType());
2734 writeOperand(Callee);
2735 if (NeedsCast) Out << ')';
2740 unsigned NumDeclaredParams = FTy->getNumParams();
2742 CallSite::arg_iterator AI = I.op_begin()+1, AE = I.op_end();
2744 if (isStructRet) { // Skip struct return argument.
2749 bool PrintedArg = false;
2750 for (; AI != AE; ++AI, ++ArgNo) {
2751 if (PrintedArg) Out << ", ";
2752 if (ArgNo < NumDeclaredParams &&
2753 (*AI)->getType() != FTy->getParamType(ArgNo)) {
2755 printType(Out, FTy->getParamType(ArgNo),
2756 /*isSigned=*/PAL.paramHasAttr(ArgNo+1, ParamAttr::SExt));
2759 // Check if the argument is expected to be passed by value.
2760 if (I.paramHasAttr(ArgNo+1, ParamAttr::ByVal))
2761 writeOperandDeref(*AI);
2769 /// visitBuiltinCall - Handle the call to the specified builtin. Returns true
2770 /// if the entire call is handled, return false it it wasn't handled, and
2771 /// optionally set 'WroteCallee' if the callee has already been printed out.
2772 bool CWriter::visitBuiltinCall(CallInst &I, Intrinsic::ID ID,
2773 bool &WroteCallee) {
2776 // If this is an intrinsic that directly corresponds to a GCC
2777 // builtin, we emit it here.
2778 const char *BuiltinName = "";
2779 Function *F = I.getCalledFunction();
2780 #define GET_GCC_BUILTIN_NAME
2781 #include "llvm/Intrinsics.gen"
2782 #undef GET_GCC_BUILTIN_NAME
2783 assert(BuiltinName[0] && "Unknown LLVM intrinsic!");
2789 case Intrinsic::memory_barrier:
2790 Out << "__sync_synchronize()";
2792 case Intrinsic::vastart:
2795 Out << "va_start(*(va_list*)";
2796 writeOperand(I.getOperand(1));
2798 // Output the last argument to the enclosing function.
2799 if (I.getParent()->getParent()->arg_empty()) {
2800 cerr << "The C backend does not currently support zero "
2801 << "argument varargs functions, such as '"
2802 << I.getParent()->getParent()->getName() << "'!\n";
2805 writeOperand(--I.getParent()->getParent()->arg_end());
2808 case Intrinsic::vaend:
2809 if (!isa<ConstantPointerNull>(I.getOperand(1))) {
2810 Out << "0; va_end(*(va_list*)";
2811 writeOperand(I.getOperand(1));
2814 Out << "va_end(*(va_list*)0)";
2817 case Intrinsic::vacopy:
2819 Out << "va_copy(*(va_list*)";
2820 writeOperand(I.getOperand(1));
2821 Out << ", *(va_list*)";
2822 writeOperand(I.getOperand(2));
2825 case Intrinsic::returnaddress:
2826 Out << "__builtin_return_address(";
2827 writeOperand(I.getOperand(1));
2830 case Intrinsic::frameaddress:
2831 Out << "__builtin_frame_address(";
2832 writeOperand(I.getOperand(1));
2835 case Intrinsic::powi:
2836 Out << "__builtin_powi(";
2837 writeOperand(I.getOperand(1));
2839 writeOperand(I.getOperand(2));
2842 case Intrinsic::setjmp:
2843 Out << "setjmp(*(jmp_buf*)";
2844 writeOperand(I.getOperand(1));
2847 case Intrinsic::longjmp:
2848 Out << "longjmp(*(jmp_buf*)";
2849 writeOperand(I.getOperand(1));
2851 writeOperand(I.getOperand(2));
2854 case Intrinsic::prefetch:
2855 Out << "LLVM_PREFETCH((const void *)";
2856 writeOperand(I.getOperand(1));
2858 writeOperand(I.getOperand(2));
2860 writeOperand(I.getOperand(3));
2863 case Intrinsic::stacksave:
2864 // Emit this as: Val = 0; *((void**)&Val) = __builtin_stack_save()
2865 // to work around GCC bugs (see PR1809).
2866 Out << "0; *((void**)&" << GetValueName(&I)
2867 << ") = __builtin_stack_save()";
2869 case Intrinsic::dbg_stoppoint: {
2870 // If we use writeOperand directly we get a "u" suffix which is rejected
2872 DbgStopPointInst &SPI = cast<DbgStopPointInst>(I);
2875 << " \"" << SPI.getDirectory()
2876 << SPI.getFileName() << "\"\n";
2879 case Intrinsic::x86_sse_cmp_ss:
2880 case Intrinsic::x86_sse_cmp_ps:
2881 case Intrinsic::x86_sse2_cmp_sd:
2882 case Intrinsic::x86_sse2_cmp_pd:
2884 printType(Out, I.getType());
2886 // Multiple GCC builtins multiplex onto this intrinsic.
2887 switch (cast<ConstantInt>(I.getOperand(3))->getZExtValue()) {
2888 default: assert(0 && "Invalid llvm.x86.sse.cmp!");
2889 case 0: Out << "__builtin_ia32_cmpeq"; break;
2890 case 1: Out << "__builtin_ia32_cmplt"; break;
2891 case 2: Out << "__builtin_ia32_cmple"; break;
2892 case 3: Out << "__builtin_ia32_cmpunord"; break;
2893 case 4: Out << "__builtin_ia32_cmpneq"; break;
2894 case 5: Out << "__builtin_ia32_cmpnlt"; break;
2895 case 6: Out << "__builtin_ia32_cmpnle"; break;
2896 case 7: Out << "__builtin_ia32_cmpord"; break;
2898 if (ID == Intrinsic::x86_sse_cmp_ps || ID == Intrinsic::x86_sse2_cmp_pd)
2902 if (ID == Intrinsic::x86_sse_cmp_ss || ID == Intrinsic::x86_sse_cmp_ps)
2908 writeOperand(I.getOperand(1));
2910 writeOperand(I.getOperand(2));
2913 case Intrinsic::ppc_altivec_lvsl:
2915 printType(Out, I.getType());
2917 Out << "__builtin_altivec_lvsl(0, (void*)";
2918 writeOperand(I.getOperand(1));
2924 //This converts the llvm constraint string to something gcc is expecting.
2925 //TODO: work out platform independent constraints and factor those out
2926 // of the per target tables
2927 // handle multiple constraint codes
2928 std::string CWriter::InterpretASMConstraint(InlineAsm::ConstraintInfo& c) {
2930 assert(c.Codes.size() == 1 && "Too many asm constraint codes to handle");
2932 const char *const *table = 0;
2934 //Grab the translation table from TargetAsmInfo if it exists
2937 const TargetMachineRegistry::entry* Match =
2938 TargetMachineRegistry::getClosestStaticTargetForModule(*TheModule, E);
2940 //Per platform Target Machines don't exist, so create it
2941 // this must be done only once
2942 const TargetMachine* TM = Match->CtorFn(*TheModule, "");
2943 TAsm = TM->getTargetAsmInfo();
2947 table = TAsm->getAsmCBE();
2949 //Search the translation table if it exists
2950 for (int i = 0; table && table[i]; i += 2)
2951 if (c.Codes[0] == table[i])
2954 //default is identity
2958 //TODO: import logic from AsmPrinter.cpp
2959 static std::string gccifyAsm(std::string asmstr) {
2960 for (std::string::size_type i = 0; i != asmstr.size(); ++i)
2961 if (asmstr[i] == '\n')
2962 asmstr.replace(i, 1, "\\n");
2963 else if (asmstr[i] == '\t')
2964 asmstr.replace(i, 1, "\\t");
2965 else if (asmstr[i] == '$') {
2966 if (asmstr[i + 1] == '{') {
2967 std::string::size_type a = asmstr.find_first_of(':', i + 1);
2968 std::string::size_type b = asmstr.find_first_of('}', i + 1);
2969 std::string n = "%" +
2970 asmstr.substr(a + 1, b - a - 1) +
2971 asmstr.substr(i + 2, a - i - 2);
2972 asmstr.replace(i, b - i + 1, n);
2975 asmstr.replace(i, 1, "%");
2977 else if (asmstr[i] == '%')//grr
2978 { asmstr.replace(i, 1, "%%"); ++i;}
2983 //TODO: assumptions about what consume arguments from the call are likely wrong
2984 // handle communitivity
2985 void CWriter::visitInlineAsm(CallInst &CI) {
2986 InlineAsm* as = cast<InlineAsm>(CI.getOperand(0));
2987 std::vector<InlineAsm::ConstraintInfo> Constraints = as->ParseConstraints();
2989 std::vector<std::pair<Value*, int> > ResultVals;
2990 if (CI.getType() == Type::VoidTy)
2992 else if (const StructType *ST = dyn_cast<StructType>(CI.getType())) {
2993 for (unsigned i = 0, e = ST->getNumElements(); i != e; ++i)
2994 ResultVals.push_back(std::make_pair(&CI, (int)i));
2996 ResultVals.push_back(std::make_pair(&CI, -1));
2999 // Fix up the asm string for gcc and emit it.
3000 Out << "__asm__ volatile (\"" << gccifyAsm(as->getAsmString()) << "\"\n";
3003 unsigned ValueCount = 0;
3004 bool IsFirst = true;
3006 // Convert over all the output constraints.
3007 for (std::vector<InlineAsm::ConstraintInfo>::iterator I = Constraints.begin(),
3008 E = Constraints.end(); I != E; ++I) {
3010 if (I->Type != InlineAsm::isOutput) {
3012 continue; // Ignore non-output constraints.
3015 assert(I->Codes.size() == 1 && "Too many asm constraint codes to handle");
3016 std::string C = InterpretASMConstraint(*I);
3017 if (C.empty()) continue;
3028 if (ValueCount < ResultVals.size()) {
3029 DestVal = ResultVals[ValueCount].first;
3030 DestValNo = ResultVals[ValueCount].second;
3032 DestVal = CI.getOperand(ValueCount-ResultVals.size()+1);
3034 if (I->isEarlyClobber)
3037 Out << "\"=" << C << "\"(" << GetValueName(DestVal);
3038 if (DestValNo != -1)
3039 Out << ".field" << DestValNo; // Multiple retvals.
3045 // Convert over all the input constraints.
3049 for (std::vector<InlineAsm::ConstraintInfo>::iterator I = Constraints.begin(),
3050 E = Constraints.end(); I != E; ++I) {
3051 if (I->Type != InlineAsm::isInput) {
3053 continue; // Ignore non-input constraints.
3056 assert(I->Codes.size() == 1 && "Too many asm constraint codes to handle");
3057 std::string C = InterpretASMConstraint(*I);
3058 if (C.empty()) continue;
3065 assert(ValueCount >= ResultVals.size() && "Input can't refer to result");
3066 Value *SrcVal = CI.getOperand(ValueCount-ResultVals.size()+1);
3068 Out << "\"" << C << "\"(";
3070 writeOperand(SrcVal);
3072 writeOperandDeref(SrcVal);
3076 // Convert over the clobber constraints.
3079 for (std::vector<InlineAsm::ConstraintInfo>::iterator I = Constraints.begin(),
3080 E = Constraints.end(); I != E; ++I) {
3081 if (I->Type != InlineAsm::isClobber)
3082 continue; // Ignore non-input constraints.
3084 assert(I->Codes.size() == 1 && "Too many asm constraint codes to handle");
3085 std::string C = InterpretASMConstraint(*I);
3086 if (C.empty()) continue;
3093 Out << '\"' << C << '"';
3099 void CWriter::visitMallocInst(MallocInst &I) {
3100 assert(0 && "lowerallocations pass didn't work!");
3103 void CWriter::visitAllocaInst(AllocaInst &I) {
3105 printType(Out, I.getType());
3106 Out << ") alloca(sizeof(";
3107 printType(Out, I.getType()->getElementType());
3109 if (I.isArrayAllocation()) {
3111 writeOperand(I.getOperand(0));
3116 void CWriter::visitFreeInst(FreeInst &I) {
3117 assert(0 && "lowerallocations pass didn't work!");
3120 void CWriter::printGEPExpression(Value *Ptr, gep_type_iterator I,
3121 gep_type_iterator E, bool Static) {
3123 // If there are no indices, just print out the pointer.
3129 // Find out if the last index is into a vector. If so, we have to print this
3130 // specially. Since vectors can't have elements of indexable type, only the
3131 // last index could possibly be of a vector element.
3132 const VectorType *LastIndexIsVector = 0;
3134 for (gep_type_iterator TmpI = I; TmpI != E; ++TmpI)
3135 LastIndexIsVector = dyn_cast<VectorType>(*TmpI);
3140 // If the last index is into a vector, we can't print it as &a[i][j] because
3141 // we can't index into a vector with j in GCC. Instead, emit this as
3142 // (((float*)&a[i])+j)
3143 if (LastIndexIsVector) {
3145 printType(Out, PointerType::getUnqual(LastIndexIsVector->getElementType()));
3151 // If the first index is 0 (very typical) we can do a number of
3152 // simplifications to clean up the code.
3153 Value *FirstOp = I.getOperand();
3154 if (!isa<Constant>(FirstOp) || !cast<Constant>(FirstOp)->isNullValue()) {
3155 // First index isn't simple, print it the hard way.
3158 ++I; // Skip the zero index.
3160 // Okay, emit the first operand. If Ptr is something that is already address
3161 // exposed, like a global, avoid emitting (&foo)[0], just emit foo instead.
3162 if (isAddressExposed(Ptr)) {
3163 writeOperandInternal(Ptr, Static);
3164 } else if (I != E && isa<StructType>(*I)) {
3165 // If we didn't already emit the first operand, see if we can print it as
3166 // P->f instead of "P[0].f"
3168 Out << "->field" << cast<ConstantInt>(I.getOperand())->getZExtValue();
3169 ++I; // eat the struct index as well.
3171 // Instead of emitting P[0][1], emit (*P)[1], which is more idiomatic.
3178 for (; I != E; ++I) {
3179 if (isa<StructType>(*I)) {
3180 Out << ".field" << cast<ConstantInt>(I.getOperand())->getZExtValue();
3181 } else if (isa<ArrayType>(*I)) {
3183 writeOperandWithCast(I.getOperand(), Instruction::GetElementPtr);
3185 } else if (!isa<VectorType>(*I)) {
3187 writeOperandWithCast(I.getOperand(), Instruction::GetElementPtr);
3190 // If the last index is into a vector, then print it out as "+j)". This
3191 // works with the 'LastIndexIsVector' code above.
3192 if (isa<Constant>(I.getOperand()) &&
3193 cast<Constant>(I.getOperand())->isNullValue()) {
3194 Out << "))"; // avoid "+0".
3197 writeOperandWithCast(I.getOperand(), Instruction::GetElementPtr);
3205 void CWriter::writeMemoryAccess(Value *Operand, const Type *OperandType,
3206 bool IsVolatile, unsigned Alignment) {
3208 bool IsUnaligned = Alignment &&
3209 Alignment < TD->getABITypeAlignment(OperandType);
3213 if (IsVolatile || IsUnaligned) {
3216 Out << "struct __attribute__ ((packed, aligned(" << Alignment << "))) {";
3217 printType(Out, OperandType, false, IsUnaligned ? "data" : "volatile*");
3220 if (IsVolatile) Out << "volatile ";
3226 writeOperand(Operand);
3228 if (IsVolatile || IsUnaligned) {
3235 void CWriter::visitLoadInst(LoadInst &I) {
3236 writeMemoryAccess(I.getOperand(0), I.getType(), I.isVolatile(),
3241 void CWriter::visitStoreInst(StoreInst &I) {
3242 writeMemoryAccess(I.getPointerOperand(), I.getOperand(0)->getType(),
3243 I.isVolatile(), I.getAlignment());
3245 Value *Operand = I.getOperand(0);
3246 Constant *BitMask = 0;
3247 if (const IntegerType* ITy = dyn_cast<IntegerType>(Operand->getType()))
3248 if (!ITy->isPowerOf2ByteWidth())
3249 // We have a bit width that doesn't match an even power-of-2 byte
3250 // size. Consequently we must & the value with the type's bit mask
3251 BitMask = ConstantInt::get(ITy, ITy->getBitMask());
3254 writeOperand(Operand);
3257 printConstant(BitMask, false);
3262 void CWriter::visitGetElementPtrInst(GetElementPtrInst &I) {
3263 printGEPExpression(I.getPointerOperand(), gep_type_begin(I),
3264 gep_type_end(I), false);
3267 void CWriter::visitVAArgInst(VAArgInst &I) {
3268 Out << "va_arg(*(va_list*)";
3269 writeOperand(I.getOperand(0));
3271 printType(Out, I.getType());
3275 void CWriter::visitInsertElementInst(InsertElementInst &I) {
3276 const Type *EltTy = I.getType()->getElementType();
3277 writeOperand(I.getOperand(0));
3280 printType(Out, PointerType::getUnqual(EltTy));
3281 Out << ")(&" << GetValueName(&I) << "))[";
3282 writeOperand(I.getOperand(2));
3284 writeOperand(I.getOperand(1));
3288 void CWriter::visitExtractElementInst(ExtractElementInst &I) {
3289 // We know that our operand is not inlined.
3292 cast<VectorType>(I.getOperand(0)->getType())->getElementType();
3293 printType(Out, PointerType::getUnqual(EltTy));
3294 Out << ")(&" << GetValueName(I.getOperand(0)) << "))[";
3295 writeOperand(I.getOperand(1));
3299 void CWriter::visitShuffleVectorInst(ShuffleVectorInst &SVI) {
3301 printType(Out, SVI.getType());
3303 const VectorType *VT = SVI.getType();
3304 unsigned NumElts = VT->getNumElements();
3305 const Type *EltTy = VT->getElementType();
3307 for (unsigned i = 0; i != NumElts; ++i) {
3309 int SrcVal = SVI.getMaskValue(i);
3310 if ((unsigned)SrcVal >= NumElts*2) {
3311 Out << " 0/*undef*/ ";
3313 Value *Op = SVI.getOperand((unsigned)SrcVal >= NumElts);
3314 if (isa<Instruction>(Op)) {
3315 // Do an extractelement of this value from the appropriate input.
3317 printType(Out, PointerType::getUnqual(EltTy));
3318 Out << ")(&" << GetValueName(Op)
3319 << "))[" << (SrcVal & (NumElts-1)) << "]";
3320 } else if (isa<ConstantAggregateZero>(Op) || isa<UndefValue>(Op)) {
3323 printConstant(cast<ConstantVector>(Op)->getOperand(SrcVal &
3332 void CWriter::visitInsertValueInst(InsertValueInst &IVI) {
3333 // Start by copying the entire aggregate value into the result variable.
3334 writeOperand(IVI.getOperand(0));
3337 // Then do the insert to update the field.
3338 Out << GetValueName(&IVI);
3339 for (const unsigned *b = IVI.idx_begin(), *i = b, *e = IVI.idx_end();
3341 const Type *IndexedTy =
3342 ExtractValueInst::getIndexedType(IVI.getOperand(0)->getType(), b, i+1);
3343 if (isa<ArrayType>(IndexedTy))
3344 Out << ".array[" << *i << "]";
3346 Out << ".field" << *i;
3349 writeOperand(IVI.getOperand(1));
3352 void CWriter::visitExtractValueInst(ExtractValueInst &EVI) {
3354 if (isa<UndefValue>(EVI.getOperand(0))) {
3356 printType(Out, EVI.getType());
3357 Out << ") 0/*UNDEF*/";
3359 Out << GetValueName(EVI.getOperand(0));
3360 for (const unsigned *b = EVI.idx_begin(), *i = b, *e = EVI.idx_end();
3362 const Type *IndexedTy =
3363 ExtractValueInst::getIndexedType(EVI.getOperand(0)->getType(), b, i+1);
3364 if (isa<ArrayType>(IndexedTy))
3365 Out << ".array[" << *i << "]";
3367 Out << ".field" << *i;
3373 //===----------------------------------------------------------------------===//
3374 // External Interface declaration
3375 //===----------------------------------------------------------------------===//
3377 bool CTargetMachine::addPassesToEmitWholeFile(PassManager &PM,
3379 CodeGenFileType FileType,
3381 if (FileType != TargetMachine::AssemblyFile) return true;
3383 PM.add(createGCLoweringPass());
3384 PM.add(createLowerAllocationsPass(true));
3385 PM.add(createLowerInvokePass());
3386 PM.add(createCFGSimplificationPass()); // clean up after lower invoke.
3387 PM.add(new CBackendNameAllUsedStructsAndMergeFunctions());
3388 PM.add(new CWriter(o));
3389 PM.add(createGCInfoDeleter());