mirror of
https://github.com/c64scene-ar/llvm-6502.git
synced 2024-12-16 11:30:51 +00:00
d50dc73b89
of their elements do not yield the same ParamAttrsList, though they should. On the other hand, everyone seems to pass such vectors with elements ordered by increasing index, so rather than sorting the elements simply assert that the elements are ordered in this way. git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@41845 91177308-0d34-0410-b5e6-96231b3b80d8
345 lines
11 KiB
C++
345 lines
11 KiB
C++
//===-- 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.
|
|
//
|
|
//===----------------------------------------------------------------------===//
|
|
//
|
|
// This file implements the Function class for the VMCore library.
|
|
//
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
#include "llvm/Module.h"
|
|
#include "llvm/DerivedTypes.h"
|
|
#include "llvm/ParameterAttributes.h"
|
|
#include "llvm/IntrinsicInst.h"
|
|
#include "llvm/CodeGen/ValueTypes.h"
|
|
#include "llvm/Support/LeakDetector.h"
|
|
#include "llvm/Support/ManagedStatic.h"
|
|
#include "SymbolTableListTraitsImpl.h"
|
|
#include "llvm/ADT/StringExtras.h"
|
|
using namespace llvm;
|
|
|
|
BasicBlock *ilist_traits<BasicBlock>::createSentinel() {
|
|
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>::createSentinel() {
|
|
Argument *Ret = new Argument(Type::Int32Ty);
|
|
// 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...
|
|
template class SymbolTableListTraits<Argument, Function>;
|
|
template class SymbolTableListTraits<BasicBlock, Function>;
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
// Argument Implementation
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
Argument::Argument(const Type *Ty, const std::string &Name, Function *Par)
|
|
: Value(Ty, Value::ArgumentVal) {
|
|
Parent = 0;
|
|
|
|
// Make sure that we get added to a function
|
|
LeakDetector::addGarbageObject(this);
|
|
|
|
if (Par)
|
|
Par->getArgumentList().push_back(this);
|
|
setName(Name);
|
|
}
|
|
|
|
void Argument::setParent(Function *parent) {
|
|
if (getParent())
|
|
LeakDetector::addGarbageObject(this);
|
|
Parent = parent;
|
|
if (getParent())
|
|
LeakDetector::removeGarbageObject(this);
|
|
}
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
// ParamAttrsList Implementation
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
uint16_t
|
|
ParamAttrsList::getParamAttrs(uint16_t Index) const {
|
|
unsigned limit = attrs.size();
|
|
for (unsigned i = 0; i < limit; ++i)
|
|
if (attrs[i].index == Index)
|
|
return attrs[i].attrs;
|
|
return ParamAttr::None;
|
|
}
|
|
|
|
|
|
std::string
|
|
ParamAttrsList::getParamAttrsText(uint16_t Attrs) {
|
|
std::string Result;
|
|
if (Attrs & ParamAttr::ZExt)
|
|
Result += "zeroext ";
|
|
if (Attrs & ParamAttr::SExt)
|
|
Result += "signext ";
|
|
if (Attrs & ParamAttr::NoReturn)
|
|
Result += "noreturn ";
|
|
if (Attrs & ParamAttr::NoUnwind)
|
|
Result += "nounwind ";
|
|
if (Attrs & ParamAttr::InReg)
|
|
Result += "inreg ";
|
|
if (Attrs & ParamAttr::NoAlias)
|
|
Result += "noalias ";
|
|
if (Attrs & ParamAttr::StructRet)
|
|
Result += "sret ";
|
|
if (Attrs & ParamAttr::ByVal)
|
|
Result += "byval ";
|
|
if (Attrs & ParamAttr::Nest)
|
|
Result += "nest ";
|
|
return Result;
|
|
}
|
|
|
|
void
|
|
ParamAttrsList::Profile(FoldingSetNodeID &ID) const {
|
|
for (unsigned i = 0; i < attrs.size(); ++i) {
|
|
unsigned val = attrs[i].attrs << 16 | attrs[i].index;
|
|
ID.AddInteger(val);
|
|
}
|
|
}
|
|
|
|
static ManagedStatic<FoldingSet<ParamAttrsList> > ParamAttrsLists;
|
|
|
|
ParamAttrsList *
|
|
ParamAttrsList::get(const ParamAttrsVector &attrVec) {
|
|
assert(!attrVec.empty() && "Illegal to create empty ParamAttrsList");
|
|
#ifndef NDEBUG
|
|
for (unsigned i = 1, e = attrVec.size(); i < e; ++i)
|
|
assert(attrVec[i-1].index < attrVec[i].index && "Misordered ParamAttrsList!");
|
|
#endif
|
|
ParamAttrsList key(attrVec);
|
|
FoldingSetNodeID ID;
|
|
key.Profile(ID);
|
|
void *InsertPos;
|
|
ParamAttrsList* PAL = ParamAttrsLists->FindNodeOrInsertPos(ID, InsertPos);
|
|
if (!PAL) {
|
|
PAL = new ParamAttrsList(attrVec);
|
|
ParamAttrsLists->InsertNode(PAL, InsertPos);
|
|
}
|
|
return PAL;
|
|
}
|
|
|
|
ParamAttrsList::~ParamAttrsList() {
|
|
ParamAttrsLists->RemoveNode(this);
|
|
}
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
// Function Implementation
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
Function::Function(const FunctionType *Ty, LinkageTypes Linkage,
|
|
const std::string &name, Module *ParentModule)
|
|
: GlobalValue(PointerType::get(Ty), Value::FunctionVal, 0, 0, Linkage, name) {
|
|
ParamAttrs = 0;
|
|
SymTab = new ValueSymbolTable();
|
|
|
|
assert((getReturnType()->isFirstClassType() ||getReturnType() == Type::VoidTy)
|
|
&& "LLVM functions cannot return aggregate values!");
|
|
|
|
// If the function has arguments, mark them as lazily built.
|
|
if (Ty->getNumParams())
|
|
SubclassData = 1; // Set the "has lazy arguments" bit.
|
|
|
|
// Make sure that we get added to a function
|
|
LeakDetector::addGarbageObject(this);
|
|
|
|
if (ParentModule)
|
|
ParentModule->getFunctionList().push_back(this);
|
|
}
|
|
|
|
Function::~Function() {
|
|
dropAllReferences(); // After this it is safe to delete instructions.
|
|
|
|
// Delete all of the method arguments and unlink from symbol table...
|
|
ArgumentList.clear();
|
|
delete SymTab;
|
|
|
|
// Drop our reference to the parameter attributes, if any.
|
|
if (ParamAttrs)
|
|
ParamAttrs->dropRef();
|
|
}
|
|
|
|
void Function::BuildLazyArguments() const {
|
|
// Create the arguments vector, all arguments start out unnamed.
|
|
const FunctionType *FT = getFunctionType();
|
|
for (unsigned i = 0, e = FT->getNumParams(); i != e; ++i) {
|
|
assert(FT->getParamType(i) != Type::VoidTy &&
|
|
"Cannot have void typed arguments!");
|
|
ArgumentList.push_back(new Argument(FT->getParamType(i)));
|
|
}
|
|
|
|
// Clear the lazy arguments bit.
|
|
const_cast<Function*>(this)->SubclassData &= ~1;
|
|
}
|
|
|
|
size_t Function::arg_size() const {
|
|
return getFunctionType()->getNumParams();
|
|
}
|
|
bool Function::arg_empty() const {
|
|
return getFunctionType()->getNumParams() == 0;
|
|
}
|
|
|
|
void Function::setParent(Module *parent) {
|
|
if (getParent())
|
|
LeakDetector::addGarbageObject(this);
|
|
Parent = parent;
|
|
if (getParent())
|
|
LeakDetector::removeGarbageObject(this);
|
|
}
|
|
|
|
void Function::setParamAttrs(ParamAttrsList *attrs) {
|
|
if (ParamAttrs)
|
|
ParamAttrs->dropRef();
|
|
|
|
if (attrs)
|
|
attrs->addRef();
|
|
|
|
ParamAttrs = attrs;
|
|
}
|
|
|
|
const FunctionType *Function::getFunctionType() const {
|
|
return cast<FunctionType>(getType()->getElementType());
|
|
}
|
|
|
|
bool Function::isVarArg() const {
|
|
return getFunctionType()->isVarArg();
|
|
}
|
|
|
|
const Type *Function::getReturnType() const {
|
|
return getFunctionType()->getReturnType();
|
|
}
|
|
|
|
void Function::removeFromParent() {
|
|
getParent()->getFunctionList().remove(this);
|
|
}
|
|
|
|
void Function::eraseFromParent() {
|
|
getParent()->getFunctionList().erase(this);
|
|
}
|
|
|
|
// 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
|
|
// zero. Then everything is deleted for real. Note that no operations are
|
|
// 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...
|
|
}
|
|
|
|
/// getIntrinsicID - This method returns the ID number of the specified
|
|
/// function, or Intrinsic::not_intrinsic if the function is not an
|
|
/// 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(bool noAssert) const {
|
|
const ValueName *ValName = this->getValueName();
|
|
if (!ValName)
|
|
return 0;
|
|
unsigned Len = ValName->getKeyLength();
|
|
const char *Name = ValName->getKeyData();
|
|
|
|
if (Len < 5 || Name[4] != '.' || Name[0] != 'l' || Name[1] != 'l'
|
|
|| Name[2] != 'v' || Name[3] != 'm')
|
|
return 0; // All intrinsics start with 'llvm.'
|
|
|
|
assert((Len != 5 || noAssert) && "'llvm.' is an invalid intrinsic name!");
|
|
|
|
#define GET_FUNCTION_RECOGNIZER
|
|
#include "llvm/Intrinsics.gen"
|
|
#undef GET_FUNCTION_RECOGNIZER
|
|
assert(noAssert && "Invalid LLVM intrinsic name");
|
|
return 0;
|
|
}
|
|
|
|
std::string Intrinsic::getName(ID id, const Type **Tys, unsigned numTys) {
|
|
assert(id < num_intrinsics && "Invalid intrinsic ID!");
|
|
const char * const Table[] = {
|
|
"not_intrinsic",
|
|
#define GET_INTRINSIC_NAME_TABLE
|
|
#include "llvm/Intrinsics.gen"
|
|
#undef GET_INTRINSIC_NAME_TABLE
|
|
};
|
|
if (numTys == 0)
|
|
return Table[id];
|
|
std::string Result(Table[id]);
|
|
for (unsigned i = 0; i < numTys; ++i)
|
|
if (Tys[i])
|
|
Result += "." + MVT::getValueTypeString(MVT::getValueType(Tys[i]));
|
|
return Result;
|
|
}
|
|
|
|
const FunctionType *Intrinsic::getType(ID id, const Type **Tys,
|
|
unsigned numTys) {
|
|
const Type *ResultTy = NULL;
|
|
std::vector<const Type*> ArgTys;
|
|
bool IsVarArg = false;
|
|
|
|
#define GET_INTRINSIC_GENERATOR
|
|
#include "llvm/Intrinsics.gen"
|
|
#undef GET_INTRINSIC_GENERATOR
|
|
|
|
return FunctionType::get(ResultTy, ArgTys, IsVarArg);
|
|
}
|
|
|
|
Function *Intrinsic::getDeclaration(Module *M, ID id, const Type **Tys,
|
|
unsigned numTys) {
|
|
// There can never be multiple globals with the same name of different types,
|
|
// because intrinsics must be a specific type.
|
|
return cast<Function>(M->getOrInsertFunction(getName(id, Tys, numTys),
|
|
getType(id, Tys, numTys)));
|
|
}
|
|
|
|
Value *IntrinsicInst::StripPointerCasts(Value *Ptr) {
|
|
if (ConstantExpr *CE = dyn_cast<ConstantExpr>(Ptr)) {
|
|
if (CE->getOpcode() == Instruction::BitCast) {
|
|
if (isa<PointerType>(CE->getOperand(0)->getType()))
|
|
return StripPointerCasts(CE->getOperand(0));
|
|
} else if (CE->getOpcode() == Instruction::GetElementPtr) {
|
|
for (unsigned i = 1, e = CE->getNumOperands(); i != e; ++i)
|
|
if (!CE->getOperand(i)->isNullValue())
|
|
return Ptr;
|
|
return StripPointerCasts(CE->getOperand(0));
|
|
}
|
|
return Ptr;
|
|
}
|
|
|
|
if (BitCastInst *CI = dyn_cast<BitCastInst>(Ptr)) {
|
|
if (isa<PointerType>(CI->getOperand(0)->getType()))
|
|
return StripPointerCasts(CI->getOperand(0));
|
|
} else if (GetElementPtrInst *GEP = dyn_cast<GetElementPtrInst>(Ptr)) {
|
|
if (GEP->hasAllZeroIndices())
|
|
return StripPointerCasts(GEP->getOperand(0));
|
|
}
|
|
return Ptr;
|
|
}
|
|
|
|
// vim: sw=2 ai
|