1 //===-- Module.cpp - Implement the Module class ------------------*- C++ -*--=//
3 // This file implements the Module class for the VMCore library.
5 //===----------------------------------------------------------------------===//
7 #include "llvm/Module.h"
8 #include "llvm/Function.h"
9 #include "llvm/GlobalVariable.h"
10 #include "llvm/InstrTypes.h"
11 #include "llvm/Constants.h"
12 #include "llvm/DerivedTypes.h"
13 #include "Support/STLExtras.h"
14 #include "ValueHolderImpl.h"
17 // Instantiate Templates - This ugliness is the price we have to pay
18 // for having a DefHolderImpl.h file seperate from DefHolder.h! :(
20 template class ValueHolder<GlobalVariable, Module, Module>;
21 template class ValueHolder<Function, Module, Module>;
23 // Define the GlobalValueRefMap as a struct that wraps a map so that we don't
24 // have Module.h depend on <map>
26 struct GlobalValueRefMap : public std::map<GlobalValue*, ConstantPointerRef*>{
30 Module::Module() : GlobalList(this, this), FunctionList(this, this) {
37 GlobalList.delete_all();
38 GlobalList.setParent(0);
39 FunctionList.delete_all();
40 FunctionList.setParent(0);
44 SymbolTable *Module::getSymbolTableSure() {
45 if (!SymTab) SymTab = new SymbolTable(0);
49 // hasSymbolTable() - Returns true if there is a symbol table allocated to
50 // this object AND if there is at least one name in it!
52 bool Module::hasSymbolTable() const {
53 if (!SymTab) return false;
55 for (SymbolTable::const_iterator I = SymTab->begin(), E = SymTab->end();
57 if (I->second.begin() != I->second.end())
58 return true; // Found nonempty type plane!
64 // getOrInsertFunction - Look up the specified function in the module symbol
65 // table. If it does not exist, add a prototype for the function and return
66 // it. This is nice because it allows most passes to get away with not handling
67 // the symbol table directly for this common task.
69 Function *Module::getOrInsertFunction(const std::string &Name,
70 const FunctionType *Ty) {
71 SymbolTable *SymTab = getSymbolTableSure();
73 // See if we have a definitions for the specified function already...
74 if (Value *V = SymTab->lookup(PointerType::get(Ty), Name)) {
75 return cast<Function>(V); // Yup, got it
76 } else { // Nope, add one
77 Function *New = new Function(Ty, false, Name);
78 FunctionList.push_back(New);
79 return New; // Return the new prototype...
83 // getFunction - Look up the specified function in the module symbol table.
84 // If it does not exist, return null.
86 Function *Module::getFunction(const std::string &Name, const FunctionType *Ty) {
87 SymbolTable *SymTab = getSymbolTable();
88 if (SymTab == 0) return 0; // No symtab, no symbols...
90 return cast_or_null<Function>(SymTab->lookup(PointerType::get(Ty), Name));
93 // addTypeName - Insert an entry in the symbol table mapping Str to Type. If
94 // there is already an entry for this name, true is returned and the symbol
95 // table is not modified.
97 bool Module::addTypeName(const std::string &Name, const Type *Ty) {
98 SymbolTable *ST = getSymbolTableSure();
100 if (ST->lookup(Type::TypeTy, Name)) return true; // Already in symtab...
102 // Not in symbol table? Set the name with the Symtab as an argument so the
103 // type knows what to update...
104 ((Value*)Ty)->setName(Name, ST);
109 // getTypeName - If there is at least one entry in the symbol table for the
110 // specified type, return it.
112 std::string Module::getTypeName(const Type *Ty) {
113 const SymbolTable *ST = getSymbolTable();
114 if (ST == 0) return ""; // No symbol table, must not have an entry...
115 if (ST->find(Type::TypeTy) == ST->end())
116 return ""; // No names for types...
118 SymbolTable::type_const_iterator TI = ST->type_begin(Type::TypeTy);
119 SymbolTable::type_const_iterator TE = ST->type_end(Type::TypeTy);
121 while (TI != TE && TI->second != (const Value*)Ty)
124 if (TI != TE) // Must have found an entry!
126 return ""; // Must not have found anything...
130 // dropAllReferences() - This function causes all the subinstructions to "let
131 // go" of all references that they are maintaining. This allows one to
132 // 'delete' a whole class at a time, even though there may be circular
133 // references... first all references are dropped, and all use counts go to
134 // zero. Then everything is delete'd for real. Note that no operations are
135 // valid on an object that has "dropped all references", except operator
138 void Module::dropAllReferences() {
139 for_each(FunctionList.begin(), FunctionList.end(),
140 std::mem_fun(&Function::dropAllReferences));
142 for_each(GlobalList.begin(), GlobalList.end(),
143 std::mem_fun(&GlobalVariable::dropAllReferences));
145 // If there are any GlobalVariable references still out there, nuke them now.
146 // Since all references are hereby dropped, nothing could possibly reference
149 for (GlobalValueRefMap::iterator I = GVRefMap->begin(), E = GVRefMap->end();
151 // Delete the ConstantPointerRef node...
152 I->second->destroyConstant();
155 // Since the table is empty, we can now delete it...
160 // Accessor for the underlying GlobalValRefMap...
161 ConstantPointerRef *Module::getConstantPointerRef(GlobalValue *V){
162 // Create ref map lazily on demand...
163 if (GVRefMap == 0) GVRefMap = new GlobalValueRefMap();
165 GlobalValueRefMap::iterator I = GVRefMap->find(V);
166 if (I != GVRefMap->end()) return I->second;
168 ConstantPointerRef *Ref = new ConstantPointerRef(V);
169 GVRefMap->insert(std::make_pair(V, Ref));
174 void Module::mutateConstantPointerRef(GlobalValue *OldGV, GlobalValue *NewGV) {
175 GlobalValueRefMap::iterator I = GVRefMap->find(OldGV);
176 assert(I != GVRefMap->end() &&
177 "mutateConstantPointerRef; OldGV not in table!");
178 ConstantPointerRef *Ref = I->second;
180 // Remove the old entry...
183 // Insert the new entry...
184 GVRefMap->insert(std::make_pair(NewGV, Ref));