X-Git-Url: http://plrg.eecs.uci.edu/git/?a=blobdiff_plain;f=lib%2FVMCore%2FModule.cpp;h=163d8d2ac173797909502b7616020a9b8efd39db;hb=ef9b9a793949469cdaa4ab6d0173136229dcab7b;hp=08bc38723cea49a3ef1a3e60eab2aa941ae842fd;hpb=11aa4770fe38befb3926646cf9ea7ed0ff7e33a8;p=oota-llvm.git diff --git a/lib/VMCore/Module.cpp b/lib/VMCore/Module.cpp index 08bc38723ce..163d8d2ac17 100644 --- a/lib/VMCore/Module.cpp +++ b/lib/VMCore/Module.cpp @@ -1,125 +1,262 @@ -//===-- Module.cpp - Implement the Module class ------------------*- C++ -*--=// +//===-- Module.cpp - Implement the Module class ---------------------------===// +// +// The LLVM Compiler Infrastructure +// +// This file was developed by the LLVM research group and is distributed under +// the University of Illinois Open Source License. See LICENSE.TXT for details. +// +//===----------------------------------------------------------------------===// // // This file implements the Module class for the VMCore library. // //===----------------------------------------------------------------------===// #include "llvm/Module.h" -#include "llvm/Function.h" -#include "llvm/GlobalVariable.h" #include "llvm/InstrTypes.h" -#include "llvm/Type.h" -#include "llvm/ConstantVals.h" +#include "llvm/Constants.h" #include "llvm/DerivedTypes.h" -#include "Support/STLExtras.h" -#include "ValueHolderImpl.h" +#include "llvm/ADT/STLExtras.h" +#include "llvm/ADT/StringExtras.h" +#include "llvm/Support/LeakDetector.h" +#include "SymbolTableListTraitsImpl.h" +#include "llvm/TypeSymbolTable.h" +#include +#include +#include #include +using namespace llvm; -// Instantiate Templates - This ugliness is the price we have to pay -// for having a DefHolderImpl.h file seperate from DefHolder.h! :( +//===----------------------------------------------------------------------===// +// Methods to implement the globals and functions lists. // -template class ValueHolder; -template class ValueHolder; -// Define the GlobalValueRefMap as a struct that wraps a map so that we don't -// have Module.h depend on -// -struct GlobalValueRefMap : public std::map{ -}; +Function *ilist_traits::createSentinel() { + FunctionType *FTy = + FunctionType::get(Type::VoidTy, std::vector(), false, + std::vector() ); + Function *Ret = new Function(FTy, GlobalValue::ExternalLinkage); + // This should not be garbage monitored. + LeakDetector::removeGarbageObject(Ret); + return Ret; +} +GlobalVariable *ilist_traits::createSentinel() { + GlobalVariable *Ret = new GlobalVariable(Type::Int32Ty, false, + GlobalValue::ExternalLinkage); + // This should not be garbage monitored. + LeakDetector::removeGarbageObject(Ret); + return Ret; +} +iplist &ilist_traits::getList(Module *M) { + return M->getFunctionList(); +} +iplist &ilist_traits::getList(Module *M) { + return M->getGlobalList(); +} + +// Explicit instantiations of SymbolTableListTraits since some of the methods +// are not in the public header file. +template class SymbolTableListTraits; +template class SymbolTableListTraits; + +//===----------------------------------------------------------------------===// +// Primitive Module methods. +// -Module::Module() : GlobalList(this, this), FunctionList(this, this) { - GVRefMap = 0; - SymTab = 0; +Module::Module(const std::string &MID) + : ModuleID(MID), DataLayout("") { + FunctionList.setItemParent(this); + FunctionList.setParent(this); + GlobalList.setItemParent(this); + GlobalList.setParent(this); + ValSymTab = new ValueSymbolTable(); + TypeSymTab = new TypeSymbolTable(); } Module::~Module() { dropAllReferences(); - GlobalList.delete_all(); + GlobalList.clear(); GlobalList.setParent(0); - FunctionList.delete_all(); + FunctionList.clear(); FunctionList.setParent(0); - delete SymTab; + LibraryList.clear(); + delete ValSymTab; + delete TypeSymTab; } -SymbolTable *Module::getSymbolTableSure() { - if (!SymTab) SymTab = new SymbolTable(0); - return SymTab; +// Module::dump() - Allow printing from debugger +void Module::dump() const { + print(*cerr.stream()); } -// hasSymbolTable() - Returns true if there is a symbol table allocated to -// this object AND if there is at least one name in it! -// -bool Module::hasSymbolTable() const { - if (!SymTab) return false; +/// Target endian information... +Module::Endianness Module::getEndianness() const { + std::string temp = DataLayout; + Module::Endianness ret = AnyEndianness; + + while (!temp.empty()) { + std::string token = getToken(temp, "-"); + + if (token[0] == 'e') { + ret = LittleEndian; + } else if (token[0] == 'E') { + ret = BigEndian; + } + } + + return ret; +} - for (SymbolTable::const_iterator I = SymTab->begin(), E = SymTab->end(); - I != E; ++I) - if (I->second.begin() != I->second.end()) - return true; // Found nonempty type plane! +/// Target Pointer Size information... +Module::PointerSize Module::getPointerSize() const { + std::string temp = DataLayout; + Module::PointerSize ret = AnyPointerSize; - return false; + while (!temp.empty()) { + std::string token = getToken(temp, "-"); + char signal = getToken(token, ":")[0]; + + if (signal == 'p') { + int size = atoi(getToken(token, ":").c_str()); + if (size == 32) + ret = Pointer32; + else if (size == 64) + ret = Pointer64; + } + } + + return ret; } +//===----------------------------------------------------------------------===// +// Methods for easy access to the functions in the module. +// // getOrInsertFunction - Look up the specified function in the module symbol // table. If it does not exist, add a prototype for the function and return // it. This is nice because it allows most passes to get away with not handling // the symbol table directly for this common task. // -Function *Module::getOrInsertFunction(const std::string &Name, +Constant *Module::getOrInsertFunction(const std::string &Name, const FunctionType *Ty) { - SymbolTable *SymTab = getSymbolTableSure(); + ValueSymbolTable &SymTab = getValueSymbolTable(); - // See if we have a definitions for the specified function already... - if (Value *V = SymTab->lookup(PointerType::get(Ty), Name)) { - return cast(V); // Yup, got it - } else { // Nope, add one - Function *New = new Function(Ty, false, Name); + // See if we have a definition for the specified function already. + Function *F = dyn_cast_or_null(SymTab.lookup(Name)); + if (F == 0) { + // Nope, add it + Function *New = new Function(Ty, GlobalVariable::ExternalLinkage, Name); FunctionList.push_back(New); - return New; // Return the new prototype... + return New; // Return the new prototype. + } + + // Okay, the function exists. Does it have externally visible linkage? + if (F->hasInternalLinkage()) { + // Rename the function. + F->setName(SymTab.getUniqueName(F->getName())); + // Retry, now there won't be a conflict. + return getOrInsertFunction(Name, Ty); } + + // If the function exists but has the wrong type, return a bitcast to the + // right type. + if (F->getFunctionType() != Ty) + return ConstantExpr::getBitCast(F, PointerType::get(Ty)); + + // Otherwise, we just found the existing function or a prototype. + return F; } +// getOrInsertFunction - Look up the specified function in the module symbol +// table. If it does not exist, add a prototype for the function and return it. +// This version of the method takes a null terminated list of function +// arguments, which makes it easier for clients to use. +// +Constant *Module::getOrInsertFunction(const std::string &Name, + const Type *RetTy, ...) { + va_list Args; + va_start(Args, RetTy); + + // Build the list of argument types... + std::vector ArgTys; + while (const Type *ArgTy = va_arg(Args, const Type*)) + ArgTys.push_back(ArgTy); + + va_end(Args); + + // Build the function type and chain to the other getOrInsertFunction... + return getOrInsertFunction(Name, FunctionType::get(RetTy, ArgTys, false)); +} + + // getFunction - Look up the specified function in the module symbol table. // If it does not exist, return null. // -Function *Module::getFunction(const std::string &Name, const FunctionType *Ty) { - SymbolTable *SymTab = getSymbolTable(); - if (SymTab == 0) return 0; // No symtab, no symbols... +Function *Module::getFunction(const std::string &Name) const { + const ValueSymbolTable &SymTab = getValueSymbolTable(); + return dyn_cast_or_null(SymTab.lookup(Name)); +} + +//===----------------------------------------------------------------------===// +// Methods for easy access to the global variables in the module. +// - return cast_or_null(SymTab->lookup(PointerType::get(Ty), Name)); +/// getGlobalVariable - Look up the specified global variable in the module +/// symbol table. If it does not exist, return null. The type argument +/// should be the underlying type of the global, i.e., it should not have +/// the top-level PointerType, which represents the address of the global. +/// If AllowInternal is set to true, this function will return types that +/// have InternalLinkage. By default, these types are not returned. +/// +GlobalVariable *Module::getGlobalVariable(const std::string &Name, + bool AllowInternal) const { + if (Value *V = ValSymTab->lookup(Name)) { + GlobalVariable *Result = dyn_cast(V); + if (Result && (AllowInternal || !Result->hasInternalLinkage())) + return Result; + } + return 0; } +//===----------------------------------------------------------------------===// +// Methods for easy access to the types in the module. +// + + // addTypeName - Insert an entry in the symbol table mapping Str to Type. If // there is already an entry for this name, true is returned and the symbol // table is not modified. // bool Module::addTypeName(const std::string &Name, const Type *Ty) { - SymbolTable *ST = getSymbolTableSure(); + TypeSymbolTable &ST = getTypeSymbolTable(); + + if (ST.lookup(Name)) return true; // Already in symtab... - if (ST->lookup(Type::TypeTy, Name)) return true; // Already in symtab... - // Not in symbol table? Set the name with the Symtab as an argument so the // type knows what to update... - ((Value*)Ty)->setName(Name, ST); + ST.insert(Name, Ty); return false; } +/// getTypeByName - Return the type with the specified name in this module, or +/// null if there is none by that name. +const Type *Module::getTypeByName(const std::string &Name) const { + const TypeSymbolTable &ST = getTypeSymbolTable(); + return cast_or_null(ST.lookup(Name)); +} + // getTypeName - If there is at least one entry in the symbol table for the // specified type, return it. // -std::string Module::getTypeName(const Type *Ty) { - const SymbolTable *ST = getSymbolTable(); - if (ST == 0) return ""; // No symbol table, must not have an entry... - if (ST->find(Type::TypeTy) == ST->end()) - return ""; // No names for types... +std::string Module::getTypeName(const Type *Ty) const { + const TypeSymbolTable &ST = getTypeSymbolTable(); - SymbolTable::type_const_iterator TI = ST->type_begin(Type::TypeTy); - SymbolTable::type_const_iterator TE = ST->type_end(Type::TypeTy); + TypeSymbolTable::const_iterator TI = ST.begin(); + TypeSymbolTable::const_iterator TE = ST.end(); + if ( TI == TE ) return ""; // No names for types - while (TI != TE && TI->second != (const Value*)Ty) + while (TI != TE && TI->second != Ty) ++TI; if (TI != TE) // Must have found an entry! @@ -127,60 +264,40 @@ std::string Module::getTypeName(const Type *Ty) { return ""; // Must not have found anything... } +//===----------------------------------------------------------------------===// +// Other module related stuff. +// + -// dropAllReferences() - This function causes all the subinstructions to "let -// go" of all references that they are maintaining. This allows one to -// 'delete' a whole class at a time, even though there may be circular -// references... first all references are dropped, and all use counts go to -// zero. Then everything is delete'd for real. Note that no operations are -// valid on an object that has "dropped all references", except operator -// delete. +// dropAllReferences() - This function causes all the subelementss to "let go" +// of all references that they are maintaining. This allows one to 'delete' a +// whole module at a time, even though there may be circular references... first +// all references are dropped, and all use counts go to zero. Then everything +// is deleted for real. Note that no operations are valid on an object that +// has "dropped all references", except operator delete. // void Module::dropAllReferences() { - for_each(FunctionList.begin(), FunctionList.end(), - std::mem_fun(&Function::dropAllReferences)); - - for_each(GlobalList.begin(), GlobalList.end(), - std::mem_fun(&GlobalVariable::dropAllReferences)); - - // If there are any GlobalVariable references still out there, nuke them now. - // Since all references are hereby dropped, nothing could possibly reference - // them still. - if (GVRefMap) { - for (GlobalValueRefMap::iterator I = GVRefMap->begin(), E = GVRefMap->end(); - I != E; ++I) { - // Delete the ConstantPointerRef node... - I->second->destroyConstant(); - } + for(Module::iterator I = begin(), E = end(); I != E; ++I) + I->dropAllReferences(); - // Since the table is empty, we can now delete it... - delete GVRefMap; - } + for(Module::global_iterator I = global_begin(), E = global_end(); I != E; ++I) + I->dropAllReferences(); } -// Accessor for the underlying GlobalValRefMap... -ConstantPointerRef *Module::getConstantPointerRef(GlobalValue *V){ - // Create ref map lazily on demand... - if (GVRefMap == 0) GVRefMap = new GlobalValueRefMap(); - - GlobalValueRefMap::iterator I = GVRefMap->find(V); - if (I != GVRefMap->end()) return I->second; - - ConstantPointerRef *Ref = new ConstantPointerRef(V); - GVRefMap->insert(std::make_pair(V, Ref)); - - return Ref; +void Module::addLibrary(const std::string& Lib) { + for (Module::lib_iterator I = lib_begin(), E = lib_end(); I != E; ++I) + if (*I == Lib) + return; + LibraryList.push_back(Lib); } -void Module::mutateConstantPointerRef(GlobalValue *OldGV, GlobalValue *NewGV) { - GlobalValueRefMap::iterator I = GVRefMap->find(OldGV); - assert(I != GVRefMap->end() && - "mutateConstantPointerRef; OldGV not in table!"); - ConstantPointerRef *Ref = I->second; - - // Remove the old entry... - GVRefMap->erase(I); - - // Insert the new entry... - GVRefMap->insert(std::make_pair(NewGV, Ref)); +void Module::removeLibrary(const std::string& Lib) { + LibraryListType::iterator I = LibraryList.begin(); + LibraryListType::iterator E = LibraryList.end(); + for (;I != E; ++I) + if (*I == Lib) { + LibraryList.erase(I); + return; + } } +