//===-- Writer.cpp - Library for converting LLVM code to C ----------------===//
+//
+// The LLVM Compiler Infrastructure
//
-// This library converts LLVM code to C code, compilable by GCC.
+// This file was developed by the LLVM research group and is distributed under
+// the University of Illinois Open Source License. See LICENSE.TXT for details.
+//
+//===----------------------------------------------------------------------===//
+//
+// This library converts LLVM code to C code, compilable by GCC and other C
+// compilers.
//
//===----------------------------------------------------------------------===//
-#include "llvm/Assembly/CWriter.h"
+#include "CTargetMachine.h"
#include "llvm/Constants.h"
#include "llvm/DerivedTypes.h"
#include "llvm/Module.h"
#include "llvm/Instructions.h"
#include "llvm/Pass.h"
+#include "llvm/PassManager.h"
#include "llvm/SymbolTable.h"
#include "llvm/Intrinsics.h"
-#include "llvm/SlotCalculator.h"
-#include "llvm/Analysis/FindUsedTypes.h"
#include "llvm/Analysis/ConstantsScanner.h"
+#include "llvm/Analysis/FindUsedTypes.h"
+#include "llvm/Analysis/LoopInfo.h"
+#include "llvm/CodeGen/IntrinsicLowering.h"
+#include "llvm/Transforms/Scalar.h"
+#include "llvm/Target/TargetMachineRegistry.h"
+#include "llvm/Support/CallSite.h"
+#include "llvm/Support/CFG.h"
+#include "llvm/Support/GetElementPtrTypeIterator.h"
#include "llvm/Support/InstVisitor.h"
-#include "llvm/Support/InstIterator.h"
-#include "Support/StringExtras.h"
-#include "Support/STLExtras.h"
+#include "llvm/Support/Mangler.h"
+#include "llvm/ADT/StringExtras.h"
+#include "llvm/Support/MathExtras.h"
+#include "llvm/Config/config.h"
#include <algorithm>
-#include <set>
+#include <iostream>
#include <sstream>
+using namespace llvm;
namespace {
- class CWriter : public Pass, public InstVisitor<CWriter> {
+ // Register the target.
+ RegisterTarget<CTargetMachine> X("c", " C backend");
+
+ /// NameAllUsedStructs - This pass inserts names for any unnamed structure
+ /// types that are used by the program.
+ ///
+ class CBackendNameAllUsedStructs : public Pass {
+ void getAnalysisUsage(AnalysisUsage &AU) const {
+ AU.addRequired<FindUsedTypes>();
+ }
+
+ virtual const char *getPassName() const {
+ return "C backend type canonicalizer";
+ }
+
+ virtual bool run(Module &M);
+ };
+
+ /// CWriter - This class is the main chunk of code that converts an LLVM
+ /// module to a C translation unit.
+ class CWriter : public FunctionPass, public InstVisitor<CWriter> {
std::ostream &Out;
- SlotCalculator *Table;
+ IntrinsicLowering &IL;
+ Mangler *Mang;
+ LoopInfo *LI;
const Module *TheModule;
std::map<const Type *, std::string> TypeNames;
- std::set<const Value*> MangledGlobals;
- bool needsMalloc;
std::map<const ConstantFP *, unsigned> FPConstantMap;
public:
- CWriter(std::ostream &o) : Out(o) {}
+ CWriter(std::ostream &o, IntrinsicLowering &il) : Out(o), IL(il) {}
+
+ virtual const char *getPassName() const { return "C backend"; }
void getAnalysisUsage(AnalysisUsage &AU) const {
+ AU.addRequired<LoopInfo>();
AU.setPreservesAll();
- AU.addRequired<FindUsedTypes>();
}
- virtual bool run(Module &M) {
- // Initialize
- Table = new SlotCalculator(&M, false);
- TheModule = &M;
+ virtual bool doInitialization(Module &M);
- // Ensure that all structure types have names...
- bool Changed = nameAllUsedStructureTypes(M);
+ bool runOnFunction(Function &F) {
+ LI = &getAnalysis<LoopInfo>();
- // Run...
- printModule(&M);
+ // Output all floating point constants that cannot be printed accurately.
+ printFloatingPointConstants(F);
+
+ lowerIntrinsics(F);
+ printFunction(F);
+ FPConstantMap.clear();
+ return false;
+ }
+ virtual bool doFinalization(Module &M) {
// Free memory...
- delete Table;
+ delete Mang;
TypeNames.clear();
- MangledGlobals.clear();
return false;
}
std::ostream &printType(std::ostream &Out, const Type *Ty,
const std::string &VariableName = "",
- bool IgnoreName = false, bool namedContext = true);
+ bool IgnoreName = false);
void writeOperand(Value *Operand);
void writeOperandInternal(Value *Operand);
- std::string getValueName(const Value *V);
-
private :
+ void lowerIntrinsics(Function &F);
+
bool nameAllUsedStructureTypes(Module &M);
void printModule(Module *M);
- void printSymbolTable(const SymbolTable &ST);
+ void printModuleTypes(const SymbolTable &ST);
void printContainedStructs(const Type *Ty, std::set<const StructType *> &);
+ void printFloatingPointConstants(Function &F);
void printFunctionSignature(const Function *F, bool Prototype);
- void printFunction(Function *);
+ void printFunction(Function &);
+ void printBasicBlock(BasicBlock *BB);
+ void printLoop(Loop *L);
void printConstant(Constant *CPV);
void printConstantArray(ConstantArray *CPA);
// printed and an extra copy of the expr is not emitted.
//
static bool isInlinableInst(const Instruction &I) {
+ // Always inline setcc instructions, even if they are shared by multiple
+ // expressions. GCC generates horrible code if we don't.
+ if (isa<SetCondInst>(I)) return true;
+
// Must be an expression, must be used exactly once. If it is dead, we
// emit it inline where it would go.
- if (I.getType() == Type::VoidTy || I.use_size() != 1 ||
+ if (I.getType() == Type::VoidTy || !I.hasOneUse() ||
isa<TerminatorInst>(I) || isa<CallInst>(I) || isa<PHINode>(I) ||
- isa<LoadInst>(I)) // Don't inline a load across a store!
+ isa<LoadInst>(I) || isa<VAArgInst>(I) || isa<VANextInst>(I))
+ // Don't inline a load across a store or other bad things!
return false;
// Only inline instruction it it's use is in the same BB as the inst.
if (!AI) return false;
if (AI->isArrayAllocation())
return 0; // FIXME: we can also inline fixed size array allocas!
- if (AI->getParent() != &AI->getParent()->getParent()->getEntryNode())
+ if (AI->getParent() != &AI->getParent()->getParent()->getEntryBlock())
return 0;
return AI;
}
void visitReturnInst(ReturnInst &I);
void visitBranchInst(BranchInst &I);
void visitSwitchInst(SwitchInst &I);
+ void visitInvokeInst(InvokeInst &I) {
+ assert(0 && "Lowerinvoke pass didn't work!");
+ }
+
+ void visitUnwindInst(UnwindInst &I) {
+ assert(0 && "Lowerinvoke pass didn't work!");
+ }
void visitPHINode(PHINode &I);
void visitBinaryOperator(Instruction &I);
void visitCastInst (CastInst &I);
+ void visitSelectInst(SelectInst &I);
void visitCallInst (CallInst &I);
+ void visitCallSite (CallSite CS);
void visitShiftInst(ShiftInst &I) { visitBinaryOperator(I); }
void visitMallocInst(MallocInst &I);
void visitLoadInst (LoadInst &I);
void visitStoreInst (StoreInst &I);
void visitGetElementPtrInst(GetElementPtrInst &I);
- void visitVarArgInst(VarArgInst &I);
+ void visitVANextInst(VANextInst &I);
+ void visitVAArgInst (VAArgInst &I);
void visitInstruction(Instruction &I) {
std::cerr << "C Writer does not know about " << I;
}
void outputLValue(Instruction *I) {
- Out << " " << getValueName(I) << " = ";
+ Out << " " << Mang->getValueName(I) << " = ";
}
+
+ bool isGotoCodeNecessary(BasicBlock *From, BasicBlock *To);
+ void printPHICopiesForSuccessors(BasicBlock *CurBlock,
+ unsigned Indent);
void printBranchToBlock(BasicBlock *CurBlock, BasicBlock *SuccBlock,
unsigned Indent);
- void printIndexingExpression(Value *Ptr, User::op_iterator I,
- User::op_iterator E);
+ void printIndexingExpression(Value *Ptr, gep_type_iterator I,
+ gep_type_iterator E);
};
}
-// We dont want identifier names with ., space, - in them.
-// So we replace them with _
-static std::string makeNameProper(std::string x) {
- std::string tmp;
- for (std::string::iterator sI = x.begin(), sEnd = x.end(); sI != sEnd; sI++)
- switch (*sI) {
- case '.': tmp += "d_"; break;
- case ' ': tmp += "s_"; break;
- case '-': tmp += "D_"; break;
- default: tmp += *sI;
- }
-
- return tmp;
-}
-
-std::string CWriter::getValueName(const Value *V) {
- if (V->hasName()) { // Print out the label if it exists...
-
- // Name mangling occurs as follows:
- // - If V is not a global, mangling always occurs.
- // - Otherwise, mangling occurs when any of the following are true:
- // 1) V has internal linkage
- // 2) V's name would collide if it is not mangled.
- //
-
- if(const GlobalValue* gv = dyn_cast<GlobalValue>(V)) {
- if(!gv->hasInternalLinkage() && !MangledGlobals.count(gv)) {
- // No internal linkage, name will not collide -> no mangling.
- return makeNameProper(gv->getName());
- }
+/// This method inserts names for any unnamed structure types that are used by
+/// the program, and removes names from structure types that are not used by the
+/// program.
+///
+bool CBackendNameAllUsedStructs::run(Module &M) {
+ // Get a set of types that are used by the program...
+ std::set<const Type *> UT = getAnalysis<FindUsedTypes>().getTypes();
+
+ // Loop over the module symbol table, removing types from UT that are
+ // already named, and removing names for structure types that are not used.
+ //
+ SymbolTable &MST = M.getSymbolTable();
+ for (SymbolTable::type_iterator TI = MST.type_begin(), TE = MST.type_end();
+ TI != TE; ) {
+ SymbolTable::type_iterator I = TI++;
+ if (const StructType *STy = dyn_cast<StructType>(I->second)) {
+ // If this is not used, remove it from the symbol table.
+ std::set<const Type *>::iterator UTI = UT.find(STy);
+ if (UTI == UT.end())
+ MST.remove(I);
+ else
+ UT.erase(UTI);
}
-
- // Non-global, or global with internal linkage / colliding name -> mangle.
- return "l" + utostr(V->getType()->getUniqueID()) + "_" +
- makeNameProper(V->getName());
}
- int Slot = Table->getValSlot(V);
- assert(Slot >= 0 && "Invalid value!");
- return "ltmp_" + itostr(Slot) + "_" + utostr(V->getType()->getUniqueID());
+ // UT now contains types that are not named. Loop over it, naming
+ // structure types.
+ //
+ bool Changed = false;
+ unsigned RenameCounter = 0;
+ for (std::set<const Type *>::const_iterator I = UT.begin(), E = UT.end();
+ I != E; ++I)
+ if (const StructType *ST = dyn_cast<StructType>(*I)) {
+ while (M.addTypeName("unnamed"+utostr(RenameCounter), ST))
+ ++RenameCounter;
+ Changed = true;
+ }
+ return Changed;
}
-// A pointer type should not use parens around *'s alone, e.g., (**)
-inline bool ptrTypeNameNeedsParens(const std::string &NameSoFar) {
- return (NameSoFar.find_last_not_of('*') != std::string::npos);
-}
// Pass the Type* and the variable name and this prints out the variable
// declaration.
//
std::ostream &CWriter::printType(std::ostream &Out, const Type *Ty,
const std::string &NameSoFar,
- bool IgnoreName, bool namedContext) {
+ bool IgnoreName) {
if (Ty->isPrimitiveType())
- switch (Ty->getPrimitiveID()) {
+ switch (Ty->getTypeID()) {
case Type::VoidTyID: return Out << "void " << NameSoFar;
case Type::BoolTyID: return Out << "bool " << NameSoFar;
case Type::UByteTyID: return Out << "unsigned char " << NameSoFar;
case Type::FloatTyID: return Out << "float " << NameSoFar;
case Type::DoubleTyID: return Out << "double " << NameSoFar;
default :
- std::cerr << "Unknown primitive type: " << Ty << "\n";
+ std::cerr << "Unknown primitive type: " << *Ty << "\n";
abort();
}
// Check to see if the type is named.
if (!IgnoreName || isa<OpaqueType>(Ty)) {
std::map<const Type *, std::string>::iterator I = TypeNames.find(Ty);
- if (I != TypeNames.end()) {
- return Out << I->second << " " << NameSoFar;
- }
+ if (I != TypeNames.end()) return Out << I->second << " " << NameSoFar;
}
- switch (Ty->getPrimitiveID()) {
+ switch (Ty->getTypeID()) {
case Type::FunctionTyID: {
const FunctionType *MTy = cast<FunctionType>(Ty);
std::stringstream FunctionInnards;
FunctionInnards << " (" << NameSoFar << ") (";
- for (FunctionType::ParamTypes::const_iterator
- I = MTy->getParamTypes().begin(),
- E = MTy->getParamTypes().end(); I != E; ++I) {
- if (I != MTy->getParamTypes().begin())
+ for (FunctionType::param_iterator I = MTy->param_begin(),
+ E = MTy->param_end(); I != E; ++I) {
+ if (I != MTy->param_begin())
FunctionInnards << ", ";
printType(FunctionInnards, *I, "");
}
if (MTy->isVarArg()) {
- if (!MTy->getParamTypes().empty())
- FunctionInnards << ", ...";
- } else if (MTy->getParamTypes().empty()) {
+ if (MTy->getNumParams())
+ FunctionInnards << ", ...";
+ } else if (!MTy->getNumParams()) {
FunctionInnards << "void";
}
FunctionInnards << ")";
const StructType *STy = cast<StructType>(Ty);
Out << NameSoFar + " {\n";
unsigned Idx = 0;
- for (StructType::ElementTypes::const_iterator
- I = STy->getElementTypes().begin(),
- E = STy->getElementTypes().end(); I != E; ++I) {
+ for (StructType::element_iterator I = STy->element_begin(),
+ E = STy->element_end(); I != E; ++I) {
Out << " ";
printType(Out, *I, "field" + utostr(Idx++));
Out << ";\n";
const PointerType *PTy = cast<PointerType>(Ty);
std::string ptrName = "*" + NameSoFar;
- // Do not need parens around "* NameSoFar" if NameSoFar consists only
- // of zero or more '*' chars *and* this is not an unnamed pointer type
- // such as the result type in a cast statement. Otherwise, enclose in ( ).
- if (ptrTypeNameNeedsParens(NameSoFar) || !namedContext ||
- PTy->getElementType()->getPrimitiveID() == Type::ArrayTyID)
- ptrName = "(" + ptrName + ")"; //
+ if (isa<ArrayType>(PTy->getElementType()))
+ ptrName = "(" + ptrName + ")";
return printType(Out, PTy->getElementType(), ptrName);
- }Out <<"--";
+ }
case Type::ArrayTyID: {
const ArrayType *ATy = cast<ArrayType>(Ty);
// Do not include the last character, which we know is null
for (unsigned i = 0, e = CPA->getNumOperands()-1; i != e; ++i) {
- unsigned char C = (ETy == Type::SByteTy) ?
- (unsigned char)cast<ConstantSInt>(CPA->getOperand(i))->getValue() :
- (unsigned char)cast<ConstantUInt>(CPA->getOperand(i))->getValue();
+ unsigned char C = cast<ConstantInt>(CPA->getOperand(i))->getRawValue();
// Print it out literally if it is a printable character. The only thing
// to be careful about is when the last letter output was a hex escape
}
}
-/// FPCSafeToPrint - Returns true if we may assume that CFP may be
-/// written out textually as a double (rather than as a reference to a
-/// stack-allocated variable). We decide this by converting CFP to a
-/// string and back into a double, and then checking whether the
-/// conversion results in a bit-equal double to the original value of
-/// CFP. This depends on us and the target C compiler agreeing on the
-/// conversion process (which is pretty likely since we only deal in
-/// IEEE FP.) This is adapted from similar code in
-/// lib/VMCore/AsmWriter.cpp:WriteConstantInt().
-static bool FPCSafeToPrint (const ConstantFP *CFP) {
+// isFPCSafeToPrint - Returns true if we may assume that CFP may be written out
+// textually as a double (rather than as a reference to a stack-allocated
+// variable). We decide this by converting CFP to a string and back into a
+// double, and then checking whether the conversion results in a bit-equal
+// double to the original value of CFP. This depends on us and the target C
+// compiler agreeing on the conversion process (which is pretty likely since we
+// only deal in IEEE FP).
+//
+static bool isFPCSafeToPrint(const ConstantFP *CFP) {
+#if HAVE_PRINTF_A
+ char Buffer[100];
+ sprintf(Buffer, "%a", CFP->getValue());
+
+ if (!strncmp(Buffer, "0x", 2) ||
+ !strncmp(Buffer, "-0x", 3) ||
+ !strncmp(Buffer, "+0x", 3))
+ return atof(Buffer) == CFP->getValue();
+ return false;
+#else
std::string StrVal = ftostr(CFP->getValue());
- // Check to make sure that the stringized number is not some string like
- // "Inf" or NaN, that atof will accept, but the lexer will not. Check that
- // the string matches the "[-+]?[0-9]" regex.
+
+ while (StrVal[0] == ' ')
+ StrVal.erase(StrVal.begin());
+
+ // Check to make sure that the stringized number is not some string like "Inf"
+ // or NaN. Check that the string matches the "[-+]?[0-9]" regex.
if ((StrVal[0] >= '0' && StrVal[0] <= '9') ||
((StrVal[0] == '-' || StrVal[0] == '+') &&
(StrVal[1] >= '0' && StrVal[1] <= '9')))
// Reparse stringized version!
- return (atof(StrVal.c_str()) == CFP->getValue());
+ return atof(StrVal.c_str()) == CFP->getValue();
return false;
+#endif
}
// printConstant - The LLVM Constant to C Constant converter.
case Instruction::GetElementPtr:
Out << "(&(";
- printIndexingExpression(CE->getOperand(0),
- CPV->op_begin()+1, CPV->op_end());
+ printIndexingExpression(CE->getOperand(0), gep_type_begin(CPV),
+ gep_type_end(CPV));
Out << "))";
return;
- case Instruction::Add:
+ case Instruction::Select:
Out << "(";
printConstant(CE->getOperand(0));
- Out << " + ";
+ Out << "?";
printConstant(CE->getOperand(1));
+ Out << ":";
+ printConstant(CE->getOperand(2));
Out << ")";
return;
+ case Instruction::Add:
case Instruction::Sub:
+ case Instruction::Mul:
+ case Instruction::Div:
+ case Instruction::Rem:
+ case Instruction::SetEQ:
+ case Instruction::SetNE:
+ case Instruction::SetLT:
+ case Instruction::SetLE:
+ case Instruction::SetGT:
+ case Instruction::SetGE:
+ case Instruction::Shl:
+ case Instruction::Shr:
Out << "(";
printConstant(CE->getOperand(0));
- Out << " - ";
+ switch (CE->getOpcode()) {
+ case Instruction::Add: Out << " + "; break;
+ case Instruction::Sub: Out << " - "; break;
+ case Instruction::Mul: Out << " * "; break;
+ case Instruction::Div: Out << " / "; break;
+ case Instruction::Rem: Out << " % "; break;
+ case Instruction::SetEQ: Out << " == "; break;
+ case Instruction::SetNE: Out << " != "; break;
+ case Instruction::SetLT: Out << " < "; break;
+ case Instruction::SetLE: Out << " <= "; break;
+ case Instruction::SetGT: Out << " > "; break;
+ case Instruction::SetGE: Out << " >= "; break;
+ case Instruction::Shl: Out << " << "; break;
+ case Instruction::Shr: Out << " >> "; break;
+ default: assert(0 && "Illegal opcode here!");
+ }
printConstant(CE->getOperand(1));
Out << ")";
return;
default:
std::cerr << "CWriter Error: Unhandled constant expression: "
- << CE << "\n";
+ << *CE << "\n";
abort();
}
}
- switch (CPV->getType()->getPrimitiveID()) {
+ switch (CPV->getType()->getTypeID()) {
case Type::BoolTyID:
Out << (CPV == ConstantBool::False ? "0" : "1"); break;
case Type::SByteTyID:
// Because of FP precision problems we must load from a stack allocated
// value that holds the value in hex.
Out << "(*(" << (FPC->getType() == Type::FloatTy ? "float" : "double")
- << "*)&FloatConstant" << I->second << ")";
+ << "*)&FPConstant" << I->second << ")";
} else {
- if (FPCSafeToPrint (FPC)) {
- Out << ftostr (FPC->getValue ());
+ if (IsNAN(FPC->getValue())) {
+ // The value is NaN
+
+ // The prefix for a quiet NaN is 0x7FF8. For a signalling NaN,
+ // it's 0x7ff4.
+ const unsigned long QuietNaN = 0x7ff8UL;
+ const unsigned long SignalNaN = 0x7ff4UL;
+
+ // We need to grab the first part of the FP #
+ union {
+ double d;
+ uint64_t ll;
+ } DHex;
+ char Buffer[100];
+
+ DHex.d = FPC->getValue();
+ sprintf(Buffer, "0x%llx", DHex.ll);
+
+ std::string Num(&Buffer[0], &Buffer[6]);
+ unsigned long Val = strtoul(Num.c_str(), 0, 16);
+
+ if (FPC->getType() == Type::FloatTy)
+ Out << "LLVM_NAN" << (Val == QuietNaN ? "" : "S") << "F(\""
+ << Buffer << "\") /*nan*/ ";
+ else
+ Out << "LLVM_NAN" << (Val == QuietNaN ? "" : "S") << "(\""
+ << Buffer << "\") /*nan*/ ";
+ } else if (IsInf(FPC->getValue())) {
+ // The value is Inf
+ if (FPC->getValue() < 0) Out << "-";
+ Out << "LLVM_INF" << (FPC->getType() == Type::FloatTy ? "F" : "")
+ << " /*inf*/ ";
} else {
- Out << FPC->getValue(); // Who knows? Give it our best shot...
+ std::string Num;
+#if HAVE_PRINTF_A
+ // Print out the constant as a floating point number.
+ char Buffer[100];
+ sprintf(Buffer, "%a", FPC->getValue());
+ Num = Buffer;
+#else
+ Num = ftostr(FPC->getValue());
+#endif
+ Out << Num;
}
}
break;
}
case Type::ArrayTyID:
- printConstantArray(cast<ConstantArray>(CPV));
+ if (isa<ConstantAggregateZero>(CPV)) {
+ const ArrayType *AT = cast<ArrayType>(CPV->getType());
+ Out << "{";
+ if (AT->getNumElements()) {
+ Out << " ";
+ Constant *CZ = Constant::getNullValue(AT->getElementType());
+ printConstant(CZ);
+ for (unsigned i = 1, e = AT->getNumElements(); i != e; ++i) {
+ Out << ", ";
+ printConstant(CZ);
+ }
+ }
+ Out << " }";
+ } else {
+ printConstantArray(cast<ConstantArray>(CPV));
+ }
break;
- case Type::StructTyID: {
- Out << "{";
- if (CPV->getNumOperands()) {
- Out << " ";
- printConstant(cast<Constant>(CPV->getOperand(0)));
- for (unsigned i = 1, e = CPV->getNumOperands(); i != e; ++i) {
- Out << ", ";
- printConstant(cast<Constant>(CPV->getOperand(i)));
+ case Type::StructTyID:
+ if (isa<ConstantAggregateZero>(CPV)) {
+ const StructType *ST = cast<StructType>(CPV->getType());
+ Out << "{";
+ if (ST->getNumElements()) {
+ Out << " ";
+ printConstant(Constant::getNullValue(ST->getElementType(0)));
+ for (unsigned i = 1, e = ST->getNumElements(); i != e; ++i) {
+ Out << ", ";
+ printConstant(Constant::getNullValue(ST->getElementType(i)));
+ }
+ }
+ Out << " }";
+ } else {
+ Out << "{";
+ if (CPV->getNumOperands()) {
+ Out << " ";
+ printConstant(cast<Constant>(CPV->getOperand(0)));
+ for (unsigned i = 1, e = CPV->getNumOperands(); i != e; ++i) {
+ Out << ", ";
+ printConstant(cast<Constant>(CPV->getOperand(i)));
+ }
}
+ Out << " }";
}
- Out << " }";
break;
- }
case Type::PointerTyID:
if (isa<ConstantPointerNull>(CPV)) {
printType(Out, CPV->getType());
Out << ")/*NULL*/0)";
break;
- } else if (ConstantPointerRef *CPR = dyn_cast<ConstantPointerRef>(CPV)) {
- writeOperand(CPR->getValue());
+ } else if (GlobalValue *GV = dyn_cast<GlobalValue>(CPV)) {
+ writeOperand(GV);
break;
}
// FALL THROUGH
default:
- std::cerr << "Unknown constant type: " << CPV << "\n";
+ std::cerr << "Unknown constant type: " << *CPV << "\n";
abort();
}
}
return;
}
- if (Operand->hasName()) {
- Out << getValueName(Operand);
- } else if (Constant *CPV = dyn_cast<Constant>(Operand)) {
+ Constant* CPV = dyn_cast<Constant>(Operand);
+ if (CPV && !isa<GlobalValue>(CPV)) {
printConstant(CPV);
} else {
- int Slot = Table->getValSlot(Operand);
- assert(Slot >= 0 && "Malformed LLVM!");
- Out << "ltmp_" << Slot << "_" << Operand->getType()->getUniqueID();
+ Out << Mang->getValueName(Operand);
}
}
Out << ")";
}
-// nameAllUsedStructureTypes - If there are structure types in the module that
-// are used but do not have names assigned to them in the symbol table yet then
-// we assign them names now.
+// generateCompilerSpecificCode - This is where we add conditional compilation
+// directives to cater to specific compilers as need be.
//
-bool CWriter::nameAllUsedStructureTypes(Module &M) {
- // Get a set of types that are used by the program...
- std::set<const Type *> UT = getAnalysis<FindUsedTypes>().getTypes();
-
- // Loop over the module symbol table, removing types from UT that are already
- // named.
- //
- SymbolTable &MST = M.getSymbolTable();
- if (MST.find(Type::TypeTy) != MST.end())
- for (SymbolTable::type_iterator I = MST.type_begin(Type::TypeTy),
- E = MST.type_end(Type::TypeTy); I != E; ++I)
- UT.erase(cast<Type>(I->second));
-
- // UT now contains types that are not named. Loop over it, naming structure
- // types.
- //
- bool Changed = false;
- for (std::set<const Type *>::const_iterator I = UT.begin(), E = UT.end();
- I != E; ++I)
- if (const StructType *ST = dyn_cast<StructType>(*I)) {
- ((Value*)ST)->setName("unnamed", &MST);
- Changed = true;
- }
- return Changed;
-}
-
-static void generateAllocaDecl(std::ostream& Out) {
- // On SunOS, we need to insert the alloca macro & proto for the builtin.
- Out << "#ifdef sun\n"
+static void generateCompilerSpecificCode(std::ostream& Out) {
+ // Alloca is hard to get, and we don't want to include stdlib.h here...
+ Out << "/* get a declaration for alloca */\n"
+ << "#if defined(sun) || defined(__CYGWIN__) || defined(__APPLE__)\n"
<< "extern void *__builtin_alloca(unsigned long);\n"
<< "#define alloca(x) __builtin_alloca(x)\n"
<< "#else\n"
<< "#include <alloca.h>\n"
<< "#endif\n"
<< "#endif\n\n";
+
+ // We output GCC specific attributes to preserve 'linkonce'ness on globals.
+ // If we aren't being compiled with GCC, just drop these attributes.
+ Out << "#ifndef __GNUC__ /* Can only support \"linkonce\" vars with GCC */\n"
+ << "#define __attribute__(X)\n"
+ << "#endif\n\n";
+
+#if 0
+ // At some point, we should support "external weak" vs. "weak" linkages.
+ // On Mac OS X, "external weak" is spelled "__attribute__((weak_import))".
+ Out << "#if defined(__GNUC__) && defined(__APPLE_CC__)\n"
+ << "#define __EXTERNAL_WEAK__ __attribute__((weak_import))\n"
+ << "#elif defined(__GNUC__)\n"
+ << "#define __EXTERNAL_WEAK__ __attribute__((weak))\n"
+ << "#else\n"
+ << "#define __EXTERNAL_WEAK__\n"
+ << "#endif\n\n";
+#endif
+
+ // For now, turn off the weak linkage attribute on Mac OS X. (See above.)
+ Out << "#if defined(__GNUC__) && defined(__APPLE_CC__)\n"
+ << "#define __ATTRIBUTE_WEAK__\n"
+ << "#elif defined(__GNUC__)\n"
+ << "#define __ATTRIBUTE_WEAK__ __attribute__((weak))\n"
+ << "#else\n"
+ << "#define __ATTRIBUTE_WEAK__\n"
+ << "#endif\n\n";
+
+ // Define NaN and Inf as GCC builtins if using GCC, as 0 otherwise
+ // From the GCC documentation:
+ //
+ // double __builtin_nan (const char *str)
+ //
+ // This is an implementation of the ISO C99 function nan.
+ //
+ // Since ISO C99 defines this function in terms of strtod, which we do
+ // not implement, a description of the parsing is in order. The string is
+ // parsed as by strtol; that is, the base is recognized by leading 0 or
+ // 0x prefixes. The number parsed is placed in the significand such that
+ // the least significant bit of the number is at the least significant
+ // bit of the significand. The number is truncated to fit the significand
+ // field provided. The significand is forced to be a quiet NaN.
+ //
+ // This function, if given a string literal, is evaluated early enough
+ // that it is considered a compile-time constant.
+ //
+ // float __builtin_nanf (const char *str)
+ //
+ // Similar to __builtin_nan, except the return type is float.
+ //
+ // double __builtin_inf (void)
+ //
+ // Similar to __builtin_huge_val, except a warning is generated if the
+ // target floating-point format does not support infinities. This
+ // function is suitable for implementing the ISO C99 macro INFINITY.
+ //
+ // float __builtin_inff (void)
+ //
+ // Similar to __builtin_inf, except the return type is float.
+ Out << "#ifdef __GNUC__\n"
+ << "#define LLVM_NAN(NanStr) __builtin_nan(NanStr) /* Double */\n"
+ << "#define LLVM_NANF(NanStr) __builtin_nanf(NanStr) /* Float */\n"
+ << "#define LLVM_NANS(NanStr) __builtin_nans(NanStr) /* Double */\n"
+ << "#define LLVM_NANSF(NanStr) __builtin_nansf(NanStr) /* Float */\n"
+ << "#define LLVM_INF __builtin_inf() /* Double */\n"
+ << "#define LLVM_INFF __builtin_inff() /* Float */\n"
+ << "#else\n"
+ << "#define LLVM_NAN(NanStr) ((double)0.0) /* Double */\n"
+ << "#define LLVM_NANF(NanStr) 0.0F /* Float */\n"
+ << "#define LLVM_NANS(NanStr) ((double)0.0) /* Double */\n"
+ << "#define LLVM_NANSF(NanStr) 0.0F /* Float */\n"
+ << "#define LLVM_INF ((double)0.0) /* Double */\n"
+ << "#define LLVM_INFF 0.0F /* Float */\n"
+ << "#endif\n";
}
-void CWriter::printModule(Module *M) {
- // Calculate which global values have names that will collide when we throw
- // away type information.
- { // Scope to delete the FoundNames set when we are done with it...
- std::set<std::string> FoundNames;
- for (Module::iterator I = M->begin(), E = M->end(); I != E; ++I)
- if (I->hasName()) // If the global has a name...
- if (FoundNames.count(I->getName())) // And the name is already used
- MangledGlobals.insert(I); // Mangle the name
- else
- FoundNames.insert(I->getName()); // Otherwise, keep track of name
+bool CWriter::doInitialization(Module &M) {
+ // Initialize
+ TheModule = &M;
- for (Module::giterator I = M->gbegin(), E = M->gend(); I != E; ++I)
- if (I->hasName()) // If the global has a name...
- if (FoundNames.count(I->getName())) // And the name is already used
- MangledGlobals.insert(I); // Mangle the name
- else
- FoundNames.insert(I->getName()); // Otherwise, keep track of name
- }
+ IL.AddPrototypes(M);
+
+ // Ensure that all structure types have names...
+ Mang = new Mangler(M);
// get declaration for alloca
Out << "/* Provide Declarations */\n";
- generateAllocaDecl(Out);
- Out << "#include <stdarg.h>\n";
- Out << "#include <setjmp.h>\n";
-
+ Out << "#include <stdarg.h>\n"; // Varargs support
+ Out << "#include <setjmp.h>\n"; // Unwind support
+ generateCompilerSpecificCode(Out);
+
// Provide a definition for `bool' if not compiling with a C++ compiler.
Out << "\n"
<< "#ifndef __cplusplus\ntypedef unsigned char bool;\n#endif\n"
//
// Loop over the symbol table, emitting all named constants...
- printSymbolTable(M->getSymbolTable());
+ printModuleTypes(M.getSymbolTable());
// Global variable declarations...
- if (!M->gempty()) {
+ if (!M.gempty()) {
Out << "\n/* External Global Variable Declarations */\n";
- for (Module::giterator I = M->gbegin(), E = M->gend(); I != E; ++I) {
+ for (Module::giterator I = M.gbegin(), E = M.gend(); I != E; ++I) {
if (I->hasExternalLinkage()) {
Out << "extern ";
- printType(Out, I->getType()->getElementType(), getValueName(I));
+ printType(Out, I->getType()->getElementType(), Mang->getValueName(I));
Out << ";\n";
}
}
}
// Function declarations
- if (!M->empty()) {
+ if (!M.empty()) {
Out << "\n/* Function Declarations */\n";
- needsMalloc = true;
- for (Module::iterator I = M->begin(), E = M->end(); I != E; ++I) {
- // If the function is external and the name collides don't print it.
- // Sometimes the bytecode likes to have multiple "declarations" for
- // external functions
- if ((I->hasInternalLinkage() || !MangledGlobals.count(I)) &&
- !I->getIntrinsicID()) {
+ for (Module::iterator I = M.begin(), E = M.end(); I != E; ++I) {
+ // Don't print declarations for intrinsic functions.
+ if (!I->getIntrinsicID() &&
+ I->getName() != "setjmp" && I->getName() != "longjmp") {
printFunctionSignature(I, true);
+ if (I->hasWeakLinkage()) Out << " __ATTRIBUTE_WEAK__";
+ if (I->hasLinkOnceLinkage()) Out << " __ATTRIBUTE_WEAK__";
Out << ";\n";
}
}
}
- // Print Malloc prototype if needed
- if (needsMalloc){
- Out << "\n/* Malloc to make sun happy */\n";
- Out << "extern void * malloc(size_t);\n\n";
- }
-
// Output the global variable declarations
- if (!M->gempty()) {
+ if (!M.gempty()) {
Out << "\n\n/* Global Variable Declarations */\n";
- for (Module::giterator I = M->gbegin(), E = M->gend(); I != E; ++I)
+ for (Module::giterator I = M.gbegin(), E = M.gend(); I != E; ++I)
if (!I->isExternal()) {
Out << "extern ";
- printType(Out, I->getType()->getElementType(), getValueName(I));
-
+ printType(Out, I->getType()->getElementType(), Mang->getValueName(I));
+
+ if (I->hasLinkOnceLinkage())
+ Out << " __attribute__((common))";
+ else if (I->hasWeakLinkage())
+ Out << " __ATTRIBUTE_WEAK__";
Out << ";\n";
}
}
-
// Output the global variable definitions and contents...
- if (!M->gempty()) {
+ if (!M.gempty()) {
Out << "\n\n/* Global Variable Definitions and Initialization */\n";
- for (Module::giterator I = M->gbegin(), E = M->gend(); I != E; ++I)
+ for (Module::giterator I = M.gbegin(), E = M.gend(); I != E; ++I)
if (!I->isExternal()) {
if (I->hasInternalLinkage())
Out << "static ";
- printType(Out, I->getType()->getElementType(), getValueName(I));
+ printType(Out, I->getType()->getElementType(), Mang->getValueName(I));
+ if (I->hasLinkOnceLinkage())
+ Out << " __attribute__((common))";
+ else if (I->hasWeakLinkage())
+ Out << " __ATTRIBUTE_WEAK__";
+
+ // If the initializer is not null, emit the initializer. If it is null,
+ // we try to avoid emitting large amounts of zeros. The problem with
+ // this, however, occurs when the variable has weak linkage. In this
+ // case, the assembler will complain about the variable being both weak
+ // and common, so we disable this optimization.
if (!I->getInitializer()->isNullValue()) {
Out << " = " ;
writeOperand(I->getInitializer());
+ } else if (I->hasWeakLinkage()) {
+ // We have to specify an initializer, but it doesn't have to be
+ // complete. If the value is an aggregate, print out { 0 }, and let
+ // the compiler figure out the rest of the zeros.
+ Out << " = " ;
+ if (isa<StructType>(I->getInitializer()->getType()) ||
+ isa<ArrayType>(I->getInitializer()->getType())) {
+ Out << "{ 0 }";
+ } else {
+ // Just print it out normally.
+ writeOperand(I->getInitializer());
+ }
}
Out << ";\n";
}
}
- // Output all of the functions...
- if (!M->empty()) {
+ if (!M.empty())
Out << "\n\n/* Function Bodies */\n";
- for (Module::iterator I = M->begin(), E = M->end(); I != E; ++I)
- printFunction(I);
- }
+ return false;
+}
+
+
+/// Output all floating point constants that cannot be printed accurately...
+void CWriter::printFloatingPointConstants(Function &F) {
+ union {
+ double D;
+ uint64_t U;
+ } DBLUnion;
+
+ union {
+ float F;
+ unsigned U;
+ } FLTUnion;
+
+ // Scan the module for floating point constants. If any FP constant is used
+ // in the function, we want to redirect it here so that we do not depend on
+ // the precision of the printed form, unless the printed form preserves
+ // precision.
+ //
+ static unsigned FPCounter = 0;
+ for (constant_iterator I = constant_begin(&F), E = constant_end(&F);
+ I != E; ++I)
+ if (const ConstantFP *FPC = dyn_cast<ConstantFP>(*I))
+ if (!isFPCSafeToPrint(FPC) && // Do not put in FPConstantMap if safe.
+ !FPConstantMap.count(FPC)) {
+ double Val = FPC->getValue();
+
+ FPConstantMap[FPC] = FPCounter; // Number the FP constants
+
+ if (FPC->getType() == Type::DoubleTy) {
+ DBLUnion.D = Val;
+ Out << "static const ConstantDoubleTy FPConstant" << FPCounter++
+ << " = 0x" << std::hex << DBLUnion.U << std::dec
+ << "ULL; /* " << Val << " */\n";
+ } else if (FPC->getType() == Type::FloatTy) {
+ FLTUnion.F = Val;
+ Out << "static const ConstantFloatTy FPConstant" << FPCounter++
+ << " = 0x" << std::hex << FLTUnion.U << std::dec
+ << "U; /* " << Val << " */\n";
+ } else
+ assert(0 && "Unknown float type!");
+ }
+
+ Out << "\n";
}
/// printSymbolTable - Run through symbol table looking for type names. If a
/// type name is found, emit it's declaration...
///
-void CWriter::printSymbolTable(const SymbolTable &ST) {
+void CWriter::printModuleTypes(const SymbolTable &ST) {
// If there are no type names, exit early.
- if (ST.find(Type::TypeTy) == ST.end())
+ if ( ! ST.hasTypes() )
return;
// We are only interested in the type plane of the symbol table...
- SymbolTable::type_const_iterator I = ST.type_begin(Type::TypeTy);
- SymbolTable::type_const_iterator End = ST.type_end(Type::TypeTy);
+ SymbolTable::type_const_iterator I = ST.type_begin();
+ SymbolTable::type_const_iterator End = ST.type_end();
// Print out forward declarations for structure types before anything else!
Out << "/* Structure forward decls */\n";
for (; I != End; ++I)
if (const Type *STy = dyn_cast<StructType>(I->second)) {
- std::string Name = "struct l_" + makeNameProper(I->first);
+ std::string Name = "struct l_" + Mangler::makeNameProper(I->first);
Out << Name << ";\n";
TypeNames.insert(std::make_pair(STy, Name));
}
// Now we can print out typedefs...
Out << "/* Typedefs */\n";
- for (I = ST.type_begin(Type::TypeTy); I != End; ++I) {
+ for (I = ST.type_begin(); I != End; ++I) {
const Type *Ty = cast<Type>(I->second);
- std::string Name = "l_" + makeNameProper(I->first);
+ std::string Name = "l_" + Mangler::makeNameProper(I->first);
Out << "typedef ";
printType(Out, Ty, Name);
Out << ";\n";
}
-
+
Out << "\n";
// Keep track of which structures have been printed so far...
// printed in the correct order.
//
Out << "/* Structure contents */\n";
- for (I = ST.type_begin(Type::TypeTy); I != End; ++I)
+ for (I = ST.type_begin(); I != End; ++I)
if (const StructType *STy = dyn_cast<StructType>(I->second))
+ // Only print out used types!
printContainedStructs(STy, StructPrinted);
}
// this one depends on.
void CWriter::printContainedStructs(const Type *Ty,
std::set<const StructType*> &StructPrinted){
- if (const StructType *STy = dyn_cast<StructType>(Ty)){
+ if (const StructType *STy = dyn_cast<StructType>(Ty)) {
//Check to see if we have already printed this struct
if (StructPrinted.count(STy) == 0) {
// Print all contained types first...
- for (StructType::ElementTypes::const_iterator
- I = STy->getElementTypes().begin(),
- E = STy->getElementTypes().end(); I != E; ++I) {
+ for (StructType::element_iterator I = STy->element_begin(),
+ E = STy->element_end(); I != E; ++I) {
const Type *Ty1 = I->get();
if (isa<StructType>(Ty1) || isa<ArrayType>(Ty1))
printContainedStructs(*I, StructPrinted);
void CWriter::printFunctionSignature(const Function *F, bool Prototype) {
- // If the program provides its own malloc prototype we don't need
- // to include the general one.
- if (getValueName(F) == "malloc")
- needsMalloc = false;
-
if (F->hasInternalLinkage()) Out << "static ";
- if (F->hasLinkOnceLinkage()) Out << "inline ";
// Loop over the arguments, printing them...
const FunctionType *FT = cast<FunctionType>(F->getFunctionType());
std::stringstream FunctionInnards;
// Print out the name...
- FunctionInnards << getValueName(F) << "(";
+ FunctionInnards << Mang->getValueName(F) << "(";
if (!F->isExternal()) {
if (!F->aempty()) {
std::string ArgName;
if (F->abegin()->hasName() || !Prototype)
- ArgName = getValueName(F->abegin());
+ ArgName = Mang->getValueName(F->abegin());
printType(FunctionInnards, F->afront().getType(), ArgName);
for (Function::const_aiterator I = ++F->abegin(), E = F->aend();
I != E; ++I) {
FunctionInnards << ", ";
if (I->hasName() || !Prototype)
- ArgName = getValueName(I);
+ ArgName = Mang->getValueName(I);
else
ArgName = "";
printType(FunctionInnards, I->getType(), ArgName);
}
} else {
// Loop over the arguments, printing them...
- for (FunctionType::ParamTypes::const_iterator I =
- FT->getParamTypes().begin(),
- E = FT->getParamTypes().end(); I != E; ++I) {
- if (I != FT->getParamTypes().begin()) FunctionInnards << ", ";
+ for (FunctionType::param_iterator I = FT->param_begin(),
+ E = FT->param_end(); I != E; ++I) {
+ if (I != FT->param_begin()) FunctionInnards << ", ";
printType(FunctionInnards, *I);
}
}
// Finish printing arguments... if this is a vararg function, print the ...,
// unless there are no known types, in which case, we just emit ().
//
- if (FT->isVarArg() && !FT->getParamTypes().empty()) {
- if (FT->getParamTypes().size()) FunctionInnards << ", ";
+ if (FT->isVarArg() && FT->getNumParams()) {
+ if (FT->getNumParams()) FunctionInnards << ", ";
FunctionInnards << "..."; // Output varargs portion of signature!
+ } else if (!FT->isVarArg() && FT->getNumParams() == 0) {
+ FunctionInnards << "void"; // ret() -> ret(void) in C.
}
FunctionInnards << ")";
// Print out the return type and the entire signature for that matter
printType(Out, F->getReturnType(), FunctionInnards.str());
-
}
-void CWriter::printFunction(Function *F) {
- if (F->isExternal()) return;
-
- Table->incorporateFunction(F);
-
- printFunctionSignature(F, false);
+void CWriter::printFunction(Function &F) {
+ printFunctionSignature(&F, false);
Out << " {\n";
// print local variable information for the function
- for (inst_iterator I = inst_begin(F), E = inst_end(F); I != E; ++I)
- if (const AllocaInst *AI = isDirectAlloca(*I)) {
+ for (inst_iterator I = inst_begin(&F), E = inst_end(&F); I != E; ++I)
+ if (const AllocaInst *AI = isDirectAlloca(&*I)) {
Out << " ";
- printType(Out, AI->getAllocatedType(), getValueName(AI));
+ printType(Out, AI->getAllocatedType(), Mang->getValueName(AI));
Out << "; /* Address exposed local */\n";
- } else if ((*I)->getType() != Type::VoidTy && !isInlinableInst(**I)) {
+ } else if (I->getType() != Type::VoidTy && !isInlinableInst(*I)) {
Out << " ";
- printType(Out, (*I)->getType(), getValueName(*I));
+ printType(Out, I->getType(), Mang->getValueName(&*I));
Out << ";\n";
if (isa<PHINode>(*I)) { // Print out PHI node temporaries as well...
Out << " ";
- printType(Out, (*I)->getType(), getValueName(*I)+"__PHI_TEMPORARY");
+ printType(Out, I->getType(),
+ Mang->getValueName(&*I)+"__PHI_TEMPORARY");
Out << ";\n";
}
}
Out << "\n";
- // Scan the function for floating point constants. If any FP constant is used
- // in the function, we want to redirect it here so that we do not depend on
- // the precision of the printed form, unless the printed form preserves
- // precision.
- //
- unsigned FPCounter = 0;
- for (constant_iterator I = constant_begin(F), E = constant_end(F); I != E;++I)
- if (const ConstantFP *FPC = dyn_cast<ConstantFP>(*I))
- if ((!FPCSafeToPrint(FPC)) // Do not put in FPConstantMap if safe.
- && (FPConstantMap.find(FPC) == FPConstantMap.end())) {
- double Val = FPC->getValue();
-
- FPConstantMap[FPC] = FPCounter; // Number the FP constants
-
- if (FPC->getType() == Type::DoubleTy)
- Out << " const ConstantDoubleTy FloatConstant" << FPCounter++
- << " = 0x" << std::hex << *(unsigned long long*)&Val << std::dec
- << "; /* " << Val << " */\n";
- else if (FPC->getType() == Type::FloatTy) {
- float fVal = Val;
- Out << " const ConstantFloatTy FloatConstant" << FPCounter++
- << " = 0x" << std::hex << *(unsigned*)&fVal << std::dec
- << "; /* " << Val << " */\n";
- } else
- assert(0 && "Unknown float type!");
- }
-
- Out << "\n";
-
// print the basic blocks
- for (Function::iterator BB = F->begin(), E = F->end(); BB != E; ++BB) {
- BasicBlock *Prev = BB->getPrev();
+ for (Function::iterator BB = F.begin(), E = F.end(); BB != E; ++BB) {
+ if (Loop *L = LI->getLoopFor(BB)) {
+ if (L->getHeader() == BB && L->getParentLoop() == 0)
+ printLoop(L);
+ } else {
+ printBasicBlock(BB);
+ }
+ }
+
+ Out << "}\n\n";
+}
- // Don't print the label for the basic block if there are no uses, or if the
- // only terminator use is the precessor basic block's terminator. We have
- // to scan the use list because PHI nodes use basic blocks too but do not
- // require a label to be generated.
- //
- bool NeedsLabel = false;
- for (Value::use_iterator UI = BB->use_begin(), UE = BB->use_end();
- UI != UE; ++UI)
- if (TerminatorInst *TI = dyn_cast<TerminatorInst>(*UI))
- if (TI != Prev->getTerminator() ||
- isa<SwitchInst>(Prev->getTerminator())) {
- NeedsLabel = true;
- break;
- }
+void CWriter::printLoop(Loop *L) {
+ Out << " do { /* Syntactic loop '" << L->getHeader()->getName()
+ << "' to make GCC happy */\n";
+ for (unsigned i = 0, e = L->getBlocks().size(); i != e; ++i) {
+ BasicBlock *BB = L->getBlocks()[i];
+ Loop *BBLoop = LI->getLoopFor(BB);
+ if (BBLoop == L)
+ printBasicBlock(BB);
+ else if (BB == BBLoop->getHeader() && BBLoop->getParentLoop() == L)
+ printLoop(BBLoop);
+ }
+ Out << " } while (1); /* end of syntactic loop '"
+ << L->getHeader()->getName() << "' */\n";
+}
- if (NeedsLabel) Out << getValueName(BB) << ":\n";
+void CWriter::printBasicBlock(BasicBlock *BB) {
- // Output all of the instructions in the basic block...
- for (BasicBlock::iterator II = BB->begin(), E = --BB->end(); II != E; ++II){
- if (!isInlinableInst(*II) && !isDirectAlloca(II)) {
- if (II->getType() != Type::VoidTy)
- outputLValue(II);
- else
- Out << " ";
- visit(*II);
- Out << ";\n";
- }
+ // Don't print the label for the basic block if there are no uses, or if
+ // the only terminator use is the predecessor basic block's terminator.
+ // We have to scan the use list because PHI nodes use basic blocks too but
+ // do not require a label to be generated.
+ //
+ bool NeedsLabel = false;
+ for (pred_iterator PI = pred_begin(BB), E = pred_end(BB); PI != E; ++PI)
+ if (isGotoCodeNecessary(*PI, BB)) {
+ NeedsLabel = true;
+ break;
+ }
+
+ if (NeedsLabel) Out << Mang->getValueName(BB) << ":\n";
+
+ // Output all of the instructions in the basic block...
+ for (BasicBlock::iterator II = BB->begin(), E = --BB->end(); II != E;
+ ++II) {
+ if (!isInlinableInst(*II) && !isDirectAlloca(II)) {
+ if (II->getType() != Type::VoidTy)
+ outputLValue(II);
+ else
+ Out << " ";
+ visit(*II);
+ Out << ";\n";
}
-
- // Don't emit prefix or suffix for the terminator...
- visit(*BB->getTerminator());
}
-
- Out << "}\n\n";
- Table->purgeFunction();
- FPConstantMap.clear();
+
+ // Don't emit prefix or suffix for the terminator...
+ visit(*BB->getTerminator());
}
+
// Specific Instruction type classes... note that all of the casts are
-// neccesary because we use the instruction classes as opaque types...
+// necessary because we use the instruction classes as opaque types...
//
void CWriter::visitReturnInst(ReturnInst &I) {
// Don't output a void return if this is the last basic block in the function
}
void CWriter::visitSwitchInst(SwitchInst &SI) {
+ printPHICopiesForSuccessors(SI.getParent(), 0);
+
Out << " switch (";
writeOperand(SI.getOperand(0));
Out << ") {\n default:\n";
Out << " }\n";
}
+bool CWriter::isGotoCodeNecessary(BasicBlock *From, BasicBlock *To) {
+ /// FIXME: This should be reenabled, but loop reordering safe!!
+ return true;
+
+ if (From->getNext() != To) // Not the direct successor, we need a goto
+ return true;
+
+ //isa<SwitchInst>(From->getTerminator())
-static bool isGotoCodeNeccessary(BasicBlock *From, BasicBlock *To) {
- // If PHI nodes need copies, we need the copy code...
- if (isa<PHINode>(To->front()) ||
- From->getNext() != To) // Not directly successor, need goto
- return true;
- // Otherwise we don't need the code.
+ if (LI->getLoopFor(From) != LI->getLoopFor(To))
+ return true;
return false;
}
-void CWriter::printBranchToBlock(BasicBlock *CurBB, BasicBlock *Succ,
- unsigned Indent) {
- for (BasicBlock::iterator I = Succ->begin();
- PHINode *PN = dyn_cast<PHINode>(I); ++I) {
- // now we have to do the printing
- Out << std::string(Indent, ' ');
- Out << " " << getValueName(I) << "__PHI_TEMPORARY = ";
- writeOperand(PN->getIncomingValue(PN->getBasicBlockIndex(CurBB)));
- Out << "; /* for PHI node */\n";
- }
+void CWriter::printPHICopiesForSuccessors(BasicBlock *CurBlock,
+ unsigned Indent) {
+ for (succ_iterator SI = succ_begin(CurBlock), E = succ_end(CurBlock);
+ SI != E; ++SI)
+ for (BasicBlock::iterator I = SI->begin();
+ PHINode *PN = dyn_cast<PHINode>(I); ++I) {
+ // now we have to do the printing
+ Out << std::string(Indent, ' ');
+ Out << " " << Mang->getValueName(I) << "__PHI_TEMPORARY = ";
+ writeOperand(PN->getIncomingValue(PN->getBasicBlockIndex(CurBlock)));
+ Out << "; /* for PHI node */\n";
+ }
+}
+
- if (CurBB->getNext() != Succ) {
+void CWriter::printBranchToBlock(BasicBlock *CurBB, BasicBlock *Succ,
+ unsigned Indent) {
+ if (isGotoCodeNecessary(CurBB, Succ)) {
Out << std::string(Indent, ' ') << " goto ";
writeOperand(Succ);
Out << ";\n";
}
}
-// Brach instruction printing - Avoid printing out a brach to a basic block that
-// immediately succeeds the current one.
+// Branch instruction printing - Avoid printing out a branch to a basic block
+// that immediately succeeds the current one.
//
void CWriter::visitBranchInst(BranchInst &I) {
+ printPHICopiesForSuccessors(I.getParent(), 0);
+
if (I.isConditional()) {
- if (isGotoCodeNeccessary(I.getParent(), I.getSuccessor(0))) {
+ if (isGotoCodeNecessary(I.getParent(), I.getSuccessor(0))) {
Out << " if (";
writeOperand(I.getCondition());
Out << ") {\n";
printBranchToBlock(I.getParent(), I.getSuccessor(0), 2);
- if (isGotoCodeNeccessary(I.getParent(), I.getSuccessor(1))) {
+ if (isGotoCodeNecessary(I.getParent(), I.getSuccessor(1))) {
Out << " } else {\n";
printBranchToBlock(I.getParent(), I.getSuccessor(1), 2);
}
} else {
- // First goto not neccesary, assume second one is...
+ // First goto not necessary, assume second one is...
Out << " if (!";
writeOperand(I.getCondition());
Out << ") {\n";
|| (I.getType() == Type::FloatTy)) {
needsCast = true;
Out << "((";
- printType(Out, I.getType(), "", false, false);
+ printType(Out, I.getType());
Out << ")(";
}
return;
}
Out << "(";
- printType(Out, I.getType(), "", /*ignoreName*/false, /*namedContext*/false);
+ printType(Out, I.getType());
Out << ")";
if (isa<PointerType>(I.getType())&&I.getOperand(0)->getType()->isIntegral() ||
isa<PointerType>(I.getOperand(0)->getType())&&I.getType()->isIntegral()) {
writeOperand(I.getOperand(0));
}
+void CWriter::visitSelectInst(SelectInst &I) {
+ Out << "((";
+ writeOperand(I.getCondition());
+ Out << ") ? (";
+ writeOperand(I.getTrueValue());
+ Out << ") : (";
+ writeOperand(I.getFalseValue());
+ Out << "))";
+}
+
+
+void CWriter::lowerIntrinsics(Function &F) {
+ for (Function::iterator BB = F.begin(), E = F.end(); BB != E; ++BB)
+ for (BasicBlock::iterator I = BB->begin(), E = BB->end(); I != E; )
+ if (CallInst *CI = dyn_cast<CallInst>(I++))
+ if (Function *F = CI->getCalledFunction())
+ switch (F->getIntrinsicID()) {
+ case Intrinsic::not_intrinsic:
+ case Intrinsic::vastart:
+ case Intrinsic::vacopy:
+ case Intrinsic::vaend:
+ case Intrinsic::returnaddress:
+ case Intrinsic::frameaddress:
+ case Intrinsic::setjmp:
+ case Intrinsic::longjmp:
+ // We directly implement these intrinsics
+ break;
+ default:
+ // All other intrinsic calls we must lower.
+ Instruction *Before = CI->getPrev();
+ IL.LowerIntrinsicCall(CI);
+ if (Before) { // Move iterator to instruction after call
+ I = Before; ++I;
+ } else {
+ I = BB->begin();
+ }
+ }
+}
+
+
+
void CWriter::visitCallInst(CallInst &I) {
// Handle intrinsic function calls first...
if (Function *F = I.getCalledFunction())
- if (LLVMIntrinsic::ID ID = (LLVMIntrinsic::ID)F->getIntrinsicID()) {
+ if (Intrinsic::ID ID = (Intrinsic::ID)F->getIntrinsicID()) {
switch (ID) {
- default: assert(0 && "Unknown LLVM intrinsic!");
- case LLVMIntrinsic::va_start:
- Out << "va_start((va_list)*";
- writeOperand(I.getOperand(1));
- Out << ", ";
+ default: assert(0 && "Unknown LLVM intrinsic!");
+ case Intrinsic::vastart:
+ Out << "0; ";
+
+ Out << "va_start(*(va_list*)&" << Mang->getValueName(&I) << ", ";
// Output the last argument to the enclosing function...
+ if (I.getParent()->getParent()->aempty()) {
+ std::cerr << "The C backend does not currently support zero "
+ << "argument varargs functions, such as '"
+ << I.getParent()->getParent()->getName() << "'!\n";
+ abort();
+ }
writeOperand(&I.getParent()->getParent()->aback());
Out << ")";
return;
- case LLVMIntrinsic::va_end:
- Out << "va_end((va_list)*";
+ case Intrinsic::vaend:
+ if (!isa<ConstantPointerNull>(I.getOperand(1))) {
+ Out << "va_end(*(va_list*)&";
+ writeOperand(I.getOperand(1));
+ Out << ")";
+ } else {
+ Out << "va_end(*(va_list*)0)";
+ }
+ return;
+ case Intrinsic::vacopy:
+ Out << "0;";
+ Out << "va_copy(*(va_list*)&" << Mang->getValueName(&I) << ", ";
+ Out << "*(va_list*)&";
writeOperand(I.getOperand(1));
Out << ")";
return;
- case LLVMIntrinsic::va_copy:
- Out << "va_copy((va_list)*";
+ case Intrinsic::returnaddress:
+ Out << "__builtin_return_address(";
writeOperand(I.getOperand(1));
- Out << ", (va_list)";
- writeOperand(I.getOperand(2));
Out << ")";
return;
-
- case LLVMIntrinsic::setjmp:
- Out << "setjmp((jmp_buf)";
+ case Intrinsic::frameaddress:
+ Out << "__builtin_frame_address(";
+ writeOperand(I.getOperand(1));
+ Out << ")";
+ return;
+ case Intrinsic::setjmp:
+ Out << "setjmp(*(jmp_buf*)";
writeOperand(I.getOperand(1));
Out << ")";
return;
- case LLVMIntrinsic::longjmp:
- Out << "longjmp((jmp_buf)";
+ case Intrinsic::longjmp:
+ Out << "longjmp(*(jmp_buf*)";
writeOperand(I.getOperand(1));
Out << ", ";
writeOperand(I.getOperand(2));
return;
}
}
+ visitCallSite(&I);
+}
- const PointerType *PTy = cast<PointerType>(I.getCalledValue()->getType());
+void CWriter::visitCallSite(CallSite CS) {
+ const PointerType *PTy = cast<PointerType>(CS.getCalledValue()->getType());
const FunctionType *FTy = cast<FunctionType>(PTy->getElementType());
const Type *RetTy = FTy->getReturnType();
- writeOperand(I.getOperand(0));
+ writeOperand(CS.getCalledValue());
Out << "(";
- if (I.getNumOperands() > 1) {
- writeOperand(I.getOperand(1));
+ if (CS.arg_begin() != CS.arg_end()) {
+ CallSite::arg_iterator AI = CS.arg_begin(), AE = CS.arg_end();
+ writeOperand(*AI);
- for (unsigned op = 2, Eop = I.getNumOperands(); op != Eop; ++op) {
+ for (++AI; AI != AE; ++AI) {
Out << ", ";
- writeOperand(I.getOperand(op));
+ writeOperand(*AI);
}
}
Out << ")";
}
void CWriter::visitMallocInst(MallocInst &I) {
- Out << "(";
- printType(Out, I.getType());
- Out << ")malloc(sizeof(";
- printType(Out, I.getType()->getElementType());
- Out << ")";
-
- if (I.isArrayAllocation()) {
- Out << " * " ;
- writeOperand(I.getOperand(0));
- }
- Out << ")";
+ assert(0 && "lowerallocations pass didn't work!");
}
void CWriter::visitAllocaInst(AllocaInst &I) {
}
void CWriter::visitFreeInst(FreeInst &I) {
- Out << "free(";
- writeOperand(I.getOperand(0));
- Out << ")";
+ assert(0 && "lowerallocations pass didn't work!");
}
-void CWriter::printIndexingExpression(Value *Ptr, User::op_iterator I,
- User::op_iterator E) {
+void CWriter::printIndexingExpression(Value *Ptr, gep_type_iterator I,
+ gep_type_iterator E) {
bool HasImplicitAddress = false;
// If accessing a global value with no indexing, avoid *(&GV) syndrome
if (GlobalValue *V = dyn_cast<GlobalValue>(Ptr)) {
HasImplicitAddress = true;
- } else if (ConstantPointerRef *CPR = dyn_cast<ConstantPointerRef>(Ptr)) {
- HasImplicitAddress = true;
- Ptr = CPR->getValue(); // Get to the global...
} else if (isDirectAlloca(Ptr)) {
HasImplicitAddress = true;
}
return;
}
- const Constant *CI = dyn_cast<Constant>(I);
+ const Constant *CI = dyn_cast<Constant>(I.getOperand());
if (HasImplicitAddress && (!CI || !CI->isNullValue()))
Out << "(&";
if (HasImplicitAddress) {
++I;
- } else if (CI && CI->isNullValue() && I+1 != E) {
+ } else if (CI && CI->isNullValue()) {
+ gep_type_iterator TmpI = I; ++TmpI;
+
// Print out the -> operator if possible...
- if ((*(I+1))->getType() == Type::UByteTy) {
+ if (TmpI != E && isa<StructType>(*TmpI)) {
Out << (HasImplicitAddress ? "." : "->");
- Out << "field" << cast<ConstantUInt>(*(I+1))->getValue();
- I += 2;
- }
+ Out << "field" << cast<ConstantUInt>(TmpI.getOperand())->getValue();
+ I = ++TmpI;
+ }
}
for (; I != E; ++I)
- if ((*I)->getType() == Type::LongTy) {
+ if (isa<StructType>(*I)) {
+ Out << ".field" << cast<ConstantUInt>(I.getOperand())->getValue();
+ } else {
Out << "[";
- writeOperand(*I);
+ writeOperand(I.getOperand());
Out << "]";
- } else {
- Out << ".field" << cast<ConstantUInt>(*I)->getValue();
}
}
void CWriter::visitGetElementPtrInst(GetElementPtrInst &I) {
Out << "&";
- printIndexingExpression(I.getPointerOperand(), I.idx_begin(), I.idx_end());
+ printIndexingExpression(I.getPointerOperand(), gep_type_begin(I),
+ gep_type_end(I));
}
-void CWriter::visitVarArgInst(VarArgInst &I) {
- Out << "va_arg((va_list)*";
- writeOperand(I.getOperand(0));
- Out << ", ";
- printType(Out, I.getType(), "", /*ignoreName*/false, /*namedContext*/false);
+void CWriter::visitVANextInst(VANextInst &I) {
+ Out << Mang->getValueName(I.getOperand(0));
+ Out << "; va_arg(*(va_list*)&" << Mang->getValueName(&I) << ", ";
+ printType(Out, I.getArgType());
Out << ")";
}
+void CWriter::visitVAArgInst(VAArgInst &I) {
+ Out << "0;\n";
+ Out << "{ va_list Tmp; va_copy(Tmp, *(va_list*)&";
+ writeOperand(I.getOperand(0));
+ Out << ");\n " << Mang->getValueName(&I) << " = va_arg(Tmp, ";
+ printType(Out, I.getType());
+ Out << ");\n va_end(Tmp); }";
+}
//===----------------------------------------------------------------------===//
// External Interface declaration
//===----------------------------------------------------------------------===//
-Pass *createWriteToCPass(std::ostream &o) { return new CWriter(o); }
+bool CTargetMachine::addPassesToEmitAssembly(PassManager &PM, std::ostream &o) {
+ PM.add(createLowerGCPass());
+ PM.add(createLowerAllocationsPass());
+ PM.add(createLowerInvokePass());
+ PM.add(new CBackendNameAllUsedStructs());
+ PM.add(new CWriter(o, getIntrinsicLowering()));
+ return false;
+}
+
+// vim: sw=2