//===-- 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/InstrTypes.h"
#include "llvm/Constants.h"
#include "llvm/DerivedTypes.h"
-#include "Support/STLExtras.h"
-#include "Support/LeakDetector.h"
+#include "llvm/ADT/STLExtras.h"
+#include "llvm/Support/LeakDetector.h"
#include "SymbolTableListTraitsImpl.h"
#include <algorithm>
#include <cstdarg>
+#include <iostream>
#include <map>
using namespace llvm;
-Function *ilist_traits<Function>::createNode() {
+//===----------------------------------------------------------------------===//
+// Methods to implement the globals and functions lists.
+//
+
+Function *ilist_traits<Function>::createSentinel() {
FunctionType *FTy =
FunctionType::get(Type::VoidTy, std::vector<const Type*>(), false);
Function *Ret = new Function(FTy, GlobalValue::ExternalLinkage);
LeakDetector::removeGarbageObject(Ret);
return Ret;
}
-GlobalVariable *ilist_traits<GlobalVariable>::createNode() {
+GlobalVariable *ilist_traits<GlobalVariable>::createSentinel() {
GlobalVariable *Ret = new GlobalVariable(Type::IntTy, false,
GlobalValue::ExternalLinkage);
// This should not be garbage monitored.
}
// Explicit instantiations of SymbolTableListTraits since some of the methods
-// are not in the public header file...
+// are not in the public header file.
template class SymbolTableListTraits<GlobalVariable, Module, Module>;
template class SymbolTableListTraits<Function, Module, Module>;
-// Define the GlobalValueRefMap as a struct that wraps a map so that we don't
-// have Module.h depend on <map>
+//===----------------------------------------------------------------------===//
+// Primitive Module methods.
//
-namespace llvm {
- struct GlobalValueRefMap {
- typedef std::map<GlobalValue*, ConstantPointerRef*> MapTy;
- typedef MapTy::iterator iterator;
- std::map<GlobalValue*, ConstantPointerRef*> Map;
- };
-}
-
Module::Module(const std::string &MID)
: ModuleID(MID), Endian(AnyEndianness), PtrSize(AnyPointerSize) {
FunctionList.setParent(this);
GlobalList.setItemParent(this);
GlobalList.setParent(this);
- GVRefMap = 0;
SymTab = new SymbolTable();
}
GlobalList.setParent(0);
FunctionList.clear();
FunctionList.setParent(0);
+ LibraryList.clear();
delete SymTab;
}
print(std::cerr);
}
+//===----------------------------------------------------------------------===//
+// 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
}
-
// getFunction - Look up the specified function in the module symbol table.
// If it does not exist, return null.
//
if (Function *F = getFunction("main", FunctionType::get(Type::IntTy,
Params, false)))
return F;
-
+
// void main(int argc, char **argv)...
if (Function *F = getFunction("main", FunctionType::get(Type::VoidTy,
Params, false)))
return Found; // Non-external function not found...
}
+//===----------------------------------------------------------------------===//
+// Methods for easy access to the global variables in the module.
+//
+
+/// 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,
+ const Type *Ty, bool AllowInternal) {
+ if (Value *V = getSymbolTable().lookup(PointerType::get(Ty), Name)) {
+ GlobalVariable *Result = cast<GlobalVariable>(V);
+ if (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
bool Module::addTypeName(const std::string &Name, const Type *Ty) {
SymbolTable &ST = getSymbolTable();
- if (ST.lookup(Type::TypeTy, Name)) return true; // Already in symtab...
-
+ if (ST.lookupType(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;
}
/// null if there is none by that name.
const Type *Module::getTypeByName(const std::string &Name) const {
const SymbolTable &ST = getSymbolTable();
- return cast_or_null<Type>(ST.lookup(Type::TypeTy, Name));
+ return cast_or_null<Type>(ST.lookupType(Name));
}
// getTypeName - If there is at least one entry in the symbol table for the
//
std::string Module::getTypeName(const Type *Ty) const {
const SymbolTable &ST = getSymbolTable();
- if (ST.find(Type::TypeTy) == ST.end())
- return ""; // No names for types...
- SymbolTable::type_const_iterator TI = ST.type_begin(Type::TypeTy);
- SymbolTable::type_const_iterator TE = ST.type_end(Type::TypeTy);
+ SymbolTable::type_const_iterator TI = ST.type_begin();
+ SymbolTable::type_const_iterator TE = ST.type_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!
return ""; // Must not have found anything...
}
+//===----------------------------------------------------------------------===//
+// Other module related stuff.
+//
+
// dropAllReferences() - This function causes all the subelementss to "let go"
// of all references that they are maintaining. This allows one to 'delete' a
for(Module::iterator I = begin(), E = end(); I != E; ++I)
I->dropAllReferences();
- for(Module::giterator I = gbegin(), E = gend(); I != E; ++I)
+ for(Module::global_iterator I = global_begin(), E = global_end(); I != E; ++I)
I->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. Note that destroying all of the constant pointer refs will
- // eventually cause the GVRefMap field to be set to null (by
- // destroyConstantPointerRef, below).
- //
- while (GVRefMap)
- // Delete the ConstantPointerRef node...
- GVRefMap->Map.begin()->second->destroyConstant();
-}
-
-// 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->Map.find(V);
- if (I != GVRefMap->Map.end()) return I->second;
-
- ConstantPointerRef *Ref = new ConstantPointerRef(V);
- GVRefMap->Map[V] = Ref;
- return Ref;
-}
-
-void Module::destroyConstantPointerRef(ConstantPointerRef *CPR) {
- assert(GVRefMap && "No map allocated, but we have a CPR?");
- if (!GVRefMap->Map.erase(CPR->getValue())) // Remove it from the map...
- assert(0 && "ConstantPointerRef not found in module CPR map!");
-
- if (GVRefMap->Map.empty()) { // If the map is empty, delete it.
- delete GVRefMap;
- GVRefMap = 0;
- }
-}
-
-void Module::mutateConstantPointerRef(GlobalValue *OldGV, GlobalValue *NewGV) {
- assert(OldGV != NewGV && "Cannot mutate to the same global!");
- GlobalValueRefMap::iterator I = GVRefMap->Map.find(OldGV);
- assert(I != GVRefMap->Map.end() &&
- "mutateConstantPointerRef; OldGV not in table!");
- ConstantPointerRef *Ref = I->second;
-
- // Remove the old entry...
- GVRefMap->Map.erase(I);
-
- // Check to see if a CPR already exists for NewGV
- I = GVRefMap->Map.lower_bound(NewGV);
-
- if (I == GVRefMap->Map.end() || I->first != NewGV) {
- // Insert the new entry...
- GVRefMap->Map.insert(I, std::make_pair(NewGV, Ref));
- } else {
- // Otherwise, an entry already exists for the current global value.
- // Completely replace the old CPR with the existing one...
- Ref->replaceAllUsesWith(I->second);
- delete Ref;
- }
}