2002-05-09 23:31:18 +02:00
|
|
|
//===-- Writer.cpp - Library for converting LLVM code to C ----------------===//
|
2002-05-08 20:09:58 +02:00
|
|
|
//
|
2002-09-21 01:26:33 +02:00
|
|
|
// This library converts LLVM code to C code, compilable by GCC.
|
2002-05-09 04:28:59 +02:00
|
|
|
//
|
2002-05-08 20:09:58 +02:00
|
|
|
//===-----------------------------------------------------------------------==//
|
|
|
|
#include "llvm/Assembly/CWriter.h"
|
|
|
|
#include "llvm/Constants.h"
|
2002-05-09 05:28:37 +02:00
|
|
|
#include "llvm/DerivedTypes.h"
|
|
|
|
#include "llvm/Module.h"
|
2002-05-08 20:09:58 +02:00
|
|
|
#include "llvm/iMemory.h"
|
|
|
|
#include "llvm/iTerminators.h"
|
|
|
|
#include "llvm/iPHINode.h"
|
|
|
|
#include "llvm/iOther.h"
|
2002-05-09 05:28:37 +02:00
|
|
|
#include "llvm/iOperators.h"
|
2002-08-31 02:29:16 +02:00
|
|
|
#include "llvm/Pass.h"
|
2002-05-08 20:09:58 +02:00
|
|
|
#include "llvm/SymbolTable.h"
|
2002-05-09 23:31:18 +02:00
|
|
|
#include "llvm/SlotCalculator.h"
|
2002-08-31 02:29:16 +02:00
|
|
|
#include "llvm/Analysis/FindUsedTypes.h"
|
2002-09-21 01:26:33 +02:00
|
|
|
#include "llvm/Analysis/ConstantsScanner.h"
|
2002-05-08 20:09:58 +02:00
|
|
|
#include "llvm/Support/InstVisitor.h"
|
2002-05-09 22:33:35 +02:00
|
|
|
#include "llvm/Support/InstIterator.h"
|
2002-05-08 20:09:58 +02:00
|
|
|
#include "Support/StringExtras.h"
|
|
|
|
#include "Support/STLExtras.h"
|
|
|
|
#include <algorithm>
|
2002-05-17 06:55:35 +02:00
|
|
|
#include <set>
|
2002-11-18 21:55:50 +01:00
|
|
|
#include <sstream>
|
2002-05-08 20:09:58 +02:00
|
|
|
using std::string;
|
|
|
|
using std::map;
|
|
|
|
using std::ostream;
|
|
|
|
|
2002-10-23 20:59:40 +02:00
|
|
|
|
2002-05-08 20:09:58 +02:00
|
|
|
namespace {
|
2002-08-31 02:29:16 +02:00
|
|
|
class CWriter : public Pass, public InstVisitor<CWriter> {
|
|
|
|
ostream &Out;
|
|
|
|
SlotCalculator *Table;
|
2002-05-08 20:09:58 +02:00
|
|
|
const Module *TheModule;
|
|
|
|
map<const Type *, string> TypeNames;
|
2002-05-17 06:55:35 +02:00
|
|
|
std::set<const Value*> MangledGlobals;
|
2002-10-23 20:59:40 +02:00
|
|
|
bool needsMalloc;
|
2002-09-14 23:36:24 +02:00
|
|
|
|
2002-09-21 01:26:33 +02:00
|
|
|
map<const ConstantFP *, unsigned> FPConstantMap;
|
2002-05-08 20:09:58 +02:00
|
|
|
public:
|
2002-08-31 02:29:16 +02:00
|
|
|
CWriter(ostream &o) : Out(o) {}
|
|
|
|
|
|
|
|
void getAnalysisUsage(AnalysisUsage &AU) const {
|
|
|
|
AU.setPreservesAll();
|
|
|
|
AU.addRequired<FindUsedTypes>();
|
|
|
|
}
|
|
|
|
|
|
|
|
virtual bool run(Module &M) {
|
|
|
|
// Initialize
|
|
|
|
Table = new SlotCalculator(&M, false);
|
|
|
|
TheModule = &M;
|
|
|
|
|
|
|
|
// Ensure that all structure types have names...
|
|
|
|
bool Changed = nameAllUsedStructureTypes(M);
|
|
|
|
|
|
|
|
// Run...
|
|
|
|
printModule(&M);
|
|
|
|
|
|
|
|
// Free memory...
|
|
|
|
delete Table;
|
|
|
|
TypeNames.clear();
|
|
|
|
MangledGlobals.clear();
|
|
|
|
return false;
|
2002-05-08 20:09:58 +02:00
|
|
|
}
|
|
|
|
|
2002-11-18 21:55:50 +01:00
|
|
|
ostream &printType(std::ostream &Out, const Type *Ty, const string &VariableName = "",
|
2002-08-25 22:00:08 +02:00
|
|
|
bool IgnoreName = false, bool namedContext = true);
|
2002-05-09 05:06:06 +02:00
|
|
|
|
2002-06-25 17:57:03 +02:00
|
|
|
void writeOperand(Value *Operand);
|
|
|
|
void writeOperandInternal(Value *Operand);
|
2002-05-08 20:09:58 +02:00
|
|
|
|
2002-05-09 05:06:06 +02:00
|
|
|
string getValueName(const Value *V);
|
|
|
|
|
2002-05-09 22:53:56 +02:00
|
|
|
private :
|
2002-08-31 02:29:16 +02:00
|
|
|
bool nameAllUsedStructureTypes(Module &M);
|
2002-05-09 17:49:41 +02:00
|
|
|
void printModule(Module *M);
|
2002-05-08 20:09:58 +02:00
|
|
|
void printSymbolTable(const SymbolTable &ST);
|
2002-09-20 17:05:40 +02:00
|
|
|
void printContainedStructs(const Type *Ty, std::set<const StructType *> &);
|
2002-05-08 20:09:58 +02:00
|
|
|
void printGlobal(const GlobalVariable *GV);
|
2002-08-20 18:55:48 +02:00
|
|
|
void printFunctionSignature(const Function *F, bool Prototype);
|
|
|
|
|
2002-05-09 17:49:41 +02:00
|
|
|
void printFunction(Function *);
|
2002-05-09 05:06:06 +02:00
|
|
|
|
2002-08-19 23:32:41 +02:00
|
|
|
void printConstant(Constant *CPV);
|
|
|
|
void printConstantArray(ConstantArray *CPA);
|
|
|
|
|
2002-05-09 23:18:38 +02: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 17:57:03 +02:00
|
|
|
static bool isInlinableInst(const Instruction &I) {
|
2002-05-09 23:18:38 +02:00
|
|
|
// Must be an expression, must be used exactly once. If it is dead, we
|
|
|
|
// emit it inline where it would go.
|
2002-06-25 17:57:03 +02:00
|
|
|
if (I.getType() == Type::VoidTy || I.use_size() != 1 ||
|
2002-11-06 21:07:54 +01:00
|
|
|
isa<TerminatorInst>(I) || isa<CallInst>(I) || isa<PHINode>(I) ||
|
|
|
|
isa<LoadInst>(I)) // Don't inline a load across a store!
|
2002-05-09 23:18:38 +02:00
|
|
|
return false;
|
|
|
|
|
|
|
|
// Only inline instruction it it's use is in the same BB as the inst.
|
2002-06-25 17:57:03 +02:00
|
|
|
return I.getParent() == cast<Instruction>(I.use_back())->getParent();
|
2002-05-09 23:18:38 +02:00
|
|
|
}
|
|
|
|
|
2002-05-09 22:53:56 +02:00
|
|
|
// Instruction visitation functions
|
|
|
|
friend class InstVisitor<CWriter>;
|
2002-05-08 20:09:58 +02:00
|
|
|
|
2002-06-25 17:57:03 +02:00
|
|
|
void visitReturnInst(ReturnInst &I);
|
|
|
|
void visitBranchInst(BranchInst &I);
|
2002-05-08 20:09:58 +02:00
|
|
|
|
2002-06-25 17:57:03 +02:00
|
|
|
void visitPHINode(PHINode &I) {}
|
|
|
|
void visitBinaryOperator(Instruction &I);
|
2002-05-08 20:09:58 +02:00
|
|
|
|
2002-06-25 17:57:03 +02:00
|
|
|
void visitCastInst (CastInst &I);
|
|
|
|
void visitCallInst (CallInst &I);
|
|
|
|
void visitShiftInst(ShiftInst &I) { visitBinaryOperator(I); }
|
2002-05-09 22:53:56 +02:00
|
|
|
|
2002-06-25 17:57:03 +02: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);
|
2002-05-09 17:49:41 +02:00
|
|
|
|
2002-06-25 17:57:03 +02:00
|
|
|
void visitInstruction(Instruction &I) {
|
2002-06-30 18:07:20 +02:00
|
|
|
std::cerr << "C Writer does not know about " << I;
|
2002-05-09 22:53:56 +02:00
|
|
|
abort();
|
2002-05-09 17:49:41 +02:00
|
|
|
}
|
2002-05-09 22:14:10 +02:00
|
|
|
|
2002-05-09 22:53:56 +02:00
|
|
|
void outputLValue(Instruction *I) {
|
|
|
|
Out << " " << getValueName(I) << " = ";
|
2002-05-08 20:09:58 +02:00
|
|
|
}
|
2002-05-09 22:53:56 +02:00
|
|
|
void printBranchToBlock(BasicBlock *CurBlock, BasicBlock *SuccBlock,
|
|
|
|
unsigned Indent);
|
2002-08-20 01:09:46 +02:00
|
|
|
void printIndexingExpression(Value *Ptr, User::op_iterator I,
|
|
|
|
User::op_iterator E);
|
2002-05-09 22:53:56 +02:00
|
|
|
};
|
2002-05-09 05:50:42 +02:00
|
|
|
}
|
|
|
|
|
2002-05-09 06:21:21 +02:00
|
|
|
// We dont want identifier names with ., space, - in them.
|
|
|
|
// So we replace them with _
|
|
|
|
static string makeNameProper(string x) {
|
|
|
|
string tmp;
|
|
|
|
for (string::iterator sI = x.begin(), sEnd = x.end(); sI != sEnd; sI++)
|
|
|
|
switch (*sI) {
|
2002-05-09 17:18:52 +02:00
|
|
|
case '.': tmp += "d_"; break;
|
|
|
|
case ' ': tmp += "s_"; break;
|
|
|
|
case '-': tmp += "D_"; break;
|
2002-05-09 06:21:21 +02:00
|
|
|
default: tmp += *sI;
|
|
|
|
}
|
|
|
|
|
|
|
|
return tmp;
|
|
|
|
}
|
|
|
|
|
2002-05-09 05:06:06 +02:00
|
|
|
string CWriter::getValueName(const Value *V) {
|
2002-06-25 17:57:03 +02:00
|
|
|
if (V->hasName()) { // Print out the label if it exists...
|
|
|
|
if (isa<GlobalValue>(V) && // Do not mangle globals...
|
2002-11-18 23:21:52 +01:00
|
|
|
cast<GlobalValue>(V)->hasExternalLinkage())// && // Unless it's internal or
|
|
|
|
//!MangledGlobals.count(V)) // Unless the name would collide if we don't
|
2002-05-09 06:21:21 +02:00
|
|
|
return makeNameProper(V->getName());
|
|
|
|
|
2002-05-09 07:16:40 +02:00
|
|
|
return "l" + utostr(V->getType()->getUniqueID()) + "_" +
|
|
|
|
makeNameProper(V->getName());
|
2002-05-09 06:21:21 +02:00
|
|
|
}
|
2002-05-09 05:06:06 +02:00
|
|
|
|
2002-08-31 02:29:16 +02:00
|
|
|
int Slot = Table->getValSlot(V);
|
2002-05-09 05:06:06 +02:00
|
|
|
assert(Slot >= 0 && "Invalid value!");
|
2002-05-09 07:16:40 +02:00
|
|
|
return "ltmp_" + itostr(Slot) + "_" + utostr(V->getType()->getUniqueID());
|
2002-05-09 05:06:06 +02:00
|
|
|
}
|
|
|
|
|
2002-08-25 22:00:08 +02:00
|
|
|
// A pointer type should not use parens around *'s alone, e.g., (**)
|
|
|
|
inline bool ptrTypeNameNeedsParens(const string &NameSoFar) {
|
|
|
|
return (NameSoFar.find_last_not_of('*') != std::string::npos);
|
|
|
|
}
|
|
|
|
|
2002-08-20 00:17:53 +02:00
|
|
|
// Pass the Type* and the variable name and this prints out the variable
|
|
|
|
// declaration.
|
|
|
|
//
|
2002-11-18 21:55:50 +01:00
|
|
|
ostream &CWriter::printType(std::ostream &Out, const Type *Ty, const string &NameSoFar,
|
2002-08-25 22:00:08 +02:00
|
|
|
bool IgnoreName, bool namedContext) {
|
2002-08-20 00:17:53 +02: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 02:08:22 +02:00
|
|
|
if (!IgnoreName || isa<OpaqueType>(Ty)) {
|
2002-08-20 00:17:53 +02:00
|
|
|
map<const Type *, string>::iterator I = TypeNames.find(Ty);
|
|
|
|
if (I != TypeNames.end()) {
|
|
|
|
return Out << I->second << " " << NameSoFar;
|
|
|
|
}
|
2002-10-16 02:08:22 +02:00
|
|
|
}
|
2002-08-20 00:17:53 +02:00
|
|
|
|
|
|
|
switch (Ty->getPrimitiveID()) {
|
|
|
|
case Type::FunctionTyID: {
|
|
|
|
const FunctionType *MTy = cast<FunctionType>(Ty);
|
2002-11-18 21:55:50 +01:00
|
|
|
std::stringstream FunctionInards;
|
|
|
|
FunctionInards << " (" << NameSoFar << ") (";
|
2002-08-20 00:17:53 +02:00
|
|
|
for (FunctionType::ParamTypes::const_iterator
|
|
|
|
I = MTy->getParamTypes().begin(),
|
|
|
|
E = MTy->getParamTypes().end(); I != E; ++I) {
|
|
|
|
if (I != MTy->getParamTypes().begin())
|
2002-11-18 21:55:50 +01:00
|
|
|
FunctionInards << ", ";
|
|
|
|
printType(FunctionInards, *I, "");
|
2002-08-20 00:17:53 +02:00
|
|
|
}
|
|
|
|
if (MTy->isVarArg()) {
|
|
|
|
if (!MTy->getParamTypes().empty())
|
2002-11-18 21:55:50 +01:00
|
|
|
FunctionInards << ", ";
|
|
|
|
FunctionInards << "...";
|
2002-08-20 00:17:53 +02:00
|
|
|
}
|
2002-11-18 21:55:50 +01:00
|
|
|
FunctionInards << ")";
|
|
|
|
string tstr = FunctionInards.str();
|
|
|
|
printType(Out, MTy->getReturnType(), tstr);
|
|
|
|
return Out;
|
2002-08-20 00:17:53 +02: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 21:55:50 +01:00
|
|
|
printType(Out, *I, "field" + utostr(Idx++));
|
2002-08-20 00:17:53 +02:00
|
|
|
Out << ";\n";
|
|
|
|
}
|
|
|
|
return Out << "}";
|
|
|
|
}
|
|
|
|
|
|
|
|
case Type::PointerTyID: {
|
|
|
|
const PointerType *PTy = cast<PointerType>(Ty);
|
2002-08-25 22:00:08 +02:00
|
|
|
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 ( ).
|
2002-09-23 23:02:50 +02:00
|
|
|
if (ptrTypeNameNeedsParens(NameSoFar) || !namedContext ||
|
|
|
|
PTy->getElementType()->getPrimitiveID() == Type::ArrayTyID)
|
2002-08-25 22:00:08 +02:00
|
|
|
ptrName = "(" + ptrName + ")"; //
|
|
|
|
|
2002-11-18 21:55:50 +01:00
|
|
|
return printType(Out, PTy->getElementType(), ptrName);
|
|
|
|
}Out <<"--";
|
2002-08-20 00:17:53 +02:00
|
|
|
|
|
|
|
case Type::ArrayTyID: {
|
|
|
|
const ArrayType *ATy = cast<ArrayType>(Ty);
|
|
|
|
unsigned NumElements = ATy->getNumElements();
|
2002-11-18 21:55:50 +01:00
|
|
|
return printType(Out, ATy->getElementType(),
|
2002-08-20 00:17:53 +02:00
|
|
|
NameSoFar + "[" + utostr(NumElements) + "]");
|
|
|
|
}
|
2002-10-16 02:08:22 +02:00
|
|
|
|
|
|
|
case Type::OpaqueTyID: {
|
|
|
|
static int Count = 0;
|
|
|
|
string TyName = "struct opaque_" + itostr(Count++);
|
|
|
|
assert(TypeNames.find(Ty) == TypeNames.end());
|
|
|
|
TypeNames[Ty] = TyName;
|
|
|
|
return Out << TyName << " " << NameSoFar;
|
|
|
|
}
|
2002-08-20 00:17:53 +02:00
|
|
|
default:
|
|
|
|
assert(0 && "Unhandled case in getTypeProps!");
|
|
|
|
abort();
|
|
|
|
}
|
|
|
|
|
|
|
|
return Out;
|
|
|
|
}
|
|
|
|
|
2002-08-19 23:32:41 +02: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
|
|
|
|
if (CPA->getNumOperands() == 0 ||
|
|
|
|
!cast<Constant>(*(CPA->op_end()-1))->isNullValue())
|
|
|
|
isString = false;
|
|
|
|
|
|
|
|
if (isString) {
|
|
|
|
Out << "\"";
|
|
|
|
// 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();
|
|
|
|
|
|
|
|
if (isprint(C)) {
|
2002-11-06 22:40:23 +01:00
|
|
|
if (C == '"' || C == '\\')
|
|
|
|
Out << "\\" << C;
|
2002-09-30 23:11:55 +02:00
|
|
|
else
|
|
|
|
Out << C;
|
2002-08-19 23:32:41 +02:00
|
|
|
} else {
|
|
|
|
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 23:11:55 +02:00
|
|
|
case '\"': Out << "\\\""; break;
|
|
|
|
case '\'': Out << "\\\'"; break;
|
2002-08-19 23:32:41 +02:00
|
|
|
default:
|
|
|
|
Out << "\\x";
|
|
|
|
Out << ( C/16 < 10) ? ( C/16 +'0') : ( C/16 -10+'A');
|
|
|
|
Out << ((C&15) < 10) ? ((C&15)+'0') : ((C&15)-10+'A');
|
|
|
|
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 << " }";
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
// 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-20 01:09:46 +02:00
|
|
|
case Instruction::Cast:
|
|
|
|
Out << "((";
|
2002-11-18 21:55:50 +01:00
|
|
|
printType(Out, CPV->getType());
|
2002-08-20 01:09:46 +02:00
|
|
|
Out << ")";
|
|
|
|
printConstant(cast<Constant>(CPV->getOperand(0)));
|
|
|
|
Out << ")";
|
|
|
|
return;
|
|
|
|
|
|
|
|
case Instruction::GetElementPtr:
|
2002-10-03 22:47:24 +02:00
|
|
|
Out << "(&(";
|
2002-08-20 01:09:46 +02:00
|
|
|
printIndexingExpression(CPV->getOperand(0),
|
|
|
|
CPV->op_begin()+1, CPV->op_end());
|
2002-10-03 22:47:24 +02:00
|
|
|
Out << "))";
|
2002-08-20 01:09:46 +02:00
|
|
|
return;
|
|
|
|
case Instruction::Add:
|
|
|
|
Out << "(";
|
|
|
|
printConstant(cast<Constant>(CPV->getOperand(0)));
|
|
|
|
Out << " + ";
|
|
|
|
printConstant(cast<Constant>(CPV->getOperand(1)));
|
|
|
|
Out << ")";
|
|
|
|
return;
|
|
|
|
case Instruction::Sub:
|
|
|
|
Out << "(";
|
|
|
|
printConstant(cast<Constant>(CPV->getOperand(0)));
|
|
|
|
Out << " - ";
|
|
|
|
printConstant(cast<Constant>(CPV->getOperand(1)));
|
|
|
|
Out << ")";
|
|
|
|
return;
|
|
|
|
|
2002-08-19 23:32:41 +02: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:
|
|
|
|
case Type::IntTyID:
|
|
|
|
Out << cast<ConstantSInt>(CPV)->getValue(); break;
|
|
|
|
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-21 01:26:33 +02:00
|
|
|
case Type::DoubleTyID: {
|
|
|
|
ConstantFP *FPC = cast<ConstantFP>(CPV);
|
|
|
|
map<const ConstantFP *, unsigned>::iterator I = FPConstantMap.find(FPC);
|
|
|
|
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")
|
|
|
|
<< "*)&FloatConstant" << I->second << ")";
|
|
|
|
} else {
|
|
|
|
Out << FPC->getValue();
|
|
|
|
}
|
|
|
|
break;
|
|
|
|
}
|
2002-08-19 23:32:41 +02: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 22:53:56 +02:00
|
|
|
if (isa<ConstantPointerNull>(CPV)) {
|
2002-10-28 20:54:06 +01:00
|
|
|
Out << "(NULL)";
|
2002-08-19 23:32:41 +02: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-20 01:09:46 +02:00
|
|
|
if (Instruction *I = dyn_cast<Instruction>(Operand))
|
|
|
|
if (isInlinableInst(*I)) {
|
|
|
|
// Should we inline this instruction to build a tree?
|
|
|
|
Out << "(";
|
|
|
|
visit(*I);
|
|
|
|
Out << ")";
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
2002-10-28 20:05:12 +01:00
|
|
|
if (Operand->hasName()) {
|
2002-08-19 23:32:41 +02:00
|
|
|
Out << getValueName(Operand);
|
|
|
|
} else if (Constant *CPV = dyn_cast<Constant>(Operand)) {
|
|
|
|
printConstant(CPV);
|
2002-05-09 22:53:56 +02:00
|
|
|
} else {
|
2002-08-31 02:29:16 +02:00
|
|
|
int Slot = Table->getValSlot(Operand);
|
2002-05-09 22:53:56 +02:00
|
|
|
assert(Slot >= 0 && "Malformed LLVM!");
|
|
|
|
Out << "ltmp_" << Slot << "_" << Operand->getType()->getUniqueID();
|
|
|
|
}
|
2002-05-09 23:18:38 +02:00
|
|
|
}
|
|
|
|
|
2002-06-25 17:57:03 +02:00
|
|
|
void CWriter::writeOperand(Value *Operand) {
|
2002-05-09 23:18:38 +02:00
|
|
|
if (isa<GlobalVariable>(Operand))
|
|
|
|
Out << "(&"; // Global variables are references as their addresses by llvm
|
|
|
|
|
|
|
|
writeOperandInternal(Operand);
|
2002-05-09 22:53:56 +02:00
|
|
|
|
|
|
|
if (isa<GlobalVariable>(Operand))
|
|
|
|
Out << ")";
|
|
|
|
}
|
|
|
|
|
2002-08-31 02:29:16 +02: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...
|
|
|
|
std::set<const Type *> UT = getAnalysis<FindUsedTypes>().getTypes();
|
|
|
|
|
|
|
|
// Loop over the module symbol table, removing types from UT that are already
|
|
|
|
// named.
|
|
|
|
//
|
2002-11-20 19:36:02 +01: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 02:29:16 +02: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 19:36:02 +01:00
|
|
|
((Value*)ST)->setName("unnamed", &MST);
|
2002-08-31 02:29:16 +02:00
|
|
|
Changed = true;
|
|
|
|
}
|
|
|
|
return Changed;
|
|
|
|
}
|
|
|
|
|
2002-05-09 17:49:41 +02:00
|
|
|
void CWriter::printModule(Module *M) {
|
2002-05-17 06:55:35 +02:00
|
|
|
// Calculate which global values have names that will collide when we throw
|
|
|
|
// away type information.
|
2002-05-21 23:10:04 +02:00
|
|
|
{ // Scope to delete the FoundNames set when we are done with it...
|
2002-05-17 06:55:35 +02:00
|
|
|
std::set<string> FoundNames;
|
|
|
|
for (Module::iterator I = M->begin(), E = M->end(); I != E; ++I)
|
2002-06-25 17:57:03 +02: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 06:55:35 +02:00
|
|
|
else
|
2002-06-25 17:57:03 +02:00
|
|
|
FoundNames.insert(I->getName()); // Otherwise, keep track of name
|
2002-05-17 06:55:35 +02:00
|
|
|
|
|
|
|
for (Module::giterator I = M->gbegin(), E = M->gend(); I != E; ++I)
|
2002-06-25 17:57:03 +02: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 06:55:35 +02:00
|
|
|
else
|
2002-06-25 17:57:03 +02:00
|
|
|
FoundNames.insert(I->getName()); // Otherwise, keep track of name
|
2002-05-17 06:55:35 +02:00
|
|
|
}
|
|
|
|
|
2002-05-08 20:09:58 +02:00
|
|
|
// printing stdlib inclusion
|
2002-10-11 23:40:44 +02:00
|
|
|
//Out << "#include <stdlib.h>\n";
|
2002-05-08 20:09:58 +02:00
|
|
|
|
2002-05-09 04:28:59 +02:00
|
|
|
// get declaration for alloca
|
|
|
|
Out << "/* Provide Declarations */\n"
|
2002-05-09 05:06:06 +02:00
|
|
|
<< "#include <alloca.h>\n\n"
|
2002-05-09 04:28:59 +02:00
|
|
|
|
2002-08-25 22:00:08 +02:00
|
|
|
// Provide a definition for null if one does not already exist,
|
|
|
|
// and for `bool' if not compiling with a C++ compiler.
|
2002-05-09 05:06:06 +02:00
|
|
|
<< "#ifndef NULL\n#define NULL 0\n#endif\n\n"
|
2002-08-25 22:00:08 +02:00
|
|
|
<< "#ifndef __cplusplus\ntypedef unsigned char bool;\n#endif\n"
|
2002-05-09 04:28:59 +02:00
|
|
|
|
2002-09-21 01:26:33 +02:00
|
|
|
<< "\n\n/* Support for floating point constants */\n"
|
|
|
|
<< "typedef unsigned long long ConstantDoubleTy;\n"
|
2002-11-07 20:43:59 +01:00
|
|
|
<< "typedef unsigned int ConstantFloatTy;\n"
|
2002-09-21 01:26:33 +02:00
|
|
|
|
2002-08-19 23:48:40 +02: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 04:28:59 +02:00
|
|
|
|
2002-05-08 20:09:58 +02:00
|
|
|
// Loop over the symbol table, emitting all named constants...
|
2002-11-20 19:36:02 +01:00
|
|
|
printSymbolTable(M->getSymbolTable());
|
2002-05-08 20:09:58 +02:00
|
|
|
|
2002-08-19 23:48:40 +02:00
|
|
|
// Global variable declarations...
|
|
|
|
if (!M->gempty()) {
|
2002-09-17 13:50:38 +02:00
|
|
|
Out << "\n/* External Global Variable Declarations */\n";
|
2002-08-19 23:48:40 +02:00
|
|
|
for (Module::giterator I = M->gbegin(), E = M->gend(); I != E; ++I) {
|
2002-09-17 13:50:38 +02:00
|
|
|
if (I->hasExternalLinkage()) {
|
|
|
|
Out << "extern ";
|
2002-11-18 21:55:50 +01:00
|
|
|
printType(Out, I->getType()->getElementType(), getValueName(I));
|
2002-09-17 13:50:38 +02:00
|
|
|
Out << ";\n";
|
|
|
|
}
|
2002-08-19 23:48:40 +02:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
// Function declarations
|
|
|
|
if (!M->empty()) {
|
|
|
|
Out << "\n/* Function Declarations */\n";
|
2002-10-23 20:59:40 +02:00
|
|
|
needsMalloc = true;
|
2002-08-20 18:55:48 +02:00
|
|
|
for (Module::iterator I = M->begin(), E = M->end(); I != E; ++I) {
|
2002-11-18 23:21:52 +01:00
|
|
|
// If the function is external and the name collides don't print it.
|
|
|
|
// Sometimes the bytecode likes to have multiple "declerations" for external functions
|
|
|
|
if (I->hasInternalLinkage() || !MangledGlobals.count(I)){
|
|
|
|
printFunctionSignature(I, true);
|
|
|
|
Out << ";\n";
|
|
|
|
}
|
2002-08-20 18:55:48 +02:00
|
|
|
}
|
2002-08-19 23:48:40 +02:00
|
|
|
}
|
2002-05-09 17:18:52 +02:00
|
|
|
|
2002-10-23 20:59:40 +02:00
|
|
|
// Print Malloc prototype if needed
|
|
|
|
if (needsMalloc){
|
|
|
|
Out << "\n/* Malloc to make sun happy */\n";
|
|
|
|
Out << "extern void * malloc(size_t);\n\n";
|
|
|
|
}
|
|
|
|
|
2002-10-28 20:05:12 +01:00
|
|
|
// Output the global variable declerations
|
|
|
|
if (!M->gempty()) {
|
|
|
|
Out << "\n\n/* Global Variable Declerations */\n";
|
|
|
|
for (Module::giterator I = M->gbegin(), E = M->gend(); I != E; ++I)
|
|
|
|
if (!I->isExternal()) {
|
|
|
|
Out << "extern ";
|
2002-11-18 21:55:50 +01:00
|
|
|
printType(Out, I->getType()->getElementType(), getValueName(I));
|
2002-10-28 20:05:12 +01:00
|
|
|
|
|
|
|
Out << ";\n";
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2002-09-17 13:50:38 +02:00
|
|
|
// Output the global variable definitions and contents...
|
2002-08-19 23:48:40 +02:00
|
|
|
if (!M->gempty()) {
|
2002-09-17 13:50:38 +02:00
|
|
|
Out << "\n\n/* Global Variable Definitions and Initialization */\n";
|
2002-10-16 22:08:47 +02:00
|
|
|
for (Module::giterator I = M->gbegin(), E = M->gend(); I != E; ++I)
|
|
|
|
if (!I->isExternal()) {
|
|
|
|
if (I->hasInternalLinkage())
|
|
|
|
Out << "static ";
|
2002-11-18 21:55:50 +01:00
|
|
|
printType(Out, I->getType()->getElementType(), getValueName(I));
|
2002-08-19 23:48:40 +02:00
|
|
|
|
|
|
|
Out << " = " ;
|
|
|
|
writeOperand(I->getInitializer());
|
2002-10-16 22:08:47 +02:00
|
|
|
Out << ";\n";
|
2002-08-19 23:48:40 +02:00
|
|
|
}
|
2002-05-09 17:18:52 +02:00
|
|
|
}
|
2002-05-08 20:09:58 +02:00
|
|
|
|
2002-05-09 04:28:59 +02:00
|
|
|
// Output all of the functions...
|
2002-08-19 23:48:40 +02:00
|
|
|
if (!M->empty()) {
|
|
|
|
Out << "\n\n/* Function Bodies */\n";
|
|
|
|
for (Module::iterator I = M->begin(), E = M->end(); I != E; ++I)
|
|
|
|
printFunction(I);
|
|
|
|
}
|
2002-05-08 20:09:58 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
|
2002-09-20 17:12:13 +02:00
|
|
|
/// printSymbolTable - Run through symbol table looking for type names. If a
|
|
|
|
/// type name is found, emit it's declaration...
|
2002-09-20 16:56:54 +02:00
|
|
|
///
|
2002-05-08 20:09:58 +02:00
|
|
|
void CWriter::printSymbolTable(const SymbolTable &ST) {
|
2002-09-20 17:12:13 +02: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 17:18:30 +02:00
|
|
|
// 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)) {
|
|
|
|
string Name = "struct l_" + makeNameProper(I->first);
|
|
|
|
Out << Name << ";\n";
|
|
|
|
TypeNames.insert(std::make_pair(STy, Name));
|
|
|
|
}
|
|
|
|
|
|
|
|
Out << "\n";
|
|
|
|
|
|
|
|
// Now we can print out typedefs...
|
|
|
|
Out << "/* Typedefs */\n";
|
|
|
|
for (I = ST.type_begin(Type::TypeTy); I != End; ++I) {
|
|
|
|
const Type *Ty = cast<Type>(I->second);
|
|
|
|
string Name = "l_" + makeNameProper(I->first);
|
|
|
|
Out << "typedef ";
|
2002-11-18 21:55:50 +01:00
|
|
|
printType(Out, Ty, Name);
|
2002-09-20 17:18:30 +02:00
|
|
|
Out << ";\n";
|
2002-05-09 16:40:11 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
Out << "\n";
|
|
|
|
|
2002-09-20 17:05:40 +02:00
|
|
|
// Keep track of which structures have been printed so far...
|
|
|
|
std::set<const StructType *> StructPrinted;
|
|
|
|
|
2002-09-14 23:36:24 +02:00
|
|
|
// Loop over all structures then push them into the stack so they are
|
|
|
|
// printed in the correct order.
|
2002-09-20 17:12:13 +02:00
|
|
|
//
|
2002-09-20 17:18:30 +02:00
|
|
|
Out << "/* Structure contents */\n";
|
2002-09-20 17:12:13 +02:00
|
|
|
for (I = ST.type_begin(Type::TypeTy); I != End; ++I)
|
|
|
|
if (const StructType *STy = dyn_cast<StructType>(I->second))
|
|
|
|
printContainedStructs(STy, StructPrinted);
|
2002-09-14 23:36:24 +02:00
|
|
|
}
|
2002-05-09 22:14:10 +02:00
|
|
|
|
2002-09-14 23:36:24 +02:00
|
|
|
// Push the struct onto the stack and recursively push all structs
|
|
|
|
// this one depends on.
|
2002-09-20 17:05:40 +02:00
|
|
|
void CWriter::printContainedStructs(const Type *Ty,
|
|
|
|
std::set<const StructType*> &StructPrinted){
|
2002-09-14 23:36:24 +02:00
|
|
|
if (const StructType *STy = dyn_cast<StructType>(Ty)){
|
|
|
|
//Check to see if we have already printed this struct
|
2002-09-20 17:05:40 +02:00
|
|
|
if (StructPrinted.count(STy) == 0) {
|
|
|
|
// Print all contained types first...
|
2002-09-20 16:56:54 +02:00
|
|
|
for (StructType::ElementTypes::const_iterator
|
|
|
|
I = STy->getElementTypes().begin(),
|
|
|
|
E = STy->getElementTypes().end(); I != E; ++I) {
|
2002-09-20 17:05:40 +02:00
|
|
|
const Type *Ty1 = I->get();
|
2002-09-20 16:56:54 +02:00
|
|
|
if (isa<StructType>(Ty1) || isa<ArrayType>(Ty1))
|
2002-09-20 17:05:40 +02:00
|
|
|
printContainedStructs(Ty1, StructPrinted);
|
2002-09-20 16:56:54 +02:00
|
|
|
}
|
|
|
|
|
2002-09-20 17:05:40 +02:00
|
|
|
//Print structure type out..
|
2002-09-14 23:36:24 +02:00
|
|
|
StructPrinted.insert(STy);
|
|
|
|
string Name = TypeNames[STy];
|
2002-11-18 21:55:50 +01:00
|
|
|
printType(Out, STy, Name, true);
|
2002-09-20 17:18:30 +02:00
|
|
|
Out << ";\n\n";
|
2002-05-08 20:09:58 +02:00
|
|
|
}
|
2002-09-20 16:56:54 +02:00
|
|
|
|
2002-09-20 17:05:40 +02:00
|
|
|
// If it is an array, check contained types and continue
|
|
|
|
} else if (const ArrayType *ATy = dyn_cast<ArrayType>(Ty)){
|
2002-09-14 23:36:24 +02:00
|
|
|
const Type *Ty1 = ATy->getElementType();
|
|
|
|
if (isa<StructType>(Ty1) || isa<ArrayType>(Ty1))
|
2002-09-20 17:05:40 +02:00
|
|
|
printContainedStructs(Ty1, StructPrinted);
|
2002-09-14 23:36:24 +02:00
|
|
|
}
|
2002-05-08 20:09:58 +02:00
|
|
|
}
|
|
|
|
|
2002-05-09 16:40:11 +02:00
|
|
|
|
2002-08-20 18:55:48 +02:00
|
|
|
void CWriter::printFunctionSignature(const Function *F, bool Prototype) {
|
2002-10-23 20:59:40 +02:00
|
|
|
// If the program provides it's own malloc prototype we don't need
|
|
|
|
// to include the general one.
|
|
|
|
if (getValueName(F) == "malloc")
|
|
|
|
needsMalloc = false;
|
2002-11-18 21:55:50 +01:00
|
|
|
if (F->hasInternalLinkage()) Out << "static ";
|
2002-05-08 20:09:58 +02:00
|
|
|
// Loop over the arguments, printing them...
|
2002-05-09 04:28:59 +02:00
|
|
|
const FunctionType *FT = cast<FunctionType>(F->getFunctionType());
|
2002-05-08 20:09:58 +02:00
|
|
|
|
2002-11-18 21:55:50 +01:00
|
|
|
std::stringstream FunctionInards;
|
|
|
|
|
|
|
|
// Print out the name...
|
|
|
|
FunctionInards << getValueName(F) << "(";
|
2002-05-08 20:09:58 +02:00
|
|
|
|
2002-05-09 04:28:59 +02:00
|
|
|
if (!F->isExternal()) {
|
2002-06-25 17:57:03 +02:00
|
|
|
if (!F->aempty()) {
|
2002-08-20 18:55:48 +02:00
|
|
|
string ArgName;
|
|
|
|
if (F->abegin()->hasName() || !Prototype)
|
|
|
|
ArgName = getValueName(F->abegin());
|
2002-11-18 21:55:50 +01:00
|
|
|
printType(FunctionInards, F->afront().getType(), ArgName);
|
2002-06-25 17:57:03 +02:00
|
|
|
for (Function::const_aiterator I = ++F->abegin(), E = F->aend();
|
|
|
|
I != E; ++I) {
|
2002-11-18 21:55:50 +01:00
|
|
|
FunctionInards << ", ";
|
2002-08-20 18:55:48 +02:00
|
|
|
if (I->hasName() || !Prototype)
|
|
|
|
ArgName = getValueName(I);
|
|
|
|
else
|
|
|
|
ArgName = "";
|
2002-11-18 21:55:50 +01:00
|
|
|
printType(FunctionInards, I->getType(), ArgName);
|
2002-05-09 17:18:52 +02:00
|
|
|
}
|
|
|
|
}
|
2002-05-08 20:09:58 +02:00
|
|
|
} else {
|
|
|
|
// Loop over the arguments, printing them...
|
|
|
|
for (FunctionType::ParamTypes::const_iterator I =
|
2002-05-09 04:28:59 +02:00
|
|
|
FT->getParamTypes().begin(),
|
|
|
|
E = FT->getParamTypes().end(); I != E; ++I) {
|
2002-11-18 21:55:50 +01:00
|
|
|
if (I != FT->getParamTypes().begin()) FunctionInards << ", ";
|
|
|
|
printType(FunctionInards, *I);
|
2002-05-08 20:09:58 +02:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2002-09-21 00:32:30 +02: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()) {
|
2002-11-18 21:55:50 +01:00
|
|
|
if (FT->getParamTypes().size()) FunctionInards << ", ";
|
|
|
|
FunctionInards << "..."; // Output varargs portion of signature!
|
2002-05-08 20:09:58 +02:00
|
|
|
}
|
2002-11-18 21:55:50 +01:00
|
|
|
FunctionInards << ")";
|
|
|
|
// Print out the return type and the entire signature for that matter
|
|
|
|
printType(Out, F->getReturnType(), FunctionInards.str());
|
|
|
|
|
2002-05-08 20:09:58 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
|
2002-05-09 17:49:41 +02:00
|
|
|
void CWriter::printFunction(Function *F) {
|
2002-05-09 04:28:59 +02:00
|
|
|
if (F->isExternal()) return;
|
2002-05-08 20:09:58 +02:00
|
|
|
|
2002-08-31 02:29:16 +02:00
|
|
|
Table->incorporateFunction(F);
|
2002-05-09 05:12:34 +02:00
|
|
|
|
2002-08-20 18:55:48 +02:00
|
|
|
printFunctionSignature(F, false);
|
2002-05-09 17:49:41 +02:00
|
|
|
Out << " {\n";
|
|
|
|
|
2002-05-09 22:39:03 +02:00
|
|
|
// print local variable information for the function
|
2002-05-09 22:33:35 +02:00
|
|
|
for (inst_iterator I = inst_begin(F), E = inst_end(F); I != E; ++I)
|
2002-06-25 17:57:03 +02:00
|
|
|
if ((*I)->getType() != Type::VoidTy && !isInlinableInst(**I)) {
|
2002-05-09 04:28:59 +02:00
|
|
|
Out << " ";
|
2002-11-18 21:55:50 +01:00
|
|
|
printType(Out, (*I)->getType(), getValueName(*I));
|
2002-05-09 04:28:59 +02:00
|
|
|
Out << ";\n";
|
2002-05-08 20:09:58 +02:00
|
|
|
}
|
2002-09-21 01:26:33 +02:00
|
|
|
|
|
|
|
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.
|
|
|
|
//
|
|
|
|
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 (FPConstantMap.find(FPC) == FPConstantMap.end()) {
|
|
|
|
double Val = FPC->getValue();
|
|
|
|
|
|
|
|
FPConstantMap[FPC] = FPCounter; // Number the FP constants
|
2002-11-07 20:43:59 +01:00
|
|
|
|
|
|
|
if (FPC->getType() == Type::DoubleTy)
|
|
|
|
Out << " const ConstantDoubleTy FloatConstant" << FPCounter++
|
|
|
|
<< " = 0x" << std::hex << *(unsigned long long*)&Val << std::dec
|
|
|
|
<< "; /* " << Val << " */\n";
|
2002-11-07 23:12:53 +01:00
|
|
|
else if (FPC->getType() == Type::FloatTy) {
|
|
|
|
float fVal = Val;
|
2002-11-07 20:43:59 +01:00
|
|
|
Out << " const ConstantFloatTy FloatConstant" << FPCounter++
|
2002-11-07 23:12:53 +01:00
|
|
|
<< " = 0x" << std::hex << *(unsigned*)&fVal << std::dec
|
2002-11-07 20:43:59 +01:00
|
|
|
<< "; /* " << Val << " */\n";
|
2002-11-07 23:12:53 +01:00
|
|
|
} else
|
2002-11-07 20:43:59 +01:00
|
|
|
assert(0 && "Unknown float type!");
|
2002-09-21 01:26:33 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
Out << "\n";
|
2002-05-09 04:28:59 +02:00
|
|
|
|
|
|
|
// print the basic blocks
|
2002-06-25 17:57:03 +02:00
|
|
|
for (Function::iterator BB = F->begin(), E = F->end(); BB != E; ++BB) {
|
|
|
|
BasicBlock *Prev = BB->getPrev();
|
2002-05-09 17:49:41 +02:00
|
|
|
|
|
|
|
// 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()) {
|
|
|
|
NeedsLabel = true;
|
|
|
|
break;
|
|
|
|
}
|
2002-05-08 20:09:58 +02:00
|
|
|
|
2002-05-09 17:49:41 +02:00
|
|
|
if (NeedsLabel) Out << getValueName(BB) << ":\n";
|
2002-05-08 20:09:58 +02:00
|
|
|
|
2002-05-09 17:49:41 +02:00
|
|
|
// Output all of the instructions in the basic block...
|
2002-06-25 17:57:03 +02:00
|
|
|
for (BasicBlock::iterator II = BB->begin(), E = --BB->end(); II != E; ++II){
|
2002-05-09 23:18:38 +02:00
|
|
|
if (!isInlinableInst(*II) && !isa<PHINode>(*II)) {
|
2002-06-25 17:57:03 +02:00
|
|
|
if (II->getType() != Type::VoidTy)
|
|
|
|
outputLValue(II);
|
2002-05-09 23:18:38 +02:00
|
|
|
else
|
|
|
|
Out << " ";
|
2002-06-25 17:57:03 +02:00
|
|
|
visit(*II);
|
2002-05-09 23:18:38 +02:00
|
|
|
Out << ";\n";
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
// Don't emit prefix or suffix for the terminator...
|
2002-06-25 17:57:03 +02:00
|
|
|
visit(*BB->getTerminator());
|
2002-05-09 17:49:41 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
Out << "}\n\n";
|
2002-08-31 02:29:16 +02:00
|
|
|
Table->purgeFunction();
|
2002-09-21 01:26:33 +02:00
|
|
|
FPConstantMap.clear();
|
2002-05-08 20:09:58 +02:00
|
|
|
}
|
|
|
|
|
2002-05-09 22:53:56 +02:00
|
|
|
// Specific Instruction type classes... note that all of the casts are
|
|
|
|
// neccesary because we use the instruction classes as opaque types...
|
|
|
|
//
|
2002-06-25 17:57:03 +02:00
|
|
|
void CWriter::visitReturnInst(ReturnInst &I) {
|
2002-05-09 22:53:56 +02:00
|
|
|
// Don't output a void return if this is the last basic block in the function
|
2002-06-25 17:57:03 +02:00
|
|
|
if (I.getNumOperands() == 0 &&
|
|
|
|
&*--I.getParent()->getParent()->end() == I.getParent() &&
|
|
|
|
!I.getParent()->size() == 1) {
|
2002-05-09 22:53:56 +02:00
|
|
|
return;
|
2002-05-21 20:05:19 +02:00
|
|
|
}
|
2002-05-09 05:50:42 +02:00
|
|
|
|
2002-05-09 22:53:56 +02:00
|
|
|
Out << " return";
|
2002-06-25 17:57:03 +02:00
|
|
|
if (I.getNumOperands()) {
|
2002-05-09 22:53:56 +02:00
|
|
|
Out << " ";
|
2002-06-25 17:57:03 +02:00
|
|
|
writeOperand(I.getOperand(0));
|
2002-05-09 22:53:56 +02:00
|
|
|
}
|
|
|
|
Out << ";\n";
|
|
|
|
}
|
|
|
|
|
|
|
|
static bool isGotoCodeNeccessary(BasicBlock *From, BasicBlock *To) {
|
|
|
|
// If PHI nodes need copies, we need the copy code...
|
|
|
|
if (isa<PHINode>(To->front()) ||
|
2002-06-25 17:57:03 +02:00
|
|
|
From->getNext() != To) // Not directly successor, need goto
|
2002-05-09 22:53:56 +02:00
|
|
|
return true;
|
|
|
|
|
|
|
|
// Otherwise we don't need the code.
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
|
|
|
void CWriter::printBranchToBlock(BasicBlock *CurBB, BasicBlock *Succ,
|
|
|
|
unsigned Indent) {
|
|
|
|
for (BasicBlock::iterator I = Succ->begin();
|
2002-06-25 17:57:03 +02:00
|
|
|
PHINode *PN = dyn_cast<PHINode>(&*I); ++I) {
|
2002-05-09 22:53:56 +02:00
|
|
|
// now we have to do the printing
|
|
|
|
Out << string(Indent, ' ');
|
|
|
|
outputLValue(PN);
|
|
|
|
writeOperand(PN->getIncomingValue(PN->getBasicBlockIndex(CurBB)));
|
|
|
|
Out << "; /* for PHI node */\n";
|
|
|
|
}
|
|
|
|
|
2002-06-25 17:57:03 +02:00
|
|
|
if (CurBB->getNext() != Succ) {
|
2002-05-09 22:53:56 +02:00
|
|
|
Out << 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.
|
|
|
|
//
|
2002-06-25 17:57:03 +02:00
|
|
|
void CWriter::visitBranchInst(BranchInst &I) {
|
|
|
|
if (I.isConditional()) {
|
|
|
|
if (isGotoCodeNeccessary(I.getParent(), I.getSuccessor(0))) {
|
2002-05-09 22:53:56 +02:00
|
|
|
Out << " if (";
|
2002-06-25 17:57:03 +02:00
|
|
|
writeOperand(I.getCondition());
|
2002-05-09 22:53:56 +02:00
|
|
|
Out << ") {\n";
|
|
|
|
|
2002-06-25 17:57:03 +02:00
|
|
|
printBranchToBlock(I.getParent(), I.getSuccessor(0), 2);
|
2002-05-09 22:53:56 +02:00
|
|
|
|
2002-06-25 17:57:03 +02:00
|
|
|
if (isGotoCodeNeccessary(I.getParent(), I.getSuccessor(1))) {
|
2002-05-09 22:53:56 +02:00
|
|
|
Out << " } else {\n";
|
2002-06-25 17:57:03 +02:00
|
|
|
printBranchToBlock(I.getParent(), I.getSuccessor(1), 2);
|
2002-05-09 22:53:56 +02:00
|
|
|
}
|
|
|
|
} else {
|
|
|
|
// First goto not neccesary, assume second one is...
|
|
|
|
Out << " if (!";
|
2002-06-25 17:57:03 +02:00
|
|
|
writeOperand(I.getCondition());
|
2002-05-09 22:53:56 +02:00
|
|
|
Out << ") {\n";
|
|
|
|
|
2002-06-25 17:57:03 +02:00
|
|
|
printBranchToBlock(I.getParent(), I.getSuccessor(1), 2);
|
2002-05-09 22:53:56 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
Out << " }\n";
|
2002-05-09 05:50:42 +02:00
|
|
|
} else {
|
2002-06-25 17:57:03 +02:00
|
|
|
printBranchToBlock(I.getParent(), I.getSuccessor(0), 0);
|
2002-05-09 04:28:59 +02:00
|
|
|
}
|
2002-05-09 22:53:56 +02:00
|
|
|
Out << "\n";
|
|
|
|
}
|
2002-05-09 05:50:42 +02:00
|
|
|
|
2002-05-09 22:53:56 +02:00
|
|
|
|
2002-06-25 17:57:03 +02:00
|
|
|
void CWriter::visitBinaryOperator(Instruction &I) {
|
2002-05-09 22:53:56 +02:00
|
|
|
// binary instructions, shift instructions, setCond instructions.
|
2002-06-25 17:57:03 +02:00
|
|
|
if (isa<PointerType>(I.getType())) {
|
2002-05-09 22:53:56 +02:00
|
|
|
Out << "(";
|
2002-11-18 21:55:50 +01:00
|
|
|
printType(Out, I.getType());
|
2002-05-09 05:50:42 +02:00
|
|
|
Out << ")";
|
2002-05-09 22:53:56 +02:00
|
|
|
}
|
|
|
|
|
2002-06-25 17:57:03 +02:00
|
|
|
if (isa<PointerType>(I.getType())) Out << "(long long)";
|
|
|
|
writeOperand(I.getOperand(0));
|
2002-05-09 22:53:56 +02:00
|
|
|
|
2002-06-25 17:57:03 +02:00
|
|
|
switch (I.getOpcode()) {
|
2002-05-09 22:53:56 +02: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 18:07:20 +02:00
|
|
|
default: std::cerr << "Invalid operator type!" << I; abort();
|
2002-05-09 22:53:56 +02:00
|
|
|
}
|
|
|
|
|
2002-06-25 17:57:03 +02:00
|
|
|
if (isa<PointerType>(I.getType())) Out << "(long long)";
|
|
|
|
writeOperand(I.getOperand(1));
|
2002-05-09 22:53:56 +02:00
|
|
|
}
|
|
|
|
|
2002-06-25 17:57:03 +02:00
|
|
|
void CWriter::visitCastInst(CastInst &I) {
|
2002-05-09 22:53:56 +02:00
|
|
|
Out << "(";
|
2002-11-18 21:55:50 +01:00
|
|
|
printType(Out, I.getType(), string(""),/*ignoreName*/false, /*namedContext*/false);
|
2002-05-09 22:53:56 +02:00
|
|
|
Out << ")";
|
2002-06-25 17:57:03 +02:00
|
|
|
writeOperand(I.getOperand(0));
|
2002-05-09 22:53:56 +02:00
|
|
|
}
|
|
|
|
|
2002-06-25 17:57:03 +02:00
|
|
|
void CWriter::visitCallInst(CallInst &I) {
|
|
|
|
const PointerType *PTy = cast<PointerType>(I.getCalledValue()->getType());
|
2002-05-09 22:53:56 +02:00
|
|
|
const FunctionType *FTy = cast<FunctionType>(PTy->getElementType());
|
|
|
|
const Type *RetTy = FTy->getReturnType();
|
|
|
|
|
2002-08-26 22:50:09 +02:00
|
|
|
writeOperand(I.getOperand(0));
|
|
|
|
Out << "(";
|
2002-05-09 22:53:56 +02:00
|
|
|
|
2002-06-25 17:57:03 +02:00
|
|
|
if (I.getNumOperands() > 1) {
|
|
|
|
writeOperand(I.getOperand(1));
|
2002-05-09 22:53:56 +02:00
|
|
|
|
2002-06-25 17:57:03 +02:00
|
|
|
for (unsigned op = 2, Eop = I.getNumOperands(); op != Eop; ++op) {
|
2002-05-09 22:53:56 +02:00
|
|
|
Out << ", ";
|
2002-06-25 17:57:03 +02:00
|
|
|
writeOperand(I.getOperand(op));
|
2002-05-09 22:53:56 +02:00
|
|
|
}
|
|
|
|
}
|
2002-05-09 23:18:38 +02:00
|
|
|
Out << ")";
|
2002-05-09 22:53:56 +02:00
|
|
|
}
|
|
|
|
|
2002-06-25 17:57:03 +02:00
|
|
|
void CWriter::visitMallocInst(MallocInst &I) {
|
2002-05-09 22:53:56 +02:00
|
|
|
Out << "(";
|
2002-11-18 21:55:50 +01:00
|
|
|
printType(Out, I.getType());
|
2002-05-09 22:53:56 +02:00
|
|
|
Out << ")malloc(sizeof(";
|
2002-11-18 21:55:50 +01:00
|
|
|
printType(Out, I.getType()->getElementType());
|
2002-05-09 22:53:56 +02:00
|
|
|
Out << ")";
|
|
|
|
|
2002-06-25 17:57:03 +02:00
|
|
|
if (I.isArrayAllocation()) {
|
2002-05-09 22:53:56 +02:00
|
|
|
Out << " * " ;
|
2002-06-25 17:57:03 +02:00
|
|
|
writeOperand(I.getOperand(0));
|
2002-05-09 22:53:56 +02:00
|
|
|
}
|
2002-05-09 23:18:38 +02:00
|
|
|
Out << ")";
|
2002-05-09 22:53:56 +02:00
|
|
|
}
|
|
|
|
|
2002-06-25 17:57:03 +02:00
|
|
|
void CWriter::visitAllocaInst(AllocaInst &I) {
|
2002-05-09 22:53:56 +02:00
|
|
|
Out << "(";
|
2002-11-18 21:55:50 +01:00
|
|
|
printType(Out, I.getType());
|
2002-05-09 22:53:56 +02:00
|
|
|
Out << ") alloca(sizeof(";
|
2002-11-18 21:55:50 +01:00
|
|
|
printType(Out, I.getType()->getElementType());
|
2002-05-09 22:53:56 +02:00
|
|
|
Out << ")";
|
2002-06-25 17:57:03 +02:00
|
|
|
if (I.isArrayAllocation()) {
|
2002-05-09 22:53:56 +02:00
|
|
|
Out << " * " ;
|
2002-06-25 17:57:03 +02:00
|
|
|
writeOperand(I.getOperand(0));
|
2002-05-09 22:53:56 +02:00
|
|
|
}
|
2002-05-09 23:18:38 +02:00
|
|
|
Out << ")";
|
2002-05-09 22:53:56 +02:00
|
|
|
}
|
|
|
|
|
2002-06-25 17:57:03 +02:00
|
|
|
void CWriter::visitFreeInst(FreeInst &I) {
|
2002-05-09 23:18:38 +02:00
|
|
|
Out << "free(";
|
2002-06-25 17:57:03 +02:00
|
|
|
writeOperand(I.getOperand(0));
|
2002-05-09 23:18:38 +02:00
|
|
|
Out << ")";
|
2002-05-09 22:53:56 +02:00
|
|
|
}
|
|
|
|
|
2002-08-20 01:09:46 +02:00
|
|
|
void CWriter::printIndexingExpression(Value *Ptr, User::op_iterator I,
|
|
|
|
User::op_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...
|
|
|
|
}
|
|
|
|
|
2002-05-09 23:18:38 +02:00
|
|
|
if (I == E) {
|
2002-08-20 01:09:46 +02:00
|
|
|
if (!HasImplicitAddress)
|
|
|
|
Out << "*"; // Implicit zero first argument: '*x' is equivalent to 'x[0]'
|
2002-05-09 23:18:38 +02:00
|
|
|
|
2002-08-20 01:09:46 +02:00
|
|
|
writeOperandInternal(Ptr);
|
|
|
|
return;
|
2002-05-09 23:18:38 +02:00
|
|
|
}
|
2002-05-09 22:53:56 +02:00
|
|
|
|
2002-08-20 01:09:46 +02:00
|
|
|
const Constant *CI = dyn_cast<Constant>(I->get());
|
|
|
|
if (HasImplicitAddress && (!CI || !CI->isNullValue()))
|
|
|
|
Out << "(&";
|
|
|
|
|
|
|
|
writeOperandInternal(Ptr);
|
2002-05-09 22:53:56 +02:00
|
|
|
|
2002-09-25 22:29:26 +02:00
|
|
|
if (HasImplicitAddress && (!CI || !CI->isNullValue())) {
|
2002-08-20 01:09:46 +02:00
|
|
|
Out << ")";
|
2002-09-25 22:29:26 +02: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 22:53:56 +02:00
|
|
|
|
2002-09-25 22:29:26 +02:00
|
|
|
if (HasImplicitAddress) {
|
|
|
|
++I;
|
|
|
|
} else if (CI && CI->isNullValue() && I+1 != E) {
|
|
|
|
// Print out the -> operator if possible...
|
2002-08-20 01:09:46 +02:00
|
|
|
if ((*(I+1))->getType() == Type::UByteTy) {
|
|
|
|
Out << (HasImplicitAddress ? "." : "->");
|
|
|
|
Out << "field" << cast<ConstantUInt>(*(I+1))->getValue();
|
|
|
|
I += 2;
|
2002-09-25 22:29:26 +02:00
|
|
|
}
|
2002-05-09 22:53:56 +02:00
|
|
|
}
|
2002-08-23 00:48:55 +02:00
|
|
|
|
2002-05-09 22:53:56 +02:00
|
|
|
for (; I != E; ++I)
|
2002-09-11 03:21:29 +02:00
|
|
|
if ((*I)->getType() == Type::LongTy) {
|
2002-09-15 23:51:04 +02:00
|
|
|
Out << "[";
|
2002-05-09 22:53:56 +02:00
|
|
|
writeOperand(*I);
|
2002-09-15 23:51:04 +02:00
|
|
|
Out << "]";
|
2002-05-09 22:53:56 +02:00
|
|
|
} else {
|
2002-09-12 22:34:47 +02:00
|
|
|
Out << ".field" << cast<ConstantUInt>(*I)->getValue();
|
2002-05-09 22:53:56 +02:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2002-06-25 17:57:03 +02:00
|
|
|
void CWriter::visitLoadInst(LoadInst &I) {
|
2002-10-02 23:14:33 +02:00
|
|
|
Out << "*";
|
2002-08-23 00:48:55 +02:00
|
|
|
writeOperand(I.getOperand(0));
|
2002-05-08 20:09:58 +02:00
|
|
|
}
|
|
|
|
|
2002-06-25 17:57:03 +02:00
|
|
|
void CWriter::visitStoreInst(StoreInst &I) {
|
2002-10-02 23:14:33 +02:00
|
|
|
Out << "*";
|
2002-08-23 00:48:55 +02:00
|
|
|
writeOperand(I.getPointerOperand());
|
2002-05-09 22:53:56 +02:00
|
|
|
Out << " = ";
|
2002-06-25 17:57:03 +02:00
|
|
|
writeOperand(I.getOperand(0));
|
2002-05-09 22:53:56 +02:00
|
|
|
}
|
|
|
|
|
2002-06-25 17:57:03 +02:00
|
|
|
void CWriter::visitGetElementPtrInst(GetElementPtrInst &I) {
|
2002-10-02 23:14:33 +02:00
|
|
|
Out << "&";
|
2002-08-20 01:09:46 +02:00
|
|
|
printIndexingExpression(I.getPointerOperand(), I.idx_begin(), I.idx_end());
|
2002-05-09 22:53:56 +02:00
|
|
|
}
|
2002-05-08 20:09:58 +02:00
|
|
|
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
// External Interface declaration
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
2002-08-31 02:29:16 +02:00
|
|
|
Pass *createWriteToCPass(std::ostream &o) { return new CWriter(o); }
|