1 //===- RegionIterator.h - Iterators to iteratate over Regions ---*- C++ -*-===//
3 // The LLVM Compiler Infrastructure
5 // This file is distributed under the University of Illinois Open Source
6 // License. See LICENSE.TXT for details.
8 //===----------------------------------------------------------------------===//
9 // This file defines the iterators to iterate over the elements of a Region.
10 //===----------------------------------------------------------------------===//
11 #ifndef LLVM_ANALYSIS_REGIONITERATOR_H
12 #define LLVM_ANALYSIS_REGIONITERATOR_H
14 #include "llvm/ADT/GraphTraits.h"
15 #include "llvm/ADT/PointerIntPair.h"
16 #include "llvm/ADT/SmallPtrSet.h"
17 #include "llvm/Analysis/RegionInfo.h"
18 #include "llvm/IR/CFG.h"
19 #include "llvm/Support/raw_ostream.h"
22 //===----------------------------------------------------------------------===//
23 /// @brief Hierarchical RegionNode successor iterator.
25 /// This iterator iterates over all successors of a RegionNode.
27 /// For a BasicBlock RegionNode it skips all BasicBlocks that are not part of
28 /// the parent Region. Furthermore for BasicBlocks that start a subregion, a
29 /// RegionNode representing the subregion is returned.
31 /// For a subregion RegionNode there is just one successor. The RegionNode
32 /// representing the exit of the subregion.
33 template<class NodeType, class BlockT, class RegionT>
34 class RNSuccIterator : public std::iterator<std::forward_iterator_tag,
35 NodeType, ptrdiff_t> {
36 typedef std::iterator<std::forward_iterator_tag, NodeType, ptrdiff_t> super;
38 typedef GraphTraits<BlockT*> BlockTraits;
39 typedef typename BlockTraits::ChildIteratorType SuccIterTy;
41 // The iterator works in two modes, bb mode or region mode.
43 // In BB mode it returns all successors of this BasicBlock as its
46 // In region mode there is only one successor, thats the regionnode mapping
47 // to the exit block of the regionnode
48 ItRgBegin, // At the beginning of the regionnode successor.
49 ItRgEnd // At the end of the regionnode successor.
52 // Use two bit to represent the mode iterator.
53 PointerIntPair<NodeType*, 2, ItMode> Node;
55 // The block successor iterator.
58 // advanceRegionSucc - A region node has only one successor. It reaches end
59 // once we advance it.
60 void advanceRegionSucc() {
61 assert(Node.getInt() == ItRgBegin && "Cannot advance region successor!");
65 NodeType* getNode() const{ return Node.getPointer(); }
67 // isRegionMode - Is the current iterator in region mode?
68 bool isRegionMode() const { return Node.getInt() != ItBB; }
70 // Get the immediate successor. This function may return a Basic Block
71 // RegionNode or a subregion RegionNode.
72 NodeType* getISucc(BlockT* BB) const {
74 succ = getNode()->getParent()->getNode(BB);
75 assert(succ && "BB not in Region or entered subregion!");
79 // getRegionSucc - Return the successor basic block of a SubRegion RegionNode.
80 inline BlockT* getRegionSucc() const {
81 assert(Node.getInt() == ItRgBegin && "Cannot get the region successor!");
82 return getNode()->template getNodeAs<RegionT>()->getExit();
85 // isExit - Is this the exit BB of the Region?
86 inline bool isExit(BlockT* BB) const {
87 return getNode()->getParent()->getExit() == BB;
90 typedef RNSuccIterator<NodeType, BlockT, RegionT> Self;
92 typedef typename super::pointer pointer;
94 /// @brief Create begin iterator of a RegionNode.
95 inline RNSuccIterator(NodeType* node)
96 : Node(node, node->isSubRegion() ? ItRgBegin : ItBB),
97 BItor(BlockTraits::child_begin(node->getEntry())) {
99 // Skip the exit block
101 while (BlockTraits::child_end(node->getEntry()) != BItor && isExit(*BItor))
104 if (isRegionMode() && isExit(getRegionSucc()))
108 /// @brief Create an end iterator.
109 inline RNSuccIterator(NodeType* node, bool)
110 : Node(node, node->isSubRegion() ? ItRgEnd : ItBB),
111 BItor(BlockTraits::child_end(node->getEntry())) {}
113 inline bool operator==(const Self& x) const {
114 assert(isRegionMode() == x.isRegionMode() && "Broken iterator!");
116 return Node.getInt() == x.Node.getInt();
118 return BItor == x.BItor;
121 inline bool operator!=(const Self& x) const { return !operator==(x); }
123 inline pointer operator*() const {
124 BlockT *BB = isRegionMode() ? getRegionSucc() : *BItor;
125 assert(!isExit(BB) && "Iterator out of range!");
129 inline Self& operator++() {
131 // The Region only has 1 successor.
137 while (BItor != BlockTraits::child_end(getNode()->getEntry())
143 inline Self operator++(int) {
149 RNSuccIterator(const RNSuccIterator&) = default;
151 inline const Self &operator=(const Self &I) {
153 assert(getNode()->getParent() == I.getNode()->getParent()
154 && "Cannot assign iterators of two different regions!");
163 //===----------------------------------------------------------------------===//
164 /// @brief Flat RegionNode iterator.
166 /// The Flat Region iterator will iterate over all BasicBlock RegionNodes that
167 /// are contained in the Region and its subregions. This is close to a virtual
168 /// control flow graph of the Region.
169 template<class NodeType, class BlockT, class RegionT>
170 class RNSuccIterator<FlatIt<NodeType>, BlockT, RegionT>
171 : public std::iterator<std::forward_iterator_tag, NodeType, ptrdiff_t> {
172 typedef std::iterator<std::forward_iterator_tag, NodeType, ptrdiff_t> super;
173 typedef GraphTraits<BlockT*> BlockTraits;
174 typedef typename BlockTraits::ChildIteratorType SuccIterTy;
180 typedef RNSuccIterator<FlatIt<NodeType>, BlockT, RegionT> Self;
181 typedef typename super::pointer pointer;
183 /// @brief Create the iterator from a RegionNode.
185 /// Note that the incoming node must be a bb node, otherwise it will trigger
186 /// an assertion when we try to get a BasicBlock.
187 inline RNSuccIterator(NodeType* node) :
189 Itor(BlockTraits::child_begin(node->getEntry())) {
190 assert(!Node->isSubRegion()
191 && "Subregion node not allowed in flat iterating mode!");
192 assert(Node->getParent() && "A BB node must have a parent!");
194 // Skip the exit block of the iterating region.
195 while (BlockTraits::child_end(Node->getEntry()) != Itor
196 && Node->getParent()->getExit() == *Itor)
200 /// @brief Create an end iterator
201 inline RNSuccIterator(NodeType* node, bool) :
203 Itor(BlockTraits::child_end(node->getEntry())) {
204 assert(!Node->isSubRegion()
205 && "Subregion node not allowed in flat iterating mode!");
208 inline bool operator==(const Self& x) const {
209 assert(Node->getParent() == x.Node->getParent()
210 && "Cannot compare iterators of different regions!");
212 return Itor == x.Itor && Node == x.Node;
215 inline bool operator!=(const Self& x) const { return !operator==(x); }
217 inline pointer operator*() const {
220 // Get the iterating region.
221 RegionT *Parent = Node->getParent();
223 // The only case that the successor reaches out of the region is it reaches
224 // the exit of the region.
225 assert(Parent->getExit() != BB && "iterator out of range!");
227 return Parent->getBBNode(BB);
230 inline Self& operator++() {
231 // Skip the exit block of the iterating region.
234 while (Itor != succ_end(Node->getEntry())
235 && Node->getParent()->getExit() == *Itor);
240 inline Self operator++(int) {
246 RNSuccIterator(const RNSuccIterator&) = default;
248 inline const Self &operator=(const Self &I) {
250 assert(Node->getParent() == I.Node->getParent()
251 && "Cannot assign iterators to two different regions!");
259 template<class NodeType, class BlockT, class RegionT>
260 inline RNSuccIterator<NodeType, BlockT, RegionT> succ_begin(NodeType* Node) {
261 return RNSuccIterator<NodeType, BlockT, RegionT>(Node);
264 template<class NodeType, class BlockT, class RegionT>
265 inline RNSuccIterator<NodeType, BlockT, RegionT> succ_end(NodeType* Node) {
266 return RNSuccIterator<NodeType, BlockT, RegionT>(Node, true);
269 //===--------------------------------------------------------------------===//
270 // RegionNode GraphTraits specialization so the bbs in the region can be
271 // iterate by generic graph iterators.
273 // NodeT can either be region node or const region node, otherwise child_begin
274 // and child_end fail.
276 #define RegionNodeGraphTraits(NodeT, BlockT, RegionT) \
277 template<> struct GraphTraits<NodeT*> { \
278 typedef NodeT NodeType; \
279 typedef RNSuccIterator<NodeType, BlockT, RegionT> ChildIteratorType; \
280 static NodeType *getEntryNode(NodeType* N) { return N; } \
281 static inline ChildIteratorType child_begin(NodeType *N) { \
282 return RNSuccIterator<NodeType, BlockT, RegionT>(N); \
284 static inline ChildIteratorType child_end(NodeType *N) { \
285 return RNSuccIterator<NodeType, BlockT, RegionT>(N, true); \
288 template<> struct GraphTraits<FlatIt<NodeT*>> { \
289 typedef NodeT NodeType; \
290 typedef RNSuccIterator<FlatIt<NodeT>, BlockT, RegionT > ChildIteratorType; \
291 static NodeType *getEntryNode(NodeType* N) { return N; } \
292 static inline ChildIteratorType child_begin(NodeType *N) { \
293 return RNSuccIterator<FlatIt<NodeType>, BlockT, RegionT>(N); \
295 static inline ChildIteratorType child_end(NodeType *N) { \
296 return RNSuccIterator<FlatIt<NodeType>, BlockT, RegionT>(N, true); \
300 #define RegionGraphTraits(RegionT, NodeT) \
301 template<> struct GraphTraits<RegionT*> \
302 : public GraphTraits<NodeT*> { \
303 typedef df_iterator<NodeType*> nodes_iterator; \
304 static NodeType *getEntryNode(RegionT* R) { \
305 return R->getNode(R->getEntry()); \
307 static nodes_iterator nodes_begin(RegionT* R) { \
308 return nodes_iterator::begin(getEntryNode(R)); \
310 static nodes_iterator nodes_end(RegionT* R) { \
311 return nodes_iterator::end(getEntryNode(R)); \
314 template<> struct GraphTraits<FlatIt<RegionT*> > \
315 : public GraphTraits<FlatIt<NodeT*> > { \
316 typedef df_iterator<NodeType*, SmallPtrSet<NodeType*, 8>, false, \
317 GraphTraits<FlatIt<NodeType*> > > nodes_iterator; \
318 static NodeType *getEntryNode(RegionT* R) { \
319 return R->getBBNode(R->getEntry()); \
321 static nodes_iterator nodes_begin(RegionT* R) { \
322 return nodes_iterator::begin(getEntryNode(R)); \
324 static nodes_iterator nodes_end(RegionT* R) { \
325 return nodes_iterator::end(getEntryNode(R)); \
329 RegionNodeGraphTraits(RegionNode, BasicBlock, Region);
330 RegionNodeGraphTraits(const RegionNode, BasicBlock, Region);
332 RegionGraphTraits(Region, RegionNode);
333 RegionGraphTraits(const Region, const RegionNode);
335 template <> struct GraphTraits<RegionInfo*>
336 : public GraphTraits<FlatIt<RegionNode*> > {
337 typedef df_iterator<NodeType*, SmallPtrSet<NodeType*, 8>, false,
338 GraphTraits<FlatIt<NodeType*> > > nodes_iterator;
340 static NodeType *getEntryNode(RegionInfo *RI) {
341 return GraphTraits<FlatIt<Region*> >::getEntryNode(RI->getTopLevelRegion());
343 static nodes_iterator nodes_begin(RegionInfo* RI) {
344 return nodes_iterator::begin(getEntryNode(RI));
346 static nodes_iterator nodes_end(RegionInfo *RI) {
347 return nodes_iterator::end(getEntryNode(RI));
351 template <> struct GraphTraits<RegionInfoPass*>
352 : public GraphTraits<RegionInfo *> {
353 typedef df_iterator<NodeType*, SmallPtrSet<NodeType*, 8>, false,
354 GraphTraits<FlatIt<NodeType*> > > nodes_iterator;
356 static NodeType *getEntryNode(RegionInfoPass *RI) {
357 return GraphTraits<RegionInfo*>::getEntryNode(&RI->getRegionInfo());
359 static nodes_iterator nodes_begin(RegionInfoPass* RI) {
360 return GraphTraits<RegionInfo*>::nodes_begin(&RI->getRegionInfo());
362 static nodes_iterator nodes_end(RegionInfoPass *RI) {
363 return GraphTraits<RegionInfo*>::nodes_end(&RI->getRegionInfo());
367 } // End namespace llvm