#include "llvm/Constants.h"
#include "llvm/DerivedTypes.h"
#include "llvm/Instruction.h"
-#include "llvm/iMemory.h"
-#include "llvm/iTerminators.h"
-#include "llvm/iPHINode.h"
-#include "llvm/iOther.h"
+#include "llvm/Instructions.h"
#include "llvm/Module.h"
#include "llvm/SymbolTable.h"
#include "llvm/Assembly/Writer.h"
#include "llvm/Support/CFG.h"
-#include "Support/StringExtras.h"
-#include "Support/STLExtras.h"
+#include "llvm/ADT/StringExtras.h"
+#include "llvm/ADT/STLExtras.h"
#include <algorithm>
using namespace llvm;
-namespace {
+namespace llvm {
/// This class provides computation of slot numbers for LLVM Assembly writing.
/// @brief LLVM Assembly Writing Slot Computation.
/// @brief A mapping of Values to slot numbers
typedef std::map<const Value*, unsigned> ValueMap;
+ typedef std::map<const Type*, unsigned> TypeMap;
/// @brief A plane with next slot number and ValueMap
- struct Plane {
+ struct ValuePlane {
unsigned next_slot; ///< The next slot number to use
ValueMap map; ///< The map of Value* -> unsigned
- Plane() { next_slot = 0; } ///< Make sure we start at 0
+ ValuePlane() { next_slot = 0; } ///< Make sure we start at 0
+ };
+
+ struct TypePlane {
+ unsigned next_slot;
+ TypeMap map;
+ TypePlane() { next_slot = 0; }
+ void clear() { map.clear(); next_slot = 0; }
};
/// @brief The map of planes by Type
- typedef std::map<const Type*, Plane> TypedPlanes;
+ typedef std::map<const Type*, ValuePlane> TypedPlanes;
/// @}
/// @name Constructors
/// Return the slot number of the specified value in it's type
/// plane. Its an error to ask for something not in the SlotMachine.
/// Its an error to ask for a Type*
- unsigned getSlot(const Value *V) const;
+ int getSlot(const Value *V);
+ int getSlot(const Type*Ty);
+
+ /// Determine if a Value has a slot or not
+ bool hasSlot(const Value* V);
+ bool hasSlot(const Type* Ty);
/// @}
/// @name Mutators
public:
/// If you'd like to deal with a function instead of just a module, use
/// this method to get its data into the SlotMachine.
- void incorporateFunction(const Function *F);
+ void incorporateFunction(const Function *F) {
+ TheFunction = F;
+ FunctionProcessed = false;
+ }
/// After calling incorporateFunction, use this method to remove the
/// most recently incorporated function from the SlotMachine. This
/// @name Implementation Details
/// @{
private:
+ /// This function does the actual initialization.
+ inline void initialize();
+
/// Values can be crammed into here at will. If they haven't
/// been inserted already, they get inserted, otherwise they are ignored.
/// Either way, the slot number for the Value* is returned.
unsigned createSlot(const Value *V);
+ unsigned createSlot(const Type* Ty);
/// Insert a value into the value table. Return the slot number
/// that it now occupies. BadThings(TM) will happen if you insert a
/// Value that's already been inserted.
unsigned insertValue( const Value *V );
+ unsigned insertValue( const Type* Ty);
/// Add all of the module level global variables (and their initializers)
/// and function declarations, but not the contents of those functions.
void processModule();
+ /// Add all of the functions arguments, basic blocks, and instructions
+ void processFunction();
+
SlotMachine(const SlotMachine &); // DO NOT IMPLEMENT
void operator=(const SlotMachine &); // DO NOT IMPLEMENT
public:
/// @brief The module for which we are holding slot numbers
- const Module *TheModule;
+ const Module* TheModule;
- /// @brief Whether or not we have a function incorporated
- bool FunctionIncorporated;
+ /// @brief The function for which we are holding slot numbers
+ const Function* TheFunction;
+ bool FunctionProcessed;
/// @brief The TypePlanes map for the module level data
TypedPlanes mMap;
+ TypePlane mTypes;
/// @brief The TypePlanes map for the function level data
TypedPlanes fMap;
+ TypePlane fTypes;
/// @}
};
-}
+} // end namespace llvm
static RegisterPass<PrintModulePass>
X("printm", "Print module to stderr",PassInfo::Analysis|PassInfo::Optimization);
std::map<const Type *, std::string> &TypeTable,
SlotMachine *Machine);
+static void WriteAsOperandInternal(std::ostream &Out, const Type *T,
+ bool PrintName,
+ std::map<const Type *, std::string> &TypeTable,
+ SlotMachine *Machine);
+
static const Module *getModuleFromVal(const Value *V) {
if (const Argument *MA = dyn_cast<Argument>(V))
return MA->getParent() ? MA->getParent()->getParent() : 0;
}
static SlotMachine *createSlotMachine(const Value *V) {
- assert(!isa<Type>(V) && "Can't create an SC for a type!");
if (const Argument *FA = dyn_cast<Argument>(V)) {
return new SlotMachine(FA->getParent());
} else if (const Instruction *I = dyn_cast<Instruction>(V)) {
//
const Type *Ty = cast<Type>(TI->second);
if (!isa<PointerType>(Ty) ||
- !cast<PointerType>(Ty)->getElementType()->isPrimitiveType() ||
- isa<OpaqueType>(cast<PointerType>(Ty)->getElementType()))
+
!cast<PointerType>(Ty)->getElementType()->isPrimitiveType() ||
+
isa<OpaqueType>(cast<PointerType>(Ty)->getElementType()))
TypeNames.insert(std::make_pair(Ty, getLLVMName(TI->first)));
}
}
-static std::string calcTypeName(const Type *Ty,
- std::vector<const Type *> &TypeStack,
- std::map<const Type *, std::string> &TypeNames){
- if (Ty->isPrimitiveType() && !isa<OpaqueType>(Ty))
- return Ty->getDescription(); // Base case
+static void calcTypeName(const Type *Ty,
+ std::vector<const Type *> &TypeStack,
+ std::map<const Type *, std::string> &TypeNames,
+ std::string & Result){
+ if (Ty->isPrimitiveType() && !isa<OpaqueType>(Ty)) {
+ Result += Ty->getDescription(); // Base case
+ return;
+ }
// Check to see if the type is named.
std::map<const Type *, std::string>::iterator I = TypeNames.find(Ty);
- if (I != TypeNames.end()) return I->second;
+ if (I != TypeNames.end()) {
+ Result += I->second;
+ return;
+ }
- if (isa<OpaqueType>(Ty))
- return "opaque";
+ if (isa<OpaqueType>(Ty)) {
+ Result += "opaque";
+ return;
+ }
// Check to see if the Type is already on the stack...
unsigned Slot = 0, CurSize = TypeStack.size();
// This is another base case for the recursion. In this case, we know
// that we have looped back to a type that we have previously visited.
// Generate the appropriate upreference to handle this.
- if (Slot < CurSize)
- return "\\" + utostr(CurSize-Slot); // Here's the upreference
+ if (Slot < CurSize) {
+ Result += "\\" + utostr(CurSize-Slot); // Here's the upreference
+ return;
+ }
TypeStack.push_back(Ty); // Recursive case: Add us to the stack..
- std::string Result;
- switch (Ty->getPrimitiveID()) {
+ switch (Ty->getTypeID()) {
case Type::FunctionTyID: {
const FunctionType *FTy = cast<FunctionType>(Ty);
- Result = calcTypeName(FTy->getReturnType(), TypeStack, TypeNames) + " (";
+ calcTypeName(FTy->getReturnType(), TypeStack, TypeNames, Result);
+ Result += " (";
for (FunctionType::param_iterator I = FTy->param_begin(),
E = FTy->param_end(); I != E; ++I) {
if (I != FTy->param_begin())
Result += ", ";
- Result += calcTypeName(*I, TypeStack, TypeNames);
+ calcTypeName(*I, TypeStack, TypeNames, Result);
}
if (FTy->isVarArg()) {
if (FTy->getNumParams()) Result += ", ";
}
case Type::StructTyID: {
const StructType *STy = cast<StructType>(Ty);
- Result = "{ ";
+ Result += "{ ";
for (StructType::element_iterator I = STy->element_begin(),
E = STy->element_end(); I != E; ++I) {
if (I != STy->element_begin())
Result += ", ";
- Result += calcTypeName(*I, TypeStack, TypeNames);
+ calcTypeName(*I, TypeStack, TypeNames, Result);
}
Result += " }";
break;
}
case Type::PointerTyID:
- Result = calcTypeName(cast<PointerType>(Ty)->getElementType(),
- TypeStack, TypeNames) + "*";
+ calcTypeName(cast<PointerType>(Ty)->getElementType(),
+ TypeStack, TypeNames, Result);
+ Result += "*";
break;
case Type::ArrayTyID: {
const ArrayType *ATy = cast<ArrayType>(Ty);
- Result = "[" + utostr(ATy->getNumElements()) + " x ";
- Result += calcTypeName(ATy->getElementType(), TypeStack, TypeNames) + "]";
+ Result += "[" + utostr(ATy->getNumElements()) + " x ";
+ calcTypeName(ATy->getElementType(), TypeStack, TypeNames, Result);
+ Result += "]";
+ break;
+ }
+ case Type::PackedTyID: {
+ const PackedType *PTy = cast<PackedType>(Ty);
+ Result += "<" + utostr(PTy->getNumElements()) + " x ";
+ calcTypeName(PTy->getElementType(), TypeStack, TypeNames, Result);
+ Result += ">";
break;
}
case Type::OpaqueTyID:
- Result = "opaque";
+ Result += "opaque";
break;
default:
- Result = "<unrecognized-type>";
+ Result += "<unrecognized-type>";
}
TypeStack.pop_back(); // Remove self from stack...
- return Result;
+ return;
}
// names.
//
std::vector<const Type *> TypeStack;
- std::string TypeName = calcTypeName(Ty, TypeStack, TypeNames);
+ std::string TypeName;
+ calcTypeName(Ty, TypeStack, TypeNames, TypeName);
TypeNames.insert(std::make_pair(Ty, TypeName));//Cache type name for later use
- return Out << TypeName;
+ return (Out << TypeName);
}
///
std::ostream &llvm::WriteTypeSymbolic(std::ostream &Out, const Type *Ty,
const Module *M) {
- Out << " ";
+ Out << ' ';
// If they want us to print out a type, attempt to make it symbolic if there
// is a symbol table in the module...
}
}
+/// @brief Internal constant writer.
static void WriteConstantInt(std::ostream &Out, const Constant *CV,
bool PrintName,
std::map<const Type *, std::string> &TypeTable,
if (isString) {
Out << "c\"";
for (unsigned i = 0; i < CA->getNumOperands(); ++i) {
- unsigned char C = cast<ConstantInt>(CA->getOperand(i))->getRawValue();
+ unsigned char C =
+ (unsigned char)cast<ConstantInt>(CA->getOperand(i))->getRawValue();
if (isprint(C) && C != '"' && C != '\\') {
Out << C;
Out << "\"";
} else { // Cannot output in string format...
- Out << "[";
+ Out << '[';
if (CA->getNumOperands()) {
- Out << " ";
+ Out << ' ';
printTypeInt(Out, ETy, TypeTable);
WriteAsOperandInternal(Out, CA->getOperand(0),
PrintName, TypeTable, Machine);
Out << " ]";
}
} else if (const ConstantStruct *CS = dyn_cast<ConstantStruct>(CV)) {
- Out << "{";
+ Out << '{';
if (CS->getNumOperands()) {
- Out << " ";
+ Out << ' ';
printTypeInt(Out, CS->getOperand(0)->getType(), TypeTable);
WriteAsOperandInternal(Out, CS->getOperand(0),
}
Out << " }";
+ } else if (const ConstantPacked *CP = dyn_cast<ConstantPacked>(CV)) {
+ const Type *ETy = CP->getType()->getElementType();
+ assert(CP->getNumOperands() > 0 &&
+ "Number of operands for a PackedConst must be > 0");
+ Out << '<';
+ Out << ' ';
+ printTypeInt(Out, ETy, TypeTable);
+ WriteAsOperandInternal(Out, CP->getOperand(0),
+ PrintName, TypeTable, Machine);
+ for (unsigned i = 1, e = CP->getNumOperands(); i != e; ++i) {
+ Out << ", ";
+ printTypeInt(Out, ETy, TypeTable);
+ WriteAsOperandInternal(Out, CP->getOperand(i), PrintName,
+ TypeTable, Machine);
+ }
+ Out << " >";
} else if (isa<ConstantPointerNull>(CV)) {
Out << "null";
- } else if (const ConstantPointerRef *PR = dyn_cast<ConstantPointerRef>(CV)) {
- WriteAsOperandInternal(Out, PR->getValue(), true, TypeTable, Machine);
+ } else if (isa<UndefValue>(CV)) {
+ Out << "undef";
} else if (const ConstantExpr *CE = dyn_cast<ConstantExpr>(CV)) {
Out << CE->getOpcodeName() << " (";
Out << " to ";
printTypeInt(Out, CE->getType(), TypeTable);
}
- Out << ")";
+ Out << ')';
} else {
Out << "<placeholder or erroneous Constant>";
bool PrintName,
std::map<const Type*, std::string> &TypeTable,
SlotMachine *Machine) {
- Out << " ";
- if (PrintName && V->hasName()) {
+ Out << ' ';
+ if ((PrintName || isa<GlobalValue>(V)) && V->hasName())
Out << getLLVMName(V->getName());
- } else {
- if (const Constant *CV = dyn_cast<Constant>(V)) {
+ else {
+ const Constant *CV = dyn_cast<Constant>(V);
+ if (CV && !isa<GlobalValue>(CV))
WriteConstantInt(Out, CV, PrintName, TypeTable, Machine);
- } else {
+ else {
int Slot;
if (Machine) {
- Slot = Machine->getSlot(V);
+ Slot = Machine->getSlot(V);
} else {
- if (const Type *Ty = dyn_cast<Type>(V)) {
- Out << Ty->getDescription();
- return;
- }
-
Machine = createSlotMachine(V);
- if (Machine == 0) { Out << "BAD VALUE TYPE!"; return; }
-
- Slot = Machine->getSlot(V);
- delete Machine;
+ if (Machine == 0)
+ Slot = Machine->getSlot(V);
+ else
+ Slot = -1;
+ delete Machine;
}
- Out << "%" << Slot;
+ if (Slot != -1)
+ Out << '%' << Slot;
+ else
+ Out << "<badref>";
}
}
}
-
/// WriteAsOperand - Write the name of the specified value out to the specified
/// ostream. This can be useful when you just want to print int %reg126, not
/// the whole instruction that generated it.
if (PrintType)
printTypeInt(Out, V->getType(), TypeNames);
- if (const Type *Ty = dyn_cast<Type> (V))
- printTypeInt(Out, Ty, TypeNames);
-
WriteAsOperandInternal(Out, V, PrintName, TypeNames, 0);
return Out;
}
+/// WriteAsOperandInternal - Write the name of the specified value out to
+/// the specified ostream. This can be useful when you just want to print
+/// int %reg126, not the whole instruction that generated it.
+///
+static void WriteAsOperandInternal(std::ostream &Out, const Type *T,
+ bool PrintName,
+ std::map<const Type*, std::string> &TypeTable,
+ SlotMachine *Machine) {
+ Out << ' ';
+ int Slot;
+ if (Machine) {
+ Slot = Machine->getSlot(T);
+ if (Slot != -1)
+ Out << '%' << Slot;
+ else
+ Out << "<badref>";
+ } else {
+ Out << T->getDescription();
+ }
+}
+
+/// WriteAsOperand - Write the name of the specified value out to the specified
+/// ostream. This can be useful when you just want to print int %reg126, not
+/// the whole instruction that generated it.
+///
+std::ostream &llvm::WriteAsOperand(std::ostream &Out, const Type *Ty,
+ bool PrintType, bool PrintName,
+ const Module *Context) {
+ std::map<const Type *, std::string> TypeNames;
+ assert(Context != 0 && "Can't write types as operand without module context");
+
+ fillTypeNameTable(Context, TypeNames);
+
+ // if (PrintType)
+ // printTypeInt(Out, V->getType(), TypeNames);
+
+ printTypeInt(Out, Ty, TypeNames);
+
+ WriteAsOperandInternal(Out, Ty, PrintName, TypeNames, 0);
+ return Out;
+}
+
namespace llvm {
class AssemblyWriter {
- std::ostream *Out;
+ std::ostream &Out;
SlotMachine &Machine;
const Module *TheModule;
std::map<const Type *, std::string> TypeNames;
public:
inline AssemblyWriter(std::ostream &o, SlotMachine &Mac, const Module *M,
AssemblyAnnotationWriter *AAW)
- : Out(&o), Machine(Mac), TheModule(M), AnnotationWriter(AAW) {
+ : Out(o), Machine(Mac), TheModule(M), AnnotationWriter(AAW) {
// If the module has a symbol table, take all global types and stuff their
// names into the TypeNames map.
void writeOperand(const Value *Op, bool PrintType, bool PrintName = true);
const Module* getModule() { return TheModule; }
- void setStream(std::ostream &os) { Out = &os; }
-private :
+private:
void printModule(const Module *M);
void printSymbolTable(const SymbolTable &ST);
void printConstant(const Constant *CPV);
// symbolic version of a type name.
//
std::ostream &printType(const Type *Ty) {
- return printTypeInt(*Out, Ty, TypeNames);
+ return printTypeInt(Out, Ty, TypeNames);
}
// printTypeAtLeastOneLevel - Print out one level of the possibly complex type
// which slot it occupies.
void printInfoComment(const Value &V);
};
-} // end of anonymous namespace
+} // end of llvm namespace
/// printTypeAtLeastOneLevel - Print out one level of the possibly complex type
/// without considering any symbolic types that we may have equal to it.
for (FunctionType::param_iterator I = FTy->param_begin(),
E = FTy->param_end(); I != E; ++I) {
if (I != FTy->param_begin())
- *Out << ", ";
+ Out << ", ";
printType(*I);
}
if (FTy->isVarArg()) {
- if (FTy->getNumParams()) *Out << ", ";
- *Out << "...";
+ if (FTy->getNumParams()) Out << ", ";
+ Out << "...";
}
- *Out << ")";
+ Out << ')';
} else if (const StructType *STy = dyn_cast<StructType>(Ty)) {
- *Out << "{ ";
+ Out << "{ ";
for (StructType::element_iterator I = STy->element_begin(),
E = STy->element_end(); I != E; ++I) {
if (I != STy->element_begin())
- *Out << ", ";
+ Out << ", ";
printType(*I);
}
- *Out << " }";
+ Out << " }";
} else if (const PointerType *PTy = dyn_cast<PointerType>(Ty)) {
- printType(PTy->getElementType()) << "*";
+ printType(PTy->getElementType()) << '*';
} else if (const ArrayType *ATy = dyn_cast<ArrayType>(Ty)) {
- *Out << "[" << ATy->getNumElements() << " x ";
- printType(ATy->getElementType()) << "]";
- } else if (const OpaqueType *OTy = dyn_cast<OpaqueType>(Ty)) {
- *Out << "opaque";
+ Out << '[' << ATy->getNumElements() << " x ";
+ printType(ATy->getElementType()) << ']';
+ } else if (const PackedType *PTy = dyn_cast<PackedType>(Ty)) {
+ Out << '<' << PTy->getNumElements() << " x ";
+ printType(PTy->getElementType()) << '>';
+ }
+ else if (const OpaqueType *OTy = dyn_cast<OpaqueType>(Ty)) {
+ Out << "opaque";
} else {
if (!Ty->isPrimitiveType())
- *Out << "<unknown derived type>";
+ Out << "<unknown derived type>";
printType(Ty);
}
- return *Out;
+ return Out;
}
void AssemblyWriter::writeOperand(const Value *Operand, bool PrintType,
- bool PrintName) {
- if (PrintType) { *Out << " "; printType(Operand->getType()); }
- WriteAsOperandInternal(*Out, Operand, PrintName, TypeNames, &Machine);
+ bool PrintName) {
+ assert(Operand != 0 && "Illegal Operand");
+ if (PrintType) { Out << ' '; printType(Operand->getType()); }
+ WriteAsOperandInternal(Out, Operand, PrintName, TypeNames, &Machine);
}
void AssemblyWriter::printModule(const Module *M) {
switch (M->getEndianness()) {
- case Module::LittleEndian: *Out << "target endian = little\n"; break;
- case Module::BigEndian: *Out << "target endian = big\n"; break;
+ case Module::LittleEndian: Out << "target endian = little\n"; break;
+ case Module::BigEndian: Out << "target endian = big\n"; break;
case Module::AnyEndianness: break;
}
switch (M->getPointerSize()) {
- case Module::Pointer32: *Out << "target pointersize = 32\n"; break;
- case Module::Pointer64: *Out << "target pointersize = 64\n"; break;
+ case Module::Pointer32: Out << "target pointersize = 32\n"; break;
+ case Module::Pointer64: Out << "target pointersize = 64\n"; break;
case Module::AnyPointerSize: break;
}
+ if (!M->getTargetTriple().empty())
+ Out << "target triple = \"" << M->getTargetTriple() << "\"\n";
- // Loop over the symbol table, emitting all named constants...
+ // Loop over the dependent libraries and emit them.
+ Module::lib_iterator LI = M->lib_begin();
+ Module::lib_iterator LE = M->lib_end();
+ if (LI != LE) {
+ Out << "deplibs = [ ";
+ while (LI != LE) {
+ Out << '"' << *LI << '"';
+ ++LI;
+ if (LI != LE)
+ Out << ", ";
+ }
+ Out << " ]\n";
+ }
+
+ // Loop over the symbol table, emitting all named constants.
printSymbolTable(M->getSymbolTable());
for (Module::const_giterator I = M->gbegin(), E = M->gend(); I != E; ++I)
printGlobal(I);
- *Out << "\nimplementation ; Functions:\n";
+ Out << "\nimplementation ; Functions:\n";
- // Output all of the functions...
+ // Output all of the functions.
for (Module::const_iterator I = M->begin(), E = M->end(); I != E; ++I)
printFunction(I);
}
void AssemblyWriter::printGlobal(const GlobalVariable *GV) {
- if (GV->hasName()) *Out << getLLVMName(GV->getName()) << " = ";
+ if (GV->hasName()) Out << getLLVMName(GV->getName()) << " = ";
if (!GV->hasInitializer())
- *Out << "external ";
+ Out << "external ";
else
switch (GV->getLinkage()) {
- case GlobalValue::InternalLinkage: *Out << "internal "; break;
- case GlobalValue::LinkOnceLinkage: *Out << "linkonce "; break;
- case GlobalValue::WeakLinkage: *Out << "weak "; break;
- case GlobalValue::AppendingLinkage: *Out << "appending "; break;
+ case GlobalValue::InternalLinkage: Out << "internal "; break;
+ case GlobalValue::LinkOnceLinkage: Out << "linkonce "; break;
+ case GlobalValue::WeakLinkage: Out << "weak "; break;
+ case GlobalValue::AppendingLinkage: Out << "appending "; break;
case GlobalValue::ExternalLinkage: break;
+ case GlobalValue::GhostLinkage:
+ std::cerr << "GhostLinkage not allowed in AsmWriter!\n";
+ abort();
}
- *Out << (GV->isConstant() ? "constant " : "global ");
+ Out << (GV->isConstant() ? "constant " : "global ");
printType(GV->getType()->getElementType());
- if (GV->hasInitializer())
- writeOperand(GV->getInitializer(), false, false);
+ if (GV->hasInitializer()) {
+ Constant* C = cast<Constant>(GV->getInitializer());
+ assert(C && "GlobalVar initializer isn't constant?");
+ writeOperand(GV->getInitializer(), false, isa<GlobalValue>(C));
+ }
printInfoComment(*GV);
- *Out << "\n";
+ Out << "\n";
}
// Print the types.
for (SymbolTable::type_const_iterator TI = ST.type_begin();
TI != ST.type_end(); ++TI ) {
- *Out << "\t" << getLLVMName(TI->first) << " = type ";
+ Out << "\t" << getLLVMName(TI->first) << " = type ";
// Make sure we print out at least one level of the type structure, so
// that we do not get %FILE = type %FILE
SymbolTable::value_const_iterator VE = ST.value_end(PI->first);
for (; VI != VE; ++VI) {
- const Value *V = VI->second;
- if (const Constant *CPV = dyn_cast<Constant>(V)) {
- printConstant(CPV);
+ const Value* V = VI->second;
+ const Constant *CPV = dyn_cast<Constant>(V) ;
+ if (CPV && !isa<GlobalValue>(V)) {
+ printConstant(CPV);
}
}
}
if (!CPV->hasName()) return;
// Print out name...
- *Out << "\t" << getLLVMName(CPV->getName()) << " =";
+ Out << "\t" << getLLVMName(CPV->getName()) << " =";
// Write the value out now...
writeOperand(CPV, true, false);
printInfoComment(*CPV);
- *Out << "\n";
+ Out << "\n";
}
/// printFunction - Print all aspects of a function.
///
void AssemblyWriter::printFunction(const Function *F) {
// Print out the return type and name...
- *Out << "\n";
+ Out << "\n";
- if (AnnotationWriter) AnnotationWriter->emitFunctionAnnot(F, *Out);
+ if (AnnotationWriter) AnnotationWriter->emitFunctionAnnot(F, Out);
if (F->isExternal())
- *Out << "declare ";
+ Out << "declare ";
else
switch (F->getLinkage()) {
- case GlobalValue::InternalLinkage: *Out << "internal "; break;
- case GlobalValue::LinkOnceLinkage: *Out << "linkonce "; break;
- case GlobalValue::WeakLinkage: *Out << "weak "; break;
- case GlobalValue::AppendingLinkage: *Out << "appending "; break;
+ case GlobalValue::InternalLinkage: Out << "internal "; break;
+ case GlobalValue::LinkOnceLinkage: Out << "linkonce "; break;
+ case GlobalValue::WeakLinkage: Out << "weak "; break;
+ case GlobalValue::AppendingLinkage: Out << "appending "; break;
case GlobalValue::ExternalLinkage: break;
+ case GlobalValue::GhostLinkage:
+ std::cerr << "GhostLinkage not allowed in AsmWriter!\n";
+ abort();
}
- printType(F->getReturnType()) << " ";
+ printType(F->getReturnType()) << ' ';
if (!F->getName().empty())
- *Out << getLLVMName(F->getName());
+ Out << getLLVMName(F->getName());
else
- *Out << "\"\"";
- *Out << "(";
+ Out << "\"\"";
+ Out << '(';
Machine.incorporateFunction(F);
// Loop over the arguments, printing them...
// Finish printing arguments...
if (FT->isVarArg()) {
- if (FT->getNumParams()) *Out << ", ";
- *Out << "..."; // Output varargs portion of signature!
+ if (FT->getNumParams()) Out << ", ";
+ Out << "..."; // Output varargs portion of signature!
}
- *Out << ")";
+ Out << ')';
if (F->isExternal()) {
- *Out << "\n";
+ Out << "\n";
} else {
- *Out << " {";
+ Out << " {";
// Output all of its basic blocks... for the function
for (Function::const_iterator I = F->begin(), E = F->end(); I != E; ++I)
printBasicBlock(I);
- *Out << "}\n";
+ Out << "}\n";
}
Machine.purgeFunction();
///
void AssemblyWriter::printArgument(const Argument *Arg) {
// Insert commas as we go... the first arg doesn't get a comma
- if (Arg != &Arg->getParent()->afront()) *Out << ", ";
+ if (Arg != &Arg->getParent()->afront()) Out << ", ";
// Output type...
printType(Arg->getType());
// Output name, if available...
if (Arg->hasName())
- *Out << " " << getLLVMName(Arg->getName());
+ Out << ' ' << getLLVMName(Arg->getName());
}
/// printBasicBlock - This member is called for each basic block in a method.
///
void AssemblyWriter::printBasicBlock(const BasicBlock *BB) {
if (BB->hasName()) { // Print out the label if it exists...
- *Out << "\n" << BB->getName() << ":";
+ Out << "\n" << BB->getName() << ':';
} else if (!BB->use_empty()) { // Don't print block # of no uses...
- *Out << "\n; <label>:" << Machine.getSlot(BB);
+ Out << "\n; <label>:";
+ int Slot = Machine.getSlot(BB);
+ if (Slot != -1)
+ Out << Slot;
+ else
+ Out << "<badref>";
}
if (BB->getParent() == 0)
- *Out << "\t\t; Error: Block without parent!";
+ Out << "\t\t; Error: Block without parent!";
else {
if (BB != &BB->getParent()->front()) { // Not the entry block?
// Output predecessors for the block...
- *Out << "\t\t;";
+ Out << "\t\t;";
pred_const_iterator PI = pred_begin(BB), PE = pred_end(BB);
if (PI == PE) {
- *Out << " No predecessors!";
+ Out << " No predecessors!";
} else {
- *Out << " preds =";
+ Out << " preds =";
writeOperand(*PI, false, true);
for (++PI; PI != PE; ++PI) {
- *Out << ",";
+ Out << ',';
writeOperand(*PI, false, true);
}
}
}
}
- *Out << "\n";
+ Out << "\n";
- if (AnnotationWriter) AnnotationWriter->emitBasicBlockStartAnnot(BB, *Out);
+ if (AnnotationWriter) AnnotationWriter->emitBasicBlockStartAnnot(BB, Out);
// Output all of the instructions in the basic block...
for (BasicBlock::const_iterator I = BB->begin(), E = BB->end(); I != E; ++I)
printInstruction(*I);
- if (AnnotationWriter) AnnotationWriter->emitBasicBlockEndAnnot(BB, *Out);
+ if (AnnotationWriter) AnnotationWriter->emitBasicBlockEndAnnot(BB, Out);
}
///
void AssemblyWriter::printInfoComment(const Value &V) {
if (V.getType() != Type::VoidTy) {
- *Out << "\t\t; <";
- printType(V.getType()) << ">";
+ Out << "\t\t; <";
+ printType(V.getType()) << '>';
if (!V.hasName()) {
- *Out << ":" << Machine.getSlot(&V); // Print out the def slot taken.
+ int SlotNum = Machine.getSlot(&V);
+ if (SlotNum == -1)
+ Out << ":<badref>";
+ else
+ Out << ':' << SlotNum; // Print out the def slot taken.
}
- *Out << " [#uses=" << V.use_size() << "]"; // Output # uses
+ Out << " [#uses=" << V.use_size() << ']'; // Output # uses
}
}
-/// printInstruction - This member is called for each Instruction in a method.
+/// printInstruction - This member is called for each Instruction in a function..
///
void AssemblyWriter::printInstruction(const Instruction &I) {
- if (AnnotationWriter) AnnotationWriter->emitInstructionAnnot(&I, *Out);
+ if (AnnotationWriter) AnnotationWriter->emitInstructionAnnot(&I, Out);
- *Out << "\t";
+ Out << "\t";
// Print out name if it exists...
if (I.hasName())
- *Out << getLLVMName(I.getName()) << " = ";
+ Out << getLLVMName(I.getName()) << " = ";
// If this is a volatile load or store, print out the volatile marker
if ((isa<LoadInst>(I) && cast<LoadInst>(I).isVolatile()) ||
(isa<StoreInst>(I) && cast<StoreInst>(I).isVolatile()))
- *Out << "volatile ";
+ Out << "volatile ";
// Print out the opcode...
- *Out << I.getOpcodeName();
+ Out << I.getOpcodeName();
// Print out the type of the operands...
const Value *Operand = I.getNumOperands() ? I.getOperand(0) : 0;
// Special case conditional branches to swizzle the condition out to the front
if (isa<BranchInst>(I) && I.getNumOperands() > 1) {
writeOperand(I.getOperand(2), true);
- *Out << ",";
+ Out << ',';
writeOperand(Operand, true);
- *Out << ",";
+ Out << ',';
writeOperand(I.getOperand(1), true);
} else if (isa<SwitchInst>(I)) {
// Special case switch statement to get formatting nice and correct...
- writeOperand(Operand , true); *Out << ",";
- writeOperand(I.getOperand(1), true); *Out << " [";
+ writeOperand(Operand , true); Out << ',';
+ writeOperand(I.getOperand(1), true); Out << " [";
for (unsigned op = 2, Eop = I.getNumOperands(); op < Eop; op += 2) {
- *Out << "\n\t\t";
- writeOperand(I.getOperand(op ), true); *Out << ",";
+ Out << "\n\t\t";
+ writeOperand(I.getOperand(op ), true); Out << ',';
writeOperand(I.getOperand(op+1), true);
}
- *Out << "\n\t]";
+ Out << "\n\t]";
} else if (isa<PHINode>(I)) {
- *Out << " ";
+ Out << ' ';
printType(I.getType());
- *Out << " ";
+ Out << ' ';
for (unsigned op = 0, Eop = I.getNumOperands(); op < Eop; op += 2) {
- if (op) *Out << ", ";
- *Out << "[";
- writeOperand(I.getOperand(op ), false); *Out << ",";
- writeOperand(I.getOperand(op+1), false); *Out << " ]";
+ if (op) Out << ", ";
+ Out << '[';
+ writeOperand(I.getOperand(op ), false); Out << ',';
+ writeOperand(I.getOperand(op+1), false); Out << " ]";
}
} else if (isa<ReturnInst>(I) && !Operand) {
- *Out << " void";
+ Out << " void";
} else if (isa<CallInst>(I)) {
const PointerType *PTy = cast<PointerType>(Operand->getType());
const FunctionType *FTy = cast<FunctionType>(PTy->getElementType());
if (!FTy->isVarArg() &&
(!isa<PointerType>(RetTy) ||
!isa<FunctionType>(cast<PointerType>(RetTy)->getElementType()))) {
- *Out << " "; printType(RetTy);
+ Out << ' '; printType(RetTy);
writeOperand(Operand, false);
} else {
writeOperand(Operand, true);
}
- *Out << "(";
+ Out << '(';
if (I.getNumOperands() > 1) writeOperand(I.getOperand(1), true);
for (unsigned op = 2, Eop = I.getNumOperands(); op < Eop; ++op) {
- *Out << ",";
+ Out << ',';
writeOperand(I.getOperand(op), true);
}
- *Out << " )";
+ Out << " )";
} else if (const InvokeInst *II = dyn_cast<InvokeInst>(&I)) {
const PointerType *PTy = cast<PointerType>(Operand->getType());
const FunctionType *FTy = cast<FunctionType>(PTy->getElementType());
if (!FTy->isVarArg() &&
(!isa<PointerType>(RetTy) ||
!isa<FunctionType>(cast<PointerType>(RetTy)->getElementType()))) {
- *Out << " "; printType(RetTy);
+ Out << ' '; printType(RetTy);
writeOperand(Operand, false);
} else {
writeOperand(Operand, true);
}
- *Out << "(";
+ Out << '(';
if (I.getNumOperands() > 3) writeOperand(I.getOperand(3), true);
for (unsigned op = 4, Eop = I.getNumOperands(); op < Eop; ++op) {
- *Out << ",";
+ Out << ',';
writeOperand(I.getOperand(op), true);
}
- *Out << " )\n\t\t\tto";
+ Out << " )\n\t\t\tto";
writeOperand(II->getNormalDest(), true);
- *Out << " unwind";
+ Out << " unwind";
writeOperand(II->getUnwindDest(), true);
} else if (const AllocationInst *AI = dyn_cast<AllocationInst>(&I)) {
- *Out << " ";
+ Out << ' ';
printType(AI->getType()->getElementType());
if (AI->isArrayAllocation()) {
- *Out << ",";
+ Out << ',';
writeOperand(AI->getArraySize(), true);
}
} else if (isa<CastInst>(I)) {
if (Operand) writeOperand(Operand, true); // Work with broken code
- *Out << " to ";
+ Out << " to ";
printType(I.getType());
} else if (isa<VAArgInst>(I)) {
if (Operand) writeOperand(Operand, true); // Work with broken code
- *Out << ", ";
+ Out << ", ";
printType(I.getType());
} else if (const VANextInst *VAN = dyn_cast<VANextInst>(&I)) {
if (Operand) writeOperand(Operand, true); // Work with broken code
- *Out << ", ";
+ Out << ", ";
printType(VAN->getArgType());
} else if (Operand) { // Print the normal way...
}
if (!PrintAllTypes) {
- *Out << " ";
+ Out << ' ';
printType(TheType);
}
for (unsigned i = 0, E = I.getNumOperands(); i != E; ++i) {
- if (i) *Out << ",";
+ if (i) Out << ',';
writeOperand(I.getOperand(i), PrintAllTypes);
}
}
printInfoComment(I);
- *Out << "\n";
+ Out << "\n";
}
void Constant::print(std::ostream &o) const {
if (this == 0) { o << "<null> constant value\n"; return; }
- // Handle CPR's special, because they have context information...
- if (const ConstantPointerRef *CPR = dyn_cast<ConstantPointerRef>(this)) {
- CPR->getValue()->print(o); // Print as a global value, with context info.
- return;
- }
-
- o << " " << getType()->getDescription() << " ";
+ o << ' ' << getType()->getDescription() << ' ';
std::map<const Type *, std::string> TypeTable;
WriteConstantInt(o, this, false, TypeTable, 0);
}
void Argument::print(std::ostream &o) const {
- o << getType() << " " << getName();
+ WriteAsOperand(o, this, true, true,
+ getParent() ? getParent()->getParent() : 0);
}
// Value::dump - allow easy printing of Values from the debugger.
delete SC; delete AW;
if (M) {
SC = new SlotMachine(M );
- AW = new AssemblyWriter(*Out, *SC, M, 0);
+ AW = new AssemblyWriter(Out, *SC, M, 0);
} else {
SC = 0; AW = 0;
}
delete SC;
}
-CachedWriter &CachedWriter::operator<<(const Value *V) {
+CachedWriter &CachedWriter::operator<<(const Value &V) {
assert(AW && SC && "CachedWriter does not have a current module!");
- switch (V->getValueType()) {
- case Value::ConstantVal:
- case Value::ArgumentVal: AW->writeOperand(V, true, true); break;
- case Value::TypeVal: AW->write(cast<Type>(V)); break;
- case Value::InstructionVal: AW->write(cast<Instruction>(V)); break;
- case Value::BasicBlockVal: AW->write(cast<BasicBlock>(V)); break;
- case Value::FunctionVal: AW->write(cast<Function>(V)); break;
- case Value::GlobalVariableVal: AW->write(cast<GlobalVariable>(V)); break;
- default: *Out << "<unknown value type: " << V->getValueType() << ">"; break;
- }
+ if (const Instruction *I = dyn_cast<Instruction>(&V))
+ AW->write(I);
+ else if (const BasicBlock *BB = dyn_cast<BasicBlock>(&V))
+ AW->write(BB);
+ else if (const Function *F = dyn_cast<Function>(&V))
+ AW->write(F);
+ else if (const GlobalVariable *GV = dyn_cast<GlobalVariable>(&V))
+ AW->write(GV);
+ else
+ AW->writeOperand(&V, true, true);
return *this;
}
-CachedWriter& CachedWriter::operator<<(const Type *X) {
+CachedWriter& CachedWriter::operator<<(const Type &Ty) {
if (SymbolicTypes) {
const Module *M = AW->getModule();
- if (M) WriteTypeSymbolic(*Out, X, M);
- return *this;
- } else
- return *this << (const Value*)X;
-}
-
-void CachedWriter::setStream(std::ostream &os) {
- Out = &os;
- if (AW) AW->setStream(os);
+ if (M) WriteTypeSymbolic(Out, &Ty, M);
+ } else {
+ AW->write(&Ty);
+ }
+ return *this;
}
//===----------------------------------------------------------------------===//
// Module level constructor. Causes the contents of the Module (sans functions)
// to be added to the slot table.
SlotMachine::SlotMachine(const Module *M)
- : TheModule(M)
- , FunctionIncorporated(false)
+ : TheModule(M) ///< Saved for lazy initialization.
+ , TheFunction(0)
+ , FunctionProcessed(false)
, mMap()
+ , mTypes()
, fMap()
+ , fTypes()
{
- if ( M != 0 )
- processModule();
}
// Function level constructor. Causes the contents of the Module and the one
// function provided to be added to the slot table.
SlotMachine::SlotMachine(const Function *F )
- : TheModule( F ? F->getParent() : 0 )
- , FunctionIncorporated(true)
+ : TheModule( F ? F->getParent() : 0 ) ///< Saved for lazy initialization
+ , TheFunction(F) ///< Saved for lazy initialization
+ , FunctionProcessed(false)
, mMap()
+ , mTypes()
, fMap()
+ , fTypes()
{
- if ( TheModule ) {
- processModule(); // Process module level stuff
- incorporateFunction(F); // Start out in incorporated state
+}
+
+inline void SlotMachine::initialize(void) {
+ if ( TheModule) {
+ processModule();
+ TheModule = 0; ///< Prevent re-processing next time we're called.
+ }
+ if ( TheFunction && ! FunctionProcessed) {
+ processFunction();
}
}
I != E; ++I)
createSlot(I);
- // Add all of the module level constants used as initializers
- for (Module::const_giterator I = TheModule->gbegin(), E = TheModule->gend();
- I != E; ++I)
- if (I->hasInitializer())
- createSlot(I->getInitializer());
-
SC_DEBUG("end processModule!\n");
}
-// Incorporate the arguments, basic blocks, and instructions of a function.
-// This is the *only* way to get the FunctionIncorporated flag set.
-void SlotMachine::incorporateFunction(const Function *F) {
+// Process the arguments, basic blocks, and instructions of a function.
+void SlotMachine::processFunction() {
SC_DEBUG("begin processFunction!\n");
- FunctionIncorporated = true;
-
// Add all the function arguments
- for(Function::const_aiterator AI = F->abegin(),
- AE = F->aend(); AI != AE; ++AI)
+ for(Function::const_aiterator AI = TheFunction->abegin(),
+ AE = TheFunction->aend(); AI != AE; ++AI)
createSlot(AI);
SC_DEBUG("Inserting Instructions:\n");
// Add all of the basic blocks and instructions
- for (Function::const_iterator BB = F->begin(), E = F->end(); BB != E; ++BB) {
+ for (Function::const_iterator BB = TheFunction->begin(),
+ E = TheFunction->end(); BB != E; ++BB) {
createSlot(BB);
for (BasicBlock::const_iterator I = BB->begin(), E = BB->end(); I!=E; ++I) {
createSlot(I);
}
}
+ FunctionProcessed = true;
+
SC_DEBUG("end processFunction!\n");
}
// Clean up after incorporating a function. This is the only way
-// (other than construction) to get the FunctionIncorporated flag cleared.
+// to get out of the function incorporation state that affects the
+// getSlot/createSlot lock. Function incorporation state is indicated
+// by TheFunction != 0.
void SlotMachine::purgeFunction() {
SC_DEBUG("begin purgeFunction!\n");
fMap.clear(); // Simply discard the function level map
- FunctionIncorporated = false;
+ fTypes.clear();
+ TheFunction = 0;
+ FunctionProcessed = false;
SC_DEBUG("end purgeFunction!\n");
}
/// Get the slot number for a value. This function will assert if you
/// ask for a Value that hasn't previously been inserted with createSlot.
/// Types are forbidden because Type does not inherit from Value (any more).
-unsigned SlotMachine::getSlot(const Value *V) const {
+int SlotMachine::getSlot(const Value *V) {
assert( V && "Can't get slot for null Value" );
- assert( !isa<Type>(V) && "Can't get slot for a type" );
+ assert(!isa<Constant>(V) || isa<GlobalValue>(V) &&
+ "Can't insert a non-GlobalValue Constant into SlotMachine");
- // Do not number CPR's at all. They are an abomination
- if ( const ConstantPointerRef* CPR = dyn_cast<ConstantPointerRef>(V) )
- V = CPR->getValue() ;
+ // Check for uninitialized state and do lazy initialization
+ this->initialize();
// Get the type of the value
const Type* VTy = V->getType();
// Find the type plane in the module map
TypedPlanes::const_iterator MI = mMap.find(VTy);
- if ( FunctionIncorporated ) {
+ if ( TheFunction ) {
// Lookup the type in the function map too
TypedPlanes::const_iterator FI = fMap.find(VTy);
// If there is a corresponding type plane in the function map
ValueMap::const_iterator FVI = FI->second.map.find(V);
// If the value doesn't exist in the function map
if ( FVI == FI->second.map.end() ) {
- // Look up the value in the module map
- ValueMap::const_iterator MVI = MI->second.map.find(V);
- // If we didn't find it, it wasn't inserted
- assert( MVI != MI->second.map.end() && "Value not found");
- // We found it only at the module level
- return MVI->second;
+ // Look up the value in the module map.
+ if (MI == mMap.end()) return -1;
+ ValueMap::const_iterator MVI = MI->second.map.find(V);
+ // If we didn't find it, it wasn't inserted
+ if (MVI == MI->second.map.end()) return -1;
+ assert( MVI != MI->second.map.end() && "Value not found");
+ // We found it only at the module level
+ return MVI->second;
// else the value exists in the function map
} else {
- // Return the slot number as the module's contribution to
- // the type plane plus the index in the function's contribution
- // to the type plane.
- return MI->second.next_slot + FVI->second;
+ // Return the slot number as the module's contribution to
+ // the type plane plus the index in the function's contribution
+ // to the type plane.
+ if (MI != mMap.end())
+ return MI->second.next_slot + FVI->second;
+ else
+ return FVI->second;
}
-
- // else there is not a corresponding type plane in the function map
- } else {
- assert( MI != mMap.end() && "No such type plane!" );
- // Look up the value in the module's map
- ValueMap::const_iterator MVI = MI->second.map.find(V);
- // If we didn't find it, it wasn't inserted.
- assert( MVI != MI->second.map.end() && "Value not found");
- // We found it only in the module level and function level
- // didn't even have a type plane.
- return MVI->second;
}
}
- // N.B. Can only get here if !FunctionIncorporated
+ // N.B. Can get here only if either !TheFunction or the function doesn't
+ // have a corresponding type plane for the Value
// Make sure the type plane exists
- assert( MI != mMap.end() && "No such type plane!" );
+ if (MI == mMap.end()) return -1;
// Lookup the value in the module's map
ValueMap::const_iterator MVI = MI->second.map.find(V);
// Make sure we found it.
- assert( MVI != MI->second.map.end() && "Value not found" );
+ if (MVI == MI->second.map.end()) return -1;
// Return it.
return MVI->second;
}
+/// Get the slot number for a value. This function will assert if you
+/// ask for a Value that hasn't previously been inserted with createSlot.
+/// Types are forbidden because Type does not inherit from Value (any more).
+int SlotMachine::getSlot(const Type *Ty) {
+ assert( Ty && "Can't get slot for null Type" );
+
+ // Check for uninitialized state and do lazy initialization
+ this->initialize();
+
+ if ( TheFunction ) {
+ // Lookup the Type in the function map
+ TypeMap::const_iterator FTI = fTypes.map.find(Ty);
+ // If the Type doesn't exist in the function map
+ if ( FTI == fTypes.map.end() ) {
+ TypeMap::const_iterator MTI = mTypes.map.find(Ty);
+ // If we didn't find it, it wasn't inserted
+ if (MTI == mTypes.map.end())
+ return -1;
+ // We found it only at the module level
+ return MTI->second;
+
+ // else the value exists in the function map
+ } else {
+ // Return the slot number as the module's contribution to
+ // the type plane plus the index in the function's contribution
+ // to the type plane.
+ return mTypes.next_slot + FTI->second;
+ }
+ }
+
+ // N.B. Can get here only if either !TheFunction
+
+ // Lookup the value in the module's map
+ TypeMap::const_iterator MTI = mTypes.map.find(Ty);
+ // Make sure we found it.
+ if (MTI == mTypes.map.end()) return -1;
+ // Return it.
+ return MTI->second;
+}
// Create a new slot, or return the existing slot if it is already
// inserted. Note that the logic here parallels getSlot but instead
// of asserting when the Value* isn't found, it inserts the value.
unsigned SlotMachine::createSlot(const Value *V) {
assert( V && "Can't insert a null Value to SlotMachine");
- assert( !isa<Type>(V) && "Can't insert a Type into SlotMachine");
+ assert(!isa<Constant>(V) || isa<GlobalValue>(V) &&
+ "Can't insert a non-GlobalValue Constant into SlotMachine");
const Type* VTy = V->getType();
// Look up the type plane for the Value's type from the module map
TypedPlanes::const_iterator MI = mMap.find(VTy);
- if ( FunctionIncorporated ) {
+ if ( TheFunction ) {
// Get the type plane for the Value's type from the function map
TypedPlanes::const_iterator FI = fMap.find(VTy);
// If there is a corresponding type plane in the function map
ValueMap::const_iterator FVI = FI->second.map.find(V);
// If the value doesn't exist in the function map
if ( FVI == FI->second.map.end() ) {
- // If there is no corresponding type plane in the module map
- if ( MI == mMap.end() )
- return insertValue(V);
- // Look up the value in the module map
- ValueMap::const_iterator MVI = MI->second.map.find(V);
- // If we didn't find it, it wasn't inserted
- if ( MVI == MI->second.map.end() )
- return insertValue(V);
- else
- // We found it only at the module level
- return MVI->second;
+ // If there is no corresponding type plane in the module map
+ if ( MI == mMap.end() )
+ return insertValue(V);
+ // Look up the value in the module map
+ ValueMap::const_iterator MVI = MI->second.map.find(V);
+ // If we didn't find it, it wasn't inserted
+ if ( MVI == MI->second.map.end() )
+ return insertValue(V);
+ else
+ // We found it only at the module level
+ return MVI->second;
// else the value exists in the function map
} else {
- if ( MI == mMap.end() )
- return FVI->second;
- else
- // Return the slot number as the module's contribution to
- // the type plane plus the index in the function's contribution
- // to the type plane.
- return MI->second.next_slot + FVI->second;
+ if ( MI == mMap.end() )
+ return FVI->second;
+ else
+ // Return the slot number as the module's contribution to
+ // the type plane plus the index in the function's contribution
+ // to the type plane.
+ return MI->second.next_slot + FVI->second;
}
// else there is not a corresponding type plane in the function map
} else {
// If the type plane doesn't exists at the module level
if ( MI == mMap.end() ) {
- return insertValue(V);
+ return insertValue(V);
// else type plane exists at the module level, examine it
} else {
- // Look up the value in the module's map
- ValueMap::const_iterator MVI = MI->second.map.find(V);
- // If we didn't find it there either
- if ( MVI == MI->second.map.end() )
- // Return the slot number as the module's contribution to
- // the type plane plus the index of the function map insertion.
- return MI->second.next_slot + insertValue(V);
- else
- return MVI->second;
+ // Look up the value in the module's map
+ ValueMap::const_iterator MVI = MI->second.map.find(V);
+ // If we didn't find it there either
+ if ( MVI == MI->second.map.end() )
+ // Return the slot number as the module's contribution to
+ // the type plane plus the index of the function map insertion.
+ return MI->second.next_slot + insertValue(V);
+ else
+ return MVI->second;
}
}
}
- // N.B. Can only get here if !FunctionIncorporated
+ // N.B. Can only get here if !TheFunction
// If the module map's type plane is not for the Value's type
if ( MI != mMap.end() ) {
return insertValue(V);
}
+// Create a new slot, or return the existing slot if it is already
+// inserted. Note that the logic here parallels getSlot but instead
+// of asserting when the Value* isn't found, it inserts the value.
+unsigned SlotMachine::createSlot(const Type *Ty) {
+ assert( Ty && "Can't insert a null Type to SlotMachine");
+
+ if ( TheFunction ) {
+ // Lookup the Type in the function map
+ TypeMap::const_iterator FTI = fTypes.map.find(Ty);
+ // If the type doesn't exist in the function map
+ if ( FTI == fTypes.map.end() ) {
+ // Look up the type in the module map
+ TypeMap::const_iterator MTI = mTypes.map.find(Ty);
+ // If we didn't find it, it wasn't inserted
+ if ( MTI == mTypes.map.end() )
+ return insertValue(Ty);
+ else
+ // We found it only at the module level
+ return MTI->second;
+
+ // else the value exists in the function map
+ } else {
+ // Return the slot number as the module's contribution to
+ // the type plane plus the index in the function's contribution
+ // to the type plane.
+ return mTypes.next_slot + FTI->second;
+ }
+ }
+
+ // N.B. Can only get here if !TheFunction
+
+ // Lookup the type in the module's map
+ TypeMap::const_iterator MTI = mTypes.map.find(Ty);
+ if ( MTI != mTypes.map.end() )
+ return MTI->second;
+
+ return insertValue(Ty);
+}
// Low level insert function. Minimal checking is done. This
// function is just for the convenience of createSlot (above).
unsigned SlotMachine::insertValue(const Value *V ) {
assert(V && "Can't insert a null Value into SlotMachine!");
- assert(!isa<Type>(V) && "Can't insert a Type into SlotMachine!");
+ assert(!isa<Constant>(V) || isa<GlobalValue>(V) &&
+ "Can't insert a non-GlobalValue Constant into SlotMachine");
- // If this value does not contribute to a plane (is void or constant)
+ // If this value does not contribute to a plane (is void)
// or if the value already has a name then ignore it.
- if (V->getType() == Type::VoidTy || // Ignore void type nodes
- (V->hasName() || isa<Constant>(V)) ) {
+ if (V->getType() == Type::VoidTy || V->hasName() ) {
SC_DEBUG("ignored value " << *V << "\n");
return 0; // FIXME: Wrong return value
}
- if (!isa<GlobalValue>(V)) // Initializers for globals are handled explicitly
- if (const Constant *C = dyn_cast<Constant>(V)) {
- // This makes sure that if a constant has uses (for example an array of
- // const ints), that they are inserted also.
- for (User::const_op_iterator I = C->op_begin(), E = C->op_end();
- I != E; ++I)
- createSlot(*I);
- }
-
const Type *VTy = V->getType();
unsigned DestSlot = 0;
- if ( FunctionIncorporated ) {
+ if ( TheFunction ) {
TypedPlanes::iterator I = fMap.find( VTy );
if ( I == fMap.end() )
- I = fMap.insert(std::make_pair(VTy,Plane())).first;
+ I = fMap.insert(std::make_pair(VTy,ValuePlane())).first;
DestSlot = I->second.map[V] = I->second.next_slot++;
} else {
TypedPlanes::iterator I = mMap.find( VTy );
if ( I == mMap.end() )
- I = mMap.insert(std::make_pair(VTy,Plane())).first;
+ I = mMap.insert(std::make_pair(VTy,ValuePlane())).first;
DestSlot = I->second.map[V] = I->second.next_slot++;
}
SC_DEBUG(" Inserting value [" << VTy << "] = " << V << " slot=" <<
- DestSlot << " [");
+ DestSlot << " [");
// G = Global, C = Constant, T = Type, F = Function, o = other
- SC_DEBUG((isa<GlobalVariable>(V) ? "G" : (isa<Constant>(V) ? "C" :
- (isa<Function>(V) ? "F" : "o"))));
+ SC_DEBUG((isa<GlobalVariable>(V) ? 'G' : (isa<Function>(V) ? 'F' :
+ (isa<Constant>(V) ? 'C' : 'o'))));
SC_DEBUG("]\n");
return DestSlot;
}
+// Low level insert function. Minimal checking is done. This
+// function is just for the convenience of createSlot (above).
+unsigned SlotMachine::insertValue(const Type *Ty ) {
+ assert(Ty && "Can't insert a null Type into SlotMachine!");
+
+ unsigned DestSlot = 0;
+
+ if ( TheFunction ) {
+ DestSlot = fTypes.map[Ty] = fTypes.next_slot++;
+ } else {
+ DestSlot = fTypes.map[Ty] = fTypes.next_slot++;
+ }
+ SC_DEBUG(" Inserting type [" << DestSlot << "] = " << Ty << "\n");
+ return DestSlot;
+}
+
// vim: sw=2
projects / oota-llvm.git / blobdiff