6502/llvm-6502
1
0
Fork 0
mirror of https://github.com/c64scene-ar/llvm-6502.git synced 2025-06-30 20:24:32 +00:00
Code Issues Projects Releases Wiki Activity

New implementation of data structure analysis

Browse Source 
This diff is completely meaningless because this is a replacement
implementation.


git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@2872 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
Chris Lattner
2002-07-10 22:42:17 +00:00
parent c68c31b2d3
commit cd0b36fb07
5 changed files with 300 additions and 796 deletions
Download Patch File Download Diff File Expand all files Collapse all files

26
include/llvm/Analysis/DataStructureGraph.h
View File

@ -16,40 +16,34 @@ class DSNodeIterator : public std::forward_iterator<DSNode, ptrdiff_t> {
friend class DSNode;
DSNode * const Node;
unsigned Link;
unsigned LinkIdx;
typedef DSNodeIterator _Self;
DSNodeIterator(DSNode *N) : Node(N), Link(0), LinkIdx(0) { // begin iterator
unsigned NumLinks = Node->getNumOutgoingLinks();
while (Link < NumLinks && Node->getOutgoingLink(Link).empty())
DSNodeIterator(DSNode *N) : Node(N), Link(0) { // begin iterator
unsigned NumLinks = Node->getNumLinks();
while (Link < NumLinks && Node->getLink(Link) == 0)
++Link;
}
DSNodeIterator(DSNode *N, bool) // Create end iterator
: Node(N), Link(N->getNumOutgoingLinks()), LinkIdx(0) {
: Node(N), Link(N->getNumLinks()) {
}
public:
bool operator==(const _Self& x) const {
return Link == x.Link && LinkIdx == x.LinkIdx;
return Link == x.Link;
}
bool operator!=(const _Self& x) const { return !operator==(x); }
pointer operator*() const {
return Node->getOutgoingLink(Link)[LinkIdx].getNode();
return Node->getLink(Link);
}
pointer operator->() const { return operator*(); }
_Self& operator++() { // Preincrement
if (LinkIdx < Node->getOutgoingLink(Link).size()-1)
++LinkIdx;
else {
unsigned NumLinks = Node->getNumOutgoingLinks();
do {
++Link;
} while (Link < NumLinks && Node->getOutgoingLink(Link).empty());
LinkIdx = 0;
}
unsigned NumLinks = Node->getNumLinks();
do {
++Link;
} while (Link < NumLinks && Node->getLink(Link) != 0);
return *this;
}
_Self operator++(int) { // Postincrement