1 //===-- Writer.cpp - Library for converting LLVM code to C ----------------===//
3 // The LLVM Compiler Infrastructure
5 // This file was developed by the LLVM research group and is distributed under
6 // the University of Illinois Open Source 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/Target/TargetMachineImpls.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/SymbolTable.h"
24 #include "llvm/Intrinsics.h"
25 #include "llvm/IntrinsicLowering.h"
26 #include "llvm/Analysis/FindUsedTypes.h"
27 #include "llvm/Analysis/ConstantsScanner.h"
28 #include "llvm/Transforms/Scalar.h"
29 #include "llvm/Support/CallSite.h"
30 #include "llvm/Support/GetElementPtrTypeIterator.h"
31 #include "llvm/Support/InstVisitor.h"
32 #include "llvm/Support/Mangler.h"
33 #include "Support/StringExtras.h"
34 #include "Config/config.h"
40 class CWriter : public Pass, public InstVisitor<CWriter> {
42 IntrinsicLowering &IL;
44 const Module *TheModule;
47 std::map<const Type *, std::string> TypeNames;
49 std::map<const ConstantFP *, unsigned> FPConstantMap;
51 CWriter(std::ostream &o, IntrinsicLowering &il) : Out(o), IL(il) {}
53 void getAnalysisUsage(AnalysisUsage &AU) const {
54 AU.addRequired<FindUsedTypes>();
57 virtual const char *getPassName() const { return "C backend"; }
59 bool doInitialization(Module &M);
61 // First pass, lower all unhandled intrinsics.
66 for (Module::iterator I = M.begin(), E = M.end(); I != E; ++I)
76 std::ostream &printType(std::ostream &Out, const Type *Ty,
77 const std::string &VariableName = "",
78 bool IgnoreName = false);
80 void writeOperand(Value *Operand);
81 void writeOperandInternal(Value *Operand);
84 void lowerIntrinsics(Module &M);
86 bool nameAllUsedStructureTypes(Module &M);
87 void printModule(Module *M);
88 void printFloatingPointConstants(Module &M);
89 void printSymbolTable(const SymbolTable &ST);
90 void printContainedStructs(const Type *Ty, std::set<const StructType *> &);
91 void printFunctionSignature(const Function *F, bool Prototype);
93 void printFunction(Function &);
95 void printConstant(Constant *CPV);
96 void printConstantArray(ConstantArray *CPA);
98 // isInlinableInst - Attempt to inline instructions into their uses to build
99 // trees as much as possible. To do this, we have to consistently decide
100 // what is acceptable to inline, so that variable declarations don't get
101 // printed and an extra copy of the expr is not emitted.
103 static bool isInlinableInst(const Instruction &I) {
104 // Must be an expression, must be used exactly once. If it is dead, we
105 // emit it inline where it would go.
106 if (I.getType() == Type::VoidTy || !I.hasOneUse() ||
107 isa<TerminatorInst>(I) || isa<CallInst>(I) || isa<PHINode>(I) ||
108 isa<LoadInst>(I) || isa<VAArgInst>(I) || isa<VANextInst>(I))
109 // Don't inline a load across a store or other bad things!
112 // Only inline instruction it it's use is in the same BB as the inst.
113 return I.getParent() == cast<Instruction>(I.use_back())->getParent();
116 // isDirectAlloca - Define fixed sized allocas in the entry block as direct
117 // variables which are accessed with the & operator. This causes GCC to
118 // generate significantly better code than to emit alloca calls directly.
120 static const AllocaInst *isDirectAlloca(const Value *V) {
121 const AllocaInst *AI = dyn_cast<AllocaInst>(V);
122 if (!AI) return false;
123 if (AI->isArrayAllocation())
124 return 0; // FIXME: we can also inline fixed size array allocas!
125 if (AI->getParent() != &AI->getParent()->getParent()->getEntryBlock())
130 // Instruction visitation functions
131 friend class InstVisitor<CWriter>;
133 void visitReturnInst(ReturnInst &I);
134 void visitBranchInst(BranchInst &I);
135 void visitSwitchInst(SwitchInst &I);
136 void visitInvokeInst(InvokeInst &I);
137 void visitUnwindInst(UnwindInst &I);
139 void visitPHINode(PHINode &I);
140 void visitBinaryOperator(Instruction &I);
142 void visitCastInst (CastInst &I);
143 void visitSelectInst(SelectInst &I);
144 void visitCallInst (CallInst &I);
145 void visitCallSite (CallSite CS);
146 void visitShiftInst(ShiftInst &I) { visitBinaryOperator(I); }
148 void visitMallocInst(MallocInst &I);
149 void visitAllocaInst(AllocaInst &I);
150 void visitFreeInst (FreeInst &I);
151 void visitLoadInst (LoadInst &I);
152 void visitStoreInst (StoreInst &I);
153 void visitGetElementPtrInst(GetElementPtrInst &I);
154 void visitVANextInst(VANextInst &I);
155 void visitVAArgInst (VAArgInst &I);
157 void visitInstruction(Instruction &I) {
158 std::cerr << "C Writer does not know about " << I;
162 void outputLValue(Instruction *I) {
163 Out << " " << Mang->getValueName(I) << " = ";
165 void printBranchToBlock(BasicBlock *CurBlock, BasicBlock *SuccBlock,
167 void printIndexingExpression(Value *Ptr, gep_type_iterator I,
168 gep_type_iterator E);
172 // Pass the Type* and the variable name and this prints out the variable
175 std::ostream &CWriter::printType(std::ostream &Out, const Type *Ty,
176 const std::string &NameSoFar,
178 if (Ty->isPrimitiveType())
179 switch (Ty->getPrimitiveID()) {
180 case Type::VoidTyID: return Out << "void " << NameSoFar;
181 case Type::BoolTyID: return Out << "bool " << NameSoFar;
182 case Type::UByteTyID: return Out << "unsigned char " << NameSoFar;
183 case Type::SByteTyID: return Out << "signed char " << NameSoFar;
184 case Type::UShortTyID: return Out << "unsigned short " << NameSoFar;
185 case Type::ShortTyID: return Out << "short " << NameSoFar;
186 case Type::UIntTyID: return Out << "unsigned " << NameSoFar;
187 case Type::IntTyID: return Out << "int " << NameSoFar;
188 case Type::ULongTyID: return Out << "unsigned long long " << NameSoFar;
189 case Type::LongTyID: return Out << "signed long long " << NameSoFar;
190 case Type::FloatTyID: return Out << "float " << NameSoFar;
191 case Type::DoubleTyID: return Out << "double " << NameSoFar;
193 std::cerr << "Unknown primitive type: " << Ty << "\n";
197 // Check to see if the type is named.
198 if (!IgnoreName || isa<OpaqueType>(Ty)) {
199 std::map<const Type *, std::string>::iterator I = TypeNames.find(Ty);
200 if (I != TypeNames.end()) return Out << I->second << " " << NameSoFar;
203 switch (Ty->getPrimitiveID()) {
204 case Type::FunctionTyID: {
205 const FunctionType *MTy = cast<FunctionType>(Ty);
206 std::stringstream FunctionInnards;
207 FunctionInnards << " (" << NameSoFar << ") (";
208 for (FunctionType::param_iterator I = MTy->param_begin(),
209 E = MTy->param_end(); I != E; ++I) {
210 if (I != MTy->param_begin())
211 FunctionInnards << ", ";
212 printType(FunctionInnards, *I, "");
214 if (MTy->isVarArg()) {
215 if (MTy->getNumParams())
216 FunctionInnards << ", ...";
217 } else if (!MTy->getNumParams()) {
218 FunctionInnards << "void";
220 FunctionInnards << ")";
221 std::string tstr = FunctionInnards.str();
222 printType(Out, MTy->getReturnType(), tstr);
225 case Type::StructTyID: {
226 const StructType *STy = cast<StructType>(Ty);
227 Out << NameSoFar + " {\n";
229 for (StructType::element_iterator I = STy->element_begin(),
230 E = STy->element_end(); I != E; ++I) {
232 printType(Out, *I, "field" + utostr(Idx++));
238 case Type::PointerTyID: {
239 const PointerType *PTy = cast<PointerType>(Ty);
240 std::string ptrName = "*" + NameSoFar;
242 if (isa<ArrayType>(PTy->getElementType()))
243 ptrName = "(" + ptrName + ")";
245 return printType(Out, PTy->getElementType(), ptrName);
248 case Type::ArrayTyID: {
249 const ArrayType *ATy = cast<ArrayType>(Ty);
250 unsigned NumElements = ATy->getNumElements();
251 return printType(Out, ATy->getElementType(),
252 NameSoFar + "[" + utostr(NumElements) + "]");
255 case Type::OpaqueTyID: {
256 static int Count = 0;
257 std::string TyName = "struct opaque_" + itostr(Count++);
258 assert(TypeNames.find(Ty) == TypeNames.end());
259 TypeNames[Ty] = TyName;
260 return Out << TyName << " " << NameSoFar;
263 assert(0 && "Unhandled case in getTypeProps!");
270 void CWriter::printConstantArray(ConstantArray *CPA) {
272 // As a special case, print the array as a string if it is an array of
273 // ubytes or an array of sbytes with positive values.
275 const Type *ETy = CPA->getType()->getElementType();
276 bool isString = (ETy == Type::SByteTy || ETy == Type::UByteTy);
278 // Make sure the last character is a null char, as automatically added by C
279 if (isString && (CPA->getNumOperands() == 0 ||
280 !cast<Constant>(*(CPA->op_end()-1))->isNullValue()))
285 // Keep track of whether the last number was a hexadecimal escape
286 bool LastWasHex = false;
288 // Do not include the last character, which we know is null
289 for (unsigned i = 0, e = CPA->getNumOperands()-1; i != e; ++i) {
290 unsigned char C = cast<ConstantInt>(CPA->getOperand(i))->getRawValue();
292 // Print it out literally if it is a printable character. The only thing
293 // to be careful about is when the last letter output was a hex escape
294 // code, in which case we have to be careful not to print out hex digits
295 // explicitly (the C compiler thinks it is a continuation of the previous
296 // character, sheesh...)
298 if (isprint(C) && (!LastWasHex || !isxdigit(C))) {
300 if (C == '"' || C == '\\')
307 case '\n': Out << "\\n"; break;
308 case '\t': Out << "\\t"; break;
309 case '\r': Out << "\\r"; break;
310 case '\v': Out << "\\v"; break;
311 case '\a': Out << "\\a"; break;
312 case '\"': Out << "\\\""; break;
313 case '\'': Out << "\\\'"; break;
316 Out << (char)(( C/16 < 10) ? ( C/16 +'0') : ( C/16 -10+'A'));
317 Out << (char)(((C&15) < 10) ? ((C&15)+'0') : ((C&15)-10+'A'));
326 if (CPA->getNumOperands()) {
328 printConstant(cast<Constant>(CPA->getOperand(0)));
329 for (unsigned i = 1, e = CPA->getNumOperands(); i != e; ++i) {
331 printConstant(cast<Constant>(CPA->getOperand(i)));
338 // isFPCSafeToPrint - Returns true if we may assume that CFP may be written out
339 // textually as a double (rather than as a reference to a stack-allocated
340 // variable). We decide this by converting CFP to a string and back into a
341 // double, and then checking whether the conversion results in a bit-equal
342 // double to the original value of CFP. This depends on us and the target C
343 // compiler agreeing on the conversion process (which is pretty likely since we
344 // only deal in IEEE FP).
346 bool isFPCSafeToPrint(const ConstantFP *CFP) {
349 sprintf(Buffer, "%a", CFP->getValue());
351 if (!strncmp(Buffer, "0x", 2) ||
352 !strncmp(Buffer, "-0x", 3) ||
353 !strncmp(Buffer, "+0x", 3))
354 return atof(Buffer) == CFP->getValue();
357 std::string StrVal = ftostr(CFP->getValue());
359 while (StrVal[0] == ' ')
360 StrVal.erase(StrVal.begin());
362 // Check to make sure that the stringized number is not some string like "Inf"
363 // or NaN. Check that the string matches the "[-+]?[0-9]" regex.
364 if ((StrVal[0] >= '0' && StrVal[0] <= '9') ||
365 ((StrVal[0] == '-' || StrVal[0] == '+') &&
366 (StrVal[1] >= '0' && StrVal[1] <= '9')))
367 // Reparse stringized version!
368 return atof(StrVal.c_str()) == CFP->getValue();
373 // printConstant - The LLVM Constant to C Constant converter.
374 void CWriter::printConstant(Constant *CPV) {
375 if (const ConstantExpr *CE = dyn_cast<ConstantExpr>(CPV)) {
376 switch (CE->getOpcode()) {
377 case Instruction::Cast:
379 printType(Out, CPV->getType());
381 printConstant(CE->getOperand(0));
385 case Instruction::GetElementPtr:
387 printIndexingExpression(CE->getOperand(0), gep_type_begin(CPV),
391 case Instruction::Select:
393 printConstant(CE->getOperand(0));
395 printConstant(CE->getOperand(1));
397 printConstant(CE->getOperand(2));
400 case Instruction::Add:
401 case Instruction::Sub:
402 case Instruction::Mul:
403 case Instruction::Div:
404 case Instruction::Rem:
405 case Instruction::SetEQ:
406 case Instruction::SetNE:
407 case Instruction::SetLT:
408 case Instruction::SetLE:
409 case Instruction::SetGT:
410 case Instruction::SetGE:
411 case Instruction::Shl:
412 case Instruction::Shr:
414 printConstant(CE->getOperand(0));
415 switch (CE->getOpcode()) {
416 case Instruction::Add: Out << " + "; break;
417 case Instruction::Sub: Out << " - "; break;
418 case Instruction::Mul: Out << " * "; break;
419 case Instruction::Div: Out << " / "; break;
420 case Instruction::Rem: Out << " % "; break;
421 case Instruction::SetEQ: Out << " == "; break;
422 case Instruction::SetNE: Out << " != "; break;
423 case Instruction::SetLT: Out << " < "; break;
424 case Instruction::SetLE: Out << " <= "; break;
425 case Instruction::SetGT: Out << " > "; break;
426 case Instruction::SetGE: Out << " >= "; break;
427 case Instruction::Shl: Out << " << "; break;
428 case Instruction::Shr: Out << " >> "; break;
429 default: assert(0 && "Illegal opcode here!");
431 printConstant(CE->getOperand(1));
436 std::cerr << "CWriter Error: Unhandled constant expression: "
442 switch (CPV->getType()->getPrimitiveID()) {
444 Out << (CPV == ConstantBool::False ? "0" : "1"); break;
445 case Type::SByteTyID:
446 case Type::ShortTyID:
447 Out << cast<ConstantSInt>(CPV)->getValue(); break;
449 if ((int)cast<ConstantSInt>(CPV)->getValue() == (int)0x80000000)
450 Out << "((int)0x80000000)"; // Handle MININT specially to avoid warning
452 Out << cast<ConstantSInt>(CPV)->getValue();
456 Out << cast<ConstantSInt>(CPV)->getValue() << "ll"; break;
458 case Type::UByteTyID:
459 case Type::UShortTyID:
460 Out << cast<ConstantUInt>(CPV)->getValue(); break;
462 Out << cast<ConstantUInt>(CPV)->getValue() << "u"; break;
463 case Type::ULongTyID:
464 Out << cast<ConstantUInt>(CPV)->getValue() << "ull"; break;
466 case Type::FloatTyID:
467 case Type::DoubleTyID: {
468 ConstantFP *FPC = cast<ConstantFP>(CPV);
469 std::map<const ConstantFP*, unsigned>::iterator I = FPConstantMap.find(FPC);
470 if (I != FPConstantMap.end()) {
471 // Because of FP precision problems we must load from a stack allocated
472 // value that holds the value in hex.
473 Out << "(*(" << (FPC->getType() == Type::FloatTy ? "float" : "double")
474 << "*)&FPConstant" << I->second << ")";
477 // Print out the constant as a floating point number.
479 sprintf(Buffer, "%a", FPC->getValue());
480 Out << Buffer << " /*" << FPC->getValue() << "*/ ";
482 Out << ftostr(FPC->getValue());
488 case Type::ArrayTyID:
489 if (isa<ConstantAggregateZero>(CPV)) {
490 const ArrayType *AT = cast<ArrayType>(CPV->getType());
492 if (AT->getNumElements()) {
494 Constant *CZ = Constant::getNullValue(AT->getElementType());
496 for (unsigned i = 1, e = AT->getNumElements(); i != e; ++i) {
503 printConstantArray(cast<ConstantArray>(CPV));
507 case Type::StructTyID:
508 if (isa<ConstantAggregateZero>(CPV)) {
509 const StructType *ST = cast<StructType>(CPV->getType());
511 if (ST->getNumElements()) {
513 printConstant(Constant::getNullValue(ST->getElementType(0)));
514 for (unsigned i = 1, e = ST->getNumElements(); i != e; ++i) {
516 printConstant(Constant::getNullValue(ST->getElementType(i)));
522 if (CPV->getNumOperands()) {
524 printConstant(cast<Constant>(CPV->getOperand(0)));
525 for (unsigned i = 1, e = CPV->getNumOperands(); i != e; ++i) {
527 printConstant(cast<Constant>(CPV->getOperand(i)));
534 case Type::PointerTyID:
535 if (isa<ConstantPointerNull>(CPV)) {
537 printType(Out, CPV->getType());
538 Out << ")/*NULL*/0)";
540 } else if (ConstantPointerRef *CPR = dyn_cast<ConstantPointerRef>(CPV)) {
541 writeOperand(CPR->getValue());
546 std::cerr << "Unknown constant type: " << CPV << "\n";
551 void CWriter::writeOperandInternal(Value *Operand) {
552 if (Instruction *I = dyn_cast<Instruction>(Operand))
553 if (isInlinableInst(*I) && !isDirectAlloca(I)) {
554 // Should we inline this instruction to build a tree?
561 if (Constant *CPV = dyn_cast<Constant>(Operand)) {
564 Out << Mang->getValueName(Operand);
568 void CWriter::writeOperand(Value *Operand) {
569 if (isa<GlobalVariable>(Operand) || isDirectAlloca(Operand))
570 Out << "(&"; // Global variables are references as their addresses by llvm
572 writeOperandInternal(Operand);
574 if (isa<GlobalVariable>(Operand) || isDirectAlloca(Operand))
578 // nameAllUsedStructureTypes - If there are structure types in the module that
579 // are used but do not have names assigned to them in the symbol table yet then
580 // we assign them names now.
582 bool CWriter::nameAllUsedStructureTypes(Module &M) {
583 // Get a set of types that are used by the program...
584 std::set<const Type *> UT = FUT->getTypes();
586 // Loop over the module symbol table, removing types from UT that are already
589 SymbolTable &MST = M.getSymbolTable();
590 if (MST.find(Type::TypeTy) != MST.end())
591 for (SymbolTable::type_iterator I = MST.type_begin(Type::TypeTy),
592 E = MST.type_end(Type::TypeTy); I != E; ++I)
593 UT.erase(cast<Type>(I->second));
595 // UT now contains types that are not named. Loop over it, naming structure
598 bool Changed = false;
599 for (std::set<const Type *>::const_iterator I = UT.begin(), E = UT.end();
601 if (const StructType *ST = dyn_cast<StructType>(*I)) {
602 ((Value*)ST)->setName("unnamed", &MST);
608 // generateCompilerSpecificCode - This is where we add conditional compilation
609 // directives to cater to specific compilers as need be.
611 static void generateCompilerSpecificCode(std::ostream& Out) {
612 // Alloca is hard to get, and we don't want to include stdlib.h here...
613 Out << "/* get a declaration for alloca */\n"
615 << "extern void *__builtin_alloca(unsigned long);\n"
616 << "#define alloca(x) __builtin_alloca(x)\n"
618 << "#ifndef __FreeBSD__\n"
619 << "#include <alloca.h>\n"
623 // We output GCC specific attributes to preserve 'linkonce'ness on globals.
624 // If we aren't being compiled with GCC, just drop these attributes.
625 Out << "#ifndef __GNUC__ /* Can only support \"linkonce\" vars with GCC */\n"
626 << "#define __attribute__(X)\n"
630 // At some point, we should support "external weak" vs. "weak" linkages.
631 // On Mac OS X, "external weak" is spelled "__attribute__((weak_import))".
632 Out << "#if defined(__GNUC__) && defined(__APPLE_CC__)\n"
633 << "#define __EXTERNAL_WEAK__ __attribute__((weak_import))\n"
634 << "#elif defined(__GNUC__)\n"
635 << "#define __EXTERNAL_WEAK__ __attribute__((weak))\n"
637 << "#define __EXTERNAL_WEAK__\n"
641 // For now, turn off the weak linkage attribute on Mac OS X. (See above.)
642 Out << "#if defined(__GNUC__) && defined(__APPLE_CC__)\n"
643 << "#define __ATTRIBUTE_WEAK__\n"
644 << "#elif defined(__GNUC__)\n"
645 << "#define __ATTRIBUTE_WEAK__ __attribute__((weak))\n"
647 << "#define __ATTRIBUTE_WEAK__\n"
651 bool CWriter::doInitialization(Module &M) {
654 FUT = &getAnalysis<FindUsedTypes>();
656 // Ensure that all structure types have names...
657 bool Changed = nameAllUsedStructureTypes(M);
658 Mang = new Mangler(M);
660 // get declaration for alloca
661 Out << "/* Provide Declarations */\n";
662 Out << "#include <stdarg.h>\n"; // Varargs support
663 Out << "#include <setjmp.h>\n"; // Unwind support
664 generateCompilerSpecificCode(Out);
666 // Provide a definition for `bool' if not compiling with a C++ compiler.
668 << "#ifndef __cplusplus\ntypedef unsigned char bool;\n#endif\n"
670 << "\n\n/* Support for floating point constants */\n"
671 << "typedef unsigned long long ConstantDoubleTy;\n"
672 << "typedef unsigned int ConstantFloatTy;\n"
674 << "\n\n/* Global Declarations */\n";
676 // First output all the declarations for the program, because C requires
677 // Functions & globals to be declared before they are used.
680 // Loop over the symbol table, emitting all named constants...
681 printSymbolTable(M.getSymbolTable());
683 // Global variable declarations...
685 Out << "\n/* External Global Variable Declarations */\n";
686 for (Module::giterator I = M.gbegin(), E = M.gend(); I != E; ++I) {
687 if (I->hasExternalLinkage()) {
689 printType(Out, I->getType()->getElementType(), Mang->getValueName(I));
695 // Function declarations
697 Out << "\n/* Function Declarations */\n";
698 for (Module::iterator I = M.begin(), E = M.end(); I != E; ++I) {
699 // Don't print declarations for intrinsic functions.
700 if (!I->getIntrinsicID()) {
701 printFunctionSignature(I, true);
702 if (I->hasWeakLinkage()) Out << " __ATTRIBUTE_WEAK__";
703 if (I->hasLinkOnceLinkage()) Out << " __ATTRIBUTE_WEAK__";
709 // Output the global variable declarations
711 Out << "\n\n/* Global Variable Declarations */\n";
712 for (Module::giterator I = M.gbegin(), E = M.gend(); I != E; ++I)
713 if (!I->isExternal()) {
715 printType(Out, I->getType()->getElementType(), Mang->getValueName(I));
717 if (I->hasLinkOnceLinkage())
718 Out << " __attribute__((common))";
719 else if (I->hasWeakLinkage())
720 Out << " __ATTRIBUTE_WEAK__";
725 // Output the global variable definitions and contents...
727 Out << "\n\n/* Global Variable Definitions and Initialization */\n";
728 for (Module::giterator I = M.gbegin(), E = M.gend(); I != E; ++I)
729 if (!I->isExternal()) {
730 if (I->hasInternalLinkage())
732 printType(Out, I->getType()->getElementType(), Mang->getValueName(I));
733 if (I->hasLinkOnceLinkage())
734 Out << " __attribute__((common))";
735 else if (I->hasWeakLinkage())
736 Out << " __ATTRIBUTE_WEAK__";
738 // If the initializer is not null, emit the initializer. If it is null,
739 // we try to avoid emitting large amounts of zeros. The problem with
740 // this, however, occurs when the variable has weak linkage. In this
741 // case, the assembler will complain about the variable being both weak
742 // and common, so we disable this optimization.
743 if (!I->getInitializer()->isNullValue()) {
745 writeOperand(I->getInitializer());
746 } else if (I->hasWeakLinkage()) {
747 // We have to specify an initializer, but it doesn't have to be
748 // complete. If the value is an aggregate, print out { 0 }, and let
749 // the compiler figure out the rest of the zeros.
751 if (isa<StructType>(I->getInitializer()->getType()) ||
752 isa<ArrayType>(I->getInitializer()->getType())) {
755 // Just print it out normally.
756 writeOperand(I->getInitializer());
763 // Output all floating point constants that cannot be printed accurately...
764 printFloatingPointConstants(M);
767 Out << "\n\n/* Function Bodies */\n";
772 /// Output all floating point constants that cannot be printed accurately...
773 void CWriter::printFloatingPointConstants(Module &M) {
776 unsigned long long U;
784 // Scan the module for floating point constants. If any FP constant is used
785 // in the function, we want to redirect it here so that we do not depend on
786 // the precision of the printed form, unless the printed form preserves
789 unsigned FPCounter = 0;
790 for (Module::iterator F = M.begin(), E = M.end(); F != E; ++F)
791 for (constant_iterator I = constant_begin(F), E = constant_end(F);
793 if (const ConstantFP *FPC = dyn_cast<ConstantFP>(*I))
794 if (!isFPCSafeToPrint(FPC) && // Do not put in FPConstantMap if safe.
795 !FPConstantMap.count(FPC)) {
796 double Val = FPC->getValue();
798 FPConstantMap[FPC] = FPCounter; // Number the FP constants
800 if (FPC->getType() == Type::DoubleTy) {
802 Out << "static const ConstantDoubleTy FPConstant" << FPCounter++
803 << " = 0x" << std::hex << DBLUnion.U << std::dec
804 << "ULL; /* " << Val << " */\n";
805 } else if (FPC->getType() == Type::FloatTy) {
807 Out << "static const ConstantFloatTy FPConstant" << FPCounter++
808 << " = 0x" << std::hex << FLTUnion.U << std::dec
809 << "U; /* " << Val << " */\n";
811 assert(0 && "Unknown float type!");
818 /// printSymbolTable - Run through symbol table looking for type names. If a
819 /// type name is found, emit it's declaration...
821 void CWriter::printSymbolTable(const SymbolTable &ST) {
822 // If there are no type names, exit early.
823 if (ST.find(Type::TypeTy) == ST.end())
826 // We are only interested in the type plane of the symbol table...
827 SymbolTable::type_const_iterator I = ST.type_begin(Type::TypeTy);
828 SymbolTable::type_const_iterator End = ST.type_end(Type::TypeTy);
830 // Print out forward declarations for structure types before anything else!
831 Out << "/* Structure forward decls */\n";
832 for (; I != End; ++I)
833 if (const Type *STy = dyn_cast<StructType>(I->second))
834 // Only print out used types!
835 if (FUT->getTypes().count(STy)) {
836 std::string Name = "struct l_" + Mangler::makeNameProper(I->first);
837 Out << Name << ";\n";
838 TypeNames.insert(std::make_pair(STy, Name));
843 // Now we can print out typedefs...
844 Out << "/* Typedefs */\n";
845 for (I = ST.type_begin(Type::TypeTy); I != End; ++I)
846 // Only print out used types!
847 if (FUT->getTypes().count(cast<Type>(I->second))) {
848 const Type *Ty = cast<Type>(I->second);
849 std::string Name = "l_" + Mangler::makeNameProper(I->first);
851 printType(Out, Ty, Name);
857 // Keep track of which structures have been printed so far...
858 std::set<const StructType *> StructPrinted;
860 // Loop over all structures then push them into the stack so they are
861 // printed in the correct order.
863 Out << "/* Structure contents */\n";
864 for (I = ST.type_begin(Type::TypeTy); I != End; ++I)
865 if (const StructType *STy = dyn_cast<StructType>(I->second))
866 // Only print out used types!
867 if (FUT->getTypes().count(STy))
868 printContainedStructs(STy, StructPrinted);
871 // Push the struct onto the stack and recursively push all structs
872 // this one depends on.
873 void CWriter::printContainedStructs(const Type *Ty,
874 std::set<const StructType*> &StructPrinted){
875 if (const StructType *STy = dyn_cast<StructType>(Ty)) {
876 //Check to see if we have already printed this struct
877 if (StructPrinted.count(STy) == 0) {
878 // Print all contained types first...
879 for (StructType::element_iterator I = STy->element_begin(),
880 E = STy->element_end(); I != E; ++I) {
881 const Type *Ty1 = I->get();
882 if (isa<StructType>(Ty1) || isa<ArrayType>(Ty1))
883 printContainedStructs(*I, StructPrinted);
886 //Print structure type out..
887 StructPrinted.insert(STy);
888 std::string Name = TypeNames[STy];
889 printType(Out, STy, Name, true);
893 // If it is an array, check contained types and continue
894 } else if (const ArrayType *ATy = dyn_cast<ArrayType>(Ty)){
895 const Type *Ty1 = ATy->getElementType();
896 if (isa<StructType>(Ty1) || isa<ArrayType>(Ty1))
897 printContainedStructs(Ty1, StructPrinted);
902 void CWriter::printFunctionSignature(const Function *F, bool Prototype) {
903 if (F->hasInternalLinkage()) Out << "static ";
905 // Loop over the arguments, printing them...
906 const FunctionType *FT = cast<FunctionType>(F->getFunctionType());
908 std::stringstream FunctionInnards;
910 // Print out the name...
911 FunctionInnards << Mang->getValueName(F) << "(";
913 if (!F->isExternal()) {
916 if (F->abegin()->hasName() || !Prototype)
917 ArgName = Mang->getValueName(F->abegin());
918 printType(FunctionInnards, F->afront().getType(), ArgName);
919 for (Function::const_aiterator I = ++F->abegin(), E = F->aend();
921 FunctionInnards << ", ";
922 if (I->hasName() || !Prototype)
923 ArgName = Mang->getValueName(I);
926 printType(FunctionInnards, I->getType(), ArgName);
930 // Loop over the arguments, printing them...
931 for (FunctionType::param_iterator I = FT->param_begin(),
932 E = FT->param_end(); I != E; ++I) {
933 if (I != FT->param_begin()) FunctionInnards << ", ";
934 printType(FunctionInnards, *I);
938 // Finish printing arguments... if this is a vararg function, print the ...,
939 // unless there are no known types, in which case, we just emit ().
941 if (FT->isVarArg() && FT->getNumParams()) {
942 if (FT->getNumParams()) FunctionInnards << ", ";
943 FunctionInnards << "..."; // Output varargs portion of signature!
944 } else if (!FT->isVarArg() && FT->getNumParams() == 0) {
945 FunctionInnards << "void"; // ret() -> ret(void) in C.
947 FunctionInnards << ")";
948 // Print out the return type and the entire signature for that matter
949 printType(Out, F->getReturnType(), FunctionInnards.str());
952 void CWriter::printFunction(Function &F) {
953 printFunctionSignature(&F, false);
956 // print local variable information for the function
957 for (inst_iterator I = inst_begin(&F), E = inst_end(&F); I != E; ++I)
958 if (const AllocaInst *AI = isDirectAlloca(&*I)) {
960 printType(Out, AI->getAllocatedType(), Mang->getValueName(AI));
961 Out << "; /* Address exposed local */\n";
962 } else if (I->getType() != Type::VoidTy && !isInlinableInst(*I)) {
964 printType(Out, I->getType(), Mang->getValueName(&*I));
967 if (isa<PHINode>(*I)) { // Print out PHI node temporaries as well...
969 printType(Out, I->getType(),
970 Mang->getValueName(&*I)+"__PHI_TEMPORARY");
977 // print the basic blocks
978 for (Function::iterator BB = F.begin(), E = F.end(); BB != E; ++BB) {
979 BasicBlock *Prev = BB->getPrev();
981 // Don't print the label for the basic block if there are no uses, or if the
982 // only terminator use is the predecessor basic block's terminator. We have
983 // to scan the use list because PHI nodes use basic blocks too but do not
984 // require a label to be generated.
986 bool NeedsLabel = false;
987 for (Value::use_iterator UI = BB->use_begin(), UE = BB->use_end();
989 if (TerminatorInst *TI = dyn_cast<TerminatorInst>(*UI))
990 if (TI != Prev->getTerminator() ||
991 isa<SwitchInst>(Prev->getTerminator()) ||
992 isa<InvokeInst>(Prev->getTerminator())) {
997 if (NeedsLabel) Out << Mang->getValueName(BB) << ":\n";
999 // Output all of the instructions in the basic block...
1000 for (BasicBlock::iterator II = BB->begin(), E = --BB->end(); II != E; ++II){
1001 if (!isInlinableInst(*II) && !isDirectAlloca(II)) {
1002 if (II->getType() != Type::VoidTy)
1011 // Don't emit prefix or suffix for the terminator...
1012 visit(*BB->getTerminator());
1018 // Specific Instruction type classes... note that all of the casts are
1019 // necessary because we use the instruction classes as opaque types...
1021 void CWriter::visitReturnInst(ReturnInst &I) {
1022 // Don't output a void return if this is the last basic block in the function
1023 if (I.getNumOperands() == 0 &&
1024 &*--I.getParent()->getParent()->end() == I.getParent() &&
1025 !I.getParent()->size() == 1) {
1030 if (I.getNumOperands()) {
1032 writeOperand(I.getOperand(0));
1037 void CWriter::visitSwitchInst(SwitchInst &SI) {
1039 writeOperand(SI.getOperand(0));
1040 Out << ") {\n default:\n";
1041 printBranchToBlock(SI.getParent(), SI.getDefaultDest(), 2);
1043 for (unsigned i = 2, e = SI.getNumOperands(); i != e; i += 2) {
1045 writeOperand(SI.getOperand(i));
1047 BasicBlock *Succ = cast<BasicBlock>(SI.getOperand(i+1));
1048 printBranchToBlock(SI.getParent(), Succ, 2);
1049 if (Succ == SI.getParent()->getNext())
1055 void CWriter::visitInvokeInst(InvokeInst &II) {
1056 assert(0 && "Lowerinvoke pass didn't work!");
1060 void CWriter::visitUnwindInst(UnwindInst &I) {
1061 assert(0 && "Lowerinvoke pass didn't work!");
1064 bool isGotoCodeNecessary(BasicBlock *From, BasicBlock *To) {
1065 // If PHI nodes need copies, we need the copy code...
1066 if (isa<PHINode>(To->front()) ||
1067 From->getNext() != To) // Not directly successor, need goto
1070 // Otherwise we don't need the code.
1074 void CWriter::printBranchToBlock(BasicBlock *CurBB, BasicBlock *Succ,
1076 for (BasicBlock::iterator I = Succ->begin();
1077 PHINode *PN = dyn_cast<PHINode>(I); ++I) {
1078 // now we have to do the printing
1079 Out << std::string(Indent, ' ');
1080 Out << " " << Mang->getValueName(I) << "__PHI_TEMPORARY = ";
1081 writeOperand(PN->getIncomingValue(PN->getBasicBlockIndex(CurBB)));
1082 Out << "; /* for PHI node */\n";
1085 if (CurBB->getNext() != Succ ||
1086 isa<InvokeInst>(CurBB->getTerminator()) ||
1087 isa<SwitchInst>(CurBB->getTerminator())) {
1088 Out << std::string(Indent, ' ') << " goto ";
1094 // Branch instruction printing - Avoid printing out a branch to a basic block
1095 // that immediately succeeds the current one.
1097 void CWriter::visitBranchInst(BranchInst &I) {
1098 if (I.isConditional()) {
1099 if (isGotoCodeNecessary(I.getParent(), I.getSuccessor(0))) {
1101 writeOperand(I.getCondition());
1104 printBranchToBlock(I.getParent(), I.getSuccessor(0), 2);
1106 if (isGotoCodeNecessary(I.getParent(), I.getSuccessor(1))) {
1107 Out << " } else {\n";
1108 printBranchToBlock(I.getParent(), I.getSuccessor(1), 2);
1111 // First goto not necessary, assume second one is...
1113 writeOperand(I.getCondition());
1116 printBranchToBlock(I.getParent(), I.getSuccessor(1), 2);
1121 printBranchToBlock(I.getParent(), I.getSuccessor(0), 0);
1126 // PHI nodes get copied into temporary values at the end of predecessor basic
1127 // blocks. We now need to copy these temporary values into the REAL value for
1129 void CWriter::visitPHINode(PHINode &I) {
1131 Out << "__PHI_TEMPORARY";
1135 void CWriter::visitBinaryOperator(Instruction &I) {
1136 // binary instructions, shift instructions, setCond instructions.
1137 assert(!isa<PointerType>(I.getType()));
1139 // We must cast the results of binary operations which might be promoted.
1140 bool needsCast = false;
1141 if ((I.getType() == Type::UByteTy) || (I.getType() == Type::SByteTy)
1142 || (I.getType() == Type::UShortTy) || (I.getType() == Type::ShortTy)
1143 || (I.getType() == Type::FloatTy)) {
1146 printType(Out, I.getType());
1150 writeOperand(I.getOperand(0));
1152 switch (I.getOpcode()) {
1153 case Instruction::Add: Out << " + "; break;
1154 case Instruction::Sub: Out << " - "; break;
1155 case Instruction::Mul: Out << "*"; break;
1156 case Instruction::Div: Out << "/"; break;
1157 case Instruction::Rem: Out << "%"; break;
1158 case Instruction::And: Out << " & "; break;
1159 case Instruction::Or: Out << " | "; break;
1160 case Instruction::Xor: Out << " ^ "; break;
1161 case Instruction::SetEQ: Out << " == "; break;
1162 case Instruction::SetNE: Out << " != "; break;
1163 case Instruction::SetLE: Out << " <= "; break;
1164 case Instruction::SetGE: Out << " >= "; break;
1165 case Instruction::SetLT: Out << " < "; break;
1166 case Instruction::SetGT: Out << " > "; break;
1167 case Instruction::Shl : Out << " << "; break;
1168 case Instruction::Shr : Out << " >> "; break;
1169 default: std::cerr << "Invalid operator type!" << I; abort();
1172 writeOperand(I.getOperand(1));
1179 void CWriter::visitCastInst(CastInst &I) {
1180 if (I.getType() == Type::BoolTy) {
1182 writeOperand(I.getOperand(0));
1187 printType(Out, I.getType());
1189 if (isa<PointerType>(I.getType())&&I.getOperand(0)->getType()->isIntegral() ||
1190 isa<PointerType>(I.getOperand(0)->getType())&&I.getType()->isIntegral()) {
1191 // Avoid "cast to pointer from integer of different size" warnings
1195 writeOperand(I.getOperand(0));
1198 void CWriter::visitSelectInst(SelectInst &I) {
1200 writeOperand(I.getCondition());
1202 writeOperand(I.getTrueValue());
1204 writeOperand(I.getFalseValue());
1209 void CWriter::lowerIntrinsics(Module &M) {
1210 for (Module::iterator F = M.begin(), E = M.end(); F != E; ++F)
1211 for (Function::iterator BB = F->begin(), E = F->end(); BB != E; ++BB)
1212 for (BasicBlock::iterator I = BB->begin(), E = BB->end(); I != E; )
1213 if (CallInst *CI = dyn_cast<CallInst>(I++))
1214 if (Function *F = CI->getCalledFunction())
1215 switch (F->getIntrinsicID()) {
1216 case Intrinsic::not_intrinsic:
1217 case Intrinsic::vastart:
1218 case Intrinsic::vacopy:
1219 case Intrinsic::vaend:
1220 case Intrinsic::returnaddress:
1221 case Intrinsic::frameaddress:
1222 case Intrinsic::setjmp:
1223 case Intrinsic::longjmp:
1224 // We directly implement these intrinsics
1227 // All other intrinsic calls we must lower.
1228 Instruction *Before = CI->getPrev();
1229 IL.LowerIntrinsicCall(CI);
1230 if (Before) { // Move iterator to instruction after call
1240 void CWriter::visitCallInst(CallInst &I) {
1241 // Handle intrinsic function calls first...
1242 if (Function *F = I.getCalledFunction())
1243 if (Intrinsic::ID ID = (Intrinsic::ID)F->getIntrinsicID()) {
1245 default: assert(0 && "Unknown LLVM intrinsic!");
1246 case Intrinsic::vastart:
1249 Out << "va_start(*(va_list*)&" << Mang->getValueName(&I) << ", ";
1250 // Output the last argument to the enclosing function...
1251 if (I.getParent()->getParent()->aempty()) {
1252 std::cerr << "The C backend does not currently support zero "
1253 << "argument varargs functions, such as '"
1254 << I.getParent()->getParent()->getName() << "'!\n";
1257 writeOperand(&I.getParent()->getParent()->aback());
1260 case Intrinsic::vaend:
1261 Out << "va_end(*(va_list*)&";
1262 writeOperand(I.getOperand(1));
1265 case Intrinsic::vacopy:
1267 Out << "va_copy(*(va_list*)&" << Mang->getValueName(&I) << ", ";
1268 Out << "*(va_list*)&";
1269 writeOperand(I.getOperand(1));
1272 case Intrinsic::returnaddress:
1273 Out << "__builtin_return_address(";
1274 writeOperand(I.getOperand(1));
1277 case Intrinsic::frameaddress:
1278 Out << "__builtin_frame_address(";
1279 writeOperand(I.getOperand(1));
1282 case Intrinsic::setjmp:
1283 Out << "setjmp(*(jmp_buf*)";
1284 writeOperand(I.getOperand(1));
1287 case Intrinsic::longjmp:
1288 Out << "longjmp(*(jmp_buf*)";
1289 writeOperand(I.getOperand(1));
1291 writeOperand(I.getOperand(2));
1299 void CWriter::visitCallSite(CallSite CS) {
1300 const PointerType *PTy = cast<PointerType>(CS.getCalledValue()->getType());
1301 const FunctionType *FTy = cast<FunctionType>(PTy->getElementType());
1302 const Type *RetTy = FTy->getReturnType();
1304 writeOperand(CS.getCalledValue());
1307 if (CS.arg_begin() != CS.arg_end()) {
1308 CallSite::arg_iterator AI = CS.arg_begin(), AE = CS.arg_end();
1311 for (++AI; AI != AE; ++AI) {
1319 void CWriter::visitMallocInst(MallocInst &I) {
1320 assert(0 && "lowerallocations pass didn't work!");
1323 void CWriter::visitAllocaInst(AllocaInst &I) {
1325 printType(Out, I.getType());
1326 Out << ") alloca(sizeof(";
1327 printType(Out, I.getType()->getElementType());
1329 if (I.isArrayAllocation()) {
1331 writeOperand(I.getOperand(0));
1336 void CWriter::visitFreeInst(FreeInst &I) {
1337 assert(0 && "lowerallocations pass didn't work!");
1340 void CWriter::printIndexingExpression(Value *Ptr, gep_type_iterator I,
1341 gep_type_iterator E) {
1342 bool HasImplicitAddress = false;
1343 // If accessing a global value with no indexing, avoid *(&GV) syndrome
1344 if (GlobalValue *V = dyn_cast<GlobalValue>(Ptr)) {
1345 HasImplicitAddress = true;
1346 } else if (ConstantPointerRef *CPR = dyn_cast<ConstantPointerRef>(Ptr)) {
1347 HasImplicitAddress = true;
1348 Ptr = CPR->getValue(); // Get to the global...
1349 } else if (isDirectAlloca(Ptr)) {
1350 HasImplicitAddress = true;
1354 if (!HasImplicitAddress)
1355 Out << "*"; // Implicit zero first argument: '*x' is equivalent to 'x[0]'
1357 writeOperandInternal(Ptr);
1361 const Constant *CI = dyn_cast<Constant>(I.getOperand());
1362 if (HasImplicitAddress && (!CI || !CI->isNullValue()))
1365 writeOperandInternal(Ptr);
1367 if (HasImplicitAddress && (!CI || !CI->isNullValue())) {
1369 HasImplicitAddress = false; // HIA is only true if we haven't addressed yet
1372 assert(!HasImplicitAddress || (CI && CI->isNullValue()) &&
1373 "Can only have implicit address with direct accessing");
1375 if (HasImplicitAddress) {
1377 } else if (CI && CI->isNullValue()) {
1378 gep_type_iterator TmpI = I; ++TmpI;
1380 // Print out the -> operator if possible...
1381 if (TmpI != E && isa<StructType>(*TmpI)) {
1382 Out << (HasImplicitAddress ? "." : "->");
1383 Out << "field" << cast<ConstantUInt>(TmpI.getOperand())->getValue();
1389 if (isa<StructType>(*I)) {
1390 Out << ".field" << cast<ConstantUInt>(I.getOperand())->getValue();
1393 writeOperand(I.getOperand());
1398 void CWriter::visitLoadInst(LoadInst &I) {
1400 writeOperand(I.getOperand(0));
1403 void CWriter::visitStoreInst(StoreInst &I) {
1405 writeOperand(I.getPointerOperand());
1407 writeOperand(I.getOperand(0));
1410 void CWriter::visitGetElementPtrInst(GetElementPtrInst &I) {
1412 printIndexingExpression(I.getPointerOperand(), gep_type_begin(I),
1416 void CWriter::visitVANextInst(VANextInst &I) {
1417 Out << Mang->getValueName(I.getOperand(0));
1418 Out << "; va_arg(*(va_list*)&" << Mang->getValueName(&I) << ", ";
1419 printType(Out, I.getArgType());
1423 void CWriter::visitVAArgInst(VAArgInst &I) {
1425 Out << "{ va_list Tmp; va_copy(Tmp, *(va_list*)&";
1426 writeOperand(I.getOperand(0));
1427 Out << ");\n " << Mang->getValueName(&I) << " = va_arg(Tmp, ";
1428 printType(Out, I.getType());
1429 Out << ");\n va_end(Tmp); }";
1432 //===----------------------------------------------------------------------===//
1433 // External Interface declaration
1434 //===----------------------------------------------------------------------===//
1436 bool CTargetMachine::addPassesToEmitAssembly(PassManager &PM, std::ostream &o) {
1437 PM.add(createLowerAllocationsPass());
1438 PM.add(createLowerInvokePass());
1439 PM.add(new CWriter(o, getIntrinsicLowering()));
1443 TargetMachine *llvm::allocateCTargetMachine(const Module &M,
1444 IntrinsicLowering *IL) {
1445 return new CTargetMachine(M, IL);