+#include "llvm/iTerminators.h"
+#include "llvm/iPHINode.h"
+#include "llvm/iOther.h"
+#include "llvm/SymbolTable.h"
+#include "llvm/Support/CFG.h"
+#include "Support/StringExtras.h"
+#include "Support/STLExtras.h"
+#include <algorithm>
+using std::string;
+using std::map;
+using std::vector;
+using std::ostream;
+
+static RegisterPass<PrintModulePass>
+X("printm", "Print module to stderr",PassInfo::Analysis|PassInfo::Optimization);
+static RegisterPass<PrintFunctionPass>
+Y("print","Print function to stderr",PassInfo::Analysis|PassInfo::Optimization);
+
+static void WriteAsOperandInternal(ostream &Out, const Value *V, bool PrintName,
+ map<const Type *, string> &TypeTable,
+ SlotCalculator *Table);
+
+static const Module *getModuleFromVal(const Value *V) {
+ if (const Argument *MA = dyn_cast<const Argument>(V))
+ return MA->getParent() ? MA->getParent()->getParent() : 0;
+ else if (const BasicBlock *BB = dyn_cast<const BasicBlock>(V))
+ return BB->getParent() ? BB->getParent()->getParent() : 0;
+ else if (const Instruction *I = dyn_cast<const Instruction>(V)) {
+ const Function *M = I->getParent() ? I->getParent()->getParent() : 0;
+ return M ? M->getParent() : 0;
+ } else if (const GlobalValue *GV = dyn_cast<const GlobalValue>(V))
+ return GV->getParent();
+ return 0;
+}
+
+static SlotCalculator *createSlotCalculator(const Value *V) {
+ assert(!isa<Type>(V) && "Can't create an SC for a type!");
+ if (const Argument *FA = dyn_cast<const Argument>(V)) {
+ return new SlotCalculator(FA->getParent(), true);
+ } else if (const Instruction *I = dyn_cast<const Instruction>(V)) {
+ return new SlotCalculator(I->getParent()->getParent(), true);
+ } else if (const BasicBlock *BB = dyn_cast<const BasicBlock>(V)) {
+ return new SlotCalculator(BB->getParent(), true);
+ } else if (const GlobalVariable *GV = dyn_cast<const GlobalVariable>(V)){
+ return new SlotCalculator(GV->getParent(), true);
+ } else if (const Function *Func = dyn_cast<const Function>(V)) {
+ return new SlotCalculator(Func, true);
+ }
+ return 0;
+}
+
+
+// If the module has a symbol table, take all global types and stuff their
+// names into the TypeNames map.
+//
+static void fillTypeNameTable(const Module *M,
+ map<const Type *, string> &TypeNames) {
+ if (!M) return;
+ const SymbolTable &ST = M->getSymbolTable();
+ SymbolTable::const_iterator PI = ST.find(Type::TypeTy);
+ if (PI != ST.end()) {
+ SymbolTable::type_const_iterator I = PI->second.begin();
+ for (; I != PI->second.end(); ++I) {
+ // As a heuristic, don't insert pointer to primitive types, because
+ // they are used too often to have a single useful name.
+ //
+ const Type *Ty = cast<const Type>(I->second);
+ if (!isa<PointerType>(Ty) ||
+ !cast<PointerType>(Ty)->getElementType()->isPrimitiveType())
+ TypeNames.insert(std::make_pair(Ty, "%"+I->first));
+ }
+ }
+}
+
+
+
+static string calcTypeName(const Type *Ty, vector<const Type *> &TypeStack,
+ map<const Type *, string> &TypeNames) {
+ if (Ty->isPrimitiveType()) return Ty->getDescription(); // Base case
+
+ // Check to see if the type is named.
+ map<const Type *, string>::iterator I = TypeNames.find(Ty);
+ if (I != TypeNames.end()) return I->second;
+
+ // Check to see if the Type is already on the stack...
+ unsigned Slot = 0, CurSize = TypeStack.size();
+ while (Slot < CurSize && TypeStack[Slot] != Ty) ++Slot; // Scan for type
+
+ // 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
+
+ TypeStack.push_back(Ty); // Recursive case: Add us to the stack..
+
+ string Result;
+ switch (Ty->getPrimitiveID()) {
+ case Type::FunctionTyID: {
+ const FunctionType *FTy = cast<const FunctionType>(Ty);
+ Result = calcTypeName(FTy->getReturnType(), TypeStack, TypeNames) + " (";
+ for (FunctionType::ParamTypes::const_iterator
+ I = FTy->getParamTypes().begin(),
+ E = FTy->getParamTypes().end(); I != E; ++I) {
+ if (I != FTy->getParamTypes().begin())
+ Result += ", ";
+ Result += calcTypeName(*I, TypeStack, TypeNames);
+ }
+ if (FTy->isVarArg()) {
+ if (!FTy->getParamTypes().empty()) Result += ", ";
+ Result += "...";
+ }
+ Result += ")";
+ break;
+ }
+ case Type::StructTyID: {
+ const StructType *STy = cast<const StructType>(Ty);
+ Result = "{ ";
+ for (StructType::ElementTypes::const_iterator
+ I = STy->getElementTypes().begin(),
+ E = STy->getElementTypes().end(); I != E; ++I) {
+ if (I != STy->getElementTypes().begin())
+ Result += ", ";
+ Result += calcTypeName(*I, TypeStack, TypeNames);
+ }
+ Result += " }";
+ break;
+ }
+ case Type::PointerTyID:
+ Result = calcTypeName(cast<const PointerType>(Ty)->getElementType(),
+ TypeStack, TypeNames) + "*";
+ break;
+ case Type::ArrayTyID: {
+ const ArrayType *ATy = cast<const ArrayType>(Ty);
+ Result = "[" + utostr(ATy->getNumElements()) + " x ";
+ Result += calcTypeName(ATy->getElementType(), TypeStack, TypeNames) + "]";
+ break;
+ }
+ default:
+ Result = "<unrecognized-type>";
+ }
+
+ TypeStack.pop_back(); // Remove self from stack...
+ return Result;
+}
+
+
+// printTypeInt - The internal guts of printing out a type that has a
+// potentially named portion.
+//
+static ostream &printTypeInt(ostream &Out, const Type *Ty,
+ map<const Type *, string> &TypeNames) {
+ // Primitive types always print out their description, regardless of whether
+ // they have been named or not.
+ //
+ if (Ty->isPrimitiveType()) return Out << Ty->getDescription();
+
+ // Check to see if the type is named.
+ map<const Type *, string>::iterator I = TypeNames.find(Ty);
+ if (I != TypeNames.end()) return Out << I->second;
+
+ // Otherwise we have a type that has not been named but is a derived type.
+ // Carefully recurse the type hierarchy to print out any contained symbolic
+ // names.
+ //
+ vector<const Type *> TypeStack;
+ string TypeName = calcTypeName(Ty, TypeStack, TypeNames);
+ TypeNames.insert(std::make_pair(Ty, TypeName));//Cache type name for later use
+ return Out << TypeName;
+}
+