aboutsummaryrefslogtreecommitdiffstats
path: root/include
diff options
context:
space:
mode:
authorHongbin Zheng <etherzhhb@gmail.com>2012-08-02 14:20:02 +0000
committerHongbin Zheng <etherzhhb@gmail.com>2012-08-02 14:20:02 +0000
commitf63f8834250e5bd50b1cc5b2649acdf42988abad (patch)
treea33a7db19b227727ebd878d2837d136df2bc20c6 /include
parent847a32b78fefb3097b662bcd1156c202d4569d96 (diff)
downloadexternal_llvm-f63f8834250e5bd50b1cc5b2649acdf42988abad.zip
external_llvm-f63f8834250e5bd50b1cc5b2649acdf42988abad.tar.gz
external_llvm-f63f8834250e5bd50b1cc5b2649acdf42988abad.tar.bz2
Implement the block_iterator of Region based on df_iterator.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@161177 91177308-0d34-0410-b5e6-96231b3b80d8
Diffstat (limited to 'include')
-rw-r--r--include/llvm/Analysis/RegionInfo.h72
1 files changed, 40 insertions, 32 deletions
diff --git a/include/llvm/Analysis/RegionInfo.h b/include/llvm/Analysis/RegionInfo.h
index eae94e7..c76a8a7 100644
--- a/include/llvm/Analysis/RegionInfo.h
+++ b/include/llvm/Analysis/RegionInfo.h
@@ -500,50 +500,58 @@ public:
/// Region. The iterator also iterates over BasicBlocks that are elements of
/// a subregion of this Region. It is therefore called a flat iterator.
//@{
- template <typename RegionNodeItT>
+ template <bool IsConst>
class block_iterator_wrapper
- : public std::iterator<std::forward_iterator_tag, BasicBlock, ptrdiff_t> {
- typedef std::iterator<std::forward_iterator_tag, BasicBlock, ptrdiff_t>
+ : public df_iterator<typename conditional<IsConst,
+ const BasicBlock,
+ BasicBlock>::type*> {
+ typedef df_iterator<typename conditional<IsConst,
+ const BasicBlock,
+ BasicBlock>::type*>
super;
-
- RegionNodeItT Iter;
-
public:
- typedef block_iterator_wrapper<RegionNodeItT> Self;
+ typedef block_iterator_wrapper<IsConst> Self;
typedef typename super::pointer pointer;
- block_iterator_wrapper(RegionNodeItT Iter) : Iter(Iter) {}
-
- bool operator==(const Self &RHS) const { return Iter == RHS.Iter; }
- bool operator!=(const Self &RHS) const { return Iter != RHS.Iter; }
- pointer operator*() const {
- return (*Iter)->template getNodeAs<BasicBlock>();
+ // Construct the begin iterator.
+ block_iterator_wrapper(pointer Entry, pointer Exit) : super(df_begin(Entry))
+ {
+ // Mark the exit of the region as visited, so that the children of the
+ // exit and the exit itself, i.e. the block outside the region will never
+ // be visited.
+ super::Visited.insert(Exit);
}
- Self& operator++() {
- ++Iter;
- return *this;
- }
- Self operator++(int) {
- Self tmp = *this;
- ++*this;
- return tmp;
- }
+ // Construct the end iterator.
+ block_iterator_wrapper() : super(df_end<pointer>(0)) {}
+
+ /*implicit*/ block_iterator_wrapper(super I) : super(I) {}
- const Self &operator=(const Self &I) {
- Iter = I.Iter;
- return *this;
+ // FIXME: Even a const_iterator returns a non-const BasicBlock pointer.
+ // This was introduced for backwards compatibility, but should
+ // be removed as soon as all users are fixed.
+ BasicBlock *operator*() const {
+ return const_cast<BasicBlock*>(super::operator*());
}
};
- typedef block_iterator_wrapper<block_node_iterator> block_iterator;
- typedef block_iterator_wrapper<const_block_node_iterator>
- const_block_iterator;
- block_iterator block_begin();
- block_iterator block_end();
+ typedef block_iterator_wrapper<false> block_iterator;
+ typedef block_iterator_wrapper<true> const_block_iterator;
- const_block_iterator block_begin() const;
- const_block_iterator block_end() const;
+ block_iterator block_begin() {
+ return block_iterator(getEntry(), getExit());
+ }
+
+ block_iterator block_end() {
+ return block_iterator();
+ }
+
+ const_block_iterator block_begin() const {
+ return const_block_iterator(getEntry(), getExit());
+ }
+ const_block_iterator block_end() const {
+ return const_block_iterator();
+ }
//@}
/// @name Element Iterators