1 //===-- llvm/Support/CFG.h - Process LLVM structures as graphs ---*- C++ -*--=//
3 // This file defines specializations of GraphTraits that allow Function and
4 // BasicBlock graphs to be treated as proper graphs for generic algorithms.
6 //===----------------------------------------------------------------------===//
11 #include "Support/GraphTraits.h"
12 #include "llvm/Function.h"
13 #include "llvm/BasicBlock.h"
14 #include "llvm/InstrTypes.h"
15 #include "Support/iterator"
17 //===--------------------------------------------------------------------===//
18 // BasicBlock pred_iterator definition
19 //===--------------------------------------------------------------------===//
21 template <class _Ptr, class _USE_iterator> // Predecessor Iterator
22 class PredIterator : public bidirectional_iterator<_Ptr, ptrdiff_t> {
23 typedef bidirectional_iterator<_Ptr, ptrdiff_t> super;
27 typedef PredIterator<_Ptr,_USE_iterator> _Self;
28 typedef typename super::pointer pointer;
30 inline void advancePastConstants() {
32 // Loop to ignore constant pool references
33 while (It != BB->use_end() && !isa<TerminatorInst>(*It))
37 inline PredIterator(_Ptr *bb) : BB(bb), It(bb->use_begin()) {
38 advancePastConstants();
40 inline PredIterator(_Ptr *bb, bool) : BB(bb), It(bb->use_end()) {}
42 inline bool operator==(const _Self& x) const { return It == x.It; }
43 inline bool operator!=(const _Self& x) const { return !operator==(x); }
45 inline pointer operator*() const {
46 assert(It != BB->use_end() && "pred_iterator out of range!");
47 return cast<Instruction>(*It)->getParent();
49 inline pointer *operator->() const { return &(operator*()); }
51 inline _Self& operator++() { // Preincrement
52 assert(It != BB->use_end() && "pred_iterator out of range!");
53 ++It; advancePastConstants();
57 inline _Self operator++(int) { // Postincrement
58 _Self tmp = *this; ++*this; return tmp;
61 inline _Self& operator--() { --It; return *this; } // Predecrement
62 inline _Self operator--(int) { // Postdecrement
63 _Self tmp = *this; --*this; return tmp;
67 typedef PredIterator<BasicBlock, Value::use_iterator> pred_iterator;
68 typedef PredIterator<const BasicBlock,
69 Value::use_const_iterator> pred_const_iterator;
71 inline pred_iterator pred_begin(BasicBlock *BB) { return pred_iterator(BB); }
72 inline pred_const_iterator pred_begin(const BasicBlock *BB) {
73 return pred_const_iterator(BB);
75 inline pred_iterator pred_end(BasicBlock *BB) { return pred_iterator(BB, true);}
76 inline pred_const_iterator pred_end(const BasicBlock *BB) {
77 return pred_const_iterator(BB, true);
82 //===--------------------------------------------------------------------===//
83 // BasicBlock succ_iterator definition
84 //===--------------------------------------------------------------------===//
86 template <class _Term, class _BB> // Successor Iterator
87 class SuccIterator : public bidirectional_iterator<_BB, ptrdiff_t> {
90 typedef bidirectional_iterator<_BB, ptrdiff_t> super;
92 typedef SuccIterator<_Term, _BB> _Self;
93 typedef typename super::pointer pointer;
94 // TODO: This can be random access iterator, need operator+ and stuff tho
96 inline SuccIterator(_Term T) : Term(T), idx(0) { // begin iterator
97 assert(T && "getTerminator returned null!");
99 inline SuccIterator(_Term T, bool) // end iterator
100 : Term(T), idx(Term->getNumSuccessors()) {
101 assert(T && "getTerminator returned null!");
104 inline bool operator==(const _Self& x) const { return idx == x.idx; }
105 inline bool operator!=(const _Self& x) const { return !operator==(x); }
107 inline pointer operator*() const { return Term->getSuccessor(idx); }
108 inline pointer operator->() const { return operator*(); }
110 inline _Self& operator++() { ++idx; return *this; } // Preincrement
111 inline _Self operator++(int) { // Postincrement
112 _Self tmp = *this; ++*this; return tmp;
115 inline _Self& operator--() { --idx; return *this; } // Predecrement
116 inline _Self operator--(int) { // Postdecrement
117 _Self tmp = *this; --*this; return tmp;
121 typedef SuccIterator<TerminatorInst*, BasicBlock> succ_iterator;
122 typedef SuccIterator<const TerminatorInst*,
123 const BasicBlock> succ_const_iterator;
125 inline succ_iterator succ_begin(BasicBlock *BB) {
126 return succ_iterator(BB->getTerminator());
128 inline succ_const_iterator succ_begin(const BasicBlock *BB) {
129 return succ_const_iterator(BB->getTerminator());
131 inline succ_iterator succ_end(BasicBlock *BB) {
132 return succ_iterator(BB->getTerminator(), true);
134 inline succ_const_iterator succ_end(const BasicBlock *BB) {
135 return succ_const_iterator(BB->getTerminator(), true);
140 //===--------------------------------------------------------------------===//
141 // GraphTraits specializations for basic block graphs (CFGs)
142 //===--------------------------------------------------------------------===//
144 // Provide specializations of GraphTraits to be able to treat a function as a
145 // graph of basic blocks...
147 template <> struct GraphTraits<BasicBlock*> {
148 typedef BasicBlock NodeType;
149 typedef succ_iterator ChildIteratorType;
151 static NodeType *getEntryNode(BasicBlock *BB) { return BB; }
152 static inline ChildIteratorType child_begin(NodeType *N) {
153 return succ_begin(N);
155 static inline ChildIteratorType child_end(NodeType *N) {
160 template <> struct GraphTraits<const BasicBlock*> {
161 typedef const BasicBlock NodeType;
162 typedef succ_const_iterator ChildIteratorType;
164 static NodeType *getEntryNode(const BasicBlock *BB) { return BB; }
166 static inline ChildIteratorType child_begin(NodeType *N) {
167 return succ_begin(N);
169 static inline ChildIteratorType child_end(NodeType *N) {
174 // Provide specializations of GraphTraits to be able to treat a function as a
175 // graph of basic blocks... and to walk it in inverse order. Inverse order for
176 // a function is considered to be when traversing the predecessor edges of a BB
177 // instead of the successor edges.
179 template <> struct GraphTraits<Inverse<BasicBlock*> > {
180 typedef BasicBlock NodeType;
181 typedef pred_iterator ChildIteratorType;
182 static NodeType *getEntryNode(Inverse<BasicBlock *> G) { return G.Graph; }
183 static inline ChildIteratorType child_begin(NodeType *N) {
184 return pred_begin(N);
186 static inline ChildIteratorType child_end(NodeType *N) {
191 template <> struct GraphTraits<Inverse<const BasicBlock*> > {
192 typedef const BasicBlock NodeType;
193 typedef pred_const_iterator ChildIteratorType;
194 static NodeType *getEntryNode(Inverse<const BasicBlock*> G) {
197 static inline ChildIteratorType child_begin(NodeType *N) {
198 return pred_begin(N);
200 static inline ChildIteratorType child_end(NodeType *N) {
207 //===--------------------------------------------------------------------===//
208 // GraphTraits specializations for function basic block graphs (CFGs)
209 //===--------------------------------------------------------------------===//
211 // Provide specializations of GraphTraits to be able to treat a function as a
212 // graph of basic blocks... these are the same as the basic block iterators,
213 // except that the root node is implicitly the first node of the function.
215 template <> struct GraphTraits<Function*> : public GraphTraits<BasicBlock*> {
216 static NodeType *getEntryNode(Function *F) { return &F->getEntryNode(); }
218 template <> struct GraphTraits<const Function*> :
219 public GraphTraits<const BasicBlock*> {
220 static NodeType *getEntryNode(const Function *F) { return &F->getEntryNode();}
224 // Provide specializations of GraphTraits to be able to treat a function as a
225 // graph of basic blocks... and to walk it in inverse order. Inverse order for
226 // a function is considered to be when traversing the predecessor edges of a BB
227 // instead of the successor edges.
229 template <> struct GraphTraits<Inverse<Function*> > :
230 public GraphTraits<Inverse<BasicBlock*> > {
231 static NodeType *getEntryNode(Inverse<Function*> G) {
232 return &G.Graph->getEntryNode();
235 template <> struct GraphTraits<Inverse<const Function*> > :
236 public GraphTraits<Inverse<const BasicBlock*> > {
237 static NodeType *getEntryNode(Inverse<const Function *> G) {
238 return &G.Graph->getEntryNode();