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"
39 class CWriter : public Pass, public InstVisitor<CWriter> {
41 IntrinsicLowering &IL;
43 const Module *TheModule;
46 std::map<const Type *, std::string> TypeNames;
48 std::map<const ConstantFP *, unsigned> FPConstantMap;
50 CWriter(std::ostream &o, IntrinsicLowering &il) : Out(o), IL(il) {}
52 void getAnalysisUsage(AnalysisUsage &AU) const {
53 AU.addRequired<FindUsedTypes>();
56 virtual const char *getPassName() const { return "C backend"; }
58 bool doInitialization(Module &M);
60 // First pass, lower all unhandled intrinsics.
65 for (Module::iterator I = M.begin(), E = M.end(); I != E; ++I)
75 std::ostream &printType(std::ostream &Out, const Type *Ty,
76 const std::string &VariableName = "",
77 bool IgnoreName = false);
79 void writeOperand(Value *Operand);
80 void writeOperandInternal(Value *Operand);
83 void lowerIntrinsics(Module &M);
85 bool nameAllUsedStructureTypes(Module &M);
86 void printModule(Module *M);
87 void printFloatingPointConstants(Module &M);
88 void printSymbolTable(const SymbolTable &ST);
89 void printContainedStructs(const Type *Ty, std::set<const StructType *> &);
90 void printFunctionSignature(const Function *F, bool Prototype);
92 void printFunction(Function &);
94 void printConstant(Constant *CPV);
95 void printConstantArray(ConstantArray *CPA);
97 // isInlinableInst - Attempt to inline instructions into their uses to build
98 // trees as much as possible. To do this, we have to consistently decide
99 // what is acceptable to inline, so that variable declarations don't get
100 // printed and an extra copy of the expr is not emitted.
102 static bool isInlinableInst(const Instruction &I) {
103 // Must be an expression, must be used exactly once. If it is dead, we
104 // emit it inline where it would go.
105 if (I.getType() == Type::VoidTy || !I.hasOneUse() ||
106 isa<TerminatorInst>(I) || isa<CallInst>(I) || isa<PHINode>(I) ||
107 isa<LoadInst>(I) || isa<VAArgInst>(I) || isa<VANextInst>(I))
108 // Don't inline a load across a store or other bad things!
111 // Only inline instruction it it's use is in the same BB as the inst.
112 return I.getParent() == cast<Instruction>(I.use_back())->getParent();
115 // isDirectAlloca - Define fixed sized allocas in the entry block as direct
116 // variables which are accessed with the & operator. This causes GCC to
117 // generate significantly better code than to emit alloca calls directly.
119 static const AllocaInst *isDirectAlloca(const Value *V) {
120 const AllocaInst *AI = dyn_cast<AllocaInst>(V);
121 if (!AI) return false;
122 if (AI->isArrayAllocation())
123 return 0; // FIXME: we can also inline fixed size array allocas!
124 if (AI->getParent() != &AI->getParent()->getParent()->getEntryBlock())
129 // Instruction visitation functions
130 friend class InstVisitor<CWriter>;
132 void visitReturnInst(ReturnInst &I);
133 void visitBranchInst(BranchInst &I);
134 void visitSwitchInst(SwitchInst &I);
135 void visitInvokeInst(InvokeInst &I);
136 void visitUnwindInst(UnwindInst &I);
138 void visitPHINode(PHINode &I);
139 void visitBinaryOperator(Instruction &I);
141 void visitCastInst (CastInst &I);
142 void visitCallInst (CallInst &I);
143 void visitCallSite (CallSite CS);
144 void visitShiftInst(ShiftInst &I) { visitBinaryOperator(I); }
146 void visitMallocInst(MallocInst &I);
147 void visitAllocaInst(AllocaInst &I);
148 void visitFreeInst (FreeInst &I);
149 void visitLoadInst (LoadInst &I);
150 void visitStoreInst (StoreInst &I);
151 void visitGetElementPtrInst(GetElementPtrInst &I);
152 void visitVANextInst(VANextInst &I);
153 void visitVAArgInst (VAArgInst &I);
155 void visitInstruction(Instruction &I) {
156 std::cerr << "C Writer does not know about " << I;
160 void outputLValue(Instruction *I) {
161 Out << " " << Mang->getValueName(I) << " = ";
163 void printBranchToBlock(BasicBlock *CurBlock, BasicBlock *SuccBlock,
165 void printIndexingExpression(Value *Ptr, gep_type_iterator I,
166 gep_type_iterator E);
170 // Pass the Type* and the variable name and this prints out the variable
173 std::ostream &CWriter::printType(std::ostream &Out, const Type *Ty,
174 const std::string &NameSoFar,
176 if (Ty->isPrimitiveType())
177 switch (Ty->getPrimitiveID()) {
178 case Type::VoidTyID: return Out << "void " << NameSoFar;
179 case Type::BoolTyID: return Out << "bool " << NameSoFar;
180 case Type::UByteTyID: return Out << "unsigned char " << NameSoFar;
181 case Type::SByteTyID: return Out << "signed char " << NameSoFar;
182 case Type::UShortTyID: return Out << "unsigned short " << NameSoFar;
183 case Type::ShortTyID: return Out << "short " << NameSoFar;
184 case Type::UIntTyID: return Out << "unsigned " << NameSoFar;
185 case Type::IntTyID: return Out << "int " << NameSoFar;
186 case Type::ULongTyID: return Out << "unsigned long long " << NameSoFar;
187 case Type::LongTyID: return Out << "signed long long " << NameSoFar;
188 case Type::FloatTyID: return Out << "float " << NameSoFar;
189 case Type::DoubleTyID: return Out << "double " << NameSoFar;
191 std::cerr << "Unknown primitive type: " << Ty << "\n";
195 // Check to see if the type is named.
196 if (!IgnoreName || isa<OpaqueType>(Ty)) {
197 std::map<const Type *, std::string>::iterator I = TypeNames.find(Ty);
198 if (I != TypeNames.end()) return Out << I->second << " " << NameSoFar;
201 switch (Ty->getPrimitiveID()) {
202 case Type::FunctionTyID: {
203 const FunctionType *MTy = cast<FunctionType>(Ty);
204 std::stringstream FunctionInnards;
205 FunctionInnards << " (" << NameSoFar << ") (";
206 for (FunctionType::param_iterator I = MTy->param_begin(),
207 E = MTy->param_end(); I != E; ++I) {
208 if (I != MTy->param_begin())
209 FunctionInnards << ", ";
210 printType(FunctionInnards, *I, "");
212 if (MTy->isVarArg()) {
213 if (MTy->getNumParams())
214 FunctionInnards << ", ...";
215 } else if (!MTy->getNumParams()) {
216 FunctionInnards << "void";
218 FunctionInnards << ")";
219 std::string tstr = FunctionInnards.str();
220 printType(Out, MTy->getReturnType(), tstr);
223 case Type::StructTyID: {
224 const StructType *STy = cast<StructType>(Ty);
225 Out << NameSoFar + " {\n";
227 for (StructType::element_iterator I = STy->element_begin(),
228 E = STy->element_end(); I != E; ++I) {
230 printType(Out, *I, "field" + utostr(Idx++));
236 case Type::PointerTyID: {
237 const PointerType *PTy = cast<PointerType>(Ty);
238 std::string ptrName = "*" + NameSoFar;
240 if (isa<ArrayType>(PTy->getElementType()))
241 ptrName = "(" + ptrName + ")";
243 return printType(Out, PTy->getElementType(), ptrName);
246 case Type::ArrayTyID: {
247 const ArrayType *ATy = cast<ArrayType>(Ty);
248 unsigned NumElements = ATy->getNumElements();
249 return printType(Out, ATy->getElementType(),
250 NameSoFar + "[" + utostr(NumElements) + "]");
253 case Type::OpaqueTyID: {
254 static int Count = 0;
255 std::string TyName = "struct opaque_" + itostr(Count++);
256 assert(TypeNames.find(Ty) == TypeNames.end());
257 TypeNames[Ty] = TyName;
258 return Out << TyName << " " << NameSoFar;
261 assert(0 && "Unhandled case in getTypeProps!");
268 void CWriter::printConstantArray(ConstantArray *CPA) {
270 // As a special case, print the array as a string if it is an array of
271 // ubytes or an array of sbytes with positive values.
273 const Type *ETy = CPA->getType()->getElementType();
274 bool isString = (ETy == Type::SByteTy || ETy == Type::UByteTy);
276 // Make sure the last character is a null char, as automatically added by C
277 if (isString && (CPA->getNumOperands() == 0 ||
278 !cast<Constant>(*(CPA->op_end()-1))->isNullValue()))
283 // Keep track of whether the last number was a hexadecimal escape
284 bool LastWasHex = false;
286 // Do not include the last character, which we know is null
287 for (unsigned i = 0, e = CPA->getNumOperands()-1; i != e; ++i) {
288 unsigned char C = cast<ConstantInt>(CPA->getOperand(i))->getRawValue();
290 // Print it out literally if it is a printable character. The only thing
291 // to be careful about is when the last letter output was a hex escape
292 // code, in which case we have to be careful not to print out hex digits
293 // explicitly (the C compiler thinks it is a continuation of the previous
294 // character, sheesh...)
296 if (isprint(C) && (!LastWasHex || !isxdigit(C))) {
298 if (C == '"' || C == '\\')
305 case '\n': Out << "\\n"; break;
306 case '\t': Out << "\\t"; break;
307 case '\r': Out << "\\r"; break;
308 case '\v': Out << "\\v"; break;
309 case '\a': Out << "\\a"; break;
310 case '\"': Out << "\\\""; break;
311 case '\'': Out << "\\\'"; break;
314 Out << (char)(( C/16 < 10) ? ( C/16 +'0') : ( C/16 -10+'A'));
315 Out << (char)(((C&15) < 10) ? ((C&15)+'0') : ((C&15)-10+'A'));
324 if (CPA->getNumOperands()) {
326 printConstant(cast<Constant>(CPA->getOperand(0)));
327 for (unsigned i = 1, e = CPA->getNumOperands(); i != e; ++i) {
329 printConstant(cast<Constant>(CPA->getOperand(i)));
336 // isFPCSafeToPrint - Returns true if we may assume that CFP may be written out
337 // textually as a double (rather than as a reference to a stack-allocated
338 // variable). We decide this by converting CFP to a string and back into a
339 // double, and then checking whether the conversion results in a bit-equal
340 // double to the original value of CFP. This depends on us and the target C
341 // compiler agreeing on the conversion process (which is pretty likely since we
342 // only deal in IEEE FP).
344 bool isFPCSafeToPrint(const ConstantFP *CFP) {
347 sprintf(Buffer, "%a", CFP->getValue());
349 if (!strncmp(Buffer, "0x", 2) ||
350 !strncmp(Buffer, "-0x", 3) ||
351 !strncmp(Buffer, "+0x", 3))
352 return atof(Buffer) == CFP->getValue();
355 std::string StrVal = ftostr(CFP->getValue());
357 while (StrVal[0] == ' ')
358 StrVal.erase(StrVal.begin());
360 // Check to make sure that the stringized number is not some string like "Inf"
361 // or NaN. Check that the string matches the "[-+]?[0-9]" regex.
362 if ((StrVal[0] >= '0' && StrVal[0] <= '9') ||
363 ((StrVal[0] == '-' || StrVal[0] == '+') &&
364 (StrVal[1] >= '0' && StrVal[1] <= '9')))
365 // Reparse stringized version!
366 return atof(StrVal.c_str()) == CFP->getValue();
371 // printConstant - The LLVM Constant to C Constant converter.
372 void CWriter::printConstant(Constant *CPV) {
373 if (const ConstantExpr *CE = dyn_cast<ConstantExpr>(CPV)) {
374 switch (CE->getOpcode()) {
375 case Instruction::Cast:
377 printType(Out, CPV->getType());
379 printConstant(CE->getOperand(0));
383 case Instruction::GetElementPtr:
385 printIndexingExpression(CE->getOperand(0), gep_type_begin(CPV),
389 case Instruction::Add:
390 case Instruction::Sub:
391 case Instruction::Mul:
392 case Instruction::Div:
393 case Instruction::Rem:
394 case Instruction::SetEQ:
395 case Instruction::SetNE:
396 case Instruction::SetLT:
397 case Instruction::SetLE:
398 case Instruction::SetGT:
399 case Instruction::SetGE:
400 case Instruction::Shl:
401 case Instruction::Shr:
403 printConstant(CE->getOperand(0));
404 switch (CE->getOpcode()) {
405 case Instruction::Add: Out << " + "; break;
406 case Instruction::Sub: Out << " - "; break;
407 case Instruction::Mul: Out << " * "; break;
408 case Instruction::Div: Out << " / "; break;
409 case Instruction::Rem: Out << " % "; break;
410 case Instruction::SetEQ: Out << " == "; break;
411 case Instruction::SetNE: Out << " != "; break;
412 case Instruction::SetLT: Out << " < "; break;
413 case Instruction::SetLE: Out << " <= "; break;
414 case Instruction::SetGT: Out << " > "; break;
415 case Instruction::SetGE: Out << " >= "; break;
416 case Instruction::Shl: Out << " << "; break;
417 case Instruction::Shr: Out << " >> "; break;
418 default: assert(0 && "Illegal opcode here!");
420 printConstant(CE->getOperand(1));
425 std::cerr << "CWriter Error: Unhandled constant expression: "
431 switch (CPV->getType()->getPrimitiveID()) {
433 Out << (CPV == ConstantBool::False ? "0" : "1"); break;
434 case Type::SByteTyID:
435 case Type::ShortTyID:
436 Out << cast<ConstantSInt>(CPV)->getValue(); break;
438 if ((int)cast<ConstantSInt>(CPV)->getValue() == (int)0x80000000)
439 Out << "((int)0x80000000)"; // Handle MININT specially to avoid warning
441 Out << cast<ConstantSInt>(CPV)->getValue();
445 Out << cast<ConstantSInt>(CPV)->getValue() << "ll"; break;
447 case Type::UByteTyID:
448 case Type::UShortTyID:
449 Out << cast<ConstantUInt>(CPV)->getValue(); break;
451 Out << cast<ConstantUInt>(CPV)->getValue() << "u"; break;
452 case Type::ULongTyID:
453 Out << cast<ConstantUInt>(CPV)->getValue() << "ull"; break;
455 case Type::FloatTyID:
456 case Type::DoubleTyID: {
457 ConstantFP *FPC = cast<ConstantFP>(CPV);
458 std::map<const ConstantFP*, unsigned>::iterator I = FPConstantMap.find(FPC);
459 if (I != FPConstantMap.end()) {
460 // Because of FP precision problems we must load from a stack allocated
461 // value that holds the value in hex.
462 Out << "(*(" << (FPC->getType() == Type::FloatTy ? "float" : "double")
463 << "*)&FPConstant" << I->second << ")";
466 // Print out the constant as a floating point number.
468 sprintf(Buffer, "%a", FPC->getValue());
469 Out << Buffer << " /*" << FPC->getValue() << "*/ ";
471 Out << ftostr(FPC->getValue());
477 case Type::ArrayTyID:
478 printConstantArray(cast<ConstantArray>(CPV));
481 case Type::StructTyID: {
483 if (CPV->getNumOperands()) {
485 printConstant(cast<Constant>(CPV->getOperand(0)));
486 for (unsigned i = 1, e = CPV->getNumOperands(); i != e; ++i) {
488 printConstant(cast<Constant>(CPV->getOperand(i)));
495 case Type::PointerTyID:
496 if (isa<ConstantPointerNull>(CPV)) {
498 printType(Out, CPV->getType());
499 Out << ")/*NULL*/0)";
501 } else if (ConstantPointerRef *CPR = dyn_cast<ConstantPointerRef>(CPV)) {
502 writeOperand(CPR->getValue());
507 std::cerr << "Unknown constant type: " << CPV << "\n";
512 void CWriter::writeOperandInternal(Value *Operand) {
513 if (Instruction *I = dyn_cast<Instruction>(Operand))
514 if (isInlinableInst(*I) && !isDirectAlloca(I)) {
515 // Should we inline this instruction to build a tree?
522 if (Constant *CPV = dyn_cast<Constant>(Operand)) {
525 Out << Mang->getValueName(Operand);
529 void CWriter::writeOperand(Value *Operand) {
530 if (isa<GlobalVariable>(Operand) || isDirectAlloca(Operand))
531 Out << "(&"; // Global variables are references as their addresses by llvm
533 writeOperandInternal(Operand);
535 if (isa<GlobalVariable>(Operand) || isDirectAlloca(Operand))
539 // nameAllUsedStructureTypes - If there are structure types in the module that
540 // are used but do not have names assigned to them in the symbol table yet then
541 // we assign them names now.
543 bool CWriter::nameAllUsedStructureTypes(Module &M) {
544 // Get a set of types that are used by the program...
545 std::set<const Type *> UT = FUT->getTypes();
547 // Loop over the module symbol table, removing types from UT that are already
550 SymbolTable &MST = M.getSymbolTable();
551 if (MST.find(Type::TypeTy) != MST.end())
552 for (SymbolTable::type_iterator I = MST.type_begin(Type::TypeTy),
553 E = MST.type_end(Type::TypeTy); I != E; ++I)
554 UT.erase(cast<Type>(I->second));
556 // UT now contains types that are not named. Loop over it, naming structure
559 bool Changed = false;
560 for (std::set<const Type *>::const_iterator I = UT.begin(), E = UT.end();
562 if (const StructType *ST = dyn_cast<StructType>(*I)) {
563 ((Value*)ST)->setName("unnamed", &MST);
569 // generateCompilerSpecificCode - This is where we add conditional compilation
570 // directives to cater to specific compilers as need be.
572 static void generateCompilerSpecificCode(std::ostream& Out) {
573 // Alloca is hard to get, and we don't want to include stdlib.h here...
574 Out << "/* get a declaration for alloca */\n"
576 << "extern void *__builtin_alloca(unsigned long);\n"
577 << "#define alloca(x) __builtin_alloca(x)\n"
579 << "#ifndef __FreeBSD__\n"
580 << "#include <alloca.h>\n"
584 // We output GCC specific attributes to preserve 'linkonce'ness on globals.
585 // If we aren't being compiled with GCC, just drop these attributes.
586 Out << "#ifndef __GNUC__ /* Can only support \"linkonce\" vars with GCC */\n"
587 << "#define __attribute__(X)\n"
591 // At some point, we should support "external weak" vs. "weak" linkages.
592 // On Mac OS X, "external weak" is spelled "__attribute__((weak_import))".
593 Out << "#if defined(__GNUC__) && defined(__APPLE_CC__)\n"
594 << "#define __EXTERNAL_WEAK__ __attribute__((weak_import))\n"
595 << "#elif defined(__GNUC__)\n"
596 << "#define __EXTERNAL_WEAK__ __attribute__((weak))\n"
598 << "#define __EXTERNAL_WEAK__\n"
602 // For now, turn off the weak linkage attribute on Mac OS X. (See above.)
603 Out << "#if defined(__GNUC__) && defined(__APPLE_CC__)\n"
604 << "#define __ATTRIBUTE_WEAK__\n"
605 << "#elif defined(__GNUC__)\n"
606 << "#define __ATTRIBUTE_WEAK__ __attribute__((weak))\n"
608 << "#define __ATTRIBUTE_WEAK__\n"
612 bool CWriter::doInitialization(Module &M) {
615 FUT = &getAnalysis<FindUsedTypes>();
617 // Ensure that all structure types have names...
618 bool Changed = nameAllUsedStructureTypes(M);
619 Mang = new Mangler(M);
621 // get declaration for alloca
622 Out << "/* Provide Declarations */\n";
623 Out << "#include <stdarg.h>\n"; // Varargs support
624 Out << "#include <setjmp.h>\n"; // Unwind support
625 generateCompilerSpecificCode(Out);
627 // Provide a definition for `bool' if not compiling with a C++ compiler.
629 << "#ifndef __cplusplus\ntypedef unsigned char bool;\n#endif\n"
631 << "\n\n/* Support for floating point constants */\n"
632 << "typedef unsigned long long ConstantDoubleTy;\n"
633 << "typedef unsigned int ConstantFloatTy;\n"
635 << "\n\n/* Global Declarations */\n";
637 // First output all the declarations for the program, because C requires
638 // Functions & globals to be declared before they are used.
641 // Loop over the symbol table, emitting all named constants...
642 printSymbolTable(M.getSymbolTable());
644 // Global variable declarations...
646 Out << "\n/* External Global Variable Declarations */\n";
647 for (Module::giterator I = M.gbegin(), E = M.gend(); I != E; ++I) {
648 if (I->hasExternalLinkage()) {
650 printType(Out, I->getType()->getElementType(), Mang->getValueName(I));
656 // Function declarations
658 Out << "\n/* Function Declarations */\n";
659 for (Module::iterator I = M.begin(), E = M.end(); I != E; ++I) {
660 // Don't print declarations for intrinsic functions.
661 if (!I->getIntrinsicID() &&
662 I->getName() != "setjmp" && I->getName() != "longjmp") {
663 printFunctionSignature(I, true);
664 if (I->hasWeakLinkage()) Out << " __ATTRIBUTE_WEAK__";
670 // Output the global variable declarations
672 Out << "\n\n/* Global Variable Declarations */\n";
673 for (Module::giterator I = M.gbegin(), E = M.gend(); I != E; ++I)
674 if (!I->isExternal()) {
676 printType(Out, I->getType()->getElementType(), Mang->getValueName(I));
678 if (I->hasLinkOnceLinkage())
679 Out << " __attribute__((common))";
680 else if (I->hasWeakLinkage())
681 Out << " __ATTRIBUTE_WEAK__";
686 // Output the global variable definitions and contents...
688 Out << "\n\n/* Global Variable Definitions and Initialization */\n";
689 for (Module::giterator I = M.gbegin(), E = M.gend(); I != E; ++I)
690 if (!I->isExternal()) {
691 if (I->hasInternalLinkage())
693 printType(Out, I->getType()->getElementType(), Mang->getValueName(I));
694 if (I->hasLinkOnceLinkage())
695 Out << " __attribute__((common))";
696 else if (I->hasWeakLinkage())
697 Out << " __ATTRIBUTE_WEAK__";
699 // If the initializer is not null, emit the initializer. If it is null,
700 // we try to avoid emitting large amounts of zeros. The problem with
701 // this, however, occurs when the variable has weak linkage. In this
702 // case, the assembler will complain about the variable being both weak
703 // and common, so we disable this optimization.
704 if (!I->getInitializer()->isNullValue() ||
705 I->hasWeakLinkage()) {
707 writeOperand(I->getInitializer());
713 // Output all floating point constants that cannot be printed accurately...
714 printFloatingPointConstants(M);
717 Out << "\n\n/* Function Bodies */\n";
722 /// Output all floating point constants that cannot be printed accurately...
723 void CWriter::printFloatingPointConstants(Module &M) {
726 unsigned long long U;
734 // Scan the module for floating point constants. If any FP constant is used
735 // in the function, we want to redirect it here so that we do not depend on
736 // the precision of the printed form, unless the printed form preserves
739 unsigned FPCounter = 0;
740 for (Module::iterator F = M.begin(), E = M.end(); F != E; ++F)
741 for (constant_iterator I = constant_begin(F), E = constant_end(F);
743 if (const ConstantFP *FPC = dyn_cast<ConstantFP>(*I))
744 if (!isFPCSafeToPrint(FPC) && // Do not put in FPConstantMap if safe.
745 !FPConstantMap.count(FPC)) {
746 double Val = FPC->getValue();
748 FPConstantMap[FPC] = FPCounter; // Number the FP constants
750 if (FPC->getType() == Type::DoubleTy) {
752 Out << "const ConstantDoubleTy FPConstant" << FPCounter++
753 << " = 0x" << std::hex << DBLUnion.U << std::dec
754 << "ULL; /* " << Val << " */\n";
755 } else if (FPC->getType() == Type::FloatTy) {
757 Out << "const ConstantFloatTy FPConstant" << FPCounter++
758 << " = 0x" << std::hex << FLTUnion.U << std::dec
759 << "U; /* " << Val << " */\n";
761 assert(0 && "Unknown float type!");
768 /// printSymbolTable - Run through symbol table looking for type names. If a
769 /// type name is found, emit it's declaration...
771 void CWriter::printSymbolTable(const SymbolTable &ST) {
772 // If there are no type names, exit early.
773 if (ST.find(Type::TypeTy) == ST.end())
776 // We are only interested in the type plane of the symbol table...
777 SymbolTable::type_const_iterator I = ST.type_begin(Type::TypeTy);
778 SymbolTable::type_const_iterator End = ST.type_end(Type::TypeTy);
780 // Print out forward declarations for structure types before anything else!
781 Out << "/* Structure forward decls */\n";
782 for (; I != End; ++I)
783 if (const Type *STy = dyn_cast<StructType>(I->second))
784 // Only print out used types!
785 if (FUT->getTypes().count(STy)) {
786 std::string Name = "struct l_" + Mangler::makeNameProper(I->first);
787 Out << Name << ";\n";
788 TypeNames.insert(std::make_pair(STy, Name));
793 // Now we can print out typedefs...
794 Out << "/* Typedefs */\n";
795 for (I = ST.type_begin(Type::TypeTy); I != End; ++I)
796 // Only print out used types!
797 if (FUT->getTypes().count(cast<Type>(I->second))) {
798 const Type *Ty = cast<Type>(I->second);
799 std::string Name = "l_" + Mangler::makeNameProper(I->first);
801 printType(Out, Ty, Name);
807 // Keep track of which structures have been printed so far...
808 std::set<const StructType *> StructPrinted;
810 // Loop over all structures then push them into the stack so they are
811 // printed in the correct order.
813 Out << "/* Structure contents */\n";
814 for (I = ST.type_begin(Type::TypeTy); I != End; ++I)
815 if (const StructType *STy = dyn_cast<StructType>(I->second))
816 // Only print out used types!
817 if (FUT->getTypes().count(STy))
818 printContainedStructs(STy, StructPrinted);
821 // Push the struct onto the stack and recursively push all structs
822 // this one depends on.
823 void CWriter::printContainedStructs(const Type *Ty,
824 std::set<const StructType*> &StructPrinted){
825 if (const StructType *STy = dyn_cast<StructType>(Ty)) {
826 //Check to see if we have already printed this struct
827 if (StructPrinted.count(STy) == 0) {
828 // Print all contained types first...
829 for (StructType::element_iterator I = STy->element_begin(),
830 E = STy->element_end(); I != E; ++I) {
831 const Type *Ty1 = I->get();
832 if (isa<StructType>(Ty1) || isa<ArrayType>(Ty1))
833 printContainedStructs(*I, StructPrinted);
836 //Print structure type out..
837 StructPrinted.insert(STy);
838 std::string Name = TypeNames[STy];
839 printType(Out, STy, Name, true);
843 // If it is an array, check contained types and continue
844 } else if (const ArrayType *ATy = dyn_cast<ArrayType>(Ty)){
845 const Type *Ty1 = ATy->getElementType();
846 if (isa<StructType>(Ty1) || isa<ArrayType>(Ty1))
847 printContainedStructs(Ty1, StructPrinted);
852 void CWriter::printFunctionSignature(const Function *F, bool Prototype) {
853 if (F->hasInternalLinkage()) Out << "static ";
854 if (F->hasLinkOnceLinkage()) Out << "inline ";
856 // Loop over the arguments, printing them...
857 const FunctionType *FT = cast<FunctionType>(F->getFunctionType());
859 std::stringstream FunctionInnards;
861 // Print out the name...
862 FunctionInnards << Mang->getValueName(F) << "(";
864 if (!F->isExternal()) {
867 if (F->abegin()->hasName() || !Prototype)
868 ArgName = Mang->getValueName(F->abegin());
869 printType(FunctionInnards, F->afront().getType(), ArgName);
870 for (Function::const_aiterator I = ++F->abegin(), E = F->aend();
872 FunctionInnards << ", ";
873 if (I->hasName() || !Prototype)
874 ArgName = Mang->getValueName(I);
877 printType(FunctionInnards, I->getType(), ArgName);
881 // Loop over the arguments, printing them...
882 for (FunctionType::param_iterator I = FT->param_begin(),
883 E = FT->param_end(); I != E; ++I) {
884 if (I != FT->param_begin()) FunctionInnards << ", ";
885 printType(FunctionInnards, *I);
889 // Finish printing arguments... if this is a vararg function, print the ...,
890 // unless there are no known types, in which case, we just emit ().
892 if (FT->isVarArg() && FT->getNumParams()) {
893 if (FT->getNumParams()) FunctionInnards << ", ";
894 FunctionInnards << "..."; // Output varargs portion of signature!
895 } else if (!FT->isVarArg() && FT->getNumParams() == 0) {
896 FunctionInnards << "void"; // ret() -> ret(void) in C.
898 FunctionInnards << ")";
899 // Print out the return type and the entire signature for that matter
900 printType(Out, F->getReturnType(), FunctionInnards.str());
903 void CWriter::printFunction(Function &F) {
904 printFunctionSignature(&F, false);
907 // print local variable information for the function
908 for (inst_iterator I = inst_begin(&F), E = inst_end(&F); I != E; ++I)
909 if (const AllocaInst *AI = isDirectAlloca(*I)) {
911 printType(Out, AI->getAllocatedType(), Mang->getValueName(AI));
912 Out << "; /* Address exposed local */\n";
913 } else if ((*I)->getType() != Type::VoidTy && !isInlinableInst(**I)) {
915 printType(Out, (*I)->getType(), Mang->getValueName(*I));
918 if (isa<PHINode>(*I)) { // Print out PHI node temporaries as well...
920 printType(Out, (*I)->getType(),
921 Mang->getValueName(*I)+"__PHI_TEMPORARY");
928 // print the basic blocks
929 for (Function::iterator BB = F.begin(), E = F.end(); BB != E; ++BB) {
930 BasicBlock *Prev = BB->getPrev();
932 // Don't print the label for the basic block if there are no uses, or if the
933 // only terminator use is the predecessor basic block's terminator. We have
934 // to scan the use list because PHI nodes use basic blocks too but do not
935 // require a label to be generated.
937 bool NeedsLabel = false;
938 for (Value::use_iterator UI = BB->use_begin(), UE = BB->use_end();
940 if (TerminatorInst *TI = dyn_cast<TerminatorInst>(*UI))
941 if (TI != Prev->getTerminator() ||
942 isa<SwitchInst>(Prev->getTerminator()) ||
943 isa<InvokeInst>(Prev->getTerminator())) {
948 if (NeedsLabel) Out << Mang->getValueName(BB) << ":\n";
950 // Output all of the instructions in the basic block...
951 for (BasicBlock::iterator II = BB->begin(), E = --BB->end(); II != E; ++II){
952 if (!isInlinableInst(*II) && !isDirectAlloca(II)) {
953 if (II->getType() != Type::VoidTy)
962 // Don't emit prefix or suffix for the terminator...
963 visit(*BB->getTerminator());
969 // Specific Instruction type classes... note that all of the casts are
970 // necessary because we use the instruction classes as opaque types...
972 void CWriter::visitReturnInst(ReturnInst &I) {
973 // Don't output a void return if this is the last basic block in the function
974 if (I.getNumOperands() == 0 &&
975 &*--I.getParent()->getParent()->end() == I.getParent() &&
976 !I.getParent()->size() == 1) {
981 if (I.getNumOperands()) {
983 writeOperand(I.getOperand(0));
988 void CWriter::visitSwitchInst(SwitchInst &SI) {
990 writeOperand(SI.getOperand(0));
991 Out << ") {\n default:\n";
992 printBranchToBlock(SI.getParent(), SI.getDefaultDest(), 2);
994 for (unsigned i = 2, e = SI.getNumOperands(); i != e; i += 2) {
996 writeOperand(SI.getOperand(i));
998 BasicBlock *Succ = cast<BasicBlock>(SI.getOperand(i+1));
999 printBranchToBlock(SI.getParent(), Succ, 2);
1000 if (Succ == SI.getParent()->getNext())
1006 void CWriter::visitInvokeInst(InvokeInst &II) {
1007 assert(0 && "Lowerinvoke pass didn't work!");
1011 void CWriter::visitUnwindInst(UnwindInst &I) {
1012 assert(0 && "Lowerinvoke pass didn't work!");
1015 bool isGotoCodeNecessary(BasicBlock *From, BasicBlock *To) {
1016 // If PHI nodes need copies, we need the copy code...
1017 if (isa<PHINode>(To->front()) ||
1018 From->getNext() != To) // Not directly successor, need goto
1021 // Otherwise we don't need the code.
1025 void CWriter::printBranchToBlock(BasicBlock *CurBB, BasicBlock *Succ,
1027 for (BasicBlock::iterator I = Succ->begin();
1028 PHINode *PN = dyn_cast<PHINode>(I); ++I) {
1029 // now we have to do the printing
1030 Out << std::string(Indent, ' ');
1031 Out << " " << Mang->getValueName(I) << "__PHI_TEMPORARY = ";
1032 writeOperand(PN->getIncomingValue(PN->getBasicBlockIndex(CurBB)));
1033 Out << "; /* for PHI node */\n";
1036 if (CurBB->getNext() != Succ ||
1037 isa<InvokeInst>(CurBB->getTerminator()) ||
1038 isa<SwitchInst>(CurBB->getTerminator())) {
1039 Out << std::string(Indent, ' ') << " goto ";
1045 // Branch instruction printing - Avoid printing out a branch to a basic block
1046 // that immediately succeeds the current one.
1048 void CWriter::visitBranchInst(BranchInst &I) {
1049 if (I.isConditional()) {
1050 if (isGotoCodeNecessary(I.getParent(), I.getSuccessor(0))) {
1052 writeOperand(I.getCondition());
1055 printBranchToBlock(I.getParent(), I.getSuccessor(0), 2);
1057 if (isGotoCodeNecessary(I.getParent(), I.getSuccessor(1))) {
1058 Out << " } else {\n";
1059 printBranchToBlock(I.getParent(), I.getSuccessor(1), 2);
1062 // First goto not necessary, assume second one is...
1064 writeOperand(I.getCondition());
1067 printBranchToBlock(I.getParent(), I.getSuccessor(1), 2);
1072 printBranchToBlock(I.getParent(), I.getSuccessor(0), 0);
1077 // PHI nodes get copied into temporary values at the end of predecessor basic
1078 // blocks. We now need to copy these temporary values into the REAL value for
1080 void CWriter::visitPHINode(PHINode &I) {
1082 Out << "__PHI_TEMPORARY";
1086 void CWriter::visitBinaryOperator(Instruction &I) {
1087 // binary instructions, shift instructions, setCond instructions.
1088 assert(!isa<PointerType>(I.getType()));
1090 // We must cast the results of binary operations which might be promoted.
1091 bool needsCast = false;
1092 if ((I.getType() == Type::UByteTy) || (I.getType() == Type::SByteTy)
1093 || (I.getType() == Type::UShortTy) || (I.getType() == Type::ShortTy)
1094 || (I.getType() == Type::FloatTy)) {
1097 printType(Out, I.getType());
1101 writeOperand(I.getOperand(0));
1103 switch (I.getOpcode()) {
1104 case Instruction::Add: Out << " + "; break;
1105 case Instruction::Sub: Out << " - "; break;
1106 case Instruction::Mul: Out << "*"; break;
1107 case Instruction::Div: Out << "/"; break;
1108 case Instruction::Rem: Out << "%"; break;
1109 case Instruction::And: Out << " & "; break;
1110 case Instruction::Or: Out << " | "; break;
1111 case Instruction::Xor: Out << " ^ "; break;
1112 case Instruction::SetEQ: Out << " == "; break;
1113 case Instruction::SetNE: Out << " != "; break;
1114 case Instruction::SetLE: Out << " <= "; break;
1115 case Instruction::SetGE: Out << " >= "; break;
1116 case Instruction::SetLT: Out << " < "; break;
1117 case Instruction::SetGT: Out << " > "; break;
1118 case Instruction::Shl : Out << " << "; break;
1119 case Instruction::Shr : Out << " >> "; break;
1120 default: std::cerr << "Invalid operator type!" << I; abort();
1123 writeOperand(I.getOperand(1));
1130 void CWriter::visitCastInst(CastInst &I) {
1131 if (I.getType() == Type::BoolTy) {
1133 writeOperand(I.getOperand(0));
1138 printType(Out, I.getType());
1140 if (isa<PointerType>(I.getType())&&I.getOperand(0)->getType()->isIntegral() ||
1141 isa<PointerType>(I.getOperand(0)->getType())&&I.getType()->isIntegral()) {
1142 // Avoid "cast to pointer from integer of different size" warnings
1146 writeOperand(I.getOperand(0));
1149 void CWriter::lowerIntrinsics(Module &M) {
1150 for (Module::iterator F = M.begin(), E = M.end(); F != E; ++F)
1151 for (Function::iterator BB = F->begin(), E = F->end(); BB != E; ++BB)
1152 for (BasicBlock::iterator I = BB->begin(), E = BB->end(); I != E; )
1153 if (CallInst *CI = dyn_cast<CallInst>(I++))
1154 if (Function *F = CI->getCalledFunction())
1155 switch (F->getIntrinsicID()) {
1156 case Intrinsic::not_intrinsic:
1157 case Intrinsic::va_start:
1158 case Intrinsic::va_copy:
1159 case Intrinsic::va_end:
1160 case Intrinsic::returnaddress:
1161 case Intrinsic::frameaddress:
1162 // We directly implement these intrinsics
1165 // All other intrinsic calls we must lower.
1166 Instruction *Before = CI->getPrev();
1167 IL.LowerIntrinsicCall(CI);
1168 if (Before) { // Move iterator to instruction after call
1178 void CWriter::visitCallInst(CallInst &I) {
1179 // Handle intrinsic function calls first...
1180 if (Function *F = I.getCalledFunction())
1181 if (Intrinsic::ID ID = (Intrinsic::ID)F->getIntrinsicID()) {
1183 default: assert(0 && "Unknown LLVM intrinsic!");
1184 case Intrinsic::va_start:
1187 Out << "va_start(*(va_list*)&" << Mang->getValueName(&I) << ", ";
1188 // Output the last argument to the enclosing function...
1189 if (I.getParent()->getParent()->aempty()) {
1190 std::cerr << "The C backend does not currently support zero "
1191 << "argument varargs functions, such as '"
1192 << I.getParent()->getParent()->getName() << "'!\n";
1195 writeOperand(&I.getParent()->getParent()->aback());
1198 case Intrinsic::va_end:
1199 Out << "va_end(*(va_list*)&";
1200 writeOperand(I.getOperand(1));
1203 case Intrinsic::va_copy:
1205 Out << "va_copy(*(va_list*)&" << Mang->getValueName(&I) << ", ";
1206 Out << "*(va_list*)&";
1207 writeOperand(I.getOperand(1));
1210 case Intrinsic::returnaddress:
1211 Out << "__builtin_return_address(";
1212 writeOperand(I.getOperand(1));
1215 case Intrinsic::frameaddress:
1216 Out << "__builtin_frame_address(";
1217 writeOperand(I.getOperand(1));
1225 void CWriter::visitCallSite(CallSite CS) {
1226 const PointerType *PTy = cast<PointerType>(CS.getCalledValue()->getType());
1227 const FunctionType *FTy = cast<FunctionType>(PTy->getElementType());
1228 const Type *RetTy = FTy->getReturnType();
1230 writeOperand(CS.getCalledValue());
1233 if (CS.arg_begin() != CS.arg_end()) {
1234 CallSite::arg_iterator AI = CS.arg_begin(), AE = CS.arg_end();
1237 for (++AI; AI != AE; ++AI) {
1245 void CWriter::visitMallocInst(MallocInst &I) {
1246 assert(0 && "lowerallocations pass didn't work!");
1249 void CWriter::visitAllocaInst(AllocaInst &I) {
1251 printType(Out, I.getType());
1252 Out << ") alloca(sizeof(";
1253 printType(Out, I.getType()->getElementType());
1255 if (I.isArrayAllocation()) {
1257 writeOperand(I.getOperand(0));
1262 void CWriter::visitFreeInst(FreeInst &I) {
1263 assert(0 && "lowerallocations pass didn't work!");
1266 void CWriter::printIndexingExpression(Value *Ptr, gep_type_iterator I,
1267 gep_type_iterator E) {
1268 bool HasImplicitAddress = false;
1269 // If accessing a global value with no indexing, avoid *(&GV) syndrome
1270 if (GlobalValue *V = dyn_cast<GlobalValue>(Ptr)) {
1271 HasImplicitAddress = true;
1272 } else if (ConstantPointerRef *CPR = dyn_cast<ConstantPointerRef>(Ptr)) {
1273 HasImplicitAddress = true;
1274 Ptr = CPR->getValue(); // Get to the global...
1275 } else if (isDirectAlloca(Ptr)) {
1276 HasImplicitAddress = true;
1280 if (!HasImplicitAddress)
1281 Out << "*"; // Implicit zero first argument: '*x' is equivalent to 'x[0]'
1283 writeOperandInternal(Ptr);
1287 const Constant *CI = dyn_cast<Constant>(I.getOperand());
1288 if (HasImplicitAddress && (!CI || !CI->isNullValue()))
1291 writeOperandInternal(Ptr);
1293 if (HasImplicitAddress && (!CI || !CI->isNullValue())) {
1295 HasImplicitAddress = false; // HIA is only true if we haven't addressed yet
1298 assert(!HasImplicitAddress || (CI && CI->isNullValue()) &&
1299 "Can only have implicit address with direct accessing");
1301 if (HasImplicitAddress) {
1303 } else if (CI && CI->isNullValue()) {
1304 gep_type_iterator TmpI = I; ++TmpI;
1306 // Print out the -> operator if possible...
1307 if (TmpI != E && isa<StructType>(*TmpI)) {
1308 Out << (HasImplicitAddress ? "." : "->");
1309 Out << "field" << cast<ConstantUInt>(TmpI.getOperand())->getValue();
1315 if (isa<StructType>(*I)) {
1316 Out << ".field" << cast<ConstantUInt>(I.getOperand())->getValue();
1319 writeOperand(I.getOperand());
1324 void CWriter::visitLoadInst(LoadInst &I) {
1326 writeOperand(I.getOperand(0));
1329 void CWriter::visitStoreInst(StoreInst &I) {
1331 writeOperand(I.getPointerOperand());
1333 writeOperand(I.getOperand(0));
1336 void CWriter::visitGetElementPtrInst(GetElementPtrInst &I) {
1338 printIndexingExpression(I.getPointerOperand(), gep_type_begin(I),
1342 void CWriter::visitVANextInst(VANextInst &I) {
1343 Out << Mang->getValueName(I.getOperand(0));
1344 Out << "; va_arg(*(va_list*)&" << Mang->getValueName(&I) << ", ";
1345 printType(Out, I.getArgType());
1349 void CWriter::visitVAArgInst(VAArgInst &I) {
1351 Out << "{ va_list Tmp; va_copy(Tmp, *(va_list*)&";
1352 writeOperand(I.getOperand(0));
1353 Out << ");\n " << Mang->getValueName(&I) << " = va_arg(Tmp, ";
1354 printType(Out, I.getType());
1355 Out << ");\n va_end(Tmp); }";
1358 //===----------------------------------------------------------------------===//
1359 // External Interface declaration
1360 //===----------------------------------------------------------------------===//
1362 bool CTargetMachine::addPassesToEmitAssembly(PassManager &PM, std::ostream &o) {
1363 PM.add(createLowerAllocationsPass());
1364 PM.add(createLowerInvokePass());
1365 PM.add(new CWriter(o, getIntrinsicLowering()));
1369 TargetMachine *llvm::allocateCTargetMachine(const Module &M,
1370 IntrinsicLowering *IL) {
1371 return new CTargetMachine(M, IL);