1
0
mirror of https://github.com/RPCS3/llvm-mirror.git synced 2024-11-24 11:42:57 +01:00
llvm-mirror/lib/VMCore/Function.cpp

262 lines
9.7 KiB
C++
Raw Normal View History

//===-- Function.cpp - Implement the Global object classes ----------------===//
//
// 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.
//
//===----------------------------------------------------------------------===//
2001-06-06 22:29:01 +02:00
//
// This file implements the Function & GlobalVariable classes for the VMCore
// library.
2001-06-06 22:29:01 +02:00
//
//===----------------------------------------------------------------------===//
#include "llvm/Module.h"
2004-07-12 03:17:34 +02:00
#include "llvm/Constant.h"
#include "llvm/DerivedTypes.h"
#include "llvm/Instructions.h"
#include "llvm/Intrinsics.h"
#include "llvm/Support/LeakDetector.h"
#include "SymbolTableListTraitsImpl.h"
using namespace llvm;
BasicBlock *ilist_traits<BasicBlock>::createNode() {
BasicBlock *Ret = new BasicBlock();
// This should not be garbage monitored.
LeakDetector::removeGarbageObject(Ret);
return Ret;
}
iplist<BasicBlock> &ilist_traits<BasicBlock>::getList(Function *F) {
return F->getBasicBlockList();
}
Argument *ilist_traits<Argument>::createNode() {
Argument *Ret = new Argument(Type::IntTy);
// This should not be garbage monitored.
LeakDetector::removeGarbageObject(Ret);
return Ret;
}
iplist<Argument> &ilist_traits<Argument>::getList(Function *F) {
return F->getArgumentList();
}
// Explicit instantiations of SymbolTableListTraits since some of the methods
// are not in the public header file...
2003-11-05 06:15:42 +01:00
template class SymbolTableListTraits<Argument, Function, Function>;
template class SymbolTableListTraits<BasicBlock, Function, Function>;
2001-06-06 22:29:01 +02:00
//===----------------------------------------------------------------------===//
// Argument Implementation
//===----------------------------------------------------------------------===//
Argument::Argument(const Type *Ty, const std::string &Name, Function *Par)
: Value(Ty, Value::ArgumentVal, Name) {
Parent = 0;
// Make sure that we get added to a function
LeakDetector::addGarbageObject(this);
if (Par)
Par->getArgumentList().push_back(this);
}
// Specialize setName to take care of symbol table majik
void Argument::setName(const std::string &name, SymbolTable *ST) {
Function *P;
assert((ST == 0 || (!getParent() || ST == &getParent()->getSymbolTable())) &&
"Invalid symtab argument!");
if ((P = getParent()) && hasName()) P->getSymbolTable().remove(this);
Value::setName(name);
if (P && hasName()) P->getSymbolTable().insert(this);
}
void Argument::setParent(Function *parent) {
if (getParent())
LeakDetector::addGarbageObject(this);
Parent = parent;
if (getParent())
LeakDetector::removeGarbageObject(this);
}
//===----------------------------------------------------------------------===//
// Function Implementation
//===----------------------------------------------------------------------===//
Function::Function(const FunctionType *Ty, LinkageTypes Linkage,
const std::string &name, Module *ParentModule)
: GlobalValue(PointerType::get(Ty), Value::FunctionVal, Linkage, name) {
BasicBlocks.setItemParent(this);
BasicBlocks.setParent(this);
ArgumentList.setItemParent(this);
ArgumentList.setParent(this);
SymTab = new SymbolTable();
assert((getReturnType()->isFirstClassType() ||getReturnType() == Type::VoidTy)
&& "LLVM functions cannot return aggregate values!");
// Create the arguments vector, all arguments start out unnamed.
for (unsigned i = 0, e = Ty->getNumParams(); i != e; ++i) {
assert(Ty->getParamType(i) != Type::VoidTy &&
"Cannot have void typed arguments!");
ArgumentList.push_back(new Argument(Ty->getParamType(i)));
}
// Make sure that we get added to a function
LeakDetector::addGarbageObject(this);
if (ParentModule)
ParentModule->getFunctionList().push_back(this);
2001-06-06 22:29:01 +02:00
}
Function::~Function() {
2001-06-06 22:29:01 +02:00
dropAllReferences(); // After this it is safe to delete instructions.
// Delete all of the method arguments and unlink from symbol table...
ArgumentList.clear();
2001-06-06 22:29:01 +02:00
ArgumentList.setParent(0);
delete SymTab;
2001-06-06 22:29:01 +02:00
}
// Specialize setName to take care of symbol table majik
void Function::setName(const std::string &name, SymbolTable *ST) {
2001-06-06 22:29:01 +02:00
Module *P;
assert((ST == 0 || (!getParent() || ST == &getParent()->getSymbolTable())) &&
"Invalid symtab argument!");
if ((P = getParent()) && hasName()) P->getSymbolTable().remove(this);
2001-06-06 22:29:01 +02:00
Value::setName(name);
if (P && hasName()) P->getSymbolTable().insert(this);
2001-06-06 22:29:01 +02:00
}
void Function::setParent(Module *parent) {
if (getParent())
LeakDetector::addGarbageObject(this);
2001-06-06 22:29:01 +02:00
Parent = parent;
if (getParent())
LeakDetector::removeGarbageObject(this);
2001-06-06 22:29:01 +02:00
}
2002-03-29 04:44:36 +01:00
const FunctionType *Function::getFunctionType() const {
return cast<FunctionType>(getType()->getElementType());
}
const Type *Function::getReturnType() const {
2002-03-29 04:44:36 +01:00
return getFunctionType()->getReturnType();
2001-06-06 22:29:01 +02:00
}
// 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
2003-10-10 19:54:14 +02:00
// zero. Then everything is deleted for real. Note that no operations are
2001-06-06 22:29:01 +02:00
// valid on an object that has "dropped all references", except operator
// delete.
//
void Function::dropAllReferences() {
for (iterator I = begin(), E = end(); I != E; ++I)
I->dropAllReferences();
BasicBlocks.clear(); // Delete all basic blocks...
2001-06-06 22:29:01 +02:00
}
/// getIntrinsicID - This method returns the ID number of the specified
/// function, or Intrinsic::not_intrinsic if the function is not an
2003-10-10 19:54:14 +02:00
/// intrinsic, or if the pointer is null. This value is always defined to be
/// zero to allow easy checking for whether a function is intrinsic or not. The
/// particular intrinsic functions which correspond to this value are defined in
/// llvm/Intrinsics.h.
///
unsigned Function::getIntrinsicID() const {
if (getName().size() < 5 || getName()[4] != '.' || getName()[0] != 'l' ||
getName()[1] != 'l' || getName()[2] != 'v' || getName()[3] != 'm')
return 0; // All intrinsics start with 'llvm.'
assert(getName().size() != 5 && "'llvm.' is an invalid intrinsic name!");
// a table of all Alpha intrinsic functions
struct {
std::string name; // The name of the intrinsic
unsigned id; // Its ID number
} alpha_intrinsics[] = {
{ "llvm.alpha.ctlz", Intrinsic::alpha_ctlz },
{ "llvm.alpha.cttz", Intrinsic::alpha_cttz },
{ "llvm.alpha.ctpop", Intrinsic::alpha_ctpop },
{ "llvm.alpha.umulh", Intrinsic::alpha_umulh },
{ "llvm.alpha.vecop", Intrinsic::alpha_vecop },
{ "llvm.alpha.pup", Intrinsic::alpha_pup },
{ "llvm.alpha.bytezap", Intrinsic::alpha_bytezap },
{ "llvm.alpha.bytemanip", Intrinsic::alpha_bytemanip },
{ "llvm.alpha.dfp_bop", Intrinsic::alpha_dfpbop },
{ "llvm.alpha.dfp_uop", Intrinsic::alpha_dfpuop },
{ "llvm.alpha.unordered", Intrinsic::alpha_unordered },
{ "llvm.alpha.uqtodfp", Intrinsic::alpha_uqtodfp },
{ "llvm.alpha.uqtosfp", Intrinsic::alpha_uqtosfp },
{ "llvm.alpha.dfptosq", Intrinsic::alpha_dfptosq },
{ "llvm.alpha.sfptosq", Intrinsic::alpha_sfptosq },
};
const unsigned num_alpha_intrinsics =
sizeof(alpha_intrinsics) / sizeof(*alpha_intrinsics);
switch (getName()[5]) {
case 'a':
if (getName().size() > 11 &&
std::string(getName().begin()+4, getName().begin()+11) == ".alpha.")
for (unsigned i = 0; i < num_alpha_intrinsics; ++i)
if (getName() == alpha_intrinsics[i].name)
return alpha_intrinsics[i].id;
break;
case 'd':
if (getName() == "llvm.dbg.stoppoint") return Intrinsic::dbg_stoppoint;
if (getName() == "llvm.dbg.region.start")return Intrinsic::dbg_region_start;
if (getName() == "llvm.dbg.region.end") return Intrinsic::dbg_region_end;
if (getName() == "llvm.dbg.func.start") return Intrinsic::dbg_func_start;
if (getName() == "llvm.dbg.declare") return Intrinsic::dbg_declare;
break;
case 'f':
if (getName() == "llvm.frameaddress") return Intrinsic::frameaddress;
break;
case 'g':
if (getName() == "llvm.gcwrite") return Intrinsic::gcwrite;
if (getName() == "llvm.gcread") return Intrinsic::gcread;
if (getName() == "llvm.gcroot") return Intrinsic::gcroot;
break;
case 'i':
if (getName() == "llvm.isunordered") return Intrinsic::isunordered;
break;
case 'l':
if (getName() == "llvm.longjmp") return Intrinsic::longjmp;
break;
case 'm':
if (getName() == "llvm.memcpy") return Intrinsic::memcpy;
if (getName() == "llvm.memmove") return Intrinsic::memmove;
if (getName() == "llvm.memset") return Intrinsic::memset;
break;
case 'r':
if (getName() == "llvm.returnaddress") return Intrinsic::returnaddress;
if (getName() == "llvm.readport") return Intrinsic::readport;
if (getName() == "llvm.readio") return Intrinsic::readio;
break;
case 's':
if (getName() == "llvm.setjmp") return Intrinsic::setjmp;
if (getName() == "llvm.sigsetjmp") return Intrinsic::sigsetjmp;
if (getName() == "llvm.siglongjmp") return Intrinsic::siglongjmp;
break;
case 'v':
if (getName() == "llvm.va_copy") return Intrinsic::vacopy;
if (getName() == "llvm.va_end") return Intrinsic::vaend;
if (getName() == "llvm.va_start") return Intrinsic::vastart;
case 'w':
if (getName() == "llvm.writeport") return Intrinsic::writeport;
if (getName() == "llvm.writeio") return Intrinsic::writeio;
break;
}
// The "llvm." namespace is reserved!
assert(0 && "Unknown LLVM intrinsic function!");
return 0;
}
// vim: sw=2 ai