2003-10-13 03:32:08 +00:00
|
|
|
//===-- Module.cpp - Implement the Module class ---------------------------===//
|
2005-04-21 23:48:37 +00:00
|
|
|
//
|
2003-10-20 19:43:21 +00:00
|
|
|
// 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.
|
2005-04-21 23:48:37 +00:00
|
|
|
//
|
2003-10-20 19:43:21 +00:00
|
|
|
//===----------------------------------------------------------------------===//
|
2001-06-06 20:29:01 +00:00
|
|
|
//
|
|
|
|
// This file implements the Module class for the VMCore library.
|
|
|
|
//
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
|
|
|
#include "llvm/Module.h"
|
2001-06-30 04:35:40 +00:00
|
|
|
#include "llvm/InstrTypes.h"
|
2002-04-28 19:55:58 +00:00
|
|
|
#include "llvm/Constants.h"
|
2002-03-29 03:44:18 +00:00
|
|
|
#include "llvm/DerivedTypes.h"
|
2004-09-01 22:55:40 +00:00
|
|
|
#include "llvm/ADT/STLExtras.h"
|
2006-05-18 02:10:31 +00:00
|
|
|
#include "llvm/ADT/StringExtras.h"
|
2004-09-01 22:55:40 +00:00
|
|
|
#include "llvm/Support/LeakDetector.h"
|
2002-06-25 16:13:24 +00:00
|
|
|
#include "SymbolTableListTraitsImpl.h"
|
2007-01-06 07:24:44 +00:00
|
|
|
#include "llvm/TypeSymbolTable.h"
|
2002-06-25 16:13:24 +00:00
|
|
|
#include <algorithm>
|
2003-08-31 00:19:28 +00:00
|
|
|
#include <cstdarg>
|
2006-05-18 02:10:31 +00:00
|
|
|
#include <cstdlib>
|
2001-10-13 06:58:40 +00:00
|
|
|
#include <map>
|
2003-11-21 20:23:48 +00:00
|
|
|
using namespace llvm;
|
2003-11-11 22:41:34 +00:00
|
|
|
|
2003-12-31 08:43:01 +00:00
|
|
|
//===----------------------------------------------------------------------===//
|
2004-04-21 18:27:56 +00:00
|
|
|
// Methods to implement the globals and functions lists.
|
2003-12-31 08:43:01 +00:00
|
|
|
//
|
|
|
|
|
2005-01-30 00:09:23 +00:00
|
|
|
Function *ilist_traits<Function>::createSentinel() {
|
2002-09-08 18:59:35 +00:00
|
|
|
FunctionType *FTy =
|
2006-12-31 05:26:44 +00:00
|
|
|
FunctionType::get(Type::VoidTy, std::vector<const Type*>(), false,
|
|
|
|
std::vector<FunctionType::ParameterAttributes>() );
|
2003-04-16 20:28:45 +00:00
|
|
|
Function *Ret = new Function(FTy, GlobalValue::ExternalLinkage);
|
2002-09-08 18:59:35 +00:00
|
|
|
// This should not be garbage monitored.
|
|
|
|
LeakDetector::removeGarbageObject(Ret);
|
|
|
|
return Ret;
|
2002-06-25 16:13:24 +00:00
|
|
|
}
|
2005-01-30 00:09:23 +00:00
|
|
|
GlobalVariable *ilist_traits<GlobalVariable>::createSentinel() {
|
2006-12-31 05:26:44 +00:00
|
|
|
GlobalVariable *Ret = new GlobalVariable(Type::Int32Ty, false,
|
2003-04-16 20:28:45 +00:00
|
|
|
GlobalValue::ExternalLinkage);
|
2002-09-08 18:59:35 +00:00
|
|
|
// This should not be garbage monitored.
|
|
|
|
LeakDetector::removeGarbageObject(Ret);
|
|
|
|
return Ret;
|
2002-06-25 16:13:24 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
iplist<Function> &ilist_traits<Function>::getList(Module *M) {
|
|
|
|
return M->getFunctionList();
|
|
|
|
}
|
|
|
|
iplist<GlobalVariable> &ilist_traits<GlobalVariable>::getList(Module *M) {
|
|
|
|
return M->getGlobalList();
|
|
|
|
}
|
|
|
|
|
|
|
|
// Explicit instantiations of SymbolTableListTraits since some of the methods
|
2006-01-24 04:13:11 +00:00
|
|
|
// are not in the public header file.
|
2003-11-05 05:15:42 +00:00
|
|
|
template class SymbolTableListTraits<GlobalVariable, Module, Module>;
|
|
|
|
template class SymbolTableListTraits<Function, Module, Module>;
|
2001-06-06 20:29:01 +00:00
|
|
|
|
2003-12-31 08:43:01 +00:00
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
// Primitive Module methods.
|
|
|
|
//
|
2001-10-13 06:58:40 +00:00
|
|
|
|
2003-04-22 18:02:04 +00:00
|
|
|
Module::Module(const std::string &MID)
|
2006-05-18 02:10:31 +00:00
|
|
|
: ModuleID(MID), DataLayout("") {
|
2002-06-25 16:13:24 +00:00
|
|
|
FunctionList.setItemParent(this);
|
|
|
|
FunctionList.setParent(this);
|
|
|
|
GlobalList.setItemParent(this);
|
|
|
|
GlobalList.setParent(this);
|
2007-02-05 20:47:22 +00:00
|
|
|
ValSymTab = new ValueSymbolTable();
|
2007-01-06 07:24:44 +00:00
|
|
|
TypeSymTab = new TypeSymbolTable();
|
2001-06-06 20:29:01 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
Module::~Module() {
|
|
|
|
dropAllReferences();
|
2002-06-25 16:13:24 +00:00
|
|
|
GlobalList.clear();
|
2001-09-10 07:58:01 +00:00
|
|
|
GlobalList.setParent(0);
|
2002-06-25 16:13:24 +00:00
|
|
|
FunctionList.clear();
|
2002-03-26 18:01:55 +00:00
|
|
|
FunctionList.setParent(0);
|
2004-07-25 18:08:57 +00:00
|
|
|
LibraryList.clear();
|
2007-01-06 07:24:44 +00:00
|
|
|
delete ValSymTab;
|
|
|
|
delete TypeSymTab;
|
2001-06-06 20:29:01 +00:00
|
|
|
}
|
|
|
|
|
2002-08-17 23:32:47 +00:00
|
|
|
// Module::dump() - Allow printing from debugger
|
|
|
|
void Module::dump() const {
|
2006-12-07 20:04:42 +00:00
|
|
|
print(*cerr.stream());
|
2002-08-17 23:32:47 +00:00
|
|
|
}
|
|
|
|
|
2006-05-18 02:10:31 +00:00
|
|
|
/// Target endian information...
|
|
|
|
Module::Endianness Module::getEndianness() const {
|
|
|
|
std::string temp = DataLayout;
|
2006-05-18 05:46:08 +00:00
|
|
|
Module::Endianness ret = AnyEndianness;
|
2006-05-18 02:10:31 +00:00
|
|
|
|
2006-05-18 05:46:08 +00:00
|
|
|
while (!temp.empty()) {
|
2006-05-18 02:10:31 +00:00
|
|
|
std::string token = getToken(temp, "-");
|
|
|
|
|
|
|
|
if (token[0] == 'e') {
|
2006-05-18 05:46:08 +00:00
|
|
|
ret = LittleEndian;
|
2006-05-18 02:10:31 +00:00
|
|
|
} else if (token[0] == 'E') {
|
2006-05-18 05:46:08 +00:00
|
|
|
ret = BigEndian;
|
2006-05-18 02:10:31 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2006-05-18 05:46:08 +00:00
|
|
|
return ret;
|
2006-05-18 02:10:31 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
/// Target Pointer Size information...
|
|
|
|
Module::PointerSize Module::getPointerSize() const {
|
|
|
|
std::string temp = DataLayout;
|
2006-05-18 05:46:08 +00:00
|
|
|
Module::PointerSize ret = AnyPointerSize;
|
2006-05-18 02:10:31 +00:00
|
|
|
|
2006-05-18 05:46:08 +00:00
|
|
|
while (!temp.empty()) {
|
2006-05-18 02:10:31 +00:00
|
|
|
std::string token = getToken(temp, "-");
|
|
|
|
char signal = getToken(token, ":")[0];
|
|
|
|
|
|
|
|
if (signal == 'p') {
|
|
|
|
int size = atoi(getToken(token, ":").c_str());
|
|
|
|
if (size == 32)
|
2006-05-18 05:46:08 +00:00
|
|
|
ret = Pointer32;
|
2006-05-18 02:10:31 +00:00
|
|
|
else if (size == 64)
|
2006-05-18 05:46:08 +00:00
|
|
|
ret = Pointer64;
|
2006-05-18 02:10:31 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2006-05-18 05:46:08 +00:00
|
|
|
return ret;
|
2006-05-18 02:10:31 +00:00
|
|
|
}
|
|
|
|
|
2003-12-31 08:43:01 +00:00
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
// Methods for easy access to the functions in the module.
|
|
|
|
//
|
|
|
|
|
2007-02-05 20:47:22 +00:00
|
|
|
// 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.
|
|
|
|
//
|
2007-01-07 08:09:25 +00:00
|
|
|
Constant *Module::getOrInsertFunction(const std::string &Name,
|
2002-03-29 03:44:18 +00:00
|
|
|
const FunctionType *Ty) {
|
2007-02-05 20:47:22 +00:00
|
|
|
ValueSymbolTable &SymTab = getValueSymbolTable();
|
2002-03-29 03:44:18 +00:00
|
|
|
|
2007-02-05 20:47:22 +00:00
|
|
|
// See if we have a definition for the specified function already.
|
2007-02-05 21:19:13 +00:00
|
|
|
GlobalValue *F = dyn_cast_or_null<GlobalValue>(SymTab.lookup(Name));
|
2007-01-07 08:09:25 +00:00
|
|
|
if (F == 0) {
|
2007-02-05 20:47:22 +00:00
|
|
|
// Nope, add it
|
2003-04-16 20:28:45 +00:00
|
|
|
Function *New = new Function(Ty, GlobalVariable::ExternalLinkage, Name);
|
2002-03-29 03:44:18 +00:00
|
|
|
FunctionList.push_back(New);
|
2007-01-07 08:09:25 +00:00
|
|
|
return New; // Return the new prototype.
|
|
|
|
}
|
|
|
|
|
|
|
|
// Okay, the function exists. Does it have externally visible linkage?
|
|
|
|
if (F->hasInternalLinkage()) {
|
|
|
|
// Rename the function.
|
2007-02-05 20:47:22 +00:00
|
|
|
F->setName(SymTab.getUniqueName(F->getName()));
|
2007-01-07 08:09:25 +00:00
|
|
|
// Retry, now there won't be a conflict.
|
|
|
|
return getOrInsertFunction(Name, Ty);
|
2002-03-29 03:44:18 +00:00
|
|
|
}
|
2007-01-07 08:09:25 +00:00
|
|
|
|
|
|
|
// If the function exists but has the wrong type, return a bitcast to the
|
|
|
|
// right type.
|
2007-02-05 21:19:13 +00:00
|
|
|
if (F->getType() != PointerType::get(Ty))
|
2007-01-07 08:09:25 +00:00
|
|
|
return ConstantExpr::getBitCast(F, PointerType::get(Ty));
|
|
|
|
|
|
|
|
// Otherwise, we just found the existing function or a prototype.
|
|
|
|
return F;
|
2002-03-29 03:44:18 +00:00
|
|
|
}
|
|
|
|
|
2003-08-31 00:19:28 +00:00
|
|
|
// 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.
|
|
|
|
//
|
2007-01-07 08:09:25 +00:00
|
|
|
Constant *Module::getOrInsertFunction(const std::string &Name,
|
2003-08-31 00:19:28 +00:00
|
|
|
const Type *RetTy, ...) {
|
|
|
|
va_list Args;
|
|
|
|
va_start(Args, RetTy);
|
|
|
|
|
|
|
|
// Build the list of argument types...
|
|
|
|
std::vector<const Type*> 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));
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2002-03-29 03:44:18 +00:00
|
|
|
// getFunction - Look up the specified function in the module symbol table.
|
|
|
|
// If it does not exist, return null.
|
|
|
|
//
|
2007-02-05 20:47:22 +00:00
|
|
|
Function *Module::getFunction(const std::string &Name) const {
|
|
|
|
const ValueSymbolTable &SymTab = getValueSymbolTable();
|
|
|
|
return dyn_cast_or_null<Function>(SymTab.lookup(Name));
|
2002-11-08 20:34:02 +00:00
|
|
|
}
|
|
|
|
|
2003-12-31 08:43:01 +00:00
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
// Methods for easy access to the global variables in the module.
|
|
|
|
//
|
|
|
|
|
|
|
|
/// getGlobalVariable - Look up the specified global variable in the module
|
2005-12-05 05:30:21 +00:00
|
|
|
/// 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.
|
2003-12-31 08:43:01 +00:00
|
|
|
///
|
2005-04-21 23:48:37 +00:00
|
|
|
GlobalVariable *Module::getGlobalVariable(const std::string &Name,
|
2007-02-05 20:47:22 +00:00
|
|
|
bool AllowInternal) const {
|
|
|
|
if (Value *V = ValSymTab->lookup(Name)) {
|
|
|
|
GlobalVariable *Result = dyn_cast<GlobalVariable>(V);
|
|
|
|
if (Result && (AllowInternal || !Result->hasInternalLinkage()))
|
2003-12-31 08:43:01 +00:00
|
|
|
return Result;
|
|
|
|
}
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
// Methods for easy access to the types in the module.
|
|
|
|
//
|
|
|
|
|
2002-11-08 20:34:02 +00:00
|
|
|
|
2003-12-31 07:09:33 +00:00
|
|
|
// 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) {
|
2007-01-06 07:24:44 +00:00
|
|
|
TypeSymbolTable &ST = getTypeSymbolTable();
|
2003-12-31 07:09:33 +00:00
|
|
|
|
2007-01-06 07:24:44 +00:00
|
|
|
if (ST.lookup(Name)) return true; // Already in symtab...
|
2005-04-21 23:48:37 +00:00
|
|
|
|
2003-12-31 07:09:33 +00:00
|
|
|
// Not in symbol table? Set the name with the Symtab as an argument so the
|
|
|
|
// type knows what to update...
|
2004-07-10 16:37:42 +00:00
|
|
|
ST.insert(Name, Ty);
|
2003-12-31 07:09:33 +00:00
|
|
|
|
|
|
|
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 {
|
2007-01-06 07:24:44 +00:00
|
|
|
const TypeSymbolTable &ST = getTypeSymbolTable();
|
|
|
|
return cast_or_null<Type>(ST.lookup(Name));
|
2003-12-31 07:09:33 +00:00
|
|
|
}
|
2002-11-08 20:34:02 +00:00
|
|
|
|
2002-04-13 18:58:33 +00:00
|
|
|
// getTypeName - If there is at least one entry in the symbol table for the
|
|
|
|
// specified type, return it.
|
|
|
|
//
|
2003-12-31 07:09:33 +00:00
|
|
|
std::string Module::getTypeName(const Type *Ty) const {
|
2007-01-06 07:24:44 +00:00
|
|
|
const TypeSymbolTable &ST = getTypeSymbolTable();
|
2002-04-13 18:58:33 +00:00
|
|
|
|
2007-01-06 07:24:44 +00:00
|
|
|
TypeSymbolTable::const_iterator TI = ST.begin();
|
|
|
|
TypeSymbolTable::const_iterator TE = ST.end();
|
2004-05-25 08:52:20 +00:00
|
|
|
if ( TI == TE ) return ""; // No names for types
|
2002-04-13 18:58:33 +00:00
|
|
|
|
2004-05-25 08:52:20 +00:00
|
|
|
while (TI != TE && TI->second != Ty)
|
2002-04-13 18:58:33 +00:00
|
|
|
++TI;
|
|
|
|
|
|
|
|
if (TI != TE) // Must have found an entry!
|
|
|
|
return TI->first;
|
|
|
|
return ""; // Must not have found anything...
|
|
|
|
}
|
|
|
|
|
2003-12-31 08:43:01 +00:00
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
// Other module related stuff.
|
|
|
|
//
|
|
|
|
|
|
|
|
|
2002-08-17 23:32:47 +00:00
|
|
|
// 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
|
2003-10-10 17:54:14 +00:00
|
|
|
// is deleted for real. Note that no operations are valid on an object that
|
2002-08-17 23:32:47 +00:00
|
|
|
// has "dropped all references", except operator delete.
|
2001-06-06 20:29:01 +00:00
|
|
|
//
|
|
|
|
void Module::dropAllReferences() {
|
2002-06-25 16:13:24 +00:00
|
|
|
for(Module::iterator I = begin(), E = end(); I != E; ++I)
|
|
|
|
I->dropAllReferences();
|
2001-10-13 06:58:40 +00:00
|
|
|
|
2005-03-15 04:54:21 +00:00
|
|
|
for(Module::global_iterator I = global_begin(), E = global_end(); I != E; ++I)
|
2002-06-25 16:13:24 +00:00
|
|
|
I->dropAllReferences();
|
2001-06-06 20:29:01 +00:00
|
|
|
}
|
2001-06-30 04:35:40 +00:00
|
|
|
|
2007-02-04 00:40:42 +00:00
|
|
|
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::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;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|