6502/llvm-6502
1
0
Fork 0
mirror of https://github.com/c64scene-ar/llvm-6502.git synced 2024-12-28 04:33:05 +00:00
Code Issues Projects Releases Wiki Activity

Add new methods

Browse Source 
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@7057 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
Chris Lattner 2003-07-02 04:37:00 +00:00
parent 73440f6a15
commit 8fd2715098
2 changed files with 24 additions and 0 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

12
include/llvm/Analysis/DSGraph.h
View File

@ -136,6 +136,12 @@ public:
return I->second;
}
const DSNodeHandle &getReturnNodeFor(Function &F) const {
ReturnNodesTy::const_iterator I = ReturnNodes.find(&F);
assert(I != ReturnNodes.end() && "F not in this DSGraph!");
return I->second;
}
/// getGraphSize - Return the number of nodes in this graph.
///
unsigned getGraphSize() const {
@ -218,6 +224,12 @@ public:
void mergeInGraph(const DSCallSite &CS, Function &F, const DSGraph &Graph,
unsigned CloneFlags);
/// getCallSiteForArguments - Get the arguments and return value bindings for
/// the specified function in the current graph.
///
DSCallSite getCallSiteForArguments(Function &F) const;
// Methods for checking to make sure graphs are well formed...
void AssertNodeInGraph(const DSNode *N) const {
assert((!N || find(Nodes.begin(), Nodes.end(), N) != Nodes.end()) &&

12
include/llvm/Analysis/DataStructure/DSGraph.h
View File

@ -136,6 +136,12 @@ public:
return I->second;
}
const DSNodeHandle &getReturnNodeFor(Function &F) const {
ReturnNodesTy::const_iterator I = ReturnNodes.find(&F);
assert(I != ReturnNodes.end() && "F not in this DSGraph!");
return I->second;
}
/// getGraphSize - Return the number of nodes in this graph.
///
unsigned getGraphSize() const {
@ -218,6 +224,12 @@ public:
void mergeInGraph(const DSCallSite &CS, Function &F, const DSGraph &Graph,
unsigned CloneFlags);
/// getCallSiteForArguments - Get the arguments and return value bindings for
/// the specified function in the current graph.
///
DSCallSite getCallSiteForArguments(Function &F) const;
// Methods for checking to make sure graphs are well formed...
void AssertNodeInGraph(const DSNode *N) const {
assert((!N || find(Nodes.begin(), Nodes.end(), N) != Nodes.end()) &&