2002-05-09 21:31:18 +00:00
|
|
|
//===-- Writer.cpp - Library for converting LLVM code to C ----------------===//
|
2003-10-20 19:43:21 +00:00
|
|
|
//
|
|
|
|
// The LLVM Compiler Infrastructure
|
|
|
|
//
|
|
|
|
// 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.
|
|
|
|
//
|
|
|
|
//===----------------------------------------------------------------------===//
|
2002-05-08 18:09:58 +00:00
|
|
|
//
|
2002-09-20 23:26:33 +00:00
|
|
|
// This library converts LLVM code to C code, compilable by GCC.
|
2002-05-09 02:28:59 +00:00
|
|
|
//
|
2003-05-03 03:14:35 +00:00
|
|
|
//===----------------------------------------------------------------------===//
|
2003-05-03 07:11:00 +00:00
|
|
|
|
2002-05-08 18:09:58 +00:00
|
|
|
#include "llvm/Assembly/CWriter.h"
|
|
|
|
#include "llvm/Constants.h"
|
2002-05-09 03:28:37 +00:00
|
|
|
#include "llvm/DerivedTypes.h"
|
|
|
|
#include "llvm/Module.h"
|
2003-04-22 20:19:52 +00:00
|
|
|
#include "llvm/Instructions.h"
|
2002-08-31 00:29:16 +00:00
|
|
|
#include "llvm/Pass.h"
|
2002-05-08 18:09:58 +00:00
|
|
|
#include "llvm/SymbolTable.h"
|
2003-05-08 18:41:45 +00:00
|
|
|
#include "llvm/Intrinsics.h"
|
2002-08-31 00:29:16 +00:00
|
|
|
#include "llvm/Analysis/FindUsedTypes.h"
|
2002-09-20 23:26:33 +00:00
|
|
|
#include "llvm/Analysis/ConstantsScanner.h"
|
2003-11-25 20:49:55 +00:00
|
|
|
#include "llvm/Support/CallSite.h"
|
|
|
|
#include "llvm/Support/GetElementPtrTypeIterator.h"
|
2002-05-08 18:09:58 +00:00
|
|
|
#include "llvm/Support/InstVisitor.h"
|
2002-05-09 20:33:35 +00:00
|
|
|
#include "llvm/Support/InstIterator.h"
|
2003-07-25 20:21:06 +00:00
|
|
|
#include "llvm/Support/Mangler.h"
|
2002-05-08 18:09:58 +00:00
|
|
|
#include "Support/StringExtras.h"
|
|
|
|
#include "Support/STLExtras.h"
|
2003-10-13 17:13:53 +00:00
|
|
|
#include "Config/config.h"
|
2002-05-08 18:09:58 +00:00
|
|
|
#include <algorithm>
|
2002-11-18 20:55:50 +00:00
|
|
|
#include <sstream>
|
2002-10-23 18:59:40 +00:00
|
|
|
|
2003-11-11 22:41:34 +00:00
|
|
|
namespace llvm {
|
|
|
|
|
2002-05-08 18:09:58 +00:00
|
|
|
namespace {
|
2002-08-31 00:29:16 +00:00
|
|
|
class CWriter : public Pass, public InstVisitor<CWriter> {
|
2003-05-03 03:14:35 +00:00
|
|
|
std::ostream &Out;
|
2003-07-24 20:20:44 +00:00
|
|
|
Mangler *Mang;
|
2002-05-08 18:09:58 +00:00
|
|
|
const Module *TheModule;
|
2003-11-02 01:29:27 +00:00
|
|
|
FindUsedTypes *FUT;
|
|
|
|
|
2003-05-03 03:14:35 +00:00
|
|
|
std::map<const Type *, std::string> TypeNames;
|
2002-05-17 04:55:35 +00:00
|
|
|
std::set<const Value*> MangledGlobals;
|
2003-06-28 17:53:05 +00:00
|
|
|
bool needsMalloc, emittedInvoke;
|
2002-09-14 21:36:24 +00:00
|
|
|
|
2003-05-03 03:14:35 +00:00
|
|
|
std::map<const ConstantFP *, unsigned> FPConstantMap;
|
2002-05-08 18:09:58 +00:00
|
|
|
public:
|
2003-05-03 03:14:35 +00:00
|
|
|
CWriter(std::ostream &o) : Out(o) {}
|
2002-08-31 00:29:16 +00:00
|
|
|
|
|
|
|
void getAnalysisUsage(AnalysisUsage &AU) const {
|
|
|
|
AU.setPreservesAll();
|
|
|
|
AU.addRequired<FindUsedTypes>();
|
|
|
|
}
|
|
|
|
|
|
|
|
virtual bool run(Module &M) {
|
|
|
|
// Initialize
|
|
|
|
TheModule = &M;
|
2003-11-02 01:29:27 +00:00
|
|
|
FUT = &getAnalysis<FindUsedTypes>();
|
2002-08-31 00:29:16 +00:00
|
|
|
|
|
|
|
// Ensure that all structure types have names...
|
|
|
|
bool Changed = nameAllUsedStructureTypes(M);
|
2003-07-24 20:20:44 +00:00
|
|
|
Mang = new Mangler(M);
|
2002-08-31 00:29:16 +00:00
|
|
|
|
|
|
|
// Run...
|
|
|
|
printModule(&M);
|
|
|
|
|
|
|
|
// Free memory...
|
2003-07-24 20:20:44 +00:00
|
|
|
delete Mang;
|
2002-08-31 00:29:16 +00:00
|
|
|
TypeNames.clear();
|
|
|
|
MangledGlobals.clear();
|
|
|
|
return false;
|
2002-05-08 18:09:58 +00:00
|
|
|
}
|
|
|
|
|
2003-05-03 03:14:35 +00:00
|
|
|
std::ostream &printType(std::ostream &Out, const Type *Ty,
|
|
|
|
const std::string &VariableName = "",
|
2003-11-03 01:01:59 +00:00
|
|
|
bool IgnoreName = false);
|
2002-05-09 03:06:06 +00:00
|
|
|
|
2002-06-25 15:57:03 +00:00
|
|
|
void writeOperand(Value *Operand);
|
|
|
|
void writeOperandInternal(Value *Operand);
|
2002-05-08 18:09:58 +00:00
|
|
|
|
2002-05-09 20:53:56 +00:00
|
|
|
private :
|
2002-08-31 00:29:16 +00:00
|
|
|
bool nameAllUsedStructureTypes(Module &M);
|
2002-05-09 15:49:41 +00:00
|
|
|
void printModule(Module *M);
|
2003-10-12 04:36:29 +00:00
|
|
|
void printFloatingPointConstants(Module &M);
|
2002-05-08 18:09:58 +00:00
|
|
|
void printSymbolTable(const SymbolTable &ST);
|
2002-09-20 15:05:40 +00:00
|
|
|
void printContainedStructs(const Type *Ty, std::set<const StructType *> &);
|
2002-08-20 16:55:48 +00:00
|
|
|
void printFunctionSignature(const Function *F, bool Prototype);
|
|
|
|
|
2002-05-09 15:49:41 +00:00
|
|
|
void printFunction(Function *);
|
2002-05-09 03:06:06 +00:00
|
|
|
|
2002-08-19 21:32:41 +00:00
|
|
|
void printConstant(Constant *CPV);
|
|
|
|
void printConstantArray(ConstantArray *CPA);
|
|
|
|
|
2002-05-09 21:18:38 +00:00
|
|
|
// isInlinableInst - Attempt to inline instructions into their uses to build
|
|
|
|
// trees as much as possible. To do this, we have to consistently decide
|
|
|
|
// what is acceptable to inline, so that variable declarations don't get
|
|
|
|
// printed and an extra copy of the expr is not emitted.
|
|
|
|
//
|
2002-06-25 15:57:03 +00:00
|
|
|
static bool isInlinableInst(const Instruction &I) {
|
2002-05-09 21:18:38 +00:00
|
|
|
// Must be an expression, must be used exactly once. If it is dead, we
|
|
|
|
// emit it inline where it would go.
|
2003-10-15 16:48:29 +00:00
|
|
|
if (I.getType() == Type::VoidTy || !I.hasOneUse() ||
|
2002-11-06 20:07:54 +00:00
|
|
|
isa<TerminatorInst>(I) || isa<CallInst>(I) || isa<PHINode>(I) ||
|
2003-10-18 05:57:43 +00:00
|
|
|
isa<LoadInst>(I) || isa<VAArgInst>(I) || isa<VANextInst>(I))
|
2003-07-23 20:45:31 +00:00
|
|
|
// Don't inline a load across a store or other bad things!
|
2002-05-09 21:18:38 +00:00
|
|
|
return false;
|
|
|
|
|
|
|
|
// Only inline instruction it it's use is in the same BB as the inst.
|
2002-06-25 15:57:03 +00:00
|
|
|
return I.getParent() == cast<Instruction>(I.use_back())->getParent();
|
2002-05-09 21:18:38 +00:00
|
|
|
}
|
|
|
|
|
2003-06-17 04:39:14 +00:00
|
|
|
// isDirectAlloca - Define fixed sized allocas in the entry block as direct
|
|
|
|
// variables which are accessed with the & operator. This causes GCC to
|
|
|
|
// generate significantly better code than to emit alloca calls directly.
|
|
|
|
//
|
|
|
|
static const AllocaInst *isDirectAlloca(const Value *V) {
|
|
|
|
const AllocaInst *AI = dyn_cast<AllocaInst>(V);
|
|
|
|
if (!AI) return false;
|
|
|
|
if (AI->isArrayAllocation())
|
|
|
|
return 0; // FIXME: we can also inline fixed size array allocas!
|
2003-09-20 14:39:18 +00:00
|
|
|
if (AI->getParent() != &AI->getParent()->getParent()->getEntryBlock())
|
2003-06-17 04:39:14 +00:00
|
|
|
return 0;
|
|
|
|
return AI;
|
|
|
|
}
|
|
|
|
|
2002-05-09 20:53:56 +00:00
|
|
|
// Instruction visitation functions
|
|
|
|
friend class InstVisitor<CWriter>;
|
2002-05-08 18:09:58 +00:00
|
|
|
|
2002-06-25 15:57:03 +00:00
|
|
|
void visitReturnInst(ReturnInst &I);
|
|
|
|
void visitBranchInst(BranchInst &I);
|
2003-04-22 20:19:52 +00:00
|
|
|
void visitSwitchInst(SwitchInst &I);
|
2003-06-28 17:53:05 +00:00
|
|
|
void visitInvokeInst(InvokeInst &I);
|
2003-09-08 18:54:55 +00:00
|
|
|
void visitUnwindInst(UnwindInst &I);
|
2002-05-08 18:09:58 +00:00
|
|
|
|
2003-05-03 07:11:00 +00:00
|
|
|
void visitPHINode(PHINode &I);
|
2002-06-25 15:57:03 +00:00
|
|
|
void visitBinaryOperator(Instruction &I);
|
2002-05-08 18:09:58 +00:00
|
|
|
|
2002-06-25 15:57:03 +00:00
|
|
|
void visitCastInst (CastInst &I);
|
|
|
|
void visitCallInst (CallInst &I);
|
2003-06-28 17:53:05 +00:00
|
|
|
void visitCallSite (CallSite CS);
|
2002-06-25 15:57:03 +00:00
|
|
|
void visitShiftInst(ShiftInst &I) { visitBinaryOperator(I); }
|
2002-05-09 20:53:56 +00:00
|
|
|
|
2002-06-25 15:57:03 +00:00
|
|
|
void visitMallocInst(MallocInst &I);
|
|
|
|
void visitAllocaInst(AllocaInst &I);
|
|
|
|
void visitFreeInst (FreeInst &I);
|
|
|
|
void visitLoadInst (LoadInst &I);
|
|
|
|
void visitStoreInst (StoreInst &I);
|
|
|
|
void visitGetElementPtrInst(GetElementPtrInst &I);
|
2003-10-18 05:57:43 +00:00
|
|
|
void visitVANextInst(VANextInst &I);
|
|
|
|
void visitVAArgInst (VAArgInst &I);
|
2002-05-09 15:49:41 +00:00
|
|
|
|
2002-06-25 15:57:03 +00:00
|
|
|
void visitInstruction(Instruction &I) {
|
2002-06-30 16:07:20 +00:00
|
|
|
std::cerr << "C Writer does not know about " << I;
|
2002-05-09 20:53:56 +00:00
|
|
|
abort();
|
2002-05-09 15:49:41 +00:00
|
|
|
}
|
2002-05-09 20:14:10 +00:00
|
|
|
|
2002-05-09 20:53:56 +00:00
|
|
|
void outputLValue(Instruction *I) {
|
2003-07-24 20:20:44 +00:00
|
|
|
Out << " " << Mang->getValueName(I) << " = ";
|
2002-05-08 18:09:58 +00:00
|
|
|
}
|
2002-05-09 20:53:56 +00:00
|
|
|
void printBranchToBlock(BasicBlock *CurBlock, BasicBlock *SuccBlock,
|
|
|
|
unsigned Indent);
|
2003-11-25 20:49:55 +00:00
|
|
|
void printIndexingExpression(Value *Ptr, gep_type_iterator I,
|
|
|
|
gep_type_iterator E);
|
2002-05-09 20:53:56 +00:00
|
|
|
};
|
2002-05-09 03:50:42 +00:00
|
|
|
|
2002-08-19 22:17:53 +00:00
|
|
|
// Pass the Type* and the variable name and this prints out the variable
|
|
|
|
// declaration.
|
|
|
|
//
|
2003-05-03 03:14:35 +00:00
|
|
|
std::ostream &CWriter::printType(std::ostream &Out, const Type *Ty,
|
|
|
|
const std::string &NameSoFar,
|
2003-11-03 01:01:59 +00:00
|
|
|
bool IgnoreName) {
|
2002-08-19 22:17:53 +00:00
|
|
|
if (Ty->isPrimitiveType())
|
|
|
|
switch (Ty->getPrimitiveID()) {
|
|
|
|
case Type::VoidTyID: return Out << "void " << NameSoFar;
|
|
|
|
case Type::BoolTyID: return Out << "bool " << NameSoFar;
|
|
|
|
case Type::UByteTyID: return Out << "unsigned char " << NameSoFar;
|
|
|
|
case Type::SByteTyID: return Out << "signed char " << NameSoFar;
|
|
|
|
case Type::UShortTyID: return Out << "unsigned short " << NameSoFar;
|
|
|
|
case Type::ShortTyID: return Out << "short " << NameSoFar;
|
|
|
|
case Type::UIntTyID: return Out << "unsigned " << NameSoFar;
|
|
|
|
case Type::IntTyID: return Out << "int " << NameSoFar;
|
|
|
|
case Type::ULongTyID: return Out << "unsigned long long " << NameSoFar;
|
|
|
|
case Type::LongTyID: return Out << "signed long long " << NameSoFar;
|
|
|
|
case Type::FloatTyID: return Out << "float " << NameSoFar;
|
|
|
|
case Type::DoubleTyID: return Out << "double " << NameSoFar;
|
|
|
|
default :
|
|
|
|
std::cerr << "Unknown primitive type: " << Ty << "\n";
|
|
|
|
abort();
|
|
|
|
}
|
|
|
|
|
|
|
|
// Check to see if the type is named.
|
2002-10-16 00:08:22 +00:00
|
|
|
if (!IgnoreName || isa<OpaqueType>(Ty)) {
|
2003-05-03 03:14:35 +00:00
|
|
|
std::map<const Type *, std::string>::iterator I = TypeNames.find(Ty);
|
2003-08-24 21:00:22 +00:00
|
|
|
if (I != TypeNames.end()) return Out << I->second << " " << NameSoFar;
|
2002-10-16 00:08:22 +00:00
|
|
|
}
|
2002-08-19 22:17:53 +00:00
|
|
|
|
|
|
|
switch (Ty->getPrimitiveID()) {
|
|
|
|
case Type::FunctionTyID: {
|
|
|
|
const FunctionType *MTy = cast<FunctionType>(Ty);
|
2003-06-25 04:52:09 +00:00
|
|
|
std::stringstream FunctionInnards;
|
|
|
|
FunctionInnards << " (" << NameSoFar << ") (";
|
2002-08-19 22:17:53 +00:00
|
|
|
for (FunctionType::ParamTypes::const_iterator
|
|
|
|
I = MTy->getParamTypes().begin(),
|
|
|
|
E = MTy->getParamTypes().end(); I != E; ++I) {
|
|
|
|
if (I != MTy->getParamTypes().begin())
|
2003-06-25 04:52:09 +00:00
|
|
|
FunctionInnards << ", ";
|
|
|
|
printType(FunctionInnards, *I, "");
|
2002-08-19 22:17:53 +00:00
|
|
|
}
|
|
|
|
if (MTy->isVarArg()) {
|
|
|
|
if (!MTy->getParamTypes().empty())
|
2003-06-25 04:52:09 +00:00
|
|
|
FunctionInnards << ", ...";
|
2003-05-13 20:15:37 +00:00
|
|
|
} else if (MTy->getParamTypes().empty()) {
|
2003-06-25 04:52:09 +00:00
|
|
|
FunctionInnards << "void";
|
2002-08-19 22:17:53 +00:00
|
|
|
}
|
2003-06-25 04:52:09 +00:00
|
|
|
FunctionInnards << ")";
|
|
|
|
std::string tstr = FunctionInnards.str();
|
2002-11-18 20:55:50 +00:00
|
|
|
printType(Out, MTy->getReturnType(), tstr);
|
|
|
|
return Out;
|
2002-08-19 22:17:53 +00:00
|
|
|
}
|
|
|
|
case Type::StructTyID: {
|
|
|
|
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) {
|
|
|
|
Out << " ";
|
2002-11-18 20:55:50 +00:00
|
|
|
printType(Out, *I, "field" + utostr(Idx++));
|
2002-08-19 22:17:53 +00:00
|
|
|
Out << ";\n";
|
|
|
|
}
|
|
|
|
return Out << "}";
|
|
|
|
}
|
|
|
|
|
|
|
|
case Type::PointerTyID: {
|
|
|
|
const PointerType *PTy = cast<PointerType>(Ty);
|
2002-08-25 20:00:08 +00:00
|
|
|
std::string ptrName = "*" + NameSoFar;
|
|
|
|
|
2003-11-03 04:31:54 +00:00
|
|
|
if (isa<ArrayType>(PTy->getElementType()))
|
|
|
|
ptrName = "(" + ptrName + ")";
|
2002-08-25 20:00:08 +00:00
|
|
|
|
2002-11-18 20:55:50 +00:00
|
|
|
return printType(Out, PTy->getElementType(), ptrName);
|
2003-07-21 16:34:35 +00:00
|
|
|
}
|
2002-08-19 22:17:53 +00:00
|
|
|
|
|
|
|
case Type::ArrayTyID: {
|
|
|
|
const ArrayType *ATy = cast<ArrayType>(Ty);
|
|
|
|
unsigned NumElements = ATy->getNumElements();
|
2002-11-18 20:55:50 +00:00
|
|
|
return printType(Out, ATy->getElementType(),
|
2002-08-19 22:17:53 +00:00
|
|
|
NameSoFar + "[" + utostr(NumElements) + "]");
|
|
|
|
}
|
2002-10-16 00:08:22 +00:00
|
|
|
|
|
|
|
case Type::OpaqueTyID: {
|
|
|
|
static int Count = 0;
|
2003-05-03 03:14:35 +00:00
|
|
|
std::string TyName = "struct opaque_" + itostr(Count++);
|
2002-10-16 00:08:22 +00:00
|
|
|
assert(TypeNames.find(Ty) == TypeNames.end());
|
|
|
|
TypeNames[Ty] = TyName;
|
|
|
|
return Out << TyName << " " << NameSoFar;
|
|
|
|
}
|
2002-08-19 22:17:53 +00:00
|
|
|
default:
|
|
|
|
assert(0 && "Unhandled case in getTypeProps!");
|
|
|
|
abort();
|
|
|
|
}
|
|
|
|
|
|
|
|
return Out;
|
|
|
|
}
|
|
|
|
|
2002-08-19 21:32:41 +00:00
|
|
|
void CWriter::printConstantArray(ConstantArray *CPA) {
|
|
|
|
|
|
|
|
// As a special case, print the array as a string if it is an array of
|
|
|
|
// ubytes or an array of sbytes with positive values.
|
|
|
|
//
|
|
|
|
const Type *ETy = CPA->getType()->getElementType();
|
|
|
|
bool isString = (ETy == Type::SByteTy || ETy == Type::UByteTy);
|
|
|
|
|
|
|
|
// Make sure the last character is a null char, as automatically added by C
|
2003-06-16 12:09:09 +00:00
|
|
|
if (isString && (CPA->getNumOperands() == 0 ||
|
|
|
|
!cast<Constant>(*(CPA->op_end()-1))->isNullValue()))
|
2002-08-19 21:32:41 +00:00
|
|
|
isString = false;
|
|
|
|
|
|
|
|
if (isString) {
|
|
|
|
Out << "\"";
|
2003-06-16 12:09:09 +00:00
|
|
|
// Keep track of whether the last number was a hexadecimal escape
|
|
|
|
bool LastWasHex = false;
|
|
|
|
|
2002-08-19 21:32:41 +00:00
|
|
|
// Do not include the last character, which we know is null
|
|
|
|
for (unsigned i = 0, e = CPA->getNumOperands()-1; i != e; ++i) {
|
2003-07-23 15:22:26 +00:00
|
|
|
unsigned char C = cast<ConstantInt>(CPA->getOperand(i))->getRawValue();
|
2002-08-19 21:32:41 +00:00
|
|
|
|
2003-06-16 12:09:09 +00:00
|
|
|
// 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
|
|
|
|
// code, in which case we have to be careful not to print out hex digits
|
2003-06-16 12:21:19 +00:00
|
|
|
// explicitly (the C compiler thinks it is a continuation of the previous
|
|
|
|
// character, sheesh...)
|
2003-06-16 12:09:09 +00:00
|
|
|
//
|
|
|
|
if (isprint(C) && (!LastWasHex || !isxdigit(C))) {
|
|
|
|
LastWasHex = false;
|
2002-11-06 21:40:23 +00:00
|
|
|
if (C == '"' || C == '\\')
|
|
|
|
Out << "\\" << C;
|
2002-09-30 21:11:55 +00:00
|
|
|
else
|
|
|
|
Out << C;
|
2002-08-19 21:32:41 +00:00
|
|
|
} else {
|
2003-06-16 12:09:09 +00:00
|
|
|
LastWasHex = false;
|
2002-08-19 21:32:41 +00:00
|
|
|
switch (C) {
|
|
|
|
case '\n': Out << "\\n"; break;
|
|
|
|
case '\t': Out << "\\t"; break;
|
|
|
|
case '\r': Out << "\\r"; break;
|
|
|
|
case '\v': Out << "\\v"; break;
|
|
|
|
case '\a': Out << "\\a"; break;
|
2002-09-30 21:11:55 +00:00
|
|
|
case '\"': Out << "\\\""; break;
|
|
|
|
case '\'': Out << "\\\'"; break;
|
2002-08-19 21:32:41 +00:00
|
|
|
default:
|
|
|
|
Out << "\\x";
|
2003-06-16 12:09:09 +00:00
|
|
|
Out << (char)(( C/16 < 10) ? ( C/16 +'0') : ( C/16 -10+'A'));
|
|
|
|
Out << (char)(((C&15) < 10) ? ((C&15)+'0') : ((C&15)-10+'A'));
|
|
|
|
LastWasHex = true;
|
2002-08-19 21:32:41 +00:00
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
Out << "\"";
|
|
|
|
} else {
|
|
|
|
Out << "{";
|
|
|
|
if (CPA->getNumOperands()) {
|
|
|
|
Out << " ";
|
|
|
|
printConstant(cast<Constant>(CPA->getOperand(0)));
|
|
|
|
for (unsigned i = 1, e = CPA->getNumOperands(); i != e; ++i) {
|
|
|
|
Out << ", ";
|
|
|
|
printConstant(cast<Constant>(CPA->getOperand(i)));
|
|
|
|
}
|
|
|
|
}
|
|
|
|
Out << " }";
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2003-10-05 00:40:51 +00:00
|
|
|
// 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).
|
|
|
|
//
|
2003-11-11 22:41:34 +00:00
|
|
|
bool isFPCSafeToPrint(const ConstantFP *CFP) {
|
2003-10-13 17:13:53 +00:00
|
|
|
#if HAVE_PRINTF_A
|
2003-10-12 08:12:58 +00:00
|
|
|
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
|
2003-06-17 23:55:35 +00:00
|
|
|
std::string StrVal = ftostr(CFP->getValue());
|
2003-10-12 04:36:29 +00:00
|
|
|
|
|
|
|
while (StrVal[0] == ' ')
|
|
|
|
StrVal.erase(StrVal.begin());
|
|
|
|
|
2003-10-05 00:40:51 +00:00
|
|
|
// 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.
|
2003-06-17 23:55:35 +00:00
|
|
|
if ((StrVal[0] >= '0' && StrVal[0] <= '9') ||
|
|
|
|
((StrVal[0] == '-' || StrVal[0] == '+') &&
|
|
|
|
(StrVal[1] >= '0' && StrVal[1] <= '9')))
|
|
|
|
// Reparse stringized version!
|
2003-10-05 00:40:51 +00:00
|
|
|
return atof(StrVal.c_str()) == CFP->getValue();
|
2003-06-17 23:55:35 +00:00
|
|
|
return false;
|
2003-10-12 08:12:58 +00:00
|
|
|
#endif
|
2003-06-17 23:55:35 +00:00
|
|
|
}
|
2002-08-19 21:32:41 +00:00
|
|
|
|
|
|
|
// printConstant - The LLVM Constant to C Constant converter.
|
|
|
|
void CWriter::printConstant(Constant *CPV) {
|
|
|
|
if (const ConstantExpr *CE = dyn_cast<ConstantExpr>(CPV)) {
|
|
|
|
switch (CE->getOpcode()) {
|
2002-08-19 23:09:46 +00:00
|
|
|
case Instruction::Cast:
|
|
|
|
Out << "((";
|
2002-11-18 20:55:50 +00:00
|
|
|
printType(Out, CPV->getType());
|
2002-08-19 23:09:46 +00:00
|
|
|
Out << ")";
|
2003-05-14 17:50:19 +00:00
|
|
|
printConstant(CE->getOperand(0));
|
2002-08-19 23:09:46 +00:00
|
|
|
Out << ")";
|
|
|
|
return;
|
|
|
|
|
|
|
|
case Instruction::GetElementPtr:
|
2002-10-03 20:47:24 +00:00
|
|
|
Out << "(&(";
|
2003-11-25 20:49:55 +00:00
|
|
|
printIndexingExpression(CE->getOperand(0), gep_type_begin(CPV),
|
|
|
|
gep_type_end(CPV));
|
2002-10-03 20:47:24 +00:00
|
|
|
Out << "))";
|
2002-08-19 23:09:46 +00:00
|
|
|
return;
|
|
|
|
case Instruction::Add:
|
|
|
|
case Instruction::Sub:
|
2003-08-14 19:19:53 +00:00
|
|
|
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:
|
2003-11-22 05:02:56 +00:00
|
|
|
case Instruction::Shl:
|
|
|
|
case Instruction::Shr:
|
2002-08-19 23:09:46 +00:00
|
|
|
Out << "(";
|
2003-05-14 17:50:19 +00:00
|
|
|
printConstant(CE->getOperand(0));
|
2003-08-14 19:19:53 +00:00
|
|
|
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;
|
2003-11-22 05:02:56 +00:00
|
|
|
case Instruction::Shl: Out << " << "; break;
|
|
|
|
case Instruction::Shr: Out << " >> "; break;
|
2003-08-14 19:19:53 +00:00
|
|
|
default: assert(0 && "Illegal opcode here!");
|
|
|
|
}
|
2003-05-14 17:50:19 +00:00
|
|
|
printConstant(CE->getOperand(1));
|
2002-08-19 23:09:46 +00:00
|
|
|
Out << ")";
|
|
|
|
return;
|
|
|
|
|
2002-08-19 21:32:41 +00:00
|
|
|
default:
|
|
|
|
std::cerr << "CWriter Error: Unhandled constant expression: "
|
|
|
|
<< CE << "\n";
|
|
|
|
abort();
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
switch (CPV->getType()->getPrimitiveID()) {
|
|
|
|
case Type::BoolTyID:
|
|
|
|
Out << (CPV == ConstantBool::False ? "0" : "1"); break;
|
|
|
|
case Type::SByteTyID:
|
|
|
|
case Type::ShortTyID:
|
|
|
|
Out << cast<ConstantSInt>(CPV)->getValue(); break;
|
2003-05-12 15:39:31 +00:00
|
|
|
case Type::IntTyID:
|
|
|
|
if ((int)cast<ConstantSInt>(CPV)->getValue() == (int)0x80000000)
|
|
|
|
Out << "((int)0x80000000)"; // Handle MININT specially to avoid warning
|
|
|
|
else
|
|
|
|
Out << cast<ConstantSInt>(CPV)->getValue();
|
|
|
|
break;
|
|
|
|
|
2002-08-19 21:32:41 +00:00
|
|
|
case Type::LongTyID:
|
|
|
|
Out << cast<ConstantSInt>(CPV)->getValue() << "ll"; break;
|
|
|
|
|
|
|
|
case Type::UByteTyID:
|
|
|
|
case Type::UShortTyID:
|
|
|
|
Out << cast<ConstantUInt>(CPV)->getValue(); break;
|
|
|
|
case Type::UIntTyID:
|
|
|
|
Out << cast<ConstantUInt>(CPV)->getValue() << "u"; break;
|
|
|
|
case Type::ULongTyID:
|
|
|
|
Out << cast<ConstantUInt>(CPV)->getValue() << "ull"; break;
|
|
|
|
|
|
|
|
case Type::FloatTyID:
|
2002-09-20 23:26:33 +00:00
|
|
|
case Type::DoubleTyID: {
|
|
|
|
ConstantFP *FPC = cast<ConstantFP>(CPV);
|
2003-05-03 03:14:35 +00:00
|
|
|
std::map<const ConstantFP*, unsigned>::iterator I = FPConstantMap.find(FPC);
|
2002-09-20 23:26:33 +00:00
|
|
|
if (I != FPConstantMap.end()) {
|
|
|
|
// 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")
|
2003-10-12 04:36:29 +00:00
|
|
|
<< "*)&FPConstant" << I->second << ")";
|
2002-09-20 23:26:33 +00:00
|
|
|
} else {
|
2003-10-13 17:13:53 +00:00
|
|
|
#if HAVE_PRINTF_A
|
2003-10-05 00:40:51 +00:00
|
|
|
// Print out the constant as a floating point number.
|
2003-10-12 08:12:58 +00:00
|
|
|
char Buffer[100];
|
|
|
|
sprintf(Buffer, "%a", FPC->getValue());
|
|
|
|
Out << Buffer << " /*" << FPC->getValue() << "*/ ";
|
|
|
|
#else
|
2003-10-05 00:40:51 +00:00
|
|
|
Out << ftostr(FPC->getValue());
|
2003-10-12 08:12:58 +00:00
|
|
|
#endif
|
2002-09-20 23:26:33 +00:00
|
|
|
}
|
|
|
|
break;
|
|
|
|
}
|
2002-08-19 21:32:41 +00:00
|
|
|
|
|
|
|
case Type::ArrayTyID:
|
|
|
|
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)));
|
|
|
|
}
|
|
|
|
}
|
|
|
|
Out << " }";
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
|
|
|
case Type::PointerTyID:
|
2002-05-09 20:53:56 +00:00
|
|
|
if (isa<ConstantPointerNull>(CPV)) {
|
2003-06-02 03:10:53 +00:00
|
|
|
Out << "((";
|
|
|
|
printType(Out, CPV->getType());
|
|
|
|
Out << ")/*NULL*/0)";
|
2002-08-19 21:32:41 +00:00
|
|
|
break;
|
|
|
|
} else if (ConstantPointerRef *CPR = dyn_cast<ConstantPointerRef>(CPV)) {
|
|
|
|
writeOperand(CPR->getValue());
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
// FALL THROUGH
|
|
|
|
default:
|
|
|
|
std::cerr << "Unknown constant type: " << CPV << "\n";
|
|
|
|
abort();
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
void CWriter::writeOperandInternal(Value *Operand) {
|
2002-08-19 23:09:46 +00:00
|
|
|
if (Instruction *I = dyn_cast<Instruction>(Operand))
|
2003-06-17 04:39:14 +00:00
|
|
|
if (isInlinableInst(*I) && !isDirectAlloca(I)) {
|
2002-08-19 23:09:46 +00:00
|
|
|
// Should we inline this instruction to build a tree?
|
|
|
|
Out << "(";
|
|
|
|
visit(*I);
|
|
|
|
Out << ")";
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
2003-07-24 20:20:44 +00:00
|
|
|
if (Constant *CPV = dyn_cast<Constant>(Operand)) {
|
2002-08-19 21:32:41 +00:00
|
|
|
printConstant(CPV);
|
2002-05-09 20:53:56 +00:00
|
|
|
} else {
|
2003-07-24 20:20:44 +00:00
|
|
|
Out << Mang->getValueName(Operand);
|
2002-05-09 20:53:56 +00:00
|
|
|
}
|
2002-05-09 21:18:38 +00:00
|
|
|
}
|
|
|
|
|
2002-06-25 15:57:03 +00:00
|
|
|
void CWriter::writeOperand(Value *Operand) {
|
2003-06-17 04:39:14 +00:00
|
|
|
if (isa<GlobalVariable>(Operand) || isDirectAlloca(Operand))
|
2002-05-09 21:18:38 +00:00
|
|
|
Out << "(&"; // Global variables are references as their addresses by llvm
|
|
|
|
|
|
|
|
writeOperandInternal(Operand);
|
2002-05-09 20:53:56 +00:00
|
|
|
|
2003-06-17 04:39:14 +00:00
|
|
|
if (isa<GlobalVariable>(Operand) || isDirectAlloca(Operand))
|
2002-05-09 20:53:56 +00:00
|
|
|
Out << ")";
|
|
|
|
}
|
|
|
|
|
2002-08-31 00:29:16 +00:00
|
|
|
// 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.
|
|
|
|
//
|
|
|
|
bool CWriter::nameAllUsedStructureTypes(Module &M) {
|
|
|
|
// Get a set of types that are used by the program...
|
2003-11-02 01:29:27 +00:00
|
|
|
std::set<const Type *> UT = FUT->getTypes();
|
2002-08-31 00:29:16 +00:00
|
|
|
|
|
|
|
// Loop over the module symbol table, removing types from UT that are already
|
|
|
|
// named.
|
|
|
|
//
|
2002-11-20 18:36:02 +00:00
|
|
|
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)
|
2002-08-31 00:29:16 +00:00
|
|
|
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)) {
|
2002-11-20 18:36:02 +00:00
|
|
|
((Value*)ST)->setName("unnamed", &MST);
|
2002-08-31 00:29:16 +00:00
|
|
|
Changed = true;
|
|
|
|
}
|
|
|
|
return Changed;
|
|
|
|
}
|
|
|
|
|
2003-06-28 17:15:12 +00:00
|
|
|
// generateCompilerSpecificCode - This is where we add conditional compilation
|
|
|
|
// directives to cater to specific compilers as need be.
|
|
|
|
//
|
2003-11-16 22:06:14 +00:00
|
|
|
static void generateCompilerSpecificCode(std::ostream& Out) {
|
2003-06-28 17:15:12 +00:00
|
|
|
// Alloca is hard to get, and we don't want to include stdlib.h here...
|
|
|
|
Out << "/* get a declaration for alloca */\n"
|
|
|
|
<< "#ifdef sun\n"
|
2003-02-12 20:45:00 +00:00
|
|
|
<< "extern void *__builtin_alloca(unsigned long);\n"
|
|
|
|
<< "#define alloca(x) __builtin_alloca(x)\n"
|
|
|
|
<< "#else\n"
|
2003-06-16 23:57:13 +00:00
|
|
|
<< "#ifndef __FreeBSD__\n"
|
2003-02-12 20:45:00 +00:00
|
|
|
<< "#include <alloca.h>\n"
|
2003-06-16 23:57:13 +00:00
|
|
|
<< "#endif\n"
|
2003-02-12 20:45:00 +00:00
|
|
|
<< "#endif\n\n";
|
2003-06-28 17:15:12 +00:00
|
|
|
|
|
|
|
// We output GCC specific attributes to preserve 'linkonce'ness on globals.
|
|
|
|
// If we aren't being compiled with GCC, just drop these attributes.
|
2003-06-28 17:53:05 +00:00
|
|
|
Out << "#ifndef __GNUC__ /* Can only support \"linkonce\" vars with GCC */\n"
|
2003-06-28 17:15:12 +00:00
|
|
|
<< "#define __attribute__(X)\n"
|
2003-12-11 00:24:36 +00:00
|
|
|
<< "#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";
|
2003-02-12 20:45:00 +00:00
|
|
|
}
|
|
|
|
|
2003-11-16 22:06:14 +00:00
|
|
|
// generateProcessorSpecificCode - This is where we add conditional compilation
|
|
|
|
// directives to cater to specific processors as need be.
|
|
|
|
//
|
|
|
|
static void generateProcessorSpecificCode(std::ostream& Out) {
|
|
|
|
// According to ANSI C, longjmp'ing to a setjmp could invalidate any
|
|
|
|
// non-volatile variable in the scope of the setjmp. For now, we are not
|
|
|
|
// doing analysis to determine which variables need to be marked volatile, so
|
|
|
|
// we just mark them all.
|
|
|
|
//
|
|
|
|
// HOWEVER, many targets implement setjmp by saving and restoring the register
|
|
|
|
// file, so they DON'T need variables to be marked volatile, and this is a
|
|
|
|
// HUGE pessimization for them. For this reason, on known-good processors, we
|
|
|
|
// do not emit volatile qualifiers.
|
|
|
|
Out << "#if defined(__386__) || defined(__i386__) || \\\n"
|
|
|
|
<< " defined(i386) || defined(WIN32)\n"
|
|
|
|
<< "/* setjmp does not require variables to be marked volatile */"
|
|
|
|
<< "#define VOLATILE_FOR_SETJMP\n"
|
|
|
|
<< "#else\n"
|
|
|
|
<< "#define VOLATILE_FOR_SETJMP volatile\n"
|
|
|
|
<< "#endif\n\n";
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2002-05-09 15:49:41 +00:00
|
|
|
void CWriter::printModule(Module *M) {
|
2002-05-17 04:55:35 +00:00
|
|
|
// Calculate which global values have names that will collide when we throw
|
|
|
|
// away type information.
|
2002-05-21 21:10:04 +00:00
|
|
|
{ // Scope to delete the FoundNames set when we are done with it...
|
2003-05-03 03:14:35 +00:00
|
|
|
std::set<std::string> FoundNames;
|
2002-05-17 04:55:35 +00:00
|
|
|
for (Module::iterator I = M->begin(), E = M->end(); I != E; ++I)
|
2002-06-25 15:57:03 +00:00
|
|
|
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
|
2002-05-17 04:55:35 +00:00
|
|
|
else
|
2002-06-25 15:57:03 +00:00
|
|
|
FoundNames.insert(I->getName()); // Otherwise, keep track of name
|
2002-05-17 04:55:35 +00:00
|
|
|
|
|
|
|
for (Module::giterator I = M->gbegin(), E = M->gend(); I != E; ++I)
|
2002-06-25 15:57:03 +00:00
|
|
|
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
|
2002-05-17 04:55:35 +00:00
|
|
|
else
|
2002-06-25 15:57:03 +00:00
|
|
|
FoundNames.insert(I->getName()); // Otherwise, keep track of name
|
2002-05-17 04:55:35 +00:00
|
|
|
}
|
|
|
|
|
2002-05-09 02:28:59 +00:00
|
|
|
// get declaration for alloca
|
2003-02-12 20:45:00 +00:00
|
|
|
Out << "/* Provide Declarations */\n";
|
2003-11-16 22:06:14 +00:00
|
|
|
Out << "#include <stdarg.h>\n"; // Varargs support
|
|
|
|
Out << "#include <setjmp.h>\n"; // Unwind support
|
2003-06-28 17:15:12 +00:00
|
|
|
generateCompilerSpecificCode(Out);
|
2003-11-16 22:06:14 +00:00
|
|
|
generateProcessorSpecificCode(Out);
|
|
|
|
|
2003-06-02 03:10:53 +00:00
|
|
|
// Provide a definition for `bool' if not compiling with a C++ compiler.
|
|
|
|
Out << "\n"
|
2002-08-25 20:00:08 +00:00
|
|
|
<< "#ifndef __cplusplus\ntypedef unsigned char bool;\n#endif\n"
|
2003-02-12 20:45:00 +00:00
|
|
|
|
2002-09-20 23:26:33 +00:00
|
|
|
<< "\n\n/* Support for floating point constants */\n"
|
|
|
|
<< "typedef unsigned long long ConstantDoubleTy;\n"
|
2002-11-07 19:43:59 +00:00
|
|
|
<< "typedef unsigned int ConstantFloatTy;\n"
|
2003-02-12 20:45:00 +00:00
|
|
|
|
2003-06-28 17:53:05 +00:00
|
|
|
<< "\n\n/* Support for the invoke instruction */\n"
|
|
|
|
<< "extern struct __llvm_jmpbuf_list_t {\n"
|
|
|
|
<< " jmp_buf buf; struct __llvm_jmpbuf_list_t *next;\n"
|
|
|
|
<< "} *__llvm_jmpbuf_list;\n"
|
|
|
|
|
2002-08-19 21:48:40 +00:00
|
|
|
<< "\n\n/* Global Declarations */\n";
|
|
|
|
|
|
|
|
// First output all the declarations for the program, because C requires
|
|
|
|
// Functions & globals to be declared before they are used.
|
|
|
|
//
|
2002-05-09 02:28:59 +00:00
|
|
|
|
2002-05-08 18:09:58 +00:00
|
|
|
// Loop over the symbol table, emitting all named constants...
|
2002-11-20 18:36:02 +00:00
|
|
|
printSymbolTable(M->getSymbolTable());
|
2002-05-08 18:09:58 +00:00
|
|
|
|
2002-08-19 21:48:40 +00:00
|
|
|
// Global variable declarations...
|
|
|
|
if (!M->gempty()) {
|
2002-09-17 11:50:38 +00:00
|
|
|
Out << "\n/* External Global Variable Declarations */\n";
|
2002-08-19 21:48:40 +00:00
|
|
|
for (Module::giterator I = M->gbegin(), E = M->gend(); I != E; ++I) {
|
2002-09-17 11:50:38 +00:00
|
|
|
if (I->hasExternalLinkage()) {
|
|
|
|
Out << "extern ";
|
2003-07-24 20:20:44 +00:00
|
|
|
printType(Out, I->getType()->getElementType(), Mang->getValueName(I));
|
2002-09-17 11:50:38 +00:00
|
|
|
Out << ";\n";
|
|
|
|
}
|
2002-08-19 21:48:40 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
// Function declarations
|
|
|
|
if (!M->empty()) {
|
|
|
|
Out << "\n/* Function Declarations */\n";
|
2002-10-23 18:59:40 +00:00
|
|
|
needsMalloc = true;
|
2002-08-20 16:55:48 +00:00
|
|
|
for (Module::iterator I = M->begin(), E = M->end(); I != E; ++I) {
|
2002-11-18 22:21:52 +00:00
|
|
|
// If the function is external and the name collides don't print it.
|
2003-05-08 18:41:45 +00:00
|
|
|
// Sometimes the bytecode likes to have multiple "declarations" for
|
2003-05-03 03:14:35 +00:00
|
|
|
// external functions
|
2003-05-08 18:41:45 +00:00
|
|
|
if ((I->hasInternalLinkage() || !MangledGlobals.count(I)) &&
|
|
|
|
!I->getIntrinsicID()) {
|
2002-11-18 22:21:52 +00:00
|
|
|
printFunctionSignature(I, true);
|
2003-12-11 00:24:36 +00:00
|
|
|
if (I->hasWeakLinkage()) Out << " __ATTRIBUTE_WEAK__";
|
2002-11-18 22:21:52 +00:00
|
|
|
Out << ";\n";
|
|
|
|
}
|
2002-08-20 16:55:48 +00:00
|
|
|
}
|
2002-08-19 21:48:40 +00:00
|
|
|
}
|
2002-05-09 15:18:52 +00:00
|
|
|
|
2002-10-23 18:59:40 +00:00
|
|
|
// Print Malloc prototype if needed
|
2003-07-09 17:33:50 +00:00
|
|
|
if (needsMalloc) {
|
2002-10-23 18:59:40 +00:00
|
|
|
Out << "\n/* Malloc to make sun happy */\n";
|
2003-07-08 14:52:09 +00:00
|
|
|
Out << "extern void * malloc();\n\n";
|
2002-10-23 18:59:40 +00:00
|
|
|
}
|
|
|
|
|
2003-06-25 04:52:09 +00:00
|
|
|
// Output the global variable declarations
|
2002-10-28 19:05:12 +00:00
|
|
|
if (!M->gempty()) {
|
2003-06-25 04:52:09 +00:00
|
|
|
Out << "\n\n/* Global Variable Declarations */\n";
|
2002-10-28 19:05:12 +00:00
|
|
|
for (Module::giterator I = M->gbegin(), E = M->gend(); I != E; ++I)
|
|
|
|
if (!I->isExternal()) {
|
|
|
|
Out << "extern ";
|
2003-07-24 20:20:44 +00:00
|
|
|
printType(Out, I->getType()->getElementType(), Mang->getValueName(I));
|
2003-11-03 17:32:38 +00:00
|
|
|
|
|
|
|
if (I->hasLinkOnceLinkage())
|
|
|
|
Out << " __attribute__((common))";
|
|
|
|
else if (I->hasWeakLinkage())
|
2003-12-11 00:24:36 +00:00
|
|
|
Out << " __ATTRIBUTE_WEAK__";
|
2002-10-28 19:05:12 +00:00
|
|
|
Out << ";\n";
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2002-09-17 11:50:38 +00:00
|
|
|
// Output the global variable definitions and contents...
|
2002-08-19 21:48:40 +00:00
|
|
|
if (!M->gempty()) {
|
2002-09-17 11:50:38 +00:00
|
|
|
Out << "\n\n/* Global Variable Definitions and Initialization */\n";
|
2002-10-16 20:08:47 +00:00
|
|
|
for (Module::giterator I = M->gbegin(), E = M->gend(); I != E; ++I)
|
|
|
|
if (!I->isExternal()) {
|
|
|
|
if (I->hasInternalLinkage())
|
|
|
|
Out << "static ";
|
2003-07-24 20:20:44 +00:00
|
|
|
printType(Out, I->getType()->getElementType(), Mang->getValueName(I));
|
2003-06-28 17:08:36 +00:00
|
|
|
if (I->hasLinkOnceLinkage())
|
|
|
|
Out << " __attribute__((common))";
|
2003-10-16 18:29:00 +00:00
|
|
|
else if (I->hasWeakLinkage())
|
2003-12-11 00:24:36 +00:00
|
|
|
Out << " __ATTRIBUTE_WEAK__";
|
2003-11-03 17:35:00 +00:00
|
|
|
|
|
|
|
// 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() ||
|
|
|
|
I->hasWeakLinkage()) {
|
2003-06-06 07:10:24 +00:00
|
|
|
Out << " = " ;
|
|
|
|
writeOperand(I->getInitializer());
|
|
|
|
}
|
2002-10-16 20:08:47 +00:00
|
|
|
Out << ";\n";
|
2002-08-19 21:48:40 +00:00
|
|
|
}
|
2002-05-09 15:18:52 +00:00
|
|
|
}
|
2002-05-08 18:09:58 +00:00
|
|
|
|
2003-10-12 04:36:29 +00:00
|
|
|
// Output all floating point constants that cannot be printed accurately...
|
|
|
|
printFloatingPointConstants(*M);
|
|
|
|
|
2002-05-09 02:28:59 +00:00
|
|
|
// Output all of the functions...
|
2003-06-28 17:53:05 +00:00
|
|
|
emittedInvoke = false;
|
2002-08-19 21:48:40 +00:00
|
|
|
if (!M->empty()) {
|
|
|
|
Out << "\n\n/* Function Bodies */\n";
|
|
|
|
for (Module::iterator I = M->begin(), E = M->end(); I != E; ++I)
|
|
|
|
printFunction(I);
|
|
|
|
}
|
2003-06-28 17:53:05 +00:00
|
|
|
|
|
|
|
// If the program included an invoke instruction, we need to output the
|
|
|
|
// support code for it here!
|
|
|
|
if (emittedInvoke) {
|
|
|
|
Out << "\n/* More support for the invoke instruction */\n"
|
|
|
|
<< "struct __llvm_jmpbuf_list_t *__llvm_jmpbuf_list "
|
|
|
|
<< "__attribute__((common)) = 0;\n";
|
|
|
|
}
|
2003-10-12 04:36:29 +00:00
|
|
|
|
|
|
|
// Done with global FP constants
|
|
|
|
FPConstantMap.clear();
|
2002-05-08 18:09:58 +00:00
|
|
|
}
|
|
|
|
|
2003-10-12 04:36:29 +00:00
|
|
|
/// Output all floating point constants that cannot be printed accurately...
|
|
|
|
void CWriter::printFloatingPointConstants(Module &M) {
|
|
|
|
union {
|
|
|
|
double D;
|
|
|
|
unsigned long long 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.
|
|
|
|
//
|
|
|
|
unsigned FPCounter = 0;
|
|
|
|
for (Module::iterator F = M.begin(), E = M.end(); F != E; ++F)
|
|
|
|
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 << "const ConstantDoubleTy FPConstant" << FPCounter++
|
|
|
|
<< " = 0x" << std::hex << DBLUnion.U << std::dec
|
|
|
|
<< "ULL; /* " << Val << " */\n";
|
|
|
|
} else if (FPC->getType() == Type::FloatTy) {
|
|
|
|
FLTUnion.F = Val;
|
|
|
|
Out << "const ConstantFloatTy FPConstant" << FPCounter++
|
|
|
|
<< " = 0x" << std::hex << FLTUnion.U << std::dec
|
|
|
|
<< "U; /* " << Val << " */\n";
|
|
|
|
} else
|
|
|
|
assert(0 && "Unknown float type!");
|
|
|
|
}
|
|
|
|
|
|
|
|
Out << "\n";
|
|
|
|
}
|
|
|
|
|
2002-05-08 18:09:58 +00:00
|
|
|
|
2002-09-20 15:12:13 +00:00
|
|
|
/// printSymbolTable - Run through symbol table looking for type names. If a
|
|
|
|
/// type name is found, emit it's declaration...
|
2002-09-20 14:56:54 +00:00
|
|
|
///
|
2002-05-08 18:09:58 +00:00
|
|
|
void CWriter::printSymbolTable(const SymbolTable &ST) {
|
2002-09-20 15:12:13 +00:00
|
|
|
// If there are no type names, exit early.
|
|
|
|
if (ST.find(Type::TypeTy) == ST.end())
|
|
|
|
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);
|
|
|
|
|
2002-09-20 15:18:30 +00:00
|
|
|
// Print out forward declarations for structure types before anything else!
|
|
|
|
Out << "/* Structure forward decls */\n";
|
|
|
|
for (; I != End; ++I)
|
2003-11-02 01:29:27 +00:00
|
|
|
if (const Type *STy = dyn_cast<StructType>(I->second))
|
|
|
|
// Only print out used types!
|
|
|
|
if (FUT->getTypes().count(STy)) {
|
|
|
|
std::string Name = "struct l_" + Mangler::makeNameProper(I->first);
|
|
|
|
Out << Name << ";\n";
|
|
|
|
TypeNames.insert(std::make_pair(STy, Name));
|
|
|
|
}
|
2002-09-20 15:18:30 +00:00
|
|
|
|
|
|
|
Out << "\n";
|
|
|
|
|
|
|
|
// Now we can print out typedefs...
|
|
|
|
Out << "/* Typedefs */\n";
|
2003-11-02 01:29:27 +00:00
|
|
|
for (I = ST.type_begin(Type::TypeTy); I != End; ++I)
|
|
|
|
// Only print out used types!
|
|
|
|
if (FUT->getTypes().count(cast<Type>(I->second))) {
|
|
|
|
const Type *Ty = cast<Type>(I->second);
|
|
|
|
std::string Name = "l_" + Mangler::makeNameProper(I->first);
|
|
|
|
Out << "typedef ";
|
|
|
|
printType(Out, Ty, Name);
|
|
|
|
Out << ";\n";
|
|
|
|
}
|
|
|
|
|
2002-05-09 14:40:11 +00:00
|
|
|
Out << "\n";
|
|
|
|
|
2002-09-20 15:05:40 +00:00
|
|
|
// Keep track of which structures have been printed so far...
|
|
|
|
std::set<const StructType *> StructPrinted;
|
|
|
|
|
2002-09-14 21:36:24 +00:00
|
|
|
// Loop over all structures then push them into the stack so they are
|
|
|
|
// printed in the correct order.
|
2002-09-20 15:12:13 +00:00
|
|
|
//
|
2002-09-20 15:18:30 +00:00
|
|
|
Out << "/* Structure contents */\n";
|
2002-09-20 15:12:13 +00:00
|
|
|
for (I = ST.type_begin(Type::TypeTy); I != End; ++I)
|
|
|
|
if (const StructType *STy = dyn_cast<StructType>(I->second))
|
2003-11-02 01:29:27 +00:00
|
|
|
// Only print out used types!
|
|
|
|
if (FUT->getTypes().count(STy))
|
|
|
|
printContainedStructs(STy, StructPrinted);
|
2002-09-14 21:36:24 +00:00
|
|
|
}
|
2002-05-09 20:14:10 +00:00
|
|
|
|
2002-09-14 21:36:24 +00:00
|
|
|
// Push the struct onto the stack and recursively push all structs
|
|
|
|
// this one depends on.
|
2002-09-20 15:05:40 +00:00
|
|
|
void CWriter::printContainedStructs(const Type *Ty,
|
|
|
|
std::set<const StructType*> &StructPrinted){
|
2003-07-09 17:33:50 +00:00
|
|
|
if (const StructType *STy = dyn_cast<StructType>(Ty)) {
|
2002-09-14 21:36:24 +00:00
|
|
|
//Check to see if we have already printed this struct
|
2002-09-20 15:05:40 +00:00
|
|
|
if (StructPrinted.count(STy) == 0) {
|
|
|
|
// Print all contained types first...
|
2002-09-20 14:56:54 +00:00
|
|
|
for (StructType::ElementTypes::const_iterator
|
|
|
|
I = STy->getElementTypes().begin(),
|
|
|
|
E = STy->getElementTypes().end(); I != E; ++I) {
|
2002-09-20 15:05:40 +00:00
|
|
|
const Type *Ty1 = I->get();
|
2002-09-20 14:56:54 +00:00
|
|
|
if (isa<StructType>(Ty1) || isa<ArrayType>(Ty1))
|
2003-05-29 15:12:27 +00:00
|
|
|
printContainedStructs(*I, StructPrinted);
|
2002-09-20 14:56:54 +00:00
|
|
|
}
|
|
|
|
|
2002-09-20 15:05:40 +00:00
|
|
|
//Print structure type out..
|
2002-09-14 21:36:24 +00:00
|
|
|
StructPrinted.insert(STy);
|
2003-05-03 03:14:35 +00:00
|
|
|
std::string Name = TypeNames[STy];
|
2002-11-18 20:55:50 +00:00
|
|
|
printType(Out, STy, Name, true);
|
2002-09-20 15:18:30 +00:00
|
|
|
Out << ";\n\n";
|
2002-05-08 18:09:58 +00:00
|
|
|
}
|
2002-09-20 14:56:54 +00:00
|
|
|
|
2002-09-20 15:05:40 +00:00
|
|
|
// If it is an array, check contained types and continue
|
|
|
|
} else if (const ArrayType *ATy = dyn_cast<ArrayType>(Ty)){
|
2002-09-14 21:36:24 +00:00
|
|
|
const Type *Ty1 = ATy->getElementType();
|
|
|
|
if (isa<StructType>(Ty1) || isa<ArrayType>(Ty1))
|
2002-09-20 15:05:40 +00:00
|
|
|
printContainedStructs(Ty1, StructPrinted);
|
2002-09-14 21:36:24 +00:00
|
|
|
}
|
2002-05-08 18:09:58 +00:00
|
|
|
}
|
|
|
|
|
2002-05-09 14:40:11 +00:00
|
|
|
|
2002-08-20 16:55:48 +00:00
|
|
|
void CWriter::printFunctionSignature(const Function *F, bool Prototype) {
|
2003-06-25 04:52:09 +00:00
|
|
|
// If the program provides its own malloc prototype we don't need
|
2002-10-23 18:59:40 +00:00
|
|
|
// to include the general one.
|
2003-07-24 20:20:44 +00:00
|
|
|
if (Mang->getValueName(F) == "malloc")
|
2002-10-23 18:59:40 +00:00
|
|
|
needsMalloc = false;
|
2003-06-25 04:52:09 +00:00
|
|
|
|
|
|
|
if (F->hasInternalLinkage()) Out << "static ";
|
|
|
|
if (F->hasLinkOnceLinkage()) Out << "inline ";
|
|
|
|
|
2002-05-08 18:09:58 +00:00
|
|
|
// Loop over the arguments, printing them...
|
2002-05-09 02:28:59 +00:00
|
|
|
const FunctionType *FT = cast<FunctionType>(F->getFunctionType());
|
2002-05-08 18:09:58 +00:00
|
|
|
|
2003-06-25 04:52:09 +00:00
|
|
|
std::stringstream FunctionInnards;
|
2002-11-18 20:55:50 +00:00
|
|
|
|
|
|
|
// Print out the name...
|
2003-07-24 20:20:44 +00:00
|
|
|
FunctionInnards << Mang->getValueName(F) << "(";
|
2002-05-08 18:09:58 +00:00
|
|
|
|
2002-05-09 02:28:59 +00:00
|
|
|
if (!F->isExternal()) {
|
2002-06-25 15:57:03 +00:00
|
|
|
if (!F->aempty()) {
|
2003-05-03 03:14:35 +00:00
|
|
|
std::string ArgName;
|
2002-08-20 16:55:48 +00:00
|
|
|
if (F->abegin()->hasName() || !Prototype)
|
2003-07-24 20:20:44 +00:00
|
|
|
ArgName = Mang->getValueName(F->abegin());
|
2003-06-25 04:52:09 +00:00
|
|
|
printType(FunctionInnards, F->afront().getType(), ArgName);
|
2002-06-25 15:57:03 +00:00
|
|
|
for (Function::const_aiterator I = ++F->abegin(), E = F->aend();
|
|
|
|
I != E; ++I) {
|
2003-06-25 04:52:09 +00:00
|
|
|
FunctionInnards << ", ";
|
2002-08-20 16:55:48 +00:00
|
|
|
if (I->hasName() || !Prototype)
|
2003-07-24 20:20:44 +00:00
|
|
|
ArgName = Mang->getValueName(I);
|
2002-08-20 16:55:48 +00:00
|
|
|
else
|
|
|
|
ArgName = "";
|
2003-06-25 04:52:09 +00:00
|
|
|
printType(FunctionInnards, I->getType(), ArgName);
|
2002-05-09 15:18:52 +00:00
|
|
|
}
|
|
|
|
}
|
2002-05-08 18:09:58 +00:00
|
|
|
} else {
|
|
|
|
// Loop over the arguments, printing them...
|
|
|
|
for (FunctionType::ParamTypes::const_iterator I =
|
2002-05-09 02:28:59 +00:00
|
|
|
FT->getParamTypes().begin(),
|
|
|
|
E = FT->getParamTypes().end(); I != E; ++I) {
|
2003-06-25 04:52:09 +00:00
|
|
|
if (I != FT->getParamTypes().begin()) FunctionInnards << ", ";
|
|
|
|
printType(FunctionInnards, *I);
|
2002-05-08 18:09:58 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2002-09-20 22:32:30 +00:00
|
|
|
// 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()) {
|
2003-06-25 04:52:09 +00:00
|
|
|
if (FT->getParamTypes().size()) FunctionInnards << ", ";
|
|
|
|
FunctionInnards << "..."; // Output varargs portion of signature!
|
2003-11-26 00:09:17 +00:00
|
|
|
} else if (!FT->isVarArg() && FT->getParamTypes().empty()) {
|
|
|
|
FunctionInnards << "void"; // ret() -> ret(void) in C.
|
2002-05-08 18:09:58 +00:00
|
|
|
}
|
2003-06-25 04:52:09 +00:00
|
|
|
FunctionInnards << ")";
|
2002-11-18 20:55:50 +00:00
|
|
|
// Print out the return type and the entire signature for that matter
|
2003-06-25 04:52:09 +00:00
|
|
|
printType(Out, F->getReturnType(), FunctionInnards.str());
|
2002-05-08 18:09:58 +00:00
|
|
|
}
|
|
|
|
|
2002-05-09 15:49:41 +00:00
|
|
|
void CWriter::printFunction(Function *F) {
|
2002-05-09 02:28:59 +00:00
|
|
|
if (F->isExternal()) return;
|
2002-05-08 18:09:58 +00:00
|
|
|
|
2002-08-20 16:55:48 +00:00
|
|
|
printFunctionSignature(F, false);
|
2002-05-09 15:49:41 +00:00
|
|
|
Out << " {\n";
|
|
|
|
|
2003-11-16 22:06:14 +00:00
|
|
|
// Determine whether or not the function contains any invoke instructions.
|
|
|
|
bool HasInvoke = false;
|
|
|
|
for (Function::iterator I = F->begin(), E = F->end(); I != E; ++I)
|
|
|
|
if (isa<InvokeInst>(I->getTerminator())) {
|
|
|
|
HasInvoke = true;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
2002-05-09 20:39:03 +00:00
|
|
|
// print local variable information for the function
|
2002-05-09 20:33:35 +00:00
|
|
|
for (inst_iterator I = inst_begin(F), E = inst_end(F); I != E; ++I)
|
2003-06-17 04:39:14 +00:00
|
|
|
if (const AllocaInst *AI = isDirectAlloca(*I)) {
|
|
|
|
Out << " ";
|
2003-11-16 22:06:14 +00:00
|
|
|
if (HasInvoke) Out << "VOLATILE_FOR_SETJMP ";
|
2003-07-24 20:20:44 +00:00
|
|
|
printType(Out, AI->getAllocatedType(), Mang->getValueName(AI));
|
2003-06-17 04:39:14 +00:00
|
|
|
Out << "; /* Address exposed local */\n";
|
|
|
|
} else if ((*I)->getType() != Type::VoidTy && !isInlinableInst(**I)) {
|
2002-05-09 02:28:59 +00:00
|
|
|
Out << " ";
|
2003-11-16 22:06:14 +00:00
|
|
|
if (HasInvoke) Out << "VOLATILE_FOR_SETJMP ";
|
2003-07-24 20:20:44 +00:00
|
|
|
printType(Out, (*I)->getType(), Mang->getValueName(*I));
|
2002-05-09 02:28:59 +00:00
|
|
|
Out << ";\n";
|
2003-06-17 04:39:14 +00:00
|
|
|
|
2003-05-03 07:11:00 +00:00
|
|
|
if (isa<PHINode>(*I)) { // Print out PHI node temporaries as well...
|
|
|
|
Out << " ";
|
2003-11-16 22:06:14 +00:00
|
|
|
if (HasInvoke) Out << "VOLATILE_FOR_SETJMP ";
|
2003-10-12 04:36:29 +00:00
|
|
|
printType(Out, (*I)->getType(),
|
|
|
|
Mang->getValueName(*I)+"__PHI_TEMPORARY");
|
2003-05-03 07:11:00 +00:00
|
|
|
Out << ";\n";
|
|
|
|
}
|
2002-05-08 18:09:58 +00:00
|
|
|
}
|
2002-09-20 23:26:33 +00:00
|
|
|
|
|
|
|
Out << "\n";
|
|
|
|
|
2002-05-09 02:28:59 +00:00
|
|
|
// print the basic blocks
|
2002-06-25 15:57:03 +00:00
|
|
|
for (Function::iterator BB = F->begin(), E = F->end(); BB != E; ++BB) {
|
|
|
|
BasicBlock *Prev = BB->getPrev();
|
2002-05-09 15:49:41 +00:00
|
|
|
|
|
|
|
// Don't print the label for the basic block if there are no uses, or if the
|
2003-09-11 22:34:13 +00:00
|
|
|
// only terminator use is the predecessor basic block's terminator. We have
|
2002-05-09 15:49:41 +00:00
|
|
|
// 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))
|
2003-04-23 19:15:13 +00:00
|
|
|
if (TI != Prev->getTerminator() ||
|
2003-08-28 19:56:10 +00:00
|
|
|
isa<SwitchInst>(Prev->getTerminator()) ||
|
|
|
|
isa<InvokeInst>(Prev->getTerminator())) {
|
2002-05-09 15:49:41 +00:00
|
|
|
NeedsLabel = true;
|
|
|
|
break;
|
|
|
|
}
|
2002-05-08 18:09:58 +00:00
|
|
|
|
2003-07-24 20:20:44 +00:00
|
|
|
if (NeedsLabel) Out << Mang->getValueName(BB) << ":\n";
|
2002-05-08 18:09:58 +00:00
|
|
|
|
2002-05-09 15:49:41 +00:00
|
|
|
// Output all of the instructions in the basic block...
|
2002-06-25 15:57:03 +00:00
|
|
|
for (BasicBlock::iterator II = BB->begin(), E = --BB->end(); II != E; ++II){
|
2003-06-17 04:39:14 +00:00
|
|
|
if (!isInlinableInst(*II) && !isDirectAlloca(II)) {
|
2002-06-25 15:57:03 +00:00
|
|
|
if (II->getType() != Type::VoidTy)
|
|
|
|
outputLValue(II);
|
2002-05-09 21:18:38 +00:00
|
|
|
else
|
|
|
|
Out << " ";
|
2002-06-25 15:57:03 +00:00
|
|
|
visit(*II);
|
2002-05-09 21:18:38 +00:00
|
|
|
Out << ";\n";
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
// Don't emit prefix or suffix for the terminator...
|
2002-06-25 15:57:03 +00:00
|
|
|
visit(*BB->getTerminator());
|
2002-05-09 15:49:41 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
Out << "}\n\n";
|
2002-05-08 18:09:58 +00:00
|
|
|
}
|
|
|
|
|
2002-05-09 20:53:56 +00:00
|
|
|
// Specific Instruction type classes... note that all of the casts are
|
2003-08-18 14:43:39 +00:00
|
|
|
// necessary because we use the instruction classes as opaque types...
|
2002-05-09 20:53:56 +00:00
|
|
|
//
|
2002-06-25 15:57:03 +00:00
|
|
|
void CWriter::visitReturnInst(ReturnInst &I) {
|
2002-05-09 20:53:56 +00:00
|
|
|
// Don't output a void return if this is the last basic block in the function
|
2002-06-25 15:57:03 +00:00
|
|
|
if (I.getNumOperands() == 0 &&
|
|
|
|
&*--I.getParent()->getParent()->end() == I.getParent() &&
|
|
|
|
!I.getParent()->size() == 1) {
|
2002-05-09 20:53:56 +00:00
|
|
|
return;
|
2002-05-21 18:05:19 +00:00
|
|
|
}
|
2002-05-09 03:50:42 +00:00
|
|
|
|
2002-05-09 20:53:56 +00:00
|
|
|
Out << " return";
|
2002-06-25 15:57:03 +00:00
|
|
|
if (I.getNumOperands()) {
|
2002-05-09 20:53:56 +00:00
|
|
|
Out << " ";
|
2002-06-25 15:57:03 +00:00
|
|
|
writeOperand(I.getOperand(0));
|
2002-05-09 20:53:56 +00:00
|
|
|
}
|
|
|
|
Out << ";\n";
|
|
|
|
}
|
|
|
|
|
2003-04-22 20:19:52 +00:00
|
|
|
void CWriter::visitSwitchInst(SwitchInst &SI) {
|
|
|
|
Out << " switch (";
|
|
|
|
writeOperand(SI.getOperand(0));
|
2003-04-23 19:15:13 +00:00
|
|
|
Out << ") {\n default:\n";
|
|
|
|
printBranchToBlock(SI.getParent(), SI.getDefaultDest(), 2);
|
2003-04-22 20:19:52 +00:00
|
|
|
Out << ";\n";
|
|
|
|
for (unsigned i = 2, e = SI.getNumOperands(); i != e; i += 2) {
|
|
|
|
Out << " case ";
|
|
|
|
writeOperand(SI.getOperand(i));
|
|
|
|
Out << ":\n";
|
|
|
|
BasicBlock *Succ = cast<BasicBlock>(SI.getOperand(i+1));
|
|
|
|
printBranchToBlock(SI.getParent(), Succ, 2);
|
|
|
|
if (Succ == SI.getParent()->getNext())
|
|
|
|
Out << " break;\n";
|
|
|
|
}
|
|
|
|
Out << " }\n";
|
|
|
|
}
|
|
|
|
|
2003-06-28 17:53:05 +00:00
|
|
|
void CWriter::visitInvokeInst(InvokeInst &II) {
|
|
|
|
Out << " {\n"
|
|
|
|
<< " struct __llvm_jmpbuf_list_t Entry;\n"
|
|
|
|
<< " Entry.next = __llvm_jmpbuf_list;\n"
|
|
|
|
<< " if (setjmp(Entry.buf)) {\n"
|
|
|
|
<< " __llvm_jmpbuf_list = Entry.next;\n";
|
|
|
|
printBranchToBlock(II.getParent(), II.getExceptionalDest(), 4);
|
|
|
|
Out << " }\n"
|
|
|
|
<< " __llvm_jmpbuf_list = &Entry;\n"
|
|
|
|
<< " ";
|
2003-08-28 19:56:10 +00:00
|
|
|
|
|
|
|
if (II.getType() != Type::VoidTy) outputLValue(&II);
|
2003-06-28 17:53:05 +00:00
|
|
|
visitCallSite(&II);
|
|
|
|
Out << ";\n"
|
|
|
|
<< " __llvm_jmpbuf_list = Entry.next;\n"
|
|
|
|
<< " }\n";
|
|
|
|
printBranchToBlock(II.getParent(), II.getNormalDest(), 0);
|
|
|
|
emittedInvoke = true;
|
|
|
|
}
|
|
|
|
|
2003-04-22 20:19:52 +00:00
|
|
|
|
2003-09-08 18:54:55 +00:00
|
|
|
void CWriter::visitUnwindInst(UnwindInst &I) {
|
|
|
|
// The unwind instructions causes a control flow transfer out of the current
|
|
|
|
// function, unwinding the stack until a caller who used the invoke
|
|
|
|
// instruction is found. In this context, we code generated the invoke
|
|
|
|
// instruction to add an entry to the top of the jmpbuf_list. Thus, here we
|
|
|
|
// just have to longjmp to the specified handler.
|
2003-09-15 16:47:12 +00:00
|
|
|
Out << " if (__llvm_jmpbuf_list == 0) { /* unwind */\n"
|
2003-12-10 18:17:57 +00:00
|
|
|
<< "#ifdef _LP64\n"
|
|
|
|
<< " extern signed long long write();\n"
|
|
|
|
<< "#else\n"
|
|
|
|
<< " extern write();\n"
|
|
|
|
<< "#endif\n"
|
2003-09-15 16:47:12 +00:00
|
|
|
<< " ((void (*)(int, void*, unsigned))write)(2,\n"
|
|
|
|
<< " \"throw found with no handler!\\n\", 31); abort();\n"
|
2003-09-08 18:54:55 +00:00
|
|
|
<< " }\n"
|
|
|
|
<< " longjmp(__llvm_jmpbuf_list->buf, 1);\n";
|
|
|
|
emittedInvoke = true;
|
|
|
|
}
|
|
|
|
|
2003-11-11 22:41:34 +00:00
|
|
|
bool isGotoCodeNecessary(BasicBlock *From, BasicBlock *To) {
|
2002-05-09 20:53:56 +00:00
|
|
|
// If PHI nodes need copies, we need the copy code...
|
|
|
|
if (isa<PHINode>(To->front()) ||
|
2002-06-25 15:57:03 +00:00
|
|
|
From->getNext() != To) // Not directly successor, need goto
|
2002-05-09 20:53:56 +00:00
|
|
|
return true;
|
|
|
|
|
|
|
|
// Otherwise we don't need the code.
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
|
|
|
void CWriter::printBranchToBlock(BasicBlock *CurBB, BasicBlock *Succ,
|
2003-06-28 17:53:05 +00:00
|
|
|
unsigned Indent) {
|
2002-05-09 20:53:56 +00:00
|
|
|
for (BasicBlock::iterator I = Succ->begin();
|
2003-04-23 16:36:11 +00:00
|
|
|
PHINode *PN = dyn_cast<PHINode>(I); ++I) {
|
2002-05-09 20:53:56 +00:00
|
|
|
// now we have to do the printing
|
2003-05-03 03:14:35 +00:00
|
|
|
Out << std::string(Indent, ' ');
|
2003-07-24 20:20:44 +00:00
|
|
|
Out << " " << Mang->getValueName(I) << "__PHI_TEMPORARY = ";
|
2002-05-09 20:53:56 +00:00
|
|
|
writeOperand(PN->getIncomingValue(PN->getBasicBlockIndex(CurBB)));
|
|
|
|
Out << "; /* for PHI node */\n";
|
|
|
|
}
|
|
|
|
|
2003-10-13 20:32:04 +00:00
|
|
|
if (CurBB->getNext() != Succ ||
|
|
|
|
isa<InvokeInst>(CurBB->getTerminator()) ||
|
|
|
|
isa<SwitchInst>(CurBB->getTerminator())) {
|
2003-05-03 03:14:35 +00:00
|
|
|
Out << std::string(Indent, ' ') << " goto ";
|
2002-05-09 20:53:56 +00:00
|
|
|
writeOperand(Succ);
|
|
|
|
Out << ";\n";
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2003-09-11 22:34:13 +00:00
|
|
|
// Branch instruction printing - Avoid printing out a branch to a basic block
|
|
|
|
// that immediately succeeds the current one.
|
2002-05-09 20:53:56 +00:00
|
|
|
//
|
2002-06-25 15:57:03 +00:00
|
|
|
void CWriter::visitBranchInst(BranchInst &I) {
|
|
|
|
if (I.isConditional()) {
|
2003-10-12 08:12:58 +00:00
|
|
|
if (isGotoCodeNecessary(I.getParent(), I.getSuccessor(0))) {
|
2002-05-09 20:53:56 +00:00
|
|
|
Out << " if (";
|
2002-06-25 15:57:03 +00:00
|
|
|
writeOperand(I.getCondition());
|
2002-05-09 20:53:56 +00:00
|
|
|
Out << ") {\n";
|
|
|
|
|
2002-06-25 15:57:03 +00:00
|
|
|
printBranchToBlock(I.getParent(), I.getSuccessor(0), 2);
|
2002-05-09 20:53:56 +00:00
|
|
|
|
2003-10-12 08:12:58 +00:00
|
|
|
if (isGotoCodeNecessary(I.getParent(), I.getSuccessor(1))) {
|
2002-05-09 20:53:56 +00:00
|
|
|
Out << " } else {\n";
|
2002-06-25 15:57:03 +00:00
|
|
|
printBranchToBlock(I.getParent(), I.getSuccessor(1), 2);
|
2002-05-09 20:53:56 +00:00
|
|
|
}
|
|
|
|
} else {
|
2003-08-18 14:43:39 +00:00
|
|
|
// First goto not necessary, assume second one is...
|
2002-05-09 20:53:56 +00:00
|
|
|
Out << " if (!";
|
2002-06-25 15:57:03 +00:00
|
|
|
writeOperand(I.getCondition());
|
2002-05-09 20:53:56 +00:00
|
|
|
Out << ") {\n";
|
|
|
|
|
2002-06-25 15:57:03 +00:00
|
|
|
printBranchToBlock(I.getParent(), I.getSuccessor(1), 2);
|
2002-05-09 20:53:56 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
Out << " }\n";
|
2002-05-09 03:50:42 +00:00
|
|
|
} else {
|
2002-06-25 15:57:03 +00:00
|
|
|
printBranchToBlock(I.getParent(), I.getSuccessor(0), 0);
|
2002-05-09 02:28:59 +00:00
|
|
|
}
|
2002-05-09 20:53:56 +00:00
|
|
|
Out << "\n";
|
|
|
|
}
|
2002-05-09 03:50:42 +00:00
|
|
|
|
2003-05-03 07:11:00 +00:00
|
|
|
// PHI nodes get copied into temporary values at the end of predecessor basic
|
|
|
|
// blocks. We now need to copy these temporary values into the REAL value for
|
|
|
|
// the PHI.
|
|
|
|
void CWriter::visitPHINode(PHINode &I) {
|
|
|
|
writeOperand(&I);
|
|
|
|
Out << "__PHI_TEMPORARY";
|
|
|
|
}
|
|
|
|
|
2002-05-09 20:53:56 +00:00
|
|
|
|
2002-06-25 15:57:03 +00:00
|
|
|
void CWriter::visitBinaryOperator(Instruction &I) {
|
2002-05-09 20:53:56 +00:00
|
|
|
// binary instructions, shift instructions, setCond instructions.
|
2003-04-23 19:09:22 +00:00
|
|
|
assert(!isa<PointerType>(I.getType()));
|
2003-06-23 20:00:51 +00:00
|
|
|
|
|
|
|
// We must cast the results of binary operations which might be promoted.
|
|
|
|
bool needsCast = false;
|
|
|
|
if ((I.getType() == Type::UByteTy) || (I.getType() == Type::SByteTy)
|
2003-06-25 03:05:33 +00:00
|
|
|
|| (I.getType() == Type::UShortTy) || (I.getType() == Type::ShortTy)
|
|
|
|
|| (I.getType() == Type::FloatTy)) {
|
2003-06-23 20:00:51 +00:00
|
|
|
needsCast = true;
|
|
|
|
Out << "((";
|
2003-11-03 01:01:59 +00:00
|
|
|
printType(Out, I.getType());
|
2003-06-23 20:00:51 +00:00
|
|
|
Out << ")(";
|
|
|
|
}
|
2002-05-09 20:53:56 +00:00
|
|
|
|
2002-06-25 15:57:03 +00:00
|
|
|
writeOperand(I.getOperand(0));
|
2002-05-09 20:53:56 +00:00
|
|
|
|
2002-06-25 15:57:03 +00:00
|
|
|
switch (I.getOpcode()) {
|
2002-05-09 20:53:56 +00:00
|
|
|
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::And: Out << " & "; break;
|
|
|
|
case Instruction::Or: Out << " | "; break;
|
|
|
|
case Instruction::Xor: Out << " ^ "; break;
|
|
|
|
case Instruction::SetEQ: Out << " == "; break;
|
|
|
|
case Instruction::SetNE: Out << " != "; break;
|
|
|
|
case Instruction::SetLE: Out << " <= "; break;
|
|
|
|
case Instruction::SetGE: Out << " >= "; break;
|
|
|
|
case Instruction::SetLT: Out << " < "; break;
|
|
|
|
case Instruction::SetGT: Out << " > "; break;
|
|
|
|
case Instruction::Shl : Out << " << "; break;
|
|
|
|
case Instruction::Shr : Out << " >> "; break;
|
2002-06-30 16:07:20 +00:00
|
|
|
default: std::cerr << "Invalid operator type!" << I; abort();
|
2002-05-09 20:53:56 +00:00
|
|
|
}
|
|
|
|
|
2002-06-25 15:57:03 +00:00
|
|
|
writeOperand(I.getOperand(1));
|
2003-06-23 20:00:51 +00:00
|
|
|
|
|
|
|
if (needsCast) {
|
|
|
|
Out << "))";
|
|
|
|
}
|
2002-05-09 20:53:56 +00:00
|
|
|
}
|
|
|
|
|
2002-06-25 15:57:03 +00:00
|
|
|
void CWriter::visitCastInst(CastInst &I) {
|
2003-06-01 03:36:51 +00:00
|
|
|
if (I.getType() == Type::BoolTy) {
|
|
|
|
Out << "(";
|
|
|
|
writeOperand(I.getOperand(0));
|
|
|
|
Out << " != 0)";
|
|
|
|
return;
|
|
|
|
}
|
2002-05-09 20:53:56 +00:00
|
|
|
Out << "(";
|
2003-11-03 01:01:59 +00:00
|
|
|
printType(Out, I.getType());
|
2002-05-09 20:53:56 +00:00
|
|
|
Out << ")";
|
2003-04-23 19:09:22 +00:00
|
|
|
if (isa<PointerType>(I.getType())&&I.getOperand(0)->getType()->isIntegral() ||
|
|
|
|
isa<PointerType>(I.getOperand(0)->getType())&&I.getType()->isIntegral()) {
|
|
|
|
// Avoid "cast to pointer from integer of different size" warnings
|
|
|
|
Out << "(long)";
|
|
|
|
}
|
2003-06-01 03:36:51 +00:00
|
|
|
|
2002-06-25 15:57:03 +00:00
|
|
|
writeOperand(I.getOperand(0));
|
2002-05-09 20:53:56 +00:00
|
|
|
}
|
|
|
|
|
2002-06-25 15:57:03 +00:00
|
|
|
void CWriter::visitCallInst(CallInst &I) {
|
2003-05-08 18:41:45 +00:00
|
|
|
// Handle intrinsic function calls first...
|
|
|
|
if (Function *F = I.getCalledFunction())
|
2003-11-11 22:41:34 +00:00
|
|
|
if (Intrinsic::ID ID = (Intrinsic::ID)F->getIntrinsicID()) {
|
2003-05-08 18:41:45 +00:00
|
|
|
switch (ID) {
|
|
|
|
default: assert(0 && "Unknown LLVM intrinsic!");
|
2003-11-11 22:41:34 +00:00
|
|
|
case Intrinsic::va_start:
|
2003-10-18 05:57:43 +00:00
|
|
|
Out << "0; ";
|
|
|
|
|
|
|
|
Out << "va_start(*(va_list*)&" << Mang->getValueName(&I) << ", ";
|
2003-05-08 18:41:45 +00:00
|
|
|
// Output the last argument to the enclosing function...
|
2003-10-23 18:39:22 +00:00
|
|
|
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();
|
|
|
|
}
|
2003-05-08 18:41:45 +00:00
|
|
|
writeOperand(&I.getParent()->getParent()->aback());
|
|
|
|
Out << ")";
|
|
|
|
return;
|
2003-11-11 22:41:34 +00:00
|
|
|
case Intrinsic::va_end:
|
2003-10-18 05:57:43 +00:00
|
|
|
Out << "va_end(*(va_list*)&";
|
2003-05-08 18:41:45 +00:00
|
|
|
writeOperand(I.getOperand(1));
|
|
|
|
Out << ")";
|
|
|
|
return;
|
2003-11-11 22:41:34 +00:00
|
|
|
case Intrinsic::va_copy:
|
2003-10-18 05:57:43 +00:00
|
|
|
Out << "0;";
|
|
|
|
Out << "va_copy(*(va_list*)&" << Mang->getValueName(&I) << ", ";
|
|
|
|
Out << "*(va_list*)&";
|
2003-05-08 18:41:45 +00:00
|
|
|
writeOperand(I.getOperand(1));
|
|
|
|
Out << ")";
|
|
|
|
return;
|
2003-11-11 22:41:34 +00:00
|
|
|
case Intrinsic::setjmp:
|
|
|
|
case Intrinsic::sigsetjmp:
|
2003-09-11 22:34:13 +00:00
|
|
|
// This intrinsic should never exist in the program, but until we get
|
2003-08-06 18:04:40 +00:00
|
|
|
// setjmp/longjmp transformations going on, we should codegen it to
|
|
|
|
// something reasonable. This will allow code that never calls longjmp
|
|
|
|
// to work.
|
|
|
|
Out << "0";
|
2003-05-17 22:26:33 +00:00
|
|
|
return;
|
2003-11-11 22:41:34 +00:00
|
|
|
case Intrinsic::longjmp:
|
|
|
|
case Intrinsic::siglongjmp:
|
2003-08-18 16:06:09 +00:00
|
|
|
// Longjmp is not implemented, and never will be. It would cause an
|
|
|
|
// exception throw.
|
2003-07-31 15:11:08 +00:00
|
|
|
Out << "abort()";
|
2003-05-17 22:26:33 +00:00
|
|
|
return;
|
2003-05-08 18:41:45 +00:00
|
|
|
}
|
|
|
|
}
|
2003-06-28 17:53:05 +00:00
|
|
|
visitCallSite(&I);
|
|
|
|
}
|
2003-05-08 18:41:45 +00:00
|
|
|
|
2003-06-28 17:53:05 +00:00
|
|
|
void CWriter::visitCallSite(CallSite CS) {
|
|
|
|
const PointerType *PTy = cast<PointerType>(CS.getCalledValue()->getType());
|
2002-05-09 20:53:56 +00:00
|
|
|
const FunctionType *FTy = cast<FunctionType>(PTy->getElementType());
|
|
|
|
const Type *RetTy = FTy->getReturnType();
|
|
|
|
|
2003-06-28 17:53:05 +00:00
|
|
|
writeOperand(CS.getCalledValue());
|
2002-08-26 20:50:09 +00:00
|
|
|
Out << "(";
|
2002-05-09 20:53:56 +00:00
|
|
|
|
2003-06-28 17:53:05 +00:00
|
|
|
if (CS.arg_begin() != CS.arg_end()) {
|
|
|
|
CallSite::arg_iterator AI = CS.arg_begin(), AE = CS.arg_end();
|
|
|
|
writeOperand(*AI);
|
2002-05-09 20:53:56 +00:00
|
|
|
|
2003-06-28 17:53:05 +00:00
|
|
|
for (++AI; AI != AE; ++AI) {
|
2002-05-09 20:53:56 +00:00
|
|
|
Out << ", ";
|
2003-06-28 17:53:05 +00:00
|
|
|
writeOperand(*AI);
|
2002-05-09 20:53:56 +00:00
|
|
|
}
|
|
|
|
}
|
2002-05-09 21:18:38 +00:00
|
|
|
Out << ")";
|
2002-05-09 20:53:56 +00:00
|
|
|
}
|
|
|
|
|
2002-06-25 15:57:03 +00:00
|
|
|
void CWriter::visitMallocInst(MallocInst &I) {
|
2002-05-09 20:53:56 +00:00
|
|
|
Out << "(";
|
2002-11-18 20:55:50 +00:00
|
|
|
printType(Out, I.getType());
|
2002-05-09 20:53:56 +00:00
|
|
|
Out << ")malloc(sizeof(";
|
2002-11-18 20:55:50 +00:00
|
|
|
printType(Out, I.getType()->getElementType());
|
2002-05-09 20:53:56 +00:00
|
|
|
Out << ")";
|
|
|
|
|
2002-06-25 15:57:03 +00:00
|
|
|
if (I.isArrayAllocation()) {
|
2002-05-09 20:53:56 +00:00
|
|
|
Out << " * " ;
|
2002-06-25 15:57:03 +00:00
|
|
|
writeOperand(I.getOperand(0));
|
2002-05-09 20:53:56 +00:00
|
|
|
}
|
2002-05-09 21:18:38 +00:00
|
|
|
Out << ")";
|
2002-05-09 20:53:56 +00:00
|
|
|
}
|
|
|
|
|
2002-06-25 15:57:03 +00:00
|
|
|
void CWriter::visitAllocaInst(AllocaInst &I) {
|
2002-05-09 20:53:56 +00:00
|
|
|
Out << "(";
|
2002-11-18 20:55:50 +00:00
|
|
|
printType(Out, I.getType());
|
2002-05-09 20:53:56 +00:00
|
|
|
Out << ") alloca(sizeof(";
|
2002-11-18 20:55:50 +00:00
|
|
|
printType(Out, I.getType()->getElementType());
|
2002-05-09 20:53:56 +00:00
|
|
|
Out << ")";
|
2002-06-25 15:57:03 +00:00
|
|
|
if (I.isArrayAllocation()) {
|
2002-05-09 20:53:56 +00:00
|
|
|
Out << " * " ;
|
2002-06-25 15:57:03 +00:00
|
|
|
writeOperand(I.getOperand(0));
|
2002-05-09 20:53:56 +00:00
|
|
|
}
|
2002-05-09 21:18:38 +00:00
|
|
|
Out << ")";
|
2002-05-09 20:53:56 +00:00
|
|
|
}
|
|
|
|
|
2002-06-25 15:57:03 +00:00
|
|
|
void CWriter::visitFreeInst(FreeInst &I) {
|
2003-08-14 19:19:53 +00:00
|
|
|
Out << "free((char*)";
|
2002-06-25 15:57:03 +00:00
|
|
|
writeOperand(I.getOperand(0));
|
2002-05-09 21:18:38 +00:00
|
|
|
Out << ")";
|
2002-05-09 20:53:56 +00:00
|
|
|
}
|
|
|
|
|
2003-11-25 20:49:55 +00:00
|
|
|
void CWriter::printIndexingExpression(Value *Ptr, gep_type_iterator I,
|
|
|
|
gep_type_iterator E) {
|
2002-08-19 23:09:46 +00:00
|
|
|
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...
|
2003-06-17 04:39:14 +00:00
|
|
|
} else if (isDirectAlloca(Ptr)) {
|
|
|
|
HasImplicitAddress = true;
|
2002-08-19 23:09:46 +00:00
|
|
|
}
|
|
|
|
|
2002-05-09 21:18:38 +00:00
|
|
|
if (I == E) {
|
2002-08-19 23:09:46 +00:00
|
|
|
if (!HasImplicitAddress)
|
|
|
|
Out << "*"; // Implicit zero first argument: '*x' is equivalent to 'x[0]'
|
2002-05-09 21:18:38 +00:00
|
|
|
|
2002-08-19 23:09:46 +00:00
|
|
|
writeOperandInternal(Ptr);
|
|
|
|
return;
|
2002-05-09 21:18:38 +00:00
|
|
|
}
|
2002-05-09 20:53:56 +00:00
|
|
|
|
2003-11-25 20:49:55 +00:00
|
|
|
const Constant *CI = dyn_cast<Constant>(I.getOperand());
|
2002-08-19 23:09:46 +00:00
|
|
|
if (HasImplicitAddress && (!CI || !CI->isNullValue()))
|
|
|
|
Out << "(&";
|
|
|
|
|
|
|
|
writeOperandInternal(Ptr);
|
2002-05-09 20:53:56 +00:00
|
|
|
|
2002-09-25 20:29:26 +00:00
|
|
|
if (HasImplicitAddress && (!CI || !CI->isNullValue())) {
|
2002-08-19 23:09:46 +00:00
|
|
|
Out << ")";
|
2002-09-25 20:29:26 +00:00
|
|
|
HasImplicitAddress = false; // HIA is only true if we haven't addressed yet
|
|
|
|
}
|
|
|
|
|
|
|
|
assert(!HasImplicitAddress || (CI && CI->isNullValue()) &&
|
|
|
|
"Can only have implicit address with direct accessing");
|
2002-05-09 20:53:56 +00:00
|
|
|
|
2002-09-25 20:29:26 +00:00
|
|
|
if (HasImplicitAddress) {
|
|
|
|
++I;
|
2003-11-25 20:49:55 +00:00
|
|
|
} else if (CI && CI->isNullValue()) {
|
|
|
|
gep_type_iterator TmpI = I; ++TmpI;
|
|
|
|
|
2002-09-25 20:29:26 +00:00
|
|
|
// Print out the -> operator if possible...
|
2003-11-25 20:49:55 +00:00
|
|
|
if (TmpI != E && isa<StructType>(*TmpI)) {
|
2002-08-19 23:09:46 +00:00
|
|
|
Out << (HasImplicitAddress ? "." : "->");
|
2003-11-25 23:44:40 +00:00
|
|
|
Out << "field" << cast<ConstantUInt>(TmpI.getOperand())->getValue();
|
2003-11-25 20:49:55 +00:00
|
|
|
I = ++TmpI;
|
|
|
|
}
|
2002-05-09 20:53:56 +00:00
|
|
|
}
|
2002-08-22 22:48:55 +00:00
|
|
|
|
2002-05-09 20:53:56 +00:00
|
|
|
for (; I != E; ++I)
|
2003-11-25 20:49:55 +00:00
|
|
|
if (isa<StructType>(*I)) {
|
|
|
|
Out << ".field" << cast<ConstantUInt>(I.getOperand())->getValue();
|
|
|
|
} else {
|
2002-09-15 21:51:04 +00:00
|
|
|
Out << "[";
|
2003-11-25 20:49:55 +00:00
|
|
|
writeOperand(I.getOperand());
|
2002-09-15 21:51:04 +00:00
|
|
|
Out << "]";
|
2002-05-09 20:53:56 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2002-06-25 15:57:03 +00:00
|
|
|
void CWriter::visitLoadInst(LoadInst &I) {
|
2002-10-02 21:14:33 +00:00
|
|
|
Out << "*";
|
2002-08-22 22:48:55 +00:00
|
|
|
writeOperand(I.getOperand(0));
|
2002-05-08 18:09:58 +00:00
|
|
|
}
|
|
|
|
|
2002-06-25 15:57:03 +00:00
|
|
|
void CWriter::visitStoreInst(StoreInst &I) {
|
2002-10-02 21:14:33 +00:00
|
|
|
Out << "*";
|
2002-08-22 22:48:55 +00:00
|
|
|
writeOperand(I.getPointerOperand());
|
2002-05-09 20:53:56 +00:00
|
|
|
Out << " = ";
|
2002-06-25 15:57:03 +00:00
|
|
|
writeOperand(I.getOperand(0));
|
2002-05-09 20:53:56 +00:00
|
|
|
}
|
|
|
|
|
2002-06-25 15:57:03 +00:00
|
|
|
void CWriter::visitGetElementPtrInst(GetElementPtrInst &I) {
|
2002-10-02 21:14:33 +00:00
|
|
|
Out << "&";
|
2003-11-25 20:49:55 +00:00
|
|
|
printIndexingExpression(I.getPointerOperand(), gep_type_begin(I),
|
|
|
|
gep_type_end(I));
|
2002-05-09 20:53:56 +00:00
|
|
|
}
|
2002-05-08 18:09:58 +00:00
|
|
|
|
2003-10-18 05:57:43 +00:00
|
|
|
void CWriter::visitVANextInst(VANextInst &I) {
|
|
|
|
Out << Mang->getValueName(I.getOperand(0));
|
|
|
|
Out << "; va_arg(*(va_list*)&" << Mang->getValueName(&I) << ", ";
|
2003-11-03 01:01:59 +00:00
|
|
|
printType(Out, I.getArgType());
|
2003-10-18 05:57:43 +00:00
|
|
|
Out << ")";
|
|
|
|
}
|
|
|
|
|
|
|
|
void CWriter::visitVAArgInst(VAArgInst &I) {
|
|
|
|
Out << "0;\n";
|
|
|
|
Out << "{ va_list Tmp; va_copy(Tmp, *(va_list*)&";
|
2003-05-08 18:41:45 +00:00
|
|
|
writeOperand(I.getOperand(0));
|
2003-10-18 05:57:43 +00:00
|
|
|
Out << ");\n " << Mang->getValueName(&I) << " = va_arg(Tmp, ";
|
2003-11-03 01:01:59 +00:00
|
|
|
printType(Out, I.getType());
|
2003-10-18 05:57:43 +00:00
|
|
|
Out << ");\n va_end(Tmp); }";
|
2003-05-08 18:41:45 +00:00
|
|
|
}
|
|
|
|
|
2003-11-11 22:41:34 +00:00
|
|
|
}
|
2003-05-08 18:41:45 +00:00
|
|
|
|
2002-05-08 18:09:58 +00:00
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
// External Interface declaration
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
2002-08-31 00:29:16 +00:00
|
|
|
Pass *createWriteToCPass(std::ostream &o) { return new CWriter(o); }
|
2003-11-11 22:41:34 +00:00
|
|
|
|
|
|
|
} // End llvm namespace
|