1 //===-- Module.cpp - Implement the Module class ---------------------------===//
3 // The LLVM Compiler Infrastructure
5 // This file was developed by the LLVM research group and is distributed under
6 // the University of Illinois Open Source License. See LICENSE.TXT for details.
8 //===----------------------------------------------------------------------===//
10 // This file implements the Module class for the VMCore library.
12 //===----------------------------------------------------------------------===//
14 #include "llvm/Module.h"
15 #include "llvm/InstrTypes.h"
16 #include "llvm/Constants.h"
17 #include "llvm/DerivedTypes.h"
18 #include "llvm/ADT/STLExtras.h"
19 #include "llvm/Support/LeakDetector.h"
20 #include "SymbolTableListTraitsImpl.h"
27 //===----------------------------------------------------------------------===//
28 // Methods to implement the globals and functions lists.
31 Function *ilist_traits<Function>::createNode() {
33 FunctionType::get(Type::VoidTy, std::vector<const Type*>(), false);
34 Function *Ret = new Function(FTy, GlobalValue::ExternalLinkage);
35 // This should not be garbage monitored.
36 LeakDetector::removeGarbageObject(Ret);
39 GlobalVariable *ilist_traits<GlobalVariable>::createNode() {
40 GlobalVariable *Ret = new GlobalVariable(Type::IntTy, false,
41 GlobalValue::ExternalLinkage);
42 // This should not be garbage monitored.
43 LeakDetector::removeGarbageObject(Ret);
47 iplist<Function> &ilist_traits<Function>::getList(Module *M) {
48 return M->getFunctionList();
50 iplist<GlobalVariable> &ilist_traits<GlobalVariable>::getList(Module *M) {
51 return M->getGlobalList();
54 // Explicit instantiations of SymbolTableListTraits since some of the methods
55 // are not in the public header file...
56 template class SymbolTableListTraits<GlobalVariable, Module, Module>;
57 template class SymbolTableListTraits<Function, Module, Module>;
59 //===----------------------------------------------------------------------===//
60 // Primitive Module methods.
63 Module::Module(const std::string &MID)
64 : ModuleID(MID), Endian(AnyEndianness), PtrSize(AnyPointerSize) {
65 FunctionList.setItemParent(this);
66 FunctionList.setParent(this);
67 GlobalList.setItemParent(this);
68 GlobalList.setParent(this);
69 SymTab = new SymbolTable();
75 GlobalList.setParent(0);
77 FunctionList.setParent(0);
82 // Module::dump() - Allow printing from debugger
83 void Module::dump() const {
87 //===----------------------------------------------------------------------===//
88 // Methods for easy access to the functions in the module.
91 // getOrInsertFunction - Look up the specified function in the module symbol
92 // table. If it does not exist, add a prototype for the function and return
93 // it. This is nice because it allows most passes to get away with not handling
94 // the symbol table directly for this common task.
96 Function *Module::getOrInsertFunction(const std::string &Name,
97 const FunctionType *Ty) {
98 SymbolTable &SymTab = getSymbolTable();
100 // See if we have a definitions for the specified function already...
101 if (Value *V = SymTab.lookup(PointerType::get(Ty), Name)) {
102 return cast<Function>(V); // Yup, got it
103 } else { // Nope, add one
104 Function *New = new Function(Ty, GlobalVariable::ExternalLinkage, Name);
105 FunctionList.push_back(New);
106 return New; // Return the new prototype...
110 // getOrInsertFunction - Look up the specified function in the module symbol
111 // table. If it does not exist, add a prototype for the function and return it.
112 // This version of the method takes a null terminated list of function
113 // arguments, which makes it easier for clients to use.
115 Function *Module::getOrInsertFunction(const std::string &Name,
116 const Type *RetTy, ...) {
118 va_start(Args, RetTy);
120 // Build the list of argument types...
121 std::vector<const Type*> ArgTys;
122 while (const Type *ArgTy = va_arg(Args, const Type*))
123 ArgTys.push_back(ArgTy);
127 // Build the function type and chain to the other getOrInsertFunction...
128 return getOrInsertFunction(Name, FunctionType::get(RetTy, ArgTys, false));
132 // getFunction - Look up the specified function in the module symbol table.
133 // If it does not exist, return null.
135 Function *Module::getFunction(const std::string &Name, const FunctionType *Ty) {
136 SymbolTable &SymTab = getSymbolTable();
137 return cast_or_null<Function>(SymTab.lookup(PointerType::get(Ty), Name));
141 /// getMainFunction - This function looks up main efficiently. This is such a
142 /// common case, that it is a method in Module. If main cannot be found, a
143 /// null pointer is returned.
145 Function *Module::getMainFunction() {
146 std::vector<const Type*> Params;
149 if (Function *F = getFunction("main", FunctionType::get(Type::IntTy,
153 // void main(void)...
154 if (Function *F = getFunction("main", FunctionType::get(Type::VoidTy,
158 Params.push_back(Type::IntTy);
160 // int main(int argc)...
161 if (Function *F = getFunction("main", FunctionType::get(Type::IntTy,
165 // void main(int argc)...
166 if (Function *F = getFunction("main", FunctionType::get(Type::VoidTy,
170 for (unsigned i = 0; i != 2; ++i) { // Check argv and envp
171 Params.push_back(PointerType::get(PointerType::get(Type::SByteTy)));
173 // int main(int argc, char **argv)...
174 if (Function *F = getFunction("main", FunctionType::get(Type::IntTy,
178 // void main(int argc, char **argv)...
179 if (Function *F = getFunction("main", FunctionType::get(Type::VoidTy,
184 // Ok, try to find main the hard way...
185 return getNamedFunction("main");
188 /// getNamedFunction - Return the first function in the module with the
189 /// specified name, of arbitrary type. This method returns null if a function
190 /// with the specified name is not found.
192 Function *Module::getNamedFunction(const std::string &Name) {
193 // Loop over all of the functions, looking for the function desired
195 for (iterator I = begin(), E = end(); I != E; ++I)
196 if (I->getName() == Name)
201 return Found; // Non-external function not found...
204 //===----------------------------------------------------------------------===//
205 // Methods for easy access to the global variables in the module.
208 /// getGlobalVariable - Look up the specified global variable in the module
209 /// symbol table. If it does not exist, return null. Note that this only
210 /// returns a global variable if it does not have internal linkage. The type
211 /// argument should be the underlying type of the global, ie, it should not
212 /// have the top-level PointerType, which represents the address of the
215 GlobalVariable *Module::getGlobalVariable(const std::string &Name,
217 if (Value *V = getSymbolTable().lookup(PointerType::get(Ty), Name)) {
218 GlobalVariable *Result = cast<GlobalVariable>(V);
219 if (!Result->hasInternalLinkage())
227 //===----------------------------------------------------------------------===//
228 // Methods for easy access to the types in the module.
232 // addTypeName - Insert an entry in the symbol table mapping Str to Type. If
233 // there is already an entry for this name, true is returned and the symbol
234 // table is not modified.
236 bool Module::addTypeName(const std::string &Name, const Type *Ty) {
237 SymbolTable &ST = getSymbolTable();
239 if (ST.lookupType(Name)) return true; // Already in symtab...
241 // Not in symbol table? Set the name with the Symtab as an argument so the
242 // type knows what to update...
248 /// getTypeByName - Return the type with the specified name in this module, or
249 /// null if there is none by that name.
250 const Type *Module::getTypeByName(const std::string &Name) const {
251 const SymbolTable &ST = getSymbolTable();
252 return cast_or_null<Type>(ST.lookupType(Name));
255 // getTypeName - If there is at least one entry in the symbol table for the
256 // specified type, return it.
258 std::string Module::getTypeName(const Type *Ty) const {
259 const SymbolTable &ST = getSymbolTable();
261 SymbolTable::type_const_iterator TI = ST.type_begin();
262 SymbolTable::type_const_iterator TE = ST.type_end();
263 if ( TI == TE ) return ""; // No names for types
265 while (TI != TE && TI->second != Ty)
268 if (TI != TE) // Must have found an entry!
270 return ""; // Must not have found anything...
273 //===----------------------------------------------------------------------===//
274 // Other module related stuff.
278 // dropAllReferences() - This function causes all the subelementss to "let go"
279 // of all references that they are maintaining. This allows one to 'delete' a
280 // whole module at a time, even though there may be circular references... first
281 // all references are dropped, and all use counts go to zero. Then everything
282 // is deleted for real. Note that no operations are valid on an object that
283 // has "dropped all references", except operator delete.
285 void Module::dropAllReferences() {
286 for(Module::iterator I = begin(), E = end(); I != E; ++I)
287 I->dropAllReferences();
289 for(Module::giterator I = gbegin(), E = gend(); I != E; ++I)
290 I->dropAllReferences();