1 //===-- CBackend.cpp - Library for converting LLVM code to C --------------===//
3 // The LLVM Compiler Infrastructure
5 // This file is distributed under the University of Illinois Open Source
6 // License. See LICENSE.TXT for details.
8 //===----------------------------------------------------------------------===//
10 // This library converts LLVM code to C code, compilable by GCC and other C
13 //===----------------------------------------------------------------------===//
15 #include "CTargetMachine.h"
16 #include "llvm/CallingConv.h"
17 #include "llvm/Constants.h"
18 #include "llvm/DerivedTypes.h"
19 #include "llvm/Module.h"
20 #include "llvm/Instructions.h"
21 #include "llvm/Pass.h"
22 #include "llvm/PassManager.h"
23 #include "llvm/TypeSymbolTable.h"
24 #include "llvm/Intrinsics.h"
25 #include "llvm/IntrinsicInst.h"
26 #include "llvm/InlineAsm.h"
27 #include "llvm/Analysis/ConstantsScanner.h"
28 #include "llvm/Analysis/FindUsedTypes.h"
29 #include "llvm/Analysis/LoopInfo.h"
30 #include "llvm/CodeGen/Passes.h"
31 #include "llvm/CodeGen/IntrinsicLowering.h"
32 #include "llvm/Transforms/Scalar.h"
33 #include "llvm/Target/TargetMachineRegistry.h"
34 #include "llvm/Target/TargetAsmInfo.h"
35 #include "llvm/Target/TargetData.h"
36 #include "llvm/Support/CallSite.h"
37 #include "llvm/Support/CFG.h"
38 #include "llvm/Support/GetElementPtrTypeIterator.h"
39 #include "llvm/Support/InstVisitor.h"
40 #include "llvm/Support/Mangler.h"
41 #include "llvm/Support/MathExtras.h"
42 #include "llvm/ADT/StringExtras.h"
43 #include "llvm/ADT/STLExtras.h"
44 #include "llvm/Support/MathExtras.h"
45 #include "llvm/Config/config.h"
50 // Register the target.
51 static RegisterTarget<CTargetMachine> X("c", " C backend");
54 /// CBackendNameAllUsedStructsAndMergeFunctions - This pass inserts names for
55 /// any unnamed structure types that are used by the program, and merges
56 /// external functions with the same name.
58 class CBackendNameAllUsedStructsAndMergeFunctions : public ModulePass {
61 CBackendNameAllUsedStructsAndMergeFunctions()
62 : ModulePass((intptr_t)&ID) {}
63 void getAnalysisUsage(AnalysisUsage &AU) const {
64 AU.addRequired<FindUsedTypes>();
67 virtual const char *getPassName() const {
68 return "C backend type canonicalizer";
71 virtual bool runOnModule(Module &M);
74 char CBackendNameAllUsedStructsAndMergeFunctions::ID = 0;
76 /// CWriter - This class is the main chunk of code that converts an LLVM
77 /// module to a C translation unit.
78 class CWriter : public FunctionPass, public InstVisitor<CWriter> {
80 IntrinsicLowering *IL;
83 const Module *TheModule;
84 const TargetAsmInfo* TAsm;
86 std::map<const Type *, std::string> TypeNames;
87 std::map<const ConstantFP *, unsigned> FPConstantMap;
88 std::set<Function*> intrinsicPrototypesAlreadyGenerated;
89 std::set<const Argument*> ByValParams;
93 explicit CWriter(std::ostream &o)
94 : FunctionPass((intptr_t)&ID), Out(o), IL(0), Mang(0), LI(0),
95 TheModule(0), TAsm(0), TD(0) {}
97 virtual const char *getPassName() const { return "C backend"; }
99 void getAnalysisUsage(AnalysisUsage &AU) const {
100 AU.addRequired<LoopInfo>();
101 AU.setPreservesAll();
104 virtual bool doInitialization(Module &M);
106 bool runOnFunction(Function &F) {
107 LI = &getAnalysis<LoopInfo>();
109 // Get rid of intrinsics we can't handle.
112 // Output all floating point constants that cannot be printed accurately.
113 printFloatingPointConstants(F);
119 virtual bool doFinalization(Module &M) {
122 FPConstantMap.clear();
125 intrinsicPrototypesAlreadyGenerated.clear();
129 std::ostream &printType(std::ostream &Out, const Type *Ty,
130 bool isSigned = false,
131 const std::string &VariableName = "",
132 bool IgnoreName = false,
133 const PAListPtr &PAL = PAListPtr());
134 std::ostream &printSimpleType(std::ostream &Out, const Type *Ty,
136 const std::string &NameSoFar = "");
138 void printStructReturnPointerFunctionType(std::ostream &Out,
139 const PAListPtr &PAL,
140 const PointerType *Ty);
142 /// writeOperandDeref - Print the result of dereferencing the specified
143 /// operand with '*'. This is equivalent to printing '*' then using
144 /// writeOperand, but avoids excess syntax in some cases.
145 void writeOperandDeref(Value *Operand) {
146 if (isAddressExposed(Operand)) {
147 // Already something with an address exposed.
148 writeOperandInternal(Operand);
151 writeOperand(Operand);
156 void writeOperand(Value *Operand);
157 void writeOperandRaw(Value *Operand);
158 void writeInstComputationInline(Instruction &I);
159 void writeOperandInternal(Value *Operand);
160 void writeOperandWithCast(Value* Operand, unsigned Opcode);
161 void writeOperandWithCast(Value* Operand, const ICmpInst &I);
162 bool writeInstructionCast(const Instruction &I);
164 void writeMemoryAccess(Value *Operand, const Type *OperandType,
165 bool IsVolatile, unsigned Alignment);
168 std::string InterpretASMConstraint(InlineAsm::ConstraintInfo& c);
170 void lowerIntrinsics(Function &F);
172 void printModule(Module *M);
173 void printModuleTypes(const TypeSymbolTable &ST);
174 void printContainedStructs(const Type *Ty, std::set<const Type *> &);
175 void printFloatingPointConstants(Function &F);
176 void printFunctionSignature(const Function *F, bool Prototype);
178 void printFunction(Function &);
179 void printBasicBlock(BasicBlock *BB);
180 void printLoop(Loop *L);
182 void printCast(unsigned opcode, const Type *SrcTy, const Type *DstTy);
183 void printConstant(Constant *CPV);
184 void printConstantWithCast(Constant *CPV, unsigned Opcode);
185 bool printConstExprCast(const ConstantExpr *CE);
186 void printConstantArray(ConstantArray *CPA);
187 void printConstantVector(ConstantVector *CV);
189 /// isAddressExposed - Return true if the specified value's name needs to
190 /// have its address taken in order to get a C value of the correct type.
191 /// This happens for global variables, byval parameters, and direct allocas.
192 bool isAddressExposed(const Value *V) const {
193 if (const Argument *A = dyn_cast<Argument>(V))
194 return ByValParams.count(A);
195 return isa<GlobalVariable>(V) || isDirectAlloca(V);
198 // isInlinableInst - Attempt to inline instructions into their uses to build
199 // trees as much as possible. To do this, we have to consistently decide
200 // what is acceptable to inline, so that variable declarations don't get
201 // printed and an extra copy of the expr is not emitted.
203 static bool isInlinableInst(const Instruction &I) {
204 // Always inline cmp instructions, even if they are shared by multiple
205 // expressions. GCC generates horrible code if we don't.
209 // Must be an expression, must be used exactly once. If it is dead, we
210 // emit it inline where it would go.
211 if (I.getType() == Type::VoidTy || !I.hasOneUse() ||
212 isa<TerminatorInst>(I) || isa<CallInst>(I) || isa<PHINode>(I) ||
213 isa<LoadInst>(I) || isa<VAArgInst>(I) || isa<InsertElementInst>(I) ||
214 isa<InsertValueInst>(I))
215 // Don't inline a load across a store or other bad things!
218 // Must not be used in inline asm, extractelement, or shufflevector.
220 const Instruction &User = cast<Instruction>(*I.use_back());
221 if (isInlineAsm(User) || isa<ExtractElementInst>(User) ||
222 isa<ShuffleVectorInst>(User))
226 // Only inline instruction it if it's use is in the same BB as the inst.
227 return I.getParent() == cast<Instruction>(I.use_back())->getParent();
230 // isDirectAlloca - Define fixed sized allocas in the entry block as direct
231 // variables which are accessed with the & operator. This causes GCC to
232 // generate significantly better code than to emit alloca calls directly.
234 static const AllocaInst *isDirectAlloca(const Value *V) {
235 const AllocaInst *AI = dyn_cast<AllocaInst>(V);
236 if (!AI) return false;
237 if (AI->isArrayAllocation())
238 return 0; // FIXME: we can also inline fixed size array allocas!
239 if (AI->getParent() != &AI->getParent()->getParent()->getEntryBlock())
244 // isInlineAsm - Check if the instruction is a call to an inline asm chunk
245 static bool isInlineAsm(const Instruction& I) {
246 if (isa<CallInst>(&I) && isa<InlineAsm>(I.getOperand(0)))
251 // Instruction visitation functions
252 friend class InstVisitor<CWriter>;
254 void visitReturnInst(ReturnInst &I);
255 void visitBranchInst(BranchInst &I);
256 void visitSwitchInst(SwitchInst &I);
257 void visitInvokeInst(InvokeInst &I) {
258 assert(0 && "Lowerinvoke pass didn't work!");
261 void visitUnwindInst(UnwindInst &I) {
262 assert(0 && "Lowerinvoke pass didn't work!");
264 void visitUnreachableInst(UnreachableInst &I);
266 void visitPHINode(PHINode &I);
267 void visitBinaryOperator(Instruction &I);
268 void visitICmpInst(ICmpInst &I);
269 void visitFCmpInst(FCmpInst &I);
271 void visitCastInst (CastInst &I);
272 void visitSelectInst(SelectInst &I);
273 void visitCallInst (CallInst &I);
274 void visitInlineAsm(CallInst &I);
275 bool visitBuiltinCall(CallInst &I, Intrinsic::ID ID, bool &WroteCallee);
277 void visitMallocInst(MallocInst &I);
278 void visitAllocaInst(AllocaInst &I);
279 void visitFreeInst (FreeInst &I);
280 void visitLoadInst (LoadInst &I);
281 void visitStoreInst (StoreInst &I);
282 void visitGetElementPtrInst(GetElementPtrInst &I);
283 void visitVAArgInst (VAArgInst &I);
285 void visitInsertElementInst(InsertElementInst &I);
286 void visitExtractElementInst(ExtractElementInst &I);
287 void visitShuffleVectorInst(ShuffleVectorInst &SVI);
288 void visitGetResultInst(GetResultInst &GRI);
290 void visitInsertValueInst(InsertValueInst &I);
291 void visitExtractValueInst(ExtractValueInst &I);
293 void visitInstruction(Instruction &I) {
294 cerr << "C Writer does not know about " << I;
298 void outputLValue(Instruction *I) {
299 Out << " " << GetValueName(I) << " = ";
302 bool isGotoCodeNecessary(BasicBlock *From, BasicBlock *To);
303 void printPHICopiesForSuccessor(BasicBlock *CurBlock,
304 BasicBlock *Successor, unsigned Indent);
305 void printBranchToBlock(BasicBlock *CurBlock, BasicBlock *SuccBlock,
307 void printGEPExpression(Value *Ptr, gep_type_iterator I,
308 gep_type_iterator E);
310 std::string GetValueName(const Value *Operand);
314 char CWriter::ID = 0;
316 /// This method inserts names for any unnamed structure types that are used by
317 /// the program, and removes names from structure types that are not used by the
320 bool CBackendNameAllUsedStructsAndMergeFunctions::runOnModule(Module &M) {
321 // Get a set of types that are used by the program...
322 std::set<const Type *> UT = getAnalysis<FindUsedTypes>().getTypes();
324 // Loop over the module symbol table, removing types from UT that are
325 // already named, and removing names for types that are not used.
327 TypeSymbolTable &TST = M.getTypeSymbolTable();
328 for (TypeSymbolTable::iterator TI = TST.begin(), TE = TST.end();
330 TypeSymbolTable::iterator I = TI++;
332 // If this isn't a struct or array type, remove it from our set of types
333 // to name. This simplifies emission later.
334 if (!isa<StructType>(I->second) && !isa<OpaqueType>(I->second) &&
335 !isa<ArrayType>(I->second)) {
338 // If this is not used, remove it from the symbol table.
339 std::set<const Type *>::iterator UTI = UT.find(I->second);
343 UT.erase(UTI); // Only keep one name for this type.
347 // UT now contains types that are not named. Loop over it, naming
350 bool Changed = false;
351 unsigned RenameCounter = 0;
352 for (std::set<const Type *>::const_iterator I = UT.begin(), E = UT.end();
354 if (isa<StructType>(*I) || isa<ArrayType>(*I)) {
355 while (M.addTypeName("unnamed"+utostr(RenameCounter), *I))
361 // Loop over all external functions and globals. If we have two with
362 // identical names, merge them.
363 // FIXME: This code should disappear when we don't allow values with the same
364 // names when they have different types!
365 std::map<std::string, GlobalValue*> ExtSymbols;
366 for (Module::iterator I = M.begin(), E = M.end(); I != E;) {
368 if (GV->isDeclaration() && GV->hasName()) {
369 std::pair<std::map<std::string, GlobalValue*>::iterator, bool> X
370 = ExtSymbols.insert(std::make_pair(GV->getName(), GV));
372 // Found a conflict, replace this global with the previous one.
373 GlobalValue *OldGV = X.first->second;
374 GV->replaceAllUsesWith(ConstantExpr::getBitCast(OldGV, GV->getType()));
375 GV->eraseFromParent();
380 // Do the same for globals.
381 for (Module::global_iterator I = M.global_begin(), E = M.global_end();
383 GlobalVariable *GV = I++;
384 if (GV->isDeclaration() && GV->hasName()) {
385 std::pair<std::map<std::string, GlobalValue*>::iterator, bool> X
386 = ExtSymbols.insert(std::make_pair(GV->getName(), GV));
388 // Found a conflict, replace this global with the previous one.
389 GlobalValue *OldGV = X.first->second;
390 GV->replaceAllUsesWith(ConstantExpr::getBitCast(OldGV, GV->getType()));
391 GV->eraseFromParent();
400 /// printStructReturnPointerFunctionType - This is like printType for a struct
401 /// return type, except, instead of printing the type as void (*)(Struct*, ...)
402 /// print it as "Struct (*)(...)", for struct return functions.
403 void CWriter::printStructReturnPointerFunctionType(std::ostream &Out,
404 const PAListPtr &PAL,
405 const PointerType *TheTy) {
406 const FunctionType *FTy = cast<FunctionType>(TheTy->getElementType());
407 std::stringstream FunctionInnards;
408 FunctionInnards << " (*) (";
409 bool PrintedType = false;
411 FunctionType::param_iterator I = FTy->param_begin(), E = FTy->param_end();
412 const Type *RetTy = cast<PointerType>(I->get())->getElementType();
414 for (++I, ++Idx; I != E; ++I, ++Idx) {
416 FunctionInnards << ", ";
417 const Type *ArgTy = *I;
418 if (PAL.paramHasAttr(Idx, ParamAttr::ByVal)) {
419 assert(isa<PointerType>(ArgTy));
420 ArgTy = cast<PointerType>(ArgTy)->getElementType();
422 printType(FunctionInnards, ArgTy,
423 /*isSigned=*/PAL.paramHasAttr(Idx, ParamAttr::SExt), "");
426 if (FTy->isVarArg()) {
428 FunctionInnards << ", ...";
429 } else if (!PrintedType) {
430 FunctionInnards << "void";
432 FunctionInnards << ')';
433 std::string tstr = FunctionInnards.str();
434 printType(Out, RetTy,
435 /*isSigned=*/PAL.paramHasAttr(0, ParamAttr::SExt), tstr);
439 CWriter::printSimpleType(std::ostream &Out, const Type *Ty, bool isSigned,
440 const std::string &NameSoFar) {
441 assert((Ty->isPrimitiveType() || Ty->isInteger() || isa<VectorType>(Ty)) &&
442 "Invalid type for printSimpleType");
443 switch (Ty->getTypeID()) {
444 case Type::VoidTyID: return Out << "void " << NameSoFar;
445 case Type::IntegerTyID: {
446 unsigned NumBits = cast<IntegerType>(Ty)->getBitWidth();
448 return Out << "bool " << NameSoFar;
449 else if (NumBits <= 8)
450 return Out << (isSigned?"signed":"unsigned") << " char " << NameSoFar;
451 else if (NumBits <= 16)
452 return Out << (isSigned?"signed":"unsigned") << " short " << NameSoFar;
453 else if (NumBits <= 32)
454 return Out << (isSigned?"signed":"unsigned") << " int " << NameSoFar;
455 else if (NumBits <= 64)
456 return Out << (isSigned?"signed":"unsigned") << " long long "<< NameSoFar;
458 assert(NumBits <= 128 && "Bit widths > 128 not implemented yet");
459 return Out << (isSigned?"llvmInt128":"llvmUInt128") << " " << NameSoFar;
462 case Type::FloatTyID: return Out << "float " << NameSoFar;
463 case Type::DoubleTyID: return Out << "double " << NameSoFar;
464 // Lacking emulation of FP80 on PPC, etc., we assume whichever of these is
465 // present matches host 'long double'.
466 case Type::X86_FP80TyID:
467 case Type::PPC_FP128TyID:
468 case Type::FP128TyID: return Out << "long double " << NameSoFar;
470 case Type::VectorTyID: {
471 const VectorType *VTy = cast<VectorType>(Ty);
472 return printSimpleType(Out, VTy->getElementType(), isSigned,
473 " __attribute__((vector_size(" +
474 utostr(TD->getABITypeSize(VTy)) + " ))) " + NameSoFar);
478 cerr << "Unknown primitive type: " << *Ty << "\n";
483 // Pass the Type* and the variable name and this prints out the variable
486 std::ostream &CWriter::printType(std::ostream &Out, const Type *Ty,
487 bool isSigned, const std::string &NameSoFar,
488 bool IgnoreName, const PAListPtr &PAL) {
489 if (Ty->isPrimitiveType() || Ty->isInteger() || isa<VectorType>(Ty)) {
490 printSimpleType(Out, Ty, isSigned, NameSoFar);
494 // Check to see if the type is named.
495 if (!IgnoreName || isa<OpaqueType>(Ty)) {
496 std::map<const Type *, std::string>::iterator I = TypeNames.find(Ty);
497 if (I != TypeNames.end()) return Out << I->second << ' ' << NameSoFar;
500 switch (Ty->getTypeID()) {
501 case Type::FunctionTyID: {
502 const FunctionType *FTy = cast<FunctionType>(Ty);
503 std::stringstream FunctionInnards;
504 FunctionInnards << " (" << NameSoFar << ") (";
506 for (FunctionType::param_iterator I = FTy->param_begin(),
507 E = FTy->param_end(); I != E; ++I) {
508 const Type *ArgTy = *I;
509 if (PAL.paramHasAttr(Idx, ParamAttr::ByVal)) {
510 assert(isa<PointerType>(ArgTy));
511 ArgTy = cast<PointerType>(ArgTy)->getElementType();
513 if (I != FTy->param_begin())
514 FunctionInnards << ", ";
515 printType(FunctionInnards, ArgTy,
516 /*isSigned=*/PAL.paramHasAttr(Idx, ParamAttr::SExt), "");
519 if (FTy->isVarArg()) {
520 if (FTy->getNumParams())
521 FunctionInnards << ", ...";
522 } else if (!FTy->getNumParams()) {
523 FunctionInnards << "void";
525 FunctionInnards << ')';
526 std::string tstr = FunctionInnards.str();
527 printType(Out, FTy->getReturnType(),
528 /*isSigned=*/PAL.paramHasAttr(0, ParamAttr::SExt), tstr);
531 case Type::StructTyID: {
532 const StructType *STy = cast<StructType>(Ty);
533 Out << NameSoFar + " {\n";
535 for (StructType::element_iterator I = STy->element_begin(),
536 E = STy->element_end(); I != E; ++I) {
538 printType(Out, *I, false, "field" + utostr(Idx++));
543 Out << " __attribute__ ((packed))";
547 case Type::PointerTyID: {
548 const PointerType *PTy = cast<PointerType>(Ty);
549 std::string ptrName = "*" + NameSoFar;
551 if (isa<ArrayType>(PTy->getElementType()) ||
552 isa<VectorType>(PTy->getElementType()))
553 ptrName = "(" + ptrName + ")";
556 // Must be a function ptr cast!
557 return printType(Out, PTy->getElementType(), false, ptrName, true, PAL);
558 return printType(Out, PTy->getElementType(), false, ptrName);
561 case Type::ArrayTyID: {
562 const ArrayType *ATy = cast<ArrayType>(Ty);
563 unsigned NumElements = ATy->getNumElements();
564 if (NumElements == 0) NumElements = 1;
565 // Arrays are wrapped in structs to allow them to have normal
566 // value semantics (avoiding the array "decay").
567 Out << NameSoFar << " { ";
568 printType(Out, ATy->getElementType(), false,
569 "array[" + utostr(NumElements) + "]");
573 case Type::OpaqueTyID: {
574 static int Count = 0;
575 std::string TyName = "struct opaque_" + itostr(Count++);
576 assert(TypeNames.find(Ty) == TypeNames.end());
577 TypeNames[Ty] = TyName;
578 return Out << TyName << ' ' << NameSoFar;
581 assert(0 && "Unhandled case in getTypeProps!");
588 void CWriter::printConstantArray(ConstantArray *CPA) {
590 // As a special case, print the array as a string if it is an array of
591 // ubytes or an array of sbytes with positive values.
593 const Type *ETy = CPA->getType()->getElementType();
594 bool isString = (ETy == Type::Int8Ty || ETy == Type::Int8Ty);
596 // Make sure the last character is a null char, as automatically added by C
597 if (isString && (CPA->getNumOperands() == 0 ||
598 !cast<Constant>(*(CPA->op_end()-1))->isNullValue()))
603 // Keep track of whether the last number was a hexadecimal escape
604 bool LastWasHex = false;
606 // Do not include the last character, which we know is null
607 for (unsigned i = 0, e = CPA->getNumOperands()-1; i != e; ++i) {
608 unsigned char C = cast<ConstantInt>(CPA->getOperand(i))->getZExtValue();
610 // Print it out literally if it is a printable character. The only thing
611 // to be careful about is when the last letter output was a hex escape
612 // code, in which case we have to be careful not to print out hex digits
613 // explicitly (the C compiler thinks it is a continuation of the previous
614 // character, sheesh...)
616 if (isprint(C) && (!LastWasHex || !isxdigit(C))) {
618 if (C == '"' || C == '\\')
625 case '\n': Out << "\\n"; break;
626 case '\t': Out << "\\t"; break;
627 case '\r': Out << "\\r"; break;
628 case '\v': Out << "\\v"; break;
629 case '\a': Out << "\\a"; break;
630 case '\"': Out << "\\\""; break;
631 case '\'': Out << "\\\'"; break;
634 Out << (char)(( C/16 < 10) ? ( C/16 +'0') : ( C/16 -10+'A'));
635 Out << (char)(((C&15) < 10) ? ((C&15)+'0') : ((C&15)-10+'A'));
644 if (CPA->getNumOperands()) {
646 printConstant(cast<Constant>(CPA->getOperand(0)));
647 for (unsigned i = 1, e = CPA->getNumOperands(); i != e; ++i) {
649 printConstant(cast<Constant>(CPA->getOperand(i)));
656 void CWriter::printConstantVector(ConstantVector *CP) {
658 if (CP->getNumOperands()) {
660 printConstant(cast<Constant>(CP->getOperand(0)));
661 for (unsigned i = 1, e = CP->getNumOperands(); i != e; ++i) {
663 printConstant(cast<Constant>(CP->getOperand(i)));
669 // isFPCSafeToPrint - Returns true if we may assume that CFP may be written out
670 // textually as a double (rather than as a reference to a stack-allocated
671 // variable). We decide this by converting CFP to a string and back into a
672 // double, and then checking whether the conversion results in a bit-equal
673 // double to the original value of CFP. This depends on us and the target C
674 // compiler agreeing on the conversion process (which is pretty likely since we
675 // only deal in IEEE FP).
677 static bool isFPCSafeToPrint(const ConstantFP *CFP) {
678 // Do long doubles in hex for now.
679 if (CFP->getType()!=Type::FloatTy && CFP->getType()!=Type::DoubleTy)
681 APFloat APF = APFloat(CFP->getValueAPF()); // copy
682 if (CFP->getType()==Type::FloatTy)
683 APF.convert(APFloat::IEEEdouble, APFloat::rmNearestTiesToEven);
684 #if HAVE_PRINTF_A && ENABLE_CBE_PRINTF_A
686 sprintf(Buffer, "%a", APF.convertToDouble());
687 if (!strncmp(Buffer, "0x", 2) ||
688 !strncmp(Buffer, "-0x", 3) ||
689 !strncmp(Buffer, "+0x", 3))
690 return APF.bitwiseIsEqual(APFloat(atof(Buffer)));
693 std::string StrVal = ftostr(APF);
695 while (StrVal[0] == ' ')
696 StrVal.erase(StrVal.begin());
698 // Check to make sure that the stringized number is not some string like "Inf"
699 // or NaN. Check that the string matches the "[-+]?[0-9]" regex.
700 if ((StrVal[0] >= '0' && StrVal[0] <= '9') ||
701 ((StrVal[0] == '-' || StrVal[0] == '+') &&
702 (StrVal[1] >= '0' && StrVal[1] <= '9')))
703 // Reparse stringized version!
704 return APF.bitwiseIsEqual(APFloat(atof(StrVal.c_str())));
709 /// Print out the casting for a cast operation. This does the double casting
710 /// necessary for conversion to the destination type, if necessary.
711 /// @brief Print a cast
712 void CWriter::printCast(unsigned opc, const Type *SrcTy, const Type *DstTy) {
713 // Print the destination type cast
715 case Instruction::UIToFP:
716 case Instruction::SIToFP:
717 case Instruction::IntToPtr:
718 case Instruction::Trunc:
719 case Instruction::BitCast:
720 case Instruction::FPExt:
721 case Instruction::FPTrunc: // For these the DstTy sign doesn't matter
723 printType(Out, DstTy);
726 case Instruction::ZExt:
727 case Instruction::PtrToInt:
728 case Instruction::FPToUI: // For these, make sure we get an unsigned dest
730 printSimpleType(Out, DstTy, false);
733 case Instruction::SExt:
734 case Instruction::FPToSI: // For these, make sure we get a signed dest
736 printSimpleType(Out, DstTy, true);
740 assert(0 && "Invalid cast opcode");
743 // Print the source type cast
745 case Instruction::UIToFP:
746 case Instruction::ZExt:
748 printSimpleType(Out, SrcTy, false);
751 case Instruction::SIToFP:
752 case Instruction::SExt:
754 printSimpleType(Out, SrcTy, true);
757 case Instruction::IntToPtr:
758 case Instruction::PtrToInt:
759 // Avoid "cast to pointer from integer of different size" warnings
760 Out << "(unsigned long)";
762 case Instruction::Trunc:
763 case Instruction::BitCast:
764 case Instruction::FPExt:
765 case Instruction::FPTrunc:
766 case Instruction::FPToSI:
767 case Instruction::FPToUI:
768 break; // These don't need a source cast.
770 assert(0 && "Invalid cast opcode");
775 // printConstant - The LLVM Constant to C Constant converter.
776 void CWriter::printConstant(Constant *CPV) {
777 if (const ConstantExpr *CE = dyn_cast<ConstantExpr>(CPV)) {
778 switch (CE->getOpcode()) {
779 case Instruction::Trunc:
780 case Instruction::ZExt:
781 case Instruction::SExt:
782 case Instruction::FPTrunc:
783 case Instruction::FPExt:
784 case Instruction::UIToFP:
785 case Instruction::SIToFP:
786 case Instruction::FPToUI:
787 case Instruction::FPToSI:
788 case Instruction::PtrToInt:
789 case Instruction::IntToPtr:
790 case Instruction::BitCast:
792 printCast(CE->getOpcode(), CE->getOperand(0)->getType(), CE->getType());
793 if (CE->getOpcode() == Instruction::SExt &&
794 CE->getOperand(0)->getType() == Type::Int1Ty) {
795 // Make sure we really sext from bool here by subtracting from 0
798 printConstant(CE->getOperand(0));
799 if (CE->getType() == Type::Int1Ty &&
800 (CE->getOpcode() == Instruction::Trunc ||
801 CE->getOpcode() == Instruction::FPToUI ||
802 CE->getOpcode() == Instruction::FPToSI ||
803 CE->getOpcode() == Instruction::PtrToInt)) {
804 // Make sure we really truncate to bool here by anding with 1
810 case Instruction::GetElementPtr:
812 printGEPExpression(CE->getOperand(0), gep_type_begin(CPV),
816 case Instruction::Select:
818 printConstant(CE->getOperand(0));
820 printConstant(CE->getOperand(1));
822 printConstant(CE->getOperand(2));
825 case Instruction::Add:
826 case Instruction::Sub:
827 case Instruction::Mul:
828 case Instruction::SDiv:
829 case Instruction::UDiv:
830 case Instruction::FDiv:
831 case Instruction::URem:
832 case Instruction::SRem:
833 case Instruction::FRem:
834 case Instruction::And:
835 case Instruction::Or:
836 case Instruction::Xor:
837 case Instruction::ICmp:
838 case Instruction::Shl:
839 case Instruction::LShr:
840 case Instruction::AShr:
843 bool NeedsClosingParens = printConstExprCast(CE);
844 printConstantWithCast(CE->getOperand(0), CE->getOpcode());
845 switch (CE->getOpcode()) {
846 case Instruction::Add: Out << " + "; break;
847 case Instruction::Sub: Out << " - "; break;
848 case Instruction::Mul: Out << " * "; break;
849 case Instruction::URem:
850 case Instruction::SRem:
851 case Instruction::FRem: Out << " % "; break;
852 case Instruction::UDiv:
853 case Instruction::SDiv:
854 case Instruction::FDiv: Out << " / "; break;
855 case Instruction::And: Out << " & "; break;
856 case Instruction::Or: Out << " | "; break;
857 case Instruction::Xor: Out << " ^ "; break;
858 case Instruction::Shl: Out << " << "; break;
859 case Instruction::LShr:
860 case Instruction::AShr: Out << " >> "; break;
861 case Instruction::ICmp:
862 switch (CE->getPredicate()) {
863 case ICmpInst::ICMP_EQ: Out << " == "; break;
864 case ICmpInst::ICMP_NE: Out << " != "; break;
865 case ICmpInst::ICMP_SLT:
866 case ICmpInst::ICMP_ULT: Out << " < "; break;
867 case ICmpInst::ICMP_SLE:
868 case ICmpInst::ICMP_ULE: Out << " <= "; break;
869 case ICmpInst::ICMP_SGT:
870 case ICmpInst::ICMP_UGT: Out << " > "; break;
871 case ICmpInst::ICMP_SGE:
872 case ICmpInst::ICMP_UGE: Out << " >= "; break;
873 default: assert(0 && "Illegal ICmp predicate");
876 default: assert(0 && "Illegal opcode here!");
878 printConstantWithCast(CE->getOperand(1), CE->getOpcode());
879 if (NeedsClosingParens)
884 case Instruction::FCmp: {
886 bool NeedsClosingParens = printConstExprCast(CE);
887 if (CE->getPredicate() == FCmpInst::FCMP_FALSE)
889 else if (CE->getPredicate() == FCmpInst::FCMP_TRUE)
893 switch (CE->getPredicate()) {
894 default: assert(0 && "Illegal FCmp predicate");
895 case FCmpInst::FCMP_ORD: op = "ord"; break;
896 case FCmpInst::FCMP_UNO: op = "uno"; break;
897 case FCmpInst::FCMP_UEQ: op = "ueq"; break;
898 case FCmpInst::FCMP_UNE: op = "une"; break;
899 case FCmpInst::FCMP_ULT: op = "ult"; break;
900 case FCmpInst::FCMP_ULE: op = "ule"; break;
901 case FCmpInst::FCMP_UGT: op = "ugt"; break;
902 case FCmpInst::FCMP_UGE: op = "uge"; break;
903 case FCmpInst::FCMP_OEQ: op = "oeq"; break;
904 case FCmpInst::FCMP_ONE: op = "one"; break;
905 case FCmpInst::FCMP_OLT: op = "olt"; break;
906 case FCmpInst::FCMP_OLE: op = "ole"; break;
907 case FCmpInst::FCMP_OGT: op = "ogt"; break;
908 case FCmpInst::FCMP_OGE: op = "oge"; break;
910 Out << "llvm_fcmp_" << op << "(";
911 printConstantWithCast(CE->getOperand(0), CE->getOpcode());
913 printConstantWithCast(CE->getOperand(1), CE->getOpcode());
916 if (NeedsClosingParens)
922 cerr << "CWriter Error: Unhandled constant expression: "
926 } else if (isa<UndefValue>(CPV) && CPV->getType()->isSingleValueType()) {
928 printType(Out, CPV->getType()); // sign doesn't matter
930 if (!isa<VectorType>(CPV->getType())) {
938 if (ConstantInt *CI = dyn_cast<ConstantInt>(CPV)) {
939 const Type* Ty = CI->getType();
940 if (Ty == Type::Int1Ty)
941 Out << (CI->getZExtValue() ? '1' : '0');
942 else if (Ty == Type::Int32Ty)
943 Out << CI->getZExtValue() << 'u';
944 else if (Ty->getPrimitiveSizeInBits() > 32)
945 Out << CI->getZExtValue() << "ull";
948 printSimpleType(Out, Ty, false) << ')';
949 if (CI->isMinValue(true))
950 Out << CI->getZExtValue() << 'u';
952 Out << CI->getSExtValue();
958 switch (CPV->getType()->getTypeID()) {
959 case Type::FloatTyID:
960 case Type::DoubleTyID:
961 case Type::X86_FP80TyID:
962 case Type::PPC_FP128TyID:
963 case Type::FP128TyID: {
964 ConstantFP *FPC = cast<ConstantFP>(CPV);
965 std::map<const ConstantFP*, unsigned>::iterator I = FPConstantMap.find(FPC);
966 if (I != FPConstantMap.end()) {
967 // Because of FP precision problems we must load from a stack allocated
968 // value that holds the value in hex.
969 Out << "(*(" << (FPC->getType() == Type::FloatTy ? "float" :
970 FPC->getType() == Type::DoubleTy ? "double" :
972 << "*)&FPConstant" << I->second << ')';
974 assert(FPC->getType() == Type::FloatTy ||
975 FPC->getType() == Type::DoubleTy);
976 double V = FPC->getType() == Type::FloatTy ?
977 FPC->getValueAPF().convertToFloat() :
978 FPC->getValueAPF().convertToDouble();
982 // FIXME the actual NaN bits should be emitted.
983 // The prefix for a quiet NaN is 0x7FF8. For a signalling NaN,
985 const unsigned long QuietNaN = 0x7ff8UL;
986 //const unsigned long SignalNaN = 0x7ff4UL;
988 // We need to grab the first part of the FP #
991 uint64_t ll = DoubleToBits(V);
992 sprintf(Buffer, "0x%llx", static_cast<long long>(ll));
994 std::string Num(&Buffer[0], &Buffer[6]);
995 unsigned long Val = strtoul(Num.c_str(), 0, 16);
997 if (FPC->getType() == Type::FloatTy)
998 Out << "LLVM_NAN" << (Val == QuietNaN ? "" : "S") << "F(\""
999 << Buffer << "\") /*nan*/ ";
1001 Out << "LLVM_NAN" << (Val == QuietNaN ? "" : "S") << "(\""
1002 << Buffer << "\") /*nan*/ ";
1003 } else if (IsInf(V)) {
1005 if (V < 0) Out << '-';
1006 Out << "LLVM_INF" << (FPC->getType() == Type::FloatTy ? "F" : "")
1010 #if HAVE_PRINTF_A && ENABLE_CBE_PRINTF_A
1011 // Print out the constant as a floating point number.
1013 sprintf(Buffer, "%a", V);
1016 Num = ftostr(FPC->getValueAPF());
1024 case Type::ArrayTyID:
1025 Out << "{ "; // Arrays are wrapped in struct types.
1026 if (ConstantArray *CA = dyn_cast<ConstantArray>(CPV)) {
1027 printConstantArray(CA);
1029 assert(isa<ConstantAggregateZero>(CPV) || isa<UndefValue>(CPV));
1030 const ArrayType *AT = cast<ArrayType>(CPV->getType());
1032 if (AT->getNumElements()) {
1034 Constant *CZ = Constant::getNullValue(AT->getElementType());
1036 for (unsigned i = 1, e = AT->getNumElements(); i != e; ++i) {
1043 Out << " }"; // Arrays are wrapped in struct types.
1046 case Type::VectorTyID:
1047 // Use C99 compound expression literal initializer syntax.
1049 printType(Out, CPV->getType());
1051 if (ConstantVector *CV = dyn_cast<ConstantVector>(CPV)) {
1052 printConstantVector(CV);
1054 assert(isa<ConstantAggregateZero>(CPV) || isa<UndefValue>(CPV));
1055 const VectorType *VT = cast<VectorType>(CPV->getType());
1057 Constant *CZ = Constant::getNullValue(VT->getElementType());
1059 for (unsigned i = 1, e = VT->getNumElements(); i != e; ++i) {
1067 case Type::StructTyID:
1068 if (isa<ConstantAggregateZero>(CPV) || isa<UndefValue>(CPV)) {
1069 const StructType *ST = cast<StructType>(CPV->getType());
1071 if (ST->getNumElements()) {
1073 printConstant(Constant::getNullValue(ST->getElementType(0)));
1074 for (unsigned i = 1, e = ST->getNumElements(); i != e; ++i) {
1076 printConstant(Constant::getNullValue(ST->getElementType(i)));
1082 if (CPV->getNumOperands()) {
1084 printConstant(cast<Constant>(CPV->getOperand(0)));
1085 for (unsigned i = 1, e = CPV->getNumOperands(); i != e; ++i) {
1087 printConstant(cast<Constant>(CPV->getOperand(i)));
1094 case Type::PointerTyID:
1095 if (isa<ConstantPointerNull>(CPV)) {
1097 printType(Out, CPV->getType()); // sign doesn't matter
1098 Out << ")/*NULL*/0)";
1100 } else if (GlobalValue *GV = dyn_cast<GlobalValue>(CPV)) {
1106 cerr << "Unknown constant type: " << *CPV << "\n";
1111 // Some constant expressions need to be casted back to the original types
1112 // because their operands were casted to the expected type. This function takes
1113 // care of detecting that case and printing the cast for the ConstantExpr.
1114 bool CWriter::printConstExprCast(const ConstantExpr* CE) {
1115 bool NeedsExplicitCast = false;
1116 const Type *Ty = CE->getOperand(0)->getType();
1117 bool TypeIsSigned = false;
1118 switch (CE->getOpcode()) {
1119 case Instruction::LShr:
1120 case Instruction::URem:
1121 case Instruction::UDiv: NeedsExplicitCast = true; break;
1122 case Instruction::AShr:
1123 case Instruction::SRem:
1124 case Instruction::SDiv: NeedsExplicitCast = true; TypeIsSigned = true; break;
1125 case Instruction::SExt:
1127 NeedsExplicitCast = true;
1128 TypeIsSigned = true;
1130 case Instruction::ZExt:
1131 case Instruction::Trunc:
1132 case Instruction::FPTrunc:
1133 case Instruction::FPExt:
1134 case Instruction::UIToFP:
1135 case Instruction::SIToFP:
1136 case Instruction::FPToUI:
1137 case Instruction::FPToSI:
1138 case Instruction::PtrToInt:
1139 case Instruction::IntToPtr:
1140 case Instruction::BitCast:
1142 NeedsExplicitCast = true;
1146 if (NeedsExplicitCast) {
1148 if (Ty->isInteger() && Ty != Type::Int1Ty)
1149 printSimpleType(Out, Ty, TypeIsSigned);
1151 printType(Out, Ty); // not integer, sign doesn't matter
1154 return NeedsExplicitCast;
1157 // Print a constant assuming that it is the operand for a given Opcode. The
1158 // opcodes that care about sign need to cast their operands to the expected
1159 // type before the operation proceeds. This function does the casting.
1160 void CWriter::printConstantWithCast(Constant* CPV, unsigned Opcode) {
1162 // Extract the operand's type, we'll need it.
1163 const Type* OpTy = CPV->getType();
1165 // Indicate whether to do the cast or not.
1166 bool shouldCast = false;
1167 bool typeIsSigned = false;
1169 // Based on the Opcode for which this Constant is being written, determine
1170 // the new type to which the operand should be casted by setting the value
1171 // of OpTy. If we change OpTy, also set shouldCast to true so it gets
1175 // for most instructions, it doesn't matter
1177 case Instruction::LShr:
1178 case Instruction::UDiv:
1179 case Instruction::URem:
1182 case Instruction::AShr:
1183 case Instruction::SDiv:
1184 case Instruction::SRem:
1186 typeIsSigned = true;
1190 // Write out the casted constant if we should, otherwise just write the
1194 printSimpleType(Out, OpTy, typeIsSigned);
1202 std::string CWriter::GetValueName(const Value *Operand) {
1205 if (!isa<GlobalValue>(Operand) && Operand->getName() != "") {
1206 std::string VarName;
1208 Name = Operand->getName();
1209 VarName.reserve(Name.capacity());
1211 for (std::string::iterator I = Name.begin(), E = Name.end();
1215 if (!((ch >= 'a' && ch <= 'z') || (ch >= 'A' && ch <= 'Z') ||
1216 (ch >= '0' && ch <= '9') || ch == '_')) {
1218 sprintf(buffer, "_%x_", ch);
1224 Name = "llvm_cbe_" + VarName;
1226 Name = Mang->getValueName(Operand);
1232 /// writeInstComputationInline - Emit the computation for the specified
1233 /// instruction inline, with no destination provided.
1234 void CWriter::writeInstComputationInline(Instruction &I) {
1235 // If this is a non-trivial bool computation, make sure to truncate down to
1236 // a 1 bit value. This is important because we want "add i1 x, y" to return
1237 // "0" when x and y are true, not "2" for example.
1238 bool NeedBoolTrunc = false;
1239 if (I.getType() == Type::Int1Ty && !isa<ICmpInst>(I) && !isa<FCmpInst>(I))
1240 NeedBoolTrunc = true;
1252 void CWriter::writeOperandInternal(Value *Operand) {
1253 if (Instruction *I = dyn_cast<Instruction>(Operand))
1254 // Should we inline this instruction to build a tree?
1255 if (isInlinableInst(*I) && !isDirectAlloca(I)) {
1257 writeInstComputationInline(*I);
1262 Constant* CPV = dyn_cast<Constant>(Operand);
1264 if (CPV && !isa<GlobalValue>(CPV))
1267 Out << GetValueName(Operand);
1270 void CWriter::writeOperandRaw(Value *Operand) {
1271 Constant* CPV = dyn_cast<Constant>(Operand);
1272 if (CPV && !isa<GlobalValue>(CPV)) {
1275 Out << GetValueName(Operand);
1279 void CWriter::writeOperand(Value *Operand) {
1280 bool isAddressImplicit = isAddressExposed(Operand);
1281 if (isAddressImplicit)
1282 Out << "(&"; // Global variables are referenced as their addresses by llvm
1284 writeOperandInternal(Operand);
1286 if (isAddressImplicit)
1290 // Some instructions need to have their result value casted back to the
1291 // original types because their operands were casted to the expected type.
1292 // This function takes care of detecting that case and printing the cast
1293 // for the Instruction.
1294 bool CWriter::writeInstructionCast(const Instruction &I) {
1295 const Type *Ty = I.getOperand(0)->getType();
1296 switch (I.getOpcode()) {
1297 case Instruction::LShr:
1298 case Instruction::URem:
1299 case Instruction::UDiv:
1301 printSimpleType(Out, Ty, false);
1304 case Instruction::AShr:
1305 case Instruction::SRem:
1306 case Instruction::SDiv:
1308 printSimpleType(Out, Ty, true);
1316 // Write the operand with a cast to another type based on the Opcode being used.
1317 // This will be used in cases where an instruction has specific type
1318 // requirements (usually signedness) for its operands.
1319 void CWriter::writeOperandWithCast(Value* Operand, unsigned Opcode) {
1321 // Extract the operand's type, we'll need it.
1322 const Type* OpTy = Operand->getType();
1324 // Indicate whether to do the cast or not.
1325 bool shouldCast = false;
1327 // Indicate whether the cast should be to a signed type or not.
1328 bool castIsSigned = false;
1330 // Based on the Opcode for which this Operand is being written, determine
1331 // the new type to which the operand should be casted by setting the value
1332 // of OpTy. If we change OpTy, also set shouldCast to true.
1335 // for most instructions, it doesn't matter
1337 case Instruction::LShr:
1338 case Instruction::UDiv:
1339 case Instruction::URem: // Cast to unsigned first
1341 castIsSigned = false;
1343 case Instruction::GetElementPtr:
1344 case Instruction::AShr:
1345 case Instruction::SDiv:
1346 case Instruction::SRem: // Cast to signed first
1348 castIsSigned = true;
1352 // Write out the casted operand if we should, otherwise just write the
1356 printSimpleType(Out, OpTy, castIsSigned);
1358 writeOperand(Operand);
1361 writeOperand(Operand);
1364 // Write the operand with a cast to another type based on the icmp predicate
1366 void CWriter::writeOperandWithCast(Value* Operand, const ICmpInst &Cmp) {
1367 // This has to do a cast to ensure the operand has the right signedness.
1368 // Also, if the operand is a pointer, we make sure to cast to an integer when
1369 // doing the comparison both for signedness and so that the C compiler doesn't
1370 // optimize things like "p < NULL" to false (p may contain an integer value
1372 bool shouldCast = Cmp.isRelational();
1374 // Write out the casted operand if we should, otherwise just write the
1377 writeOperand(Operand);
1381 // Should this be a signed comparison? If so, convert to signed.
1382 bool castIsSigned = Cmp.isSignedPredicate();
1384 // If the operand was a pointer, convert to a large integer type.
1385 const Type* OpTy = Operand->getType();
1386 if (isa<PointerType>(OpTy))
1387 OpTy = TD->getIntPtrType();
1390 printSimpleType(Out, OpTy, castIsSigned);
1392 writeOperand(Operand);
1396 // generateCompilerSpecificCode - This is where we add conditional compilation
1397 // directives to cater to specific compilers as need be.
1399 static void generateCompilerSpecificCode(std::ostream& Out,
1400 const TargetData *TD) {
1401 // Alloca is hard to get, and we don't want to include stdlib.h here.
1402 Out << "/* get a declaration for alloca */\n"
1403 << "#if defined(__CYGWIN__) || defined(__MINGW32__)\n"
1404 << "#define alloca(x) __builtin_alloca((x))\n"
1405 << "#define _alloca(x) __builtin_alloca((x))\n"
1406 << "#elif defined(__APPLE__)\n"
1407 << "extern void *__builtin_alloca(unsigned long);\n"
1408 << "#define alloca(x) __builtin_alloca(x)\n"
1409 << "#define longjmp _longjmp\n"
1410 << "#define setjmp _setjmp\n"
1411 << "#elif defined(__sun__)\n"
1412 << "#if defined(__sparcv9)\n"
1413 << "extern void *__builtin_alloca(unsigned long);\n"
1415 << "extern void *__builtin_alloca(unsigned int);\n"
1417 << "#define alloca(x) __builtin_alloca(x)\n"
1418 << "#elif defined(__FreeBSD__) || defined(__NetBSD__) || defined(__OpenBSD__)\n"
1419 << "#define alloca(x) __builtin_alloca(x)\n"
1420 << "#elif defined(_MSC_VER)\n"
1421 << "#define inline _inline\n"
1422 << "#define alloca(x) _alloca(x)\n"
1424 << "#include <alloca.h>\n"
1427 // We output GCC specific attributes to preserve 'linkonce'ness on globals.
1428 // If we aren't being compiled with GCC, just drop these attributes.
1429 Out << "#ifndef __GNUC__ /* Can only support \"linkonce\" vars with GCC */\n"
1430 << "#define __attribute__(X)\n"
1433 // On Mac OS X, "external weak" is spelled "__attribute__((weak_import))".
1434 Out << "#if defined(__GNUC__) && defined(__APPLE_CC__)\n"
1435 << "#define __EXTERNAL_WEAK__ __attribute__((weak_import))\n"
1436 << "#elif defined(__GNUC__)\n"
1437 << "#define __EXTERNAL_WEAK__ __attribute__((weak))\n"
1439 << "#define __EXTERNAL_WEAK__\n"
1442 // For now, turn off the weak linkage attribute on Mac OS X. (See above.)
1443 Out << "#if defined(__GNUC__) && defined(__APPLE_CC__)\n"
1444 << "#define __ATTRIBUTE_WEAK__\n"
1445 << "#elif defined(__GNUC__)\n"
1446 << "#define __ATTRIBUTE_WEAK__ __attribute__((weak))\n"
1448 << "#define __ATTRIBUTE_WEAK__\n"
1451 // Add hidden visibility support. FIXME: APPLE_CC?
1452 Out << "#if defined(__GNUC__)\n"
1453 << "#define __HIDDEN__ __attribute__((visibility(\"hidden\")))\n"
1456 // Define NaN and Inf as GCC builtins if using GCC, as 0 otherwise
1457 // From the GCC documentation:
1459 // double __builtin_nan (const char *str)
1461 // This is an implementation of the ISO C99 function nan.
1463 // Since ISO C99 defines this function in terms of strtod, which we do
1464 // not implement, a description of the parsing is in order. The string is
1465 // parsed as by strtol; that is, the base is recognized by leading 0 or
1466 // 0x prefixes. The number parsed is placed in the significand such that
1467 // the least significant bit of the number is at the least significant
1468 // bit of the significand. The number is truncated to fit the significand
1469 // field provided. The significand is forced to be a quiet NaN.
1471 // This function, if given a string literal, is evaluated early enough
1472 // that it is considered a compile-time constant.
1474 // float __builtin_nanf (const char *str)
1476 // Similar to __builtin_nan, except the return type is float.
1478 // double __builtin_inf (void)
1480 // Similar to __builtin_huge_val, except a warning is generated if the
1481 // target floating-point format does not support infinities. This
1482 // function is suitable for implementing the ISO C99 macro INFINITY.
1484 // float __builtin_inff (void)
1486 // Similar to __builtin_inf, except the return type is float.
1487 Out << "#ifdef __GNUC__\n"
1488 << "#define LLVM_NAN(NanStr) __builtin_nan(NanStr) /* Double */\n"
1489 << "#define LLVM_NANF(NanStr) __builtin_nanf(NanStr) /* Float */\n"
1490 << "#define LLVM_NANS(NanStr) __builtin_nans(NanStr) /* Double */\n"
1491 << "#define LLVM_NANSF(NanStr) __builtin_nansf(NanStr) /* Float */\n"
1492 << "#define LLVM_INF __builtin_inf() /* Double */\n"
1493 << "#define LLVM_INFF __builtin_inff() /* Float */\n"
1494 << "#define LLVM_PREFETCH(addr,rw,locality) "
1495 "__builtin_prefetch(addr,rw,locality)\n"
1496 << "#define __ATTRIBUTE_CTOR__ __attribute__((constructor))\n"
1497 << "#define __ATTRIBUTE_DTOR__ __attribute__((destructor))\n"
1498 << "#define LLVM_ASM __asm__\n"
1500 << "#define LLVM_NAN(NanStr) ((double)0.0) /* Double */\n"
1501 << "#define LLVM_NANF(NanStr) 0.0F /* Float */\n"
1502 << "#define LLVM_NANS(NanStr) ((double)0.0) /* Double */\n"
1503 << "#define LLVM_NANSF(NanStr) 0.0F /* Float */\n"
1504 << "#define LLVM_INF ((double)0.0) /* Double */\n"
1505 << "#define LLVM_INFF 0.0F /* Float */\n"
1506 << "#define LLVM_PREFETCH(addr,rw,locality) /* PREFETCH */\n"
1507 << "#define __ATTRIBUTE_CTOR__\n"
1508 << "#define __ATTRIBUTE_DTOR__\n"
1509 << "#define LLVM_ASM(X)\n"
1512 Out << "#if __GNUC__ < 4 /* Old GCC's, or compilers not GCC */ \n"
1513 << "#define __builtin_stack_save() 0 /* not implemented */\n"
1514 << "#define __builtin_stack_restore(X) /* noop */\n"
1517 // Output typedefs for 128-bit integers. If these are needed with a
1518 // 32-bit target or with a C compiler that doesn't support mode(TI),
1519 // more drastic measures will be needed.
1520 if (TD->getPointerSize() >= 8) {
1521 Out << "#ifdef __GNUC__ /* 128-bit integer types */\n"
1522 << "typedef int __attribute__((mode(TI))) llvmInt128;\n"
1523 << "typedef unsigned __attribute__((mode(TI))) llvmUInt128;\n"
1527 // Output target-specific code that should be inserted into main.
1528 Out << "#define CODE_FOR_MAIN() /* Any target-specific code for main()*/\n";
1531 /// FindStaticTors - Given a static ctor/dtor list, unpack its contents into
1532 /// the StaticTors set.
1533 static void FindStaticTors(GlobalVariable *GV, std::set<Function*> &StaticTors){
1534 ConstantArray *InitList = dyn_cast<ConstantArray>(GV->getInitializer());
1535 if (!InitList) return;
1537 for (unsigned i = 0, e = InitList->getNumOperands(); i != e; ++i)
1538 if (ConstantStruct *CS = dyn_cast<ConstantStruct>(InitList->getOperand(i))){
1539 if (CS->getNumOperands() != 2) return; // Not array of 2-element structs.
1541 if (CS->getOperand(1)->isNullValue())
1542 return; // Found a null terminator, exit printing.
1543 Constant *FP = CS->getOperand(1);
1544 if (ConstantExpr *CE = dyn_cast<ConstantExpr>(FP))
1546 FP = CE->getOperand(0);
1547 if (Function *F = dyn_cast<Function>(FP))
1548 StaticTors.insert(F);
1552 enum SpecialGlobalClass {
1554 GlobalCtors, GlobalDtors,
1558 /// getGlobalVariableClass - If this is a global that is specially recognized
1559 /// by LLVM, return a code that indicates how we should handle it.
1560 static SpecialGlobalClass getGlobalVariableClass(const GlobalVariable *GV) {
1561 // If this is a global ctors/dtors list, handle it now.
1562 if (GV->hasAppendingLinkage() && GV->use_empty()) {
1563 if (GV->getName() == "llvm.global_ctors")
1565 else if (GV->getName() == "llvm.global_dtors")
1569 // Otherwise, it it is other metadata, don't print it. This catches things
1570 // like debug information.
1571 if (GV->getSection() == "llvm.metadata")
1578 bool CWriter::doInitialization(Module &M) {
1582 TD = new TargetData(&M);
1583 IL = new IntrinsicLowering(*TD);
1584 IL->AddPrototypes(M);
1586 // Ensure that all structure types have names...
1587 Mang = new Mangler(M);
1588 Mang->markCharUnacceptable('.');
1590 // Keep track of which functions are static ctors/dtors so they can have
1591 // an attribute added to their prototypes.
1592 std::set<Function*> StaticCtors, StaticDtors;
1593 for (Module::global_iterator I = M.global_begin(), E = M.global_end();
1595 switch (getGlobalVariableClass(I)) {
1598 FindStaticTors(I, StaticCtors);
1601 FindStaticTors(I, StaticDtors);
1606 // get declaration for alloca
1607 Out << "/* Provide Declarations */\n";
1608 Out << "#include <stdarg.h>\n"; // Varargs support
1609 Out << "#include <setjmp.h>\n"; // Unwind support
1610 generateCompilerSpecificCode(Out, TD);
1612 // Provide a definition for `bool' if not compiling with a C++ compiler.
1614 << "#ifndef __cplusplus\ntypedef unsigned char bool;\n#endif\n"
1616 << "\n\n/* Support for floating point constants */\n"
1617 << "typedef unsigned long long ConstantDoubleTy;\n"
1618 << "typedef unsigned int ConstantFloatTy;\n"
1619 << "typedef struct { unsigned long long f1; unsigned short f2; "
1620 "unsigned short pad[3]; } ConstantFP80Ty;\n"
1621 // This is used for both kinds of 128-bit long double; meaning differs.
1622 << "typedef struct { unsigned long long f1; unsigned long long f2; }"
1623 " ConstantFP128Ty;\n"
1624 << "\n\n/* Global Declarations */\n";
1626 // First output all the declarations for the program, because C requires
1627 // Functions & globals to be declared before they are used.
1630 // Loop over the symbol table, emitting all named constants...
1631 printModuleTypes(M.getTypeSymbolTable());
1633 // Global variable declarations...
1634 if (!M.global_empty()) {
1635 Out << "\n/* External Global Variable Declarations */\n";
1636 for (Module::global_iterator I = M.global_begin(), E = M.global_end();
1639 if (I->hasExternalLinkage() || I->hasExternalWeakLinkage() ||
1640 I->hasCommonLinkage())
1642 else if (I->hasDLLImportLinkage())
1643 Out << "__declspec(dllimport) ";
1645 continue; // Internal Global
1647 // Thread Local Storage
1648 if (I->isThreadLocal())
1651 printType(Out, I->getType()->getElementType(), false, GetValueName(I));
1653 if (I->hasExternalWeakLinkage())
1654 Out << " __EXTERNAL_WEAK__";
1659 // Function declarations
1660 Out << "\n/* Function Declarations */\n";
1661 Out << "double fmod(double, double);\n"; // Support for FP rem
1662 Out << "float fmodf(float, float);\n";
1663 Out << "long double fmodl(long double, long double);\n";
1665 for (Module::iterator I = M.begin(), E = M.end(); I != E; ++I) {
1666 // Don't print declarations for intrinsic functions.
1667 if (!I->isIntrinsic() && I->getName() != "setjmp" &&
1668 I->getName() != "longjmp" && I->getName() != "_setjmp") {
1669 if (I->hasExternalWeakLinkage())
1671 printFunctionSignature(I, true);
1672 if (I->hasWeakLinkage() || I->hasLinkOnceLinkage())
1673 Out << " __ATTRIBUTE_WEAK__";
1674 if (I->hasExternalWeakLinkage())
1675 Out << " __EXTERNAL_WEAK__";
1676 if (StaticCtors.count(I))
1677 Out << " __ATTRIBUTE_CTOR__";
1678 if (StaticDtors.count(I))
1679 Out << " __ATTRIBUTE_DTOR__";
1680 if (I->hasHiddenVisibility())
1681 Out << " __HIDDEN__";
1683 if (I->hasName() && I->getName()[0] == 1)
1684 Out << " LLVM_ASM(\"" << I->getName().c_str()+1 << "\")";
1690 // Output the global variable declarations
1691 if (!M.global_empty()) {
1692 Out << "\n\n/* Global Variable Declarations */\n";
1693 for (Module::global_iterator I = M.global_begin(), E = M.global_end();
1695 if (!I->isDeclaration()) {
1696 // Ignore special globals, such as debug info.
1697 if (getGlobalVariableClass(I))
1700 if (I->hasInternalLinkage())
1705 // Thread Local Storage
1706 if (I->isThreadLocal())
1709 printType(Out, I->getType()->getElementType(), false,
1712 if (I->hasLinkOnceLinkage())
1713 Out << " __attribute__((common))";
1714 else if (I->hasCommonLinkage()) // FIXME is this right?
1715 Out << " __ATTRIBUTE_WEAK__";
1716 else if (I->hasWeakLinkage())
1717 Out << " __ATTRIBUTE_WEAK__";
1718 else if (I->hasExternalWeakLinkage())
1719 Out << " __EXTERNAL_WEAK__";
1720 if (I->hasHiddenVisibility())
1721 Out << " __HIDDEN__";
1726 // Output the global variable definitions and contents...
1727 if (!M.global_empty()) {
1728 Out << "\n\n/* Global Variable Definitions and Initialization */\n";
1729 for (Module::global_iterator I = M.global_begin(), E = M.global_end();
1731 if (!I->isDeclaration()) {
1732 // Ignore special globals, such as debug info.
1733 if (getGlobalVariableClass(I))
1736 if (I->hasInternalLinkage())
1738 else if (I->hasDLLImportLinkage())
1739 Out << "__declspec(dllimport) ";
1740 else if (I->hasDLLExportLinkage())
1741 Out << "__declspec(dllexport) ";
1743 // Thread Local Storage
1744 if (I->isThreadLocal())
1747 printType(Out, I->getType()->getElementType(), false,
1749 if (I->hasLinkOnceLinkage())
1750 Out << " __attribute__((common))";
1751 else if (I->hasWeakLinkage())
1752 Out << " __ATTRIBUTE_WEAK__";
1753 else if (I->hasCommonLinkage())
1754 Out << " __ATTRIBUTE_WEAK__";
1756 if (I->hasHiddenVisibility())
1757 Out << " __HIDDEN__";
1759 // If the initializer is not null, emit the initializer. If it is null,
1760 // we try to avoid emitting large amounts of zeros. The problem with
1761 // this, however, occurs when the variable has weak linkage. In this
1762 // case, the assembler will complain about the variable being both weak
1763 // and common, so we disable this optimization.
1764 // FIXME common linkage should avoid this problem.
1765 if (!I->getInitializer()->isNullValue()) {
1767 writeOperand(I->getInitializer());
1768 } else if (I->hasWeakLinkage()) {
1769 // We have to specify an initializer, but it doesn't have to be
1770 // complete. If the value is an aggregate, print out { 0 }, and let
1771 // the compiler figure out the rest of the zeros.
1773 if (isa<StructType>(I->getInitializer()->getType()) ||
1774 isa<VectorType>(I->getInitializer()->getType())) {
1776 } else if (isa<ArrayType>(I->getInitializer()->getType())) {
1777 // As with structs and vectors, but with an extra set of braces
1778 // because arrays are wrapped in structs.
1781 // Just print it out normally.
1782 writeOperand(I->getInitializer());
1790 Out << "\n\n/* Function Bodies */\n";
1792 // Emit some helper functions for dealing with FCMP instruction's
1794 Out << "static inline int llvm_fcmp_ord(double X, double Y) { ";
1795 Out << "return X == X && Y == Y; }\n";
1796 Out << "static inline int llvm_fcmp_uno(double X, double Y) { ";
1797 Out << "return X != X || Y != Y; }\n";
1798 Out << "static inline int llvm_fcmp_ueq(double X, double Y) { ";
1799 Out << "return X == Y || llvm_fcmp_uno(X, Y); }\n";
1800 Out << "static inline int llvm_fcmp_une(double X, double Y) { ";
1801 Out << "return X != Y; }\n";
1802 Out << "static inline int llvm_fcmp_ult(double X, double Y) { ";
1803 Out << "return X < Y || llvm_fcmp_uno(X, Y); }\n";
1804 Out << "static inline int llvm_fcmp_ugt(double X, double Y) { ";
1805 Out << "return X > Y || llvm_fcmp_uno(X, Y); }\n";
1806 Out << "static inline int llvm_fcmp_ule(double X, double Y) { ";
1807 Out << "return X <= Y || llvm_fcmp_uno(X, Y); }\n";
1808 Out << "static inline int llvm_fcmp_uge(double X, double Y) { ";
1809 Out << "return X >= Y || llvm_fcmp_uno(X, Y); }\n";
1810 Out << "static inline int llvm_fcmp_oeq(double X, double Y) { ";
1811 Out << "return X == Y ; }\n";
1812 Out << "static inline int llvm_fcmp_one(double X, double Y) { ";
1813 Out << "return X != Y && llvm_fcmp_ord(X, Y); }\n";
1814 Out << "static inline int llvm_fcmp_olt(double X, double Y) { ";
1815 Out << "return X < Y ; }\n";
1816 Out << "static inline int llvm_fcmp_ogt(double X, double Y) { ";
1817 Out << "return X > Y ; }\n";
1818 Out << "static inline int llvm_fcmp_ole(double X, double Y) { ";
1819 Out << "return X <= Y ; }\n";
1820 Out << "static inline int llvm_fcmp_oge(double X, double Y) { ";
1821 Out << "return X >= Y ; }\n";
1826 /// Output all floating point constants that cannot be printed accurately...
1827 void CWriter::printFloatingPointConstants(Function &F) {
1828 // Scan the module for floating point constants. If any FP constant is used
1829 // in the function, we want to redirect it here so that we do not depend on
1830 // the precision of the printed form, unless the printed form preserves
1833 static unsigned FPCounter = 0;
1834 for (constant_iterator I = constant_begin(&F), E = constant_end(&F);
1836 if (const ConstantFP *FPC = dyn_cast<ConstantFP>(*I))
1837 if (!isFPCSafeToPrint(FPC) && // Do not put in FPConstantMap if safe.
1838 !FPConstantMap.count(FPC)) {
1839 FPConstantMap[FPC] = FPCounter; // Number the FP constants
1841 if (FPC->getType() == Type::DoubleTy) {
1842 double Val = FPC->getValueAPF().convertToDouble();
1843 uint64_t i = FPC->getValueAPF().convertToAPInt().getZExtValue();
1844 Out << "static const ConstantDoubleTy FPConstant" << FPCounter++
1845 << " = 0x" << std::hex << i << std::dec
1846 << "ULL; /* " << Val << " */\n";
1847 } else if (FPC->getType() == Type::FloatTy) {
1848 float Val = FPC->getValueAPF().convertToFloat();
1849 uint32_t i = (uint32_t)FPC->getValueAPF().convertToAPInt().
1851 Out << "static const ConstantFloatTy FPConstant" << FPCounter++
1852 << " = 0x" << std::hex << i << std::dec
1853 << "U; /* " << Val << " */\n";
1854 } else if (FPC->getType() == Type::X86_FP80Ty) {
1855 // api needed to prevent premature destruction
1856 APInt api = FPC->getValueAPF().convertToAPInt();
1857 const uint64_t *p = api.getRawData();
1858 Out << "static const ConstantFP80Ty FPConstant" << FPCounter++
1859 << " = { 0x" << std::hex
1860 << ((uint16_t)p[1] | (p[0] & 0xffffffffffffLL)<<16)
1861 << "ULL, 0x" << (uint16_t)(p[0] >> 48) << ",{0,0,0}"
1862 << "}; /* Long double constant */\n" << std::dec;
1863 } else if (FPC->getType() == Type::PPC_FP128Ty) {
1864 APInt api = FPC->getValueAPF().convertToAPInt();
1865 const uint64_t *p = api.getRawData();
1866 Out << "static const ConstantFP128Ty FPConstant" << FPCounter++
1867 << " = { 0x" << std::hex
1868 << p[0] << ", 0x" << p[1]
1869 << "}; /* Long double constant */\n" << std::dec;
1872 assert(0 && "Unknown float type!");
1879 /// printSymbolTable - Run through symbol table looking for type names. If a
1880 /// type name is found, emit its declaration...
1882 void CWriter::printModuleTypes(const TypeSymbolTable &TST) {
1883 Out << "/* Helper union for bitcasts */\n";
1884 Out << "typedef union {\n";
1885 Out << " unsigned int Int32;\n";
1886 Out << " unsigned long long Int64;\n";
1887 Out << " float Float;\n";
1888 Out << " double Double;\n";
1889 Out << "} llvmBitCastUnion;\n";
1891 // We are only interested in the type plane of the symbol table.
1892 TypeSymbolTable::const_iterator I = TST.begin();
1893 TypeSymbolTable::const_iterator End = TST.end();
1895 // If there are no type names, exit early.
1896 if (I == End) return;
1898 // Print out forward declarations for structure types before anything else!
1899 Out << "/* Structure forward decls */\n";
1900 for (; I != End; ++I) {
1901 std::string Name = "struct l_" + Mang->makeNameProper(I->first);
1902 Out << Name << ";\n";
1903 TypeNames.insert(std::make_pair(I->second, Name));
1908 // Now we can print out typedefs. Above, we guaranteed that this can only be
1909 // for struct or opaque types.
1910 Out << "/* Typedefs */\n";
1911 for (I = TST.begin(); I != End; ++I) {
1912 std::string Name = "l_" + Mang->makeNameProper(I->first);
1914 printType(Out, I->second, false, Name);
1920 // Keep track of which structures have been printed so far...
1921 std::set<const Type *> StructPrinted;
1923 // Loop over all structures then push them into the stack so they are
1924 // printed in the correct order.
1926 Out << "/* Structure contents */\n";
1927 for (I = TST.begin(); I != End; ++I)
1928 if (isa<StructType>(I->second) || isa<ArrayType>(I->second))
1929 // Only print out used types!
1930 printContainedStructs(I->second, StructPrinted);
1933 // Push the struct onto the stack and recursively push all structs
1934 // this one depends on.
1936 // TODO: Make this work properly with vector types
1938 void CWriter::printContainedStructs(const Type *Ty,
1939 std::set<const Type*> &StructPrinted) {
1940 // Don't walk through pointers.
1941 if (isa<PointerType>(Ty) || Ty->isPrimitiveType() || Ty->isInteger()) return;
1943 // Print all contained types first.
1944 for (Type::subtype_iterator I = Ty->subtype_begin(),
1945 E = Ty->subtype_end(); I != E; ++I)
1946 printContainedStructs(*I, StructPrinted);
1948 if (isa<StructType>(Ty) || isa<ArrayType>(Ty)) {
1949 // Check to see if we have already printed this struct.
1950 if (StructPrinted.insert(Ty).second) {
1951 // Print structure type out.
1952 std::string Name = TypeNames[Ty];
1953 printType(Out, Ty, false, Name, true);
1959 void CWriter::printFunctionSignature(const Function *F, bool Prototype) {
1960 /// isStructReturn - Should this function actually return a struct by-value?
1961 bool isStructReturn = F->hasStructRetAttr();
1963 if (F->hasInternalLinkage()) Out << "static ";
1964 if (F->hasDLLImportLinkage()) Out << "__declspec(dllimport) ";
1965 if (F->hasDLLExportLinkage()) Out << "__declspec(dllexport) ";
1966 switch (F->getCallingConv()) {
1967 case CallingConv::X86_StdCall:
1968 Out << "__stdcall ";
1970 case CallingConv::X86_FastCall:
1971 Out << "__fastcall ";
1975 // Loop over the arguments, printing them...
1976 const FunctionType *FT = cast<FunctionType>(F->getFunctionType());
1977 const PAListPtr &PAL = F->getParamAttrs();
1979 std::stringstream FunctionInnards;
1981 // Print out the name...
1982 FunctionInnards << GetValueName(F) << '(';
1984 bool PrintedArg = false;
1985 if (!F->isDeclaration()) {
1986 if (!F->arg_empty()) {
1987 Function::const_arg_iterator I = F->arg_begin(), E = F->arg_end();
1990 // If this is a struct-return function, don't print the hidden
1991 // struct-return argument.
1992 if (isStructReturn) {
1993 assert(I != E && "Invalid struct return function!");
1998 std::string ArgName;
1999 for (; I != E; ++I) {
2000 if (PrintedArg) FunctionInnards << ", ";
2001 if (I->hasName() || !Prototype)
2002 ArgName = GetValueName(I);
2005 const Type *ArgTy = I->getType();
2006 if (PAL.paramHasAttr(Idx, ParamAttr::ByVal)) {
2007 ArgTy = cast<PointerType>(ArgTy)->getElementType();
2008 ByValParams.insert(I);
2010 printType(FunctionInnards, ArgTy,
2011 /*isSigned=*/PAL.paramHasAttr(Idx, ParamAttr::SExt),
2018 // Loop over the arguments, printing them.
2019 FunctionType::param_iterator I = FT->param_begin(), E = FT->param_end();
2022 // If this is a struct-return function, don't print the hidden
2023 // struct-return argument.
2024 if (isStructReturn) {
2025 assert(I != E && "Invalid struct return function!");
2030 for (; I != E; ++I) {
2031 if (PrintedArg) FunctionInnards << ", ";
2032 const Type *ArgTy = *I;
2033 if (PAL.paramHasAttr(Idx, ParamAttr::ByVal)) {
2034 assert(isa<PointerType>(ArgTy));
2035 ArgTy = cast<PointerType>(ArgTy)->getElementType();
2037 printType(FunctionInnards, ArgTy,
2038 /*isSigned=*/PAL.paramHasAttr(Idx, ParamAttr::SExt));
2044 // Finish printing arguments... if this is a vararg function, print the ...,
2045 // unless there are no known types, in which case, we just emit ().
2047 if (FT->isVarArg() && PrintedArg) {
2048 if (PrintedArg) FunctionInnards << ", ";
2049 FunctionInnards << "..."; // Output varargs portion of signature!
2050 } else if (!FT->isVarArg() && !PrintedArg) {
2051 FunctionInnards << "void"; // ret() -> ret(void) in C.
2053 FunctionInnards << ')';
2055 // Get the return tpe for the function.
2057 if (!isStructReturn)
2058 RetTy = F->getReturnType();
2060 // If this is a struct-return function, print the struct-return type.
2061 RetTy = cast<PointerType>(FT->getParamType(0))->getElementType();
2064 // Print out the return type and the signature built above.
2065 printType(Out, RetTy,
2066 /*isSigned=*/PAL.paramHasAttr(0, ParamAttr::SExt),
2067 FunctionInnards.str());
2070 static inline bool isFPIntBitCast(const Instruction &I) {
2071 if (!isa<BitCastInst>(I))
2073 const Type *SrcTy = I.getOperand(0)->getType();
2074 const Type *DstTy = I.getType();
2075 return (SrcTy->isFloatingPoint() && DstTy->isInteger()) ||
2076 (DstTy->isFloatingPoint() && SrcTy->isInteger());
2079 void CWriter::printFunction(Function &F) {
2080 /// isStructReturn - Should this function actually return a struct by-value?
2081 bool isStructReturn = F.hasStructRetAttr();
2083 printFunctionSignature(&F, false);
2086 // If this is a struct return function, handle the result with magic.
2087 if (isStructReturn) {
2088 const Type *StructTy =
2089 cast<PointerType>(F.arg_begin()->getType())->getElementType();
2091 printType(Out, StructTy, false, "StructReturn");
2092 Out << "; /* Struct return temporary */\n";
2095 printType(Out, F.arg_begin()->getType(), false,
2096 GetValueName(F.arg_begin()));
2097 Out << " = &StructReturn;\n";
2100 bool PrintedVar = false;
2102 // print local variable information for the function
2103 for (inst_iterator I = inst_begin(&F), E = inst_end(&F); I != E; ++I) {
2104 if (const AllocaInst *AI = isDirectAlloca(&*I)) {
2106 printType(Out, AI->getAllocatedType(), false, GetValueName(AI));
2107 Out << "; /* Address-exposed local */\n";
2109 } else if (I->getType() != Type::VoidTy && !isInlinableInst(*I)) {
2111 printType(Out, I->getType(), false, GetValueName(&*I));
2114 if (isa<PHINode>(*I)) { // Print out PHI node temporaries as well...
2116 printType(Out, I->getType(), false,
2117 GetValueName(&*I)+"__PHI_TEMPORARY");
2122 // We need a temporary for the BitCast to use so it can pluck a value out
2123 // of a union to do the BitCast. This is separate from the need for a
2124 // variable to hold the result of the BitCast.
2125 if (isFPIntBitCast(*I)) {
2126 Out << " llvmBitCastUnion " << GetValueName(&*I)
2127 << "__BITCAST_TEMPORARY;\n";
2135 if (F.hasExternalLinkage() && F.getName() == "main")
2136 Out << " CODE_FOR_MAIN();\n";
2138 // print the basic blocks
2139 for (Function::iterator BB = F.begin(), E = F.end(); BB != E; ++BB) {
2140 if (Loop *L = LI->getLoopFor(BB)) {
2141 if (L->getHeader() == BB && L->getParentLoop() == 0)
2144 printBasicBlock(BB);
2151 void CWriter::printLoop(Loop *L) {
2152 Out << " do { /* Syntactic loop '" << L->getHeader()->getName()
2153 << "' to make GCC happy */\n";
2154 for (unsigned i = 0, e = L->getBlocks().size(); i != e; ++i) {
2155 BasicBlock *BB = L->getBlocks()[i];
2156 Loop *BBLoop = LI->getLoopFor(BB);
2158 printBasicBlock(BB);
2159 else if (BB == BBLoop->getHeader() && BBLoop->getParentLoop() == L)
2162 Out << " } while (1); /* end of syntactic loop '"
2163 << L->getHeader()->getName() << "' */\n";
2166 void CWriter::printBasicBlock(BasicBlock *BB) {
2168 // Don't print the label for the basic block if there are no uses, or if
2169 // the only terminator use is the predecessor basic block's terminator.
2170 // We have to scan the use list because PHI nodes use basic blocks too but
2171 // do not require a label to be generated.
2173 bool NeedsLabel = false;
2174 for (pred_iterator PI = pred_begin(BB), E = pred_end(BB); PI != E; ++PI)
2175 if (isGotoCodeNecessary(*PI, BB)) {
2180 if (NeedsLabel) Out << GetValueName(BB) << ":\n";
2182 // Output all of the instructions in the basic block...
2183 for (BasicBlock::iterator II = BB->begin(), E = --BB->end(); II != E;
2185 if (!isInlinableInst(*II) && !isDirectAlloca(II)) {
2186 if (II->getType() != Type::VoidTy && !isInlineAsm(*II))
2190 writeInstComputationInline(*II);
2195 // Don't emit prefix or suffix for the terminator.
2196 visit(*BB->getTerminator());
2200 // Specific Instruction type classes... note that all of the casts are
2201 // necessary because we use the instruction classes as opaque types...
2203 void CWriter::visitReturnInst(ReturnInst &I) {
2204 // If this is a struct return function, return the temporary struct.
2205 bool isStructReturn = I.getParent()->getParent()->hasStructRetAttr();
2207 if (isStructReturn) {
2208 Out << " return StructReturn;\n";
2212 // Don't output a void return if this is the last basic block in the function
2213 if (I.getNumOperands() == 0 &&
2214 &*--I.getParent()->getParent()->end() == I.getParent() &&
2215 !I.getParent()->size() == 1) {
2219 if (I.getNumOperands() > 1) {
2222 printType(Out, I.getParent()->getParent()->getReturnType());
2223 Out << " llvm_cbe_mrv_temp = {\n";
2224 for (unsigned i = 0, e = I.getNumOperands(); i != e; ++i) {
2226 writeOperand(I.getOperand(i));
2232 Out << " return llvm_cbe_mrv_temp;\n";
2238 if (I.getNumOperands()) {
2240 writeOperand(I.getOperand(0));
2245 void CWriter::visitSwitchInst(SwitchInst &SI) {
2248 writeOperand(SI.getOperand(0));
2249 Out << ") {\n default:\n";
2250 printPHICopiesForSuccessor (SI.getParent(), SI.getDefaultDest(), 2);
2251 printBranchToBlock(SI.getParent(), SI.getDefaultDest(), 2);
2253 for (unsigned i = 2, e = SI.getNumOperands(); i != e; i += 2) {
2255 writeOperand(SI.getOperand(i));
2257 BasicBlock *Succ = cast<BasicBlock>(SI.getOperand(i+1));
2258 printPHICopiesForSuccessor (SI.getParent(), Succ, 2);
2259 printBranchToBlock(SI.getParent(), Succ, 2);
2260 if (Function::iterator(Succ) == next(Function::iterator(SI.getParent())))
2266 void CWriter::visitUnreachableInst(UnreachableInst &I) {
2267 Out << " /*UNREACHABLE*/;\n";
2270 bool CWriter::isGotoCodeNecessary(BasicBlock *From, BasicBlock *To) {
2271 /// FIXME: This should be reenabled, but loop reordering safe!!
2274 if (next(Function::iterator(From)) != Function::iterator(To))
2275 return true; // Not the direct successor, we need a goto.
2277 //isa<SwitchInst>(From->getTerminator())
2279 if (LI->getLoopFor(From) != LI->getLoopFor(To))
2284 void CWriter::printPHICopiesForSuccessor (BasicBlock *CurBlock,
2285 BasicBlock *Successor,
2287 for (BasicBlock::iterator I = Successor->begin(); isa<PHINode>(I); ++I) {
2288 PHINode *PN = cast<PHINode>(I);
2289 // Now we have to do the printing.
2290 Value *IV = PN->getIncomingValueForBlock(CurBlock);
2291 if (!isa<UndefValue>(IV)) {
2292 Out << std::string(Indent, ' ');
2293 Out << " " << GetValueName(I) << "__PHI_TEMPORARY = ";
2295 Out << "; /* for PHI node */\n";
2300 void CWriter::printBranchToBlock(BasicBlock *CurBB, BasicBlock *Succ,
2302 if (isGotoCodeNecessary(CurBB, Succ)) {
2303 Out << std::string(Indent, ' ') << " goto ";
2309 // Branch instruction printing - Avoid printing out a branch to a basic block
2310 // that immediately succeeds the current one.
2312 void CWriter::visitBranchInst(BranchInst &I) {
2314 if (I.isConditional()) {
2315 if (isGotoCodeNecessary(I.getParent(), I.getSuccessor(0))) {
2317 writeOperand(I.getCondition());
2320 printPHICopiesForSuccessor (I.getParent(), I.getSuccessor(0), 2);
2321 printBranchToBlock(I.getParent(), I.getSuccessor(0), 2);
2323 if (isGotoCodeNecessary(I.getParent(), I.getSuccessor(1))) {
2324 Out << " } else {\n";
2325 printPHICopiesForSuccessor (I.getParent(), I.getSuccessor(1), 2);
2326 printBranchToBlock(I.getParent(), I.getSuccessor(1), 2);
2329 // First goto not necessary, assume second one is...
2331 writeOperand(I.getCondition());
2334 printPHICopiesForSuccessor (I.getParent(), I.getSuccessor(1), 2);
2335 printBranchToBlock(I.getParent(), I.getSuccessor(1), 2);
2340 printPHICopiesForSuccessor (I.getParent(), I.getSuccessor(0), 0);
2341 printBranchToBlock(I.getParent(), I.getSuccessor(0), 0);
2346 // PHI nodes get copied into temporary values at the end of predecessor basic
2347 // blocks. We now need to copy these temporary values into the REAL value for
2349 void CWriter::visitPHINode(PHINode &I) {
2351 Out << "__PHI_TEMPORARY";
2355 void CWriter::visitBinaryOperator(Instruction &I) {
2356 // binary instructions, shift instructions, setCond instructions.
2357 assert(!isa<PointerType>(I.getType()));
2359 // We must cast the results of binary operations which might be promoted.
2360 bool needsCast = false;
2361 if ((I.getType() == Type::Int8Ty) || (I.getType() == Type::Int16Ty)
2362 || (I.getType() == Type::FloatTy)) {
2365 printType(Out, I.getType(), false);
2369 // If this is a negation operation, print it out as such. For FP, we don't
2370 // want to print "-0.0 - X".
2371 if (BinaryOperator::isNeg(&I)) {
2373 writeOperand(BinaryOperator::getNegArgument(cast<BinaryOperator>(&I)));
2375 } else if (I.getOpcode() == Instruction::FRem) {
2376 // Output a call to fmod/fmodf instead of emitting a%b
2377 if (I.getType() == Type::FloatTy)
2379 else if (I.getType() == Type::DoubleTy)
2381 else // all 3 flavors of long double
2383 writeOperand(I.getOperand(0));
2385 writeOperand(I.getOperand(1));
2389 // Write out the cast of the instruction's value back to the proper type
2391 bool NeedsClosingParens = writeInstructionCast(I);
2393 // Certain instructions require the operand to be forced to a specific type
2394 // so we use writeOperandWithCast here instead of writeOperand. Similarly
2395 // below for operand 1
2396 writeOperandWithCast(I.getOperand(0), I.getOpcode());
2398 switch (I.getOpcode()) {
2399 case Instruction::Add: Out << " + "; break;
2400 case Instruction::Sub: Out << " - "; break;
2401 case Instruction::Mul: Out << " * "; break;
2402 case Instruction::URem:
2403 case Instruction::SRem:
2404 case Instruction::FRem: Out << " % "; break;
2405 case Instruction::UDiv:
2406 case Instruction::SDiv:
2407 case Instruction::FDiv: Out << " / "; break;
2408 case Instruction::And: Out << " & "; break;
2409 case Instruction::Or: Out << " | "; break;
2410 case Instruction::Xor: Out << " ^ "; break;
2411 case Instruction::Shl : Out << " << "; break;
2412 case Instruction::LShr:
2413 case Instruction::AShr: Out << " >> "; break;
2414 default: cerr << "Invalid operator type!" << I; abort();
2417 writeOperandWithCast(I.getOperand(1), I.getOpcode());
2418 if (NeedsClosingParens)
2427 void CWriter::visitICmpInst(ICmpInst &I) {
2428 // We must cast the results of icmp which might be promoted.
2429 bool needsCast = false;
2431 // Write out the cast of the instruction's value back to the proper type
2433 bool NeedsClosingParens = writeInstructionCast(I);
2435 // Certain icmp predicate require the operand to be forced to a specific type
2436 // so we use writeOperandWithCast here instead of writeOperand. Similarly
2437 // below for operand 1
2438 writeOperandWithCast(I.getOperand(0), I);
2440 switch (I.getPredicate()) {
2441 case ICmpInst::ICMP_EQ: Out << " == "; break;
2442 case ICmpInst::ICMP_NE: Out << " != "; break;
2443 case ICmpInst::ICMP_ULE:
2444 case ICmpInst::ICMP_SLE: Out << " <= "; break;
2445 case ICmpInst::ICMP_UGE:
2446 case ICmpInst::ICMP_SGE: Out << " >= "; break;
2447 case ICmpInst::ICMP_ULT:
2448 case ICmpInst::ICMP_SLT: Out << " < "; break;
2449 case ICmpInst::ICMP_UGT:
2450 case ICmpInst::ICMP_SGT: Out << " > "; break;
2451 default: cerr << "Invalid icmp predicate!" << I; abort();
2454 writeOperandWithCast(I.getOperand(1), I);
2455 if (NeedsClosingParens)
2463 void CWriter::visitFCmpInst(FCmpInst &I) {
2464 if (I.getPredicate() == FCmpInst::FCMP_FALSE) {
2468 if (I.getPredicate() == FCmpInst::FCMP_TRUE) {
2474 switch (I.getPredicate()) {
2475 default: assert(0 && "Illegal FCmp predicate");
2476 case FCmpInst::FCMP_ORD: op = "ord"; break;
2477 case FCmpInst::FCMP_UNO: op = "uno"; break;
2478 case FCmpInst::FCMP_UEQ: op = "ueq"; break;
2479 case FCmpInst::FCMP_UNE: op = "une"; break;
2480 case FCmpInst::FCMP_ULT: op = "ult"; break;
2481 case FCmpInst::FCMP_ULE: op = "ule"; break;
2482 case FCmpInst::FCMP_UGT: op = "ugt"; break;
2483 case FCmpInst::FCMP_UGE: op = "uge"; break;
2484 case FCmpInst::FCMP_OEQ: op = "oeq"; break;
2485 case FCmpInst::FCMP_ONE: op = "one"; break;
2486 case FCmpInst::FCMP_OLT: op = "olt"; break;
2487 case FCmpInst::FCMP_OLE: op = "ole"; break;
2488 case FCmpInst::FCMP_OGT: op = "ogt"; break;
2489 case FCmpInst::FCMP_OGE: op = "oge"; break;
2492 Out << "llvm_fcmp_" << op << "(";
2493 // Write the first operand
2494 writeOperand(I.getOperand(0));
2496 // Write the second operand
2497 writeOperand(I.getOperand(1));
2501 static const char * getFloatBitCastField(const Type *Ty) {
2502 switch (Ty->getTypeID()) {
2503 default: assert(0 && "Invalid Type");
2504 case Type::FloatTyID: return "Float";
2505 case Type::DoubleTyID: return "Double";
2506 case Type::IntegerTyID: {
2507 unsigned NumBits = cast<IntegerType>(Ty)->getBitWidth();
2516 void CWriter::visitCastInst(CastInst &I) {
2517 const Type *DstTy = I.getType();
2518 const Type *SrcTy = I.getOperand(0)->getType();
2519 if (isFPIntBitCast(I)) {
2521 // These int<->float and long<->double casts need to be handled specially
2522 Out << GetValueName(&I) << "__BITCAST_TEMPORARY."
2523 << getFloatBitCastField(I.getOperand(0)->getType()) << " = ";
2524 writeOperand(I.getOperand(0));
2525 Out << ", " << GetValueName(&I) << "__BITCAST_TEMPORARY."
2526 << getFloatBitCastField(I.getType());
2532 printCast(I.getOpcode(), SrcTy, DstTy);
2534 // Make a sext from i1 work by subtracting the i1 from 0 (an int).
2535 if (SrcTy == Type::Int1Ty && I.getOpcode() == Instruction::SExt)
2538 writeOperand(I.getOperand(0));
2540 if (DstTy == Type::Int1Ty &&
2541 (I.getOpcode() == Instruction::Trunc ||
2542 I.getOpcode() == Instruction::FPToUI ||
2543 I.getOpcode() == Instruction::FPToSI ||
2544 I.getOpcode() == Instruction::PtrToInt)) {
2545 // Make sure we really get a trunc to bool by anding the operand with 1
2551 void CWriter::visitSelectInst(SelectInst &I) {
2553 writeOperand(I.getCondition());
2555 writeOperand(I.getTrueValue());
2557 writeOperand(I.getFalseValue());
2562 void CWriter::lowerIntrinsics(Function &F) {
2563 // This is used to keep track of intrinsics that get generated to a lowered
2564 // function. We must generate the prototypes before the function body which
2565 // will only be expanded on first use (by the loop below).
2566 std::vector<Function*> prototypesToGen;
2568 // Examine all the instructions in this function to find the intrinsics that
2569 // need to be lowered.
2570 for (Function::iterator BB = F.begin(), EE = F.end(); BB != EE; ++BB)
2571 for (BasicBlock::iterator I = BB->begin(), E = BB->end(); I != E; )
2572 if (CallInst *CI = dyn_cast<CallInst>(I++))
2573 if (Function *F = CI->getCalledFunction())
2574 switch (F->getIntrinsicID()) {
2575 case Intrinsic::not_intrinsic:
2576 case Intrinsic::memory_barrier:
2577 case Intrinsic::vastart:
2578 case Intrinsic::vacopy:
2579 case Intrinsic::vaend:
2580 case Intrinsic::returnaddress:
2581 case Intrinsic::frameaddress:
2582 case Intrinsic::setjmp:
2583 case Intrinsic::longjmp:
2584 case Intrinsic::prefetch:
2585 case Intrinsic::dbg_stoppoint:
2586 case Intrinsic::powi:
2587 case Intrinsic::x86_sse_cmp_ss:
2588 case Intrinsic::x86_sse_cmp_ps:
2589 case Intrinsic::x86_sse2_cmp_sd:
2590 case Intrinsic::x86_sse2_cmp_pd:
2591 case Intrinsic::ppc_altivec_lvsl:
2592 // We directly implement these intrinsics
2595 // If this is an intrinsic that directly corresponds to a GCC
2596 // builtin, we handle it.
2597 const char *BuiltinName = "";
2598 #define GET_GCC_BUILTIN_NAME
2599 #include "llvm/Intrinsics.gen"
2600 #undef GET_GCC_BUILTIN_NAME
2601 // If we handle it, don't lower it.
2602 if (BuiltinName[0]) break;
2604 // All other intrinsic calls we must lower.
2605 Instruction *Before = 0;
2606 if (CI != &BB->front())
2607 Before = prior(BasicBlock::iterator(CI));
2609 IL->LowerIntrinsicCall(CI);
2610 if (Before) { // Move iterator to instruction after call
2615 // If the intrinsic got lowered to another call, and that call has
2616 // a definition then we need to make sure its prototype is emitted
2617 // before any calls to it.
2618 if (CallInst *Call = dyn_cast<CallInst>(I))
2619 if (Function *NewF = Call->getCalledFunction())
2620 if (!NewF->isDeclaration())
2621 prototypesToGen.push_back(NewF);
2626 // We may have collected some prototypes to emit in the loop above.
2627 // Emit them now, before the function that uses them is emitted. But,
2628 // be careful not to emit them twice.
2629 std::vector<Function*>::iterator I = prototypesToGen.begin();
2630 std::vector<Function*>::iterator E = prototypesToGen.end();
2631 for ( ; I != E; ++I) {
2632 if (intrinsicPrototypesAlreadyGenerated.insert(*I).second) {
2634 printFunctionSignature(*I, true);
2640 void CWriter::visitCallInst(CallInst &I) {
2641 if (isa<InlineAsm>(I.getOperand(0)))
2642 return visitInlineAsm(I);
2644 bool WroteCallee = false;
2646 // Handle intrinsic function calls first...
2647 if (Function *F = I.getCalledFunction())
2648 if (Intrinsic::ID ID = (Intrinsic::ID)F->getIntrinsicID())
2649 if (visitBuiltinCall(I, ID, WroteCallee))
2652 Value *Callee = I.getCalledValue();
2654 const PointerType *PTy = cast<PointerType>(Callee->getType());
2655 const FunctionType *FTy = cast<FunctionType>(PTy->getElementType());
2657 // If this is a call to a struct-return function, assign to the first
2658 // parameter instead of passing it to the call.
2659 const PAListPtr &PAL = I.getParamAttrs();
2660 bool hasByVal = I.hasByValArgument();
2661 bool isStructRet = I.hasStructRetAttr();
2663 writeOperandDeref(I.getOperand(1));
2667 if (I.isTailCall()) Out << " /*tail*/ ";
2670 // If this is an indirect call to a struct return function, we need to cast
2671 // the pointer. Ditto for indirect calls with byval arguments.
2672 bool NeedsCast = (hasByVal || isStructRet) && !isa<Function>(Callee);
2674 // GCC is a real PITA. It does not permit codegening casts of functions to
2675 // function pointers if they are in a call (it generates a trap instruction
2676 // instead!). We work around this by inserting a cast to void* in between
2677 // the function and the function pointer cast. Unfortunately, we can't just
2678 // form the constant expression here, because the folder will immediately
2681 // Note finally, that this is completely unsafe. ANSI C does not guarantee
2682 // that void* and function pointers have the same size. :( To deal with this
2683 // in the common case, we handle casts where the number of arguments passed
2686 if (ConstantExpr *CE = dyn_cast<ConstantExpr>(Callee))
2688 if (Function *RF = dyn_cast<Function>(CE->getOperand(0))) {
2694 // Ok, just cast the pointer type.
2697 printStructReturnPointerFunctionType(Out, PAL,
2698 cast<PointerType>(I.getCalledValue()->getType()));
2700 printType(Out, I.getCalledValue()->getType(), false, "", true, PAL);
2702 printType(Out, I.getCalledValue()->getType());
2705 writeOperand(Callee);
2706 if (NeedsCast) Out << ')';
2711 unsigned NumDeclaredParams = FTy->getNumParams();
2713 CallSite::arg_iterator AI = I.op_begin()+1, AE = I.op_end();
2715 if (isStructRet) { // Skip struct return argument.
2720 bool PrintedArg = false;
2721 for (; AI != AE; ++AI, ++ArgNo) {
2722 if (PrintedArg) Out << ", ";
2723 if (ArgNo < NumDeclaredParams &&
2724 (*AI)->getType() != FTy->getParamType(ArgNo)) {
2726 printType(Out, FTy->getParamType(ArgNo),
2727 /*isSigned=*/PAL.paramHasAttr(ArgNo+1, ParamAttr::SExt));
2730 // Check if the argument is expected to be passed by value.
2731 if (I.paramHasAttr(ArgNo+1, ParamAttr::ByVal))
2732 writeOperandDeref(*AI);
2740 /// visitBuiltinCall - Handle the call to the specified builtin. Returns true
2741 /// if the entire call is handled, return false it it wasn't handled, and
2742 /// optionally set 'WroteCallee' if the callee has already been printed out.
2743 bool CWriter::visitBuiltinCall(CallInst &I, Intrinsic::ID ID,
2744 bool &WroteCallee) {
2747 // If this is an intrinsic that directly corresponds to a GCC
2748 // builtin, we emit it here.
2749 const char *BuiltinName = "";
2750 Function *F = I.getCalledFunction();
2751 #define GET_GCC_BUILTIN_NAME
2752 #include "llvm/Intrinsics.gen"
2753 #undef GET_GCC_BUILTIN_NAME
2754 assert(BuiltinName[0] && "Unknown LLVM intrinsic!");
2760 case Intrinsic::memory_barrier:
2761 Out << "__sync_synchronize()";
2763 case Intrinsic::vastart:
2766 Out << "va_start(*(va_list*)";
2767 writeOperand(I.getOperand(1));
2769 // Output the last argument to the enclosing function.
2770 if (I.getParent()->getParent()->arg_empty()) {
2771 cerr << "The C backend does not currently support zero "
2772 << "argument varargs functions, such as '"
2773 << I.getParent()->getParent()->getName() << "'!\n";
2776 writeOperand(--I.getParent()->getParent()->arg_end());
2779 case Intrinsic::vaend:
2780 if (!isa<ConstantPointerNull>(I.getOperand(1))) {
2781 Out << "0; va_end(*(va_list*)";
2782 writeOperand(I.getOperand(1));
2785 Out << "va_end(*(va_list*)0)";
2788 case Intrinsic::vacopy:
2790 Out << "va_copy(*(va_list*)";
2791 writeOperand(I.getOperand(1));
2792 Out << ", *(va_list*)";
2793 writeOperand(I.getOperand(2));
2796 case Intrinsic::returnaddress:
2797 Out << "__builtin_return_address(";
2798 writeOperand(I.getOperand(1));
2801 case Intrinsic::frameaddress:
2802 Out << "__builtin_frame_address(";
2803 writeOperand(I.getOperand(1));
2806 case Intrinsic::powi:
2807 Out << "__builtin_powi(";
2808 writeOperand(I.getOperand(1));
2810 writeOperand(I.getOperand(2));
2813 case Intrinsic::setjmp:
2814 Out << "setjmp(*(jmp_buf*)";
2815 writeOperand(I.getOperand(1));
2818 case Intrinsic::longjmp:
2819 Out << "longjmp(*(jmp_buf*)";
2820 writeOperand(I.getOperand(1));
2822 writeOperand(I.getOperand(2));
2825 case Intrinsic::prefetch:
2826 Out << "LLVM_PREFETCH((const void *)";
2827 writeOperand(I.getOperand(1));
2829 writeOperand(I.getOperand(2));
2831 writeOperand(I.getOperand(3));
2834 case Intrinsic::stacksave:
2835 // Emit this as: Val = 0; *((void**)&Val) = __builtin_stack_save()
2836 // to work around GCC bugs (see PR1809).
2837 Out << "0; *((void**)&" << GetValueName(&I)
2838 << ") = __builtin_stack_save()";
2840 case Intrinsic::dbg_stoppoint: {
2841 // If we use writeOperand directly we get a "u" suffix which is rejected
2843 DbgStopPointInst &SPI = cast<DbgStopPointInst>(I);
2846 << " \"" << SPI.getDirectory()
2847 << SPI.getFileName() << "\"\n";
2850 case Intrinsic::x86_sse_cmp_ss:
2851 case Intrinsic::x86_sse_cmp_ps:
2852 case Intrinsic::x86_sse2_cmp_sd:
2853 case Intrinsic::x86_sse2_cmp_pd:
2855 printType(Out, I.getType());
2857 // Multiple GCC builtins multiplex onto this intrinsic.
2858 switch (cast<ConstantInt>(I.getOperand(3))->getZExtValue()) {
2859 default: assert(0 && "Invalid llvm.x86.sse.cmp!");
2860 case 0: Out << "__builtin_ia32_cmpeq"; break;
2861 case 1: Out << "__builtin_ia32_cmplt"; break;
2862 case 2: Out << "__builtin_ia32_cmple"; break;
2863 case 3: Out << "__builtin_ia32_cmpunord"; break;
2864 case 4: Out << "__builtin_ia32_cmpneq"; break;
2865 case 5: Out << "__builtin_ia32_cmpnlt"; break;
2866 case 6: Out << "__builtin_ia32_cmpnle"; break;
2867 case 7: Out << "__builtin_ia32_cmpord"; break;
2869 if (ID == Intrinsic::x86_sse_cmp_ps || ID == Intrinsic::x86_sse2_cmp_pd)
2873 if (ID == Intrinsic::x86_sse_cmp_ss || ID == Intrinsic::x86_sse_cmp_ps)
2879 writeOperand(I.getOperand(1));
2881 writeOperand(I.getOperand(2));
2884 case Intrinsic::ppc_altivec_lvsl:
2886 printType(Out, I.getType());
2888 Out << "__builtin_altivec_lvsl(0, (void*)";
2889 writeOperand(I.getOperand(1));
2895 //This converts the llvm constraint string to something gcc is expecting.
2896 //TODO: work out platform independent constraints and factor those out
2897 // of the per target tables
2898 // handle multiple constraint codes
2899 std::string CWriter::InterpretASMConstraint(InlineAsm::ConstraintInfo& c) {
2901 assert(c.Codes.size() == 1 && "Too many asm constraint codes to handle");
2903 const char *const *table = 0;
2905 //Grab the translation table from TargetAsmInfo if it exists
2908 const TargetMachineRegistry::entry* Match =
2909 TargetMachineRegistry::getClosestStaticTargetForModule(*TheModule, E);
2911 //Per platform Target Machines don't exist, so create it
2912 // this must be done only once
2913 const TargetMachine* TM = Match->CtorFn(*TheModule, "");
2914 TAsm = TM->getTargetAsmInfo();
2918 table = TAsm->getAsmCBE();
2920 //Search the translation table if it exists
2921 for (int i = 0; table && table[i]; i += 2)
2922 if (c.Codes[0] == table[i])
2925 //default is identity
2929 //TODO: import logic from AsmPrinter.cpp
2930 static std::string gccifyAsm(std::string asmstr) {
2931 for (std::string::size_type i = 0; i != asmstr.size(); ++i)
2932 if (asmstr[i] == '\n')
2933 asmstr.replace(i, 1, "\\n");
2934 else if (asmstr[i] == '\t')
2935 asmstr.replace(i, 1, "\\t");
2936 else if (asmstr[i] == '$') {
2937 if (asmstr[i + 1] == '{') {
2938 std::string::size_type a = asmstr.find_first_of(':', i + 1);
2939 std::string::size_type b = asmstr.find_first_of('}', i + 1);
2940 std::string n = "%" +
2941 asmstr.substr(a + 1, b - a - 1) +
2942 asmstr.substr(i + 2, a - i - 2);
2943 asmstr.replace(i, b - i + 1, n);
2946 asmstr.replace(i, 1, "%");
2948 else if (asmstr[i] == '%')//grr
2949 { asmstr.replace(i, 1, "%%"); ++i;}
2954 //TODO: assumptions about what consume arguments from the call are likely wrong
2955 // handle communitivity
2956 void CWriter::visitInlineAsm(CallInst &CI) {
2957 InlineAsm* as = cast<InlineAsm>(CI.getOperand(0));
2958 std::vector<InlineAsm::ConstraintInfo> Constraints = as->ParseConstraints();
2960 std::vector<std::pair<Value*, int> > ResultVals;
2961 if (CI.getType() == Type::VoidTy)
2963 else if (const StructType *ST = dyn_cast<StructType>(CI.getType())) {
2964 for (unsigned i = 0, e = ST->getNumElements(); i != e; ++i)
2965 ResultVals.push_back(std::make_pair(&CI, (int)i));
2967 ResultVals.push_back(std::make_pair(&CI, -1));
2970 // Fix up the asm string for gcc and emit it.
2971 Out << "__asm__ volatile (\"" << gccifyAsm(as->getAsmString()) << "\"\n";
2974 unsigned ValueCount = 0;
2975 bool IsFirst = true;
2977 // Convert over all the output constraints.
2978 for (std::vector<InlineAsm::ConstraintInfo>::iterator I = Constraints.begin(),
2979 E = Constraints.end(); I != E; ++I) {
2981 if (I->Type != InlineAsm::isOutput) {
2983 continue; // Ignore non-output constraints.
2986 assert(I->Codes.size() == 1 && "Too many asm constraint codes to handle");
2987 std::string C = InterpretASMConstraint(*I);
2988 if (C.empty()) continue;
2999 if (ValueCount < ResultVals.size()) {
3000 DestVal = ResultVals[ValueCount].first;
3001 DestValNo = ResultVals[ValueCount].second;
3003 DestVal = CI.getOperand(ValueCount-ResultVals.size()+1);
3005 if (I->isEarlyClobber)
3008 Out << "\"=" << C << "\"(" << GetValueName(DestVal);
3009 if (DestValNo != -1)
3010 Out << ".field" << DestValNo; // Multiple retvals.
3016 // Convert over all the input constraints.
3020 for (std::vector<InlineAsm::ConstraintInfo>::iterator I = Constraints.begin(),
3021 E = Constraints.end(); I != E; ++I) {
3022 if (I->Type != InlineAsm::isInput) {
3024 continue; // Ignore non-input constraints.
3027 assert(I->Codes.size() == 1 && "Too many asm constraint codes to handle");
3028 std::string C = InterpretASMConstraint(*I);
3029 if (C.empty()) continue;
3036 assert(ValueCount >= ResultVals.size() && "Input can't refer to result");
3037 Value *SrcVal = CI.getOperand(ValueCount-ResultVals.size()+1);
3039 Out << "\"" << C << "\"(";
3041 writeOperand(SrcVal);
3043 writeOperandDeref(SrcVal);
3047 // Convert over the clobber constraints.
3050 for (std::vector<InlineAsm::ConstraintInfo>::iterator I = Constraints.begin(),
3051 E = Constraints.end(); I != E; ++I) {
3052 if (I->Type != InlineAsm::isClobber)
3053 continue; // Ignore non-input constraints.
3055 assert(I->Codes.size() == 1 && "Too many asm constraint codes to handle");
3056 std::string C = InterpretASMConstraint(*I);
3057 if (C.empty()) continue;
3064 Out << '\"' << C << '"';
3070 void CWriter::visitMallocInst(MallocInst &I) {
3071 assert(0 && "lowerallocations pass didn't work!");
3074 void CWriter::visitAllocaInst(AllocaInst &I) {
3076 printType(Out, I.getType());
3077 Out << ") alloca(sizeof(";
3078 printType(Out, I.getType()->getElementType());
3080 if (I.isArrayAllocation()) {
3082 writeOperand(I.getOperand(0));
3087 void CWriter::visitFreeInst(FreeInst &I) {
3088 assert(0 && "lowerallocations pass didn't work!");
3091 void CWriter::printGEPExpression(Value *Ptr, gep_type_iterator I,
3092 gep_type_iterator E) {
3094 // If there are no indices, just print out the pointer.
3100 // Find out if the last index is into a vector. If so, we have to print this
3101 // specially. Since vectors can't have elements of indexable type, only the
3102 // last index could possibly be of a vector element.
3103 const VectorType *LastIndexIsVector = 0;
3105 for (gep_type_iterator TmpI = I; TmpI != E; ++TmpI)
3106 LastIndexIsVector = dyn_cast<VectorType>(*TmpI);
3111 // If the last index is into a vector, we can't print it as &a[i][j] because
3112 // we can't index into a vector with j in GCC. Instead, emit this as
3113 // (((float*)&a[i])+j)
3114 if (LastIndexIsVector) {
3116 printType(Out, PointerType::getUnqual(LastIndexIsVector->getElementType()));
3122 // If the first index is 0 (very typical) we can do a number of
3123 // simplifications to clean up the code.
3124 Value *FirstOp = I.getOperand();
3125 if (!isa<Constant>(FirstOp) || !cast<Constant>(FirstOp)->isNullValue()) {
3126 // First index isn't simple, print it the hard way.
3129 ++I; // Skip the zero index.
3131 // Okay, emit the first operand. If Ptr is something that is already address
3132 // exposed, like a global, avoid emitting (&foo)[0], just emit foo instead.
3133 if (isAddressExposed(Ptr)) {
3134 writeOperandInternal(Ptr);
3135 } else if (I != E && isa<StructType>(*I)) {
3136 // If we didn't already emit the first operand, see if we can print it as
3137 // P->f instead of "P[0].f"
3139 Out << "->field" << cast<ConstantInt>(I.getOperand())->getZExtValue();
3140 ++I; // eat the struct index as well.
3142 // Instead of emitting P[0][1], emit (*P)[1], which is more idiomatic.
3149 for (; I != E; ++I) {
3150 if (isa<StructType>(*I)) {
3151 Out << ".field" << cast<ConstantInt>(I.getOperand())->getZExtValue();
3152 } else if (isa<ArrayType>(*I)) {
3154 writeOperandWithCast(I.getOperand(), Instruction::GetElementPtr);
3156 } else if (!isa<VectorType>(*I)) {
3158 writeOperandWithCast(I.getOperand(), Instruction::GetElementPtr);
3161 // If the last index is into a vector, then print it out as "+j)". This
3162 // works with the 'LastIndexIsVector' code above.
3163 if (isa<Constant>(I.getOperand()) &&
3164 cast<Constant>(I.getOperand())->isNullValue()) {
3165 Out << "))"; // avoid "+0".
3168 writeOperandWithCast(I.getOperand(), Instruction::GetElementPtr);
3176 void CWriter::writeMemoryAccess(Value *Operand, const Type *OperandType,
3177 bool IsVolatile, unsigned Alignment) {
3179 bool IsUnaligned = Alignment &&
3180 Alignment < TD->getABITypeAlignment(OperandType);
3184 if (IsVolatile || IsUnaligned) {
3187 Out << "struct __attribute__ ((packed, aligned(" << Alignment << "))) {";
3188 printType(Out, OperandType, false, IsUnaligned ? "data" : "volatile*");
3191 if (IsVolatile) Out << "volatile ";
3197 writeOperand(Operand);
3199 if (IsVolatile || IsUnaligned) {
3206 void CWriter::visitLoadInst(LoadInst &I) {
3207 writeMemoryAccess(I.getOperand(0), I.getType(), I.isVolatile(),
3212 void CWriter::visitStoreInst(StoreInst &I) {
3213 writeMemoryAccess(I.getPointerOperand(), I.getOperand(0)->getType(),
3214 I.isVolatile(), I.getAlignment());
3216 Value *Operand = I.getOperand(0);
3217 Constant *BitMask = 0;
3218 if (const IntegerType* ITy = dyn_cast<IntegerType>(Operand->getType()))
3219 if (!ITy->isPowerOf2ByteWidth())
3220 // We have a bit width that doesn't match an even power-of-2 byte
3221 // size. Consequently we must & the value with the type's bit mask
3222 BitMask = ConstantInt::get(ITy, ITy->getBitMask());
3225 writeOperand(Operand);
3228 printConstant(BitMask);
3233 void CWriter::visitGetElementPtrInst(GetElementPtrInst &I) {
3234 printGEPExpression(I.getPointerOperand(), gep_type_begin(I),
3238 void CWriter::visitVAArgInst(VAArgInst &I) {
3239 Out << "va_arg(*(va_list*)";
3240 writeOperand(I.getOperand(0));
3242 printType(Out, I.getType());
3246 void CWriter::visitInsertElementInst(InsertElementInst &I) {
3247 const Type *EltTy = I.getType()->getElementType();
3248 writeOperand(I.getOperand(0));
3251 printType(Out, PointerType::getUnqual(EltTy));
3252 Out << ")(&" << GetValueName(&I) << "))[";
3253 writeOperand(I.getOperand(2));
3255 writeOperand(I.getOperand(1));
3259 void CWriter::visitExtractElementInst(ExtractElementInst &I) {
3260 // We know that our operand is not inlined.
3263 cast<VectorType>(I.getOperand(0)->getType())->getElementType();
3264 printType(Out, PointerType::getUnqual(EltTy));
3265 Out << ")(&" << GetValueName(I.getOperand(0)) << "))[";
3266 writeOperand(I.getOperand(1));
3270 void CWriter::visitShuffleVectorInst(ShuffleVectorInst &SVI) {
3272 printType(Out, SVI.getType());
3274 const VectorType *VT = SVI.getType();
3275 unsigned NumElts = VT->getNumElements();
3276 const Type *EltTy = VT->getElementType();
3278 for (unsigned i = 0; i != NumElts; ++i) {
3280 int SrcVal = SVI.getMaskValue(i);
3281 if ((unsigned)SrcVal >= NumElts*2) {
3282 Out << " 0/*undef*/ ";
3284 Value *Op = SVI.getOperand((unsigned)SrcVal >= NumElts);
3285 if (isa<Instruction>(Op)) {
3286 // Do an extractelement of this value from the appropriate input.
3288 printType(Out, PointerType::getUnqual(EltTy));
3289 Out << ")(&" << GetValueName(Op)
3290 << "))[" << (SrcVal & (NumElts-1)) << "]";
3291 } else if (isa<ConstantAggregateZero>(Op) || isa<UndefValue>(Op)) {
3294 printConstant(cast<ConstantVector>(Op)->getOperand(SrcVal &
3302 void CWriter::visitGetResultInst(GetResultInst &GRI) {
3304 if (isa<UndefValue>(GRI.getOperand(0))) {
3306 printType(Out, GRI.getType());
3307 Out << ") 0/*UNDEF*/";
3309 Out << GetValueName(GRI.getOperand(0)) << ".field" << GRI.getIndex();
3314 void CWriter::visitInsertValueInst(InsertValueInst &IVI) {
3315 // Start by copying the entire aggregate value into the result variable.
3316 writeOperand(IVI.getOperand(0));
3319 // Then do the insert to update the field.
3320 Out << GetValueName(&IVI);
3321 for (const unsigned *b = IVI.idx_begin(), *i = b, *e = IVI.idx_end();
3323 const Type *IndexedTy =
3324 ExtractValueInst::getIndexedType(IVI.getOperand(0)->getType(), b, i+1);
3325 if (isa<ArrayType>(IndexedTy))
3326 Out << ".array[" << *i << "]";
3328 Out << ".field" << *i;
3331 writeOperand(IVI.getOperand(1));
3334 void CWriter::visitExtractValueInst(ExtractValueInst &EVI) {
3336 if (isa<UndefValue>(EVI.getOperand(0))) {
3338 printType(Out, EVI.getType());
3339 Out << ") 0/*UNDEF*/";
3341 Out << GetValueName(EVI.getOperand(0));
3342 for (const unsigned *b = EVI.idx_begin(), *i = b, *e = EVI.idx_end();
3344 const Type *IndexedTy =
3345 ExtractValueInst::getIndexedType(EVI.getOperand(0)->getType(), b, i+1);
3346 if (isa<ArrayType>(IndexedTy))
3347 Out << ".array[" << *i << "]";
3349 Out << ".field" << *i;
3355 //===----------------------------------------------------------------------===//
3356 // External Interface declaration
3357 //===----------------------------------------------------------------------===//
3359 bool CTargetMachine::addPassesToEmitWholeFile(PassManager &PM,
3361 CodeGenFileType FileType,
3363 if (FileType != TargetMachine::AssemblyFile) return true;
3365 PM.add(createGCLoweringPass());
3366 PM.add(createLowerAllocationsPass(true));
3367 PM.add(createLowerInvokePass());
3368 PM.add(createCFGSimplificationPass()); // clean up after lower invoke.
3369 PM.add(new CBackendNameAllUsedStructsAndMergeFunctions());
3370 PM.add(new CWriter(o));
3371 PM.add(createCollectorMetadataDeleter());