blob: 3b6ff744c769e0dbb25bde43659e774b29370658 (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
|
//===- DataStructureGraph.h - Provide graph classes --------------*- C++ -*--=//
//
// This file provides GraphTraits specializations for the DataStructure graph
// nodes, allowing datastructure graphs to be processed by generic graph
// algorithms.
//
//===----------------------------------------------------------------------===//
#ifndef LLVM_ANALYSIS_DATASTRUCTURE_GRAPH_H
#define LLVM_ANALYSIS_DATASTRUCTURE_GRAPH_H
#include "Support/GraphTraits.h"
#include "llvm/Analysis/DataStructure.h"
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())
++Link;
}
DSNodeIterator(DSNode *N, bool) // Create end iterator
: Node(N), Link(N->getNumOutgoingLinks()), LinkIdx(0) {
}
public:
bool operator==(const _Self& x) const {
return Link == x.Link && LinkIdx == x.LinkIdx;
}
bool operator!=(const _Self& x) const { return !operator==(x); }
pointer operator*() const {
return Node->getOutgoingLink(Link)[LinkIdx].getNode();
}
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;
}
return *this;
}
_Self operator++(int) { // Postincrement
_Self tmp = *this; ++*this; return tmp;
}
};
template <> struct GraphTraits<DSNode*> {
typedef DSNode NodeType;
typedef DSNode::iterator ChildIteratorType;
static NodeType *getEntryNode(DSNode *N) { return N; }
static ChildIteratorType child_begin(NodeType *N) { return N->begin(); }
static ChildIteratorType child_end(NodeType *N) { return N->end(); }
};
// Provide iterators for DSNode...
inline DSNode::iterator DSNode::begin() { return DSNodeIterator(this); }
inline DSNode::iterator DSNode::end() { return DSNodeIterator(this, false); }
#endif
|
