2014-03-04 11:45:46 +00:00
|
|
|
//===- CFG.h - Process LLVM structures as graphs ----------------*- C++ -*-===//
|
2005-04-21 20:48:15 +00:00
|
|
|
//
|
2003-10-20 20:19:47 +00:00
|
|
|
// The LLVM Compiler Infrastructure
|
|
|
|
//
|
2007-12-29 19:59:42 +00:00
|
|
|
// This file is distributed under the University of Illinois Open Source
|
|
|
|
// License. See LICENSE.TXT for details.
|
2005-04-21 20:48:15 +00:00
|
|
|
//
|
2003-10-20 20:19:47 +00:00
|
|
|
//===----------------------------------------------------------------------===//
|
2002-02-12 21:02:53 +00:00
|
|
|
//
|
2002-04-07 20:49:59 +00:00
|
|
|
// This file defines specializations of GraphTraits that allow Function and
|
2002-02-12 21:02:53 +00:00
|
|
|
// BasicBlock graphs to be treated as proper graphs for generic algorithms.
|
|
|
|
//
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
2014-03-04 11:45:46 +00:00
|
|
|
#ifndef LLVM_IR_CFG_H
|
|
|
|
#define LLVM_IR_CFG_H
|
2002-02-12 21:02:53 +00:00
|
|
|
|
2004-09-01 22:55:40 +00:00
|
|
|
#include "llvm/ADT/GraphTraits.h"
|
2015-02-04 19:14:57 +00:00
|
|
|
#include "llvm/ADT/iterator_range.h"
|
2013-01-02 11:36:10 +00:00
|
|
|
#include "llvm/IR/Function.h"
|
|
|
|
#include "llvm/IR/InstrTypes.h"
|
2002-02-12 22:35:32 +00:00
|
|
|
|
2003-11-11 22:41:34 +00:00
|
|
|
namespace llvm {
|
|
|
|
|
2009-08-27 23:44:33 +00:00
|
|
|
//===----------------------------------------------------------------------===//
|
2002-02-12 22:35:32 +00:00
|
|
|
// BasicBlock pred_iterator definition
|
2009-08-27 23:44:33 +00:00
|
|
|
//===----------------------------------------------------------------------===//
|
2002-02-12 22:35:32 +00:00
|
|
|
|
2010-04-14 15:59:02 +00:00
|
|
|
template <class Ptr, class USE_iterator> // Predecessor Iterator
|
2009-08-27 23:44:33 +00:00
|
|
|
class PredIterator : public std::iterator<std::forward_iterator_tag,
|
Seciton 24.2.2 of the C++ standard, [iterator.iterators], Table 106
requires that the return type of *r for all iterators r be reference,
where reference is defined in [iterator.requirements.general]/p11 as
iterator_traits<X>::reference, and X is the type of r.
But in CFG.h, the dereference operator of PredIterator and SuccIterator
return pointer, not reference.
Furthermore the nested type reference is value_type&, which is not the
type returned from operator*().
This patch simply makes the iterator::reference type value_type*, which
is what the operator*() returns, and then re-lables the return type as
reference.
From a functionality point of view, the only difference is that the
nested reference type is now value_type* instead of value_type&.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@178240 91177308-0d34-0410-b5e6-96231b3b80d8
2013-03-28 15:47:50 +00:00
|
|
|
Ptr, ptrdiff_t, Ptr*, Ptr*> {
|
|
|
|
typedef std::iterator<std::forward_iterator_tag, Ptr, ptrdiff_t, Ptr*,
|
|
|
|
Ptr*> super;
|
2010-04-14 15:41:50 +00:00
|
|
|
typedef PredIterator<Ptr, USE_iterator> Self;
|
|
|
|
USE_iterator It;
|
2005-04-21 20:48:15 +00:00
|
|
|
|
2008-04-25 16:53:59 +00:00
|
|
|
inline void advancePastNonTerminators() {
|
2013-12-05 05:44:44 +00:00
|
|
|
// Loop to ignore non-terminator uses (for example BlockAddresses).
|
2008-04-25 16:53:59 +00:00
|
|
|
while (!It.atEnd() && !isa<TerminatorInst>(*It))
|
2003-04-26 17:38:26 +00:00
|
|
|
++It;
|
|
|
|
}
|
2005-04-21 20:48:15 +00:00
|
|
|
|
2010-04-14 15:33:04 +00:00
|
|
|
public:
|
|
|
|
typedef typename super::pointer pointer;
|
Seciton 24.2.2 of the C++ standard, [iterator.iterators], Table 106
requires that the return type of *r for all iterators r be reference,
where reference is defined in [iterator.requirements.general]/p11 as
iterator_traits<X>::reference, and X is the type of r.
But in CFG.h, the dereference operator of PredIterator and SuccIterator
return pointer, not reference.
Furthermore the nested type reference is value_type&, which is not the
type returned from operator*().
This patch simply makes the iterator::reference type value_type*, which
is what the operator*() returns, and then re-lables the return type as
reference.
From a functionality point of view, the only difference is that the
nested reference type is now value_type* instead of value_type&.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@178240 91177308-0d34-0410-b5e6-96231b3b80d8
2013-03-28 15:47:50 +00:00
|
|
|
typedef typename super::reference reference;
|
2010-04-14 15:33:04 +00:00
|
|
|
|
2011-03-02 00:11:28 +00:00
|
|
|
PredIterator() {}
|
2014-03-09 03:16:01 +00:00
|
|
|
explicit inline PredIterator(Ptr *bb) : It(bb->user_begin()) {
|
2008-04-25 16:53:59 +00:00
|
|
|
advancePastNonTerminators();
|
2002-02-12 22:35:32 +00:00
|
|
|
}
|
2014-03-09 03:16:01 +00:00
|
|
|
inline PredIterator(Ptr *bb, bool) : It(bb->user_end()) {}
|
2005-04-21 20:48:15 +00:00
|
|
|
|
2010-04-14 15:41:50 +00:00
|
|
|
inline bool operator==(const Self& x) const { return It == x.It; }
|
|
|
|
inline bool operator!=(const Self& x) const { return !operator==(x); }
|
2005-04-21 20:48:15 +00:00
|
|
|
|
Seciton 24.2.2 of the C++ standard, [iterator.iterators], Table 106
requires that the return type of *r for all iterators r be reference,
where reference is defined in [iterator.requirements.general]/p11 as
iterator_traits<X>::reference, and X is the type of r.
But in CFG.h, the dereference operator of PredIterator and SuccIterator
return pointer, not reference.
Furthermore the nested type reference is value_type&, which is not the
type returned from operator*().
This patch simply makes the iterator::reference type value_type*, which
is what the operator*() returns, and then re-lables the return type as
reference.
From a functionality point of view, the only difference is that the
nested reference type is now value_type* instead of value_type&.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@178240 91177308-0d34-0410-b5e6-96231b3b80d8
2013-03-28 15:47:50 +00:00
|
|
|
inline reference operator*() const {
|
2007-10-11 04:18:11 +00:00
|
|
|
assert(!It.atEnd() && "pred_iterator out of range!");
|
2008-04-25 16:53:59 +00:00
|
|
|
return cast<TerminatorInst>(*It)->getParent();
|
2002-02-12 22:35:32 +00:00
|
|
|
}
|
2010-07-08 16:52:57 +00:00
|
|
|
inline pointer *operator->() const { return &operator*(); }
|
2005-04-21 20:48:15 +00:00
|
|
|
|
2010-04-14 15:41:50 +00:00
|
|
|
inline Self& operator++() { // Preincrement
|
2007-10-11 04:18:11 +00:00
|
|
|
assert(!It.atEnd() && "pred_iterator out of range!");
|
2008-04-25 16:53:59 +00:00
|
|
|
++It; advancePastNonTerminators();
|
2005-04-21 20:48:15 +00:00
|
|
|
return *this;
|
2002-02-12 22:35:32 +00:00
|
|
|
}
|
2005-04-21 20:48:15 +00:00
|
|
|
|
2010-04-14 15:41:50 +00:00
|
|
|
inline Self operator++(int) { // Postincrement
|
|
|
|
Self tmp = *this; ++*this; return tmp;
|
2002-02-12 22:35:32 +00:00
|
|
|
}
|
2011-03-02 00:11:28 +00:00
|
|
|
|
|
|
|
/// getOperandNo - Return the operand number in the predecessor's
|
|
|
|
/// terminator of the successor.
|
|
|
|
unsigned getOperandNo() const {
|
|
|
|
return It.getOperandNo();
|
|
|
|
}
|
2012-02-17 18:59:53 +00:00
|
|
|
|
|
|
|
/// getUse - Return the operand Use in the predecessor's terminator
|
|
|
|
/// of the successor.
|
|
|
|
Use &getUse() const {
|
|
|
|
return It.getUse();
|
|
|
|
}
|
2002-02-12 22:35:32 +00:00
|
|
|
};
|
|
|
|
|
2014-03-09 03:16:01 +00:00
|
|
|
typedef PredIterator<BasicBlock, Value::user_iterator> pred_iterator;
|
2005-04-21 20:48:15 +00:00
|
|
|
typedef PredIterator<const BasicBlock,
|
2014-03-09 03:16:01 +00:00
|
|
|
Value::const_user_iterator> const_pred_iterator;
|
2015-02-04 19:14:57 +00:00
|
|
|
typedef llvm::iterator_range<pred_iterator> pred_range;
|
|
|
|
typedef llvm::iterator_range<const_pred_iterator> pred_const_range;
|
2002-02-12 22:35:32 +00:00
|
|
|
|
|
|
|
inline pred_iterator pred_begin(BasicBlock *BB) { return pred_iterator(BB); }
|
2010-03-25 23:25:28 +00:00
|
|
|
inline const_pred_iterator pred_begin(const BasicBlock *BB) {
|
|
|
|
return const_pred_iterator(BB);
|
2002-02-12 22:35:32 +00:00
|
|
|
}
|
|
|
|
inline pred_iterator pred_end(BasicBlock *BB) { return pred_iterator(BB, true);}
|
2010-03-25 23:25:28 +00:00
|
|
|
inline const_pred_iterator pred_end(const BasicBlock *BB) {
|
|
|
|
return const_pred_iterator(BB, true);
|
2002-02-12 22:35:32 +00:00
|
|
|
}
|
2015-01-13 03:46:47 +00:00
|
|
|
inline bool pred_empty(const BasicBlock *BB) {
|
|
|
|
return pred_begin(BB) == pred_end(BB);
|
|
|
|
}
|
2015-02-04 19:14:57 +00:00
|
|
|
inline pred_range predecessors(BasicBlock *BB) {
|
|
|
|
return pred_range(pred_begin(BB), pred_end(BB));
|
|
|
|
}
|
|
|
|
inline pred_const_range predecessors(const BasicBlock *BB) {
|
|
|
|
return pred_const_range(pred_begin(BB), pred_end(BB));
|
|
|
|
}
|
2002-02-12 22:35:32 +00:00
|
|
|
|
2009-08-27 23:44:33 +00:00
|
|
|
//===----------------------------------------------------------------------===//
|
2002-02-12 22:35:32 +00:00
|
|
|
// BasicBlock succ_iterator definition
|
2009-08-27 23:44:33 +00:00
|
|
|
//===----------------------------------------------------------------------===//
|
2002-02-12 22:35:32 +00:00
|
|
|
|
2004-05-21 18:37:13 +00:00
|
|
|
template <class Term_, class BB_> // Successor Iterator
|
2014-02-10 14:17:42 +00:00
|
|
|
class SuccIterator : public std::iterator<std::random_access_iterator_tag, BB_,
|
|
|
|
int, BB_ *, BB_ *> {
|
|
|
|
typedef std::iterator<std::random_access_iterator_tag, BB_, int, BB_ *, BB_ *>
|
|
|
|
super;
|
|
|
|
|
|
|
|
public:
|
|
|
|
typedef typename super::pointer pointer;
|
|
|
|
typedef typename super::reference reference;
|
|
|
|
|
|
|
|
private:
|
2004-05-21 18:37:13 +00:00
|
|
|
const Term_ Term;
|
2002-02-12 22:35:32 +00:00
|
|
|
unsigned idx;
|
2010-04-14 15:41:50 +00:00
|
|
|
typedef SuccIterator<Term_, BB_> Self;
|
2010-04-14 15:38:15 +00:00
|
|
|
|
|
|
|
inline bool index_is_valid(int idx) {
|
|
|
|
return idx >= 0 && (unsigned) idx < Term->getNumSuccessors();
|
|
|
|
}
|
|
|
|
|
2014-02-10 14:17:42 +00:00
|
|
|
/// \brief Proxy object to allow write access in operator[]
|
|
|
|
class SuccessorProxy {
|
|
|
|
Self it;
|
|
|
|
|
|
|
|
public:
|
|
|
|
explicit SuccessorProxy(const Self &it) : it(it) {}
|
|
|
|
|
2015-03-03 21:18:16 +00:00
|
|
|
SuccessorProxy &operator=(SuccessorProxy r) {
|
2014-02-10 14:17:42 +00:00
|
|
|
*this = reference(r);
|
|
|
|
return *this;
|
|
|
|
}
|
|
|
|
|
|
|
|
SuccessorProxy &operator=(reference r) {
|
|
|
|
it.Term->setSuccessor(it.idx, r);
|
|
|
|
return *this;
|
|
|
|
}
|
2005-04-21 20:48:15 +00:00
|
|
|
|
2014-02-10 14:17:42 +00:00
|
|
|
operator reference() const { return *it; }
|
|
|
|
};
|
|
|
|
|
|
|
|
public:
|
2010-04-14 15:50:02 +00:00
|
|
|
explicit inline SuccIterator(Term_ T) : Term(T), idx(0) {// begin iterator
|
2002-02-12 22:35:32 +00:00
|
|
|
}
|
2004-05-21 18:37:13 +00:00
|
|
|
inline SuccIterator(Term_ T, bool) // end iterator
|
2011-07-04 23:09:02 +00:00
|
|
|
: Term(T) {
|
|
|
|
if (Term)
|
|
|
|
idx = Term->getNumSuccessors();
|
|
|
|
else
|
|
|
|
// Term == NULL happens, if a basic block is not fully constructed and
|
|
|
|
// consequently getTerminator() returns NULL. In this case we construct a
|
|
|
|
// SuccIterator which describes a basic block that has zero successors.
|
|
|
|
// Defining SuccIterator for incomplete and malformed CFGs is especially
|
|
|
|
// useful for debugging.
|
|
|
|
idx = 0;
|
2002-02-12 22:35:32 +00:00
|
|
|
}
|
2002-10-07 16:53:22 +00:00
|
|
|
|
2010-04-14 15:41:50 +00:00
|
|
|
inline const Self &operator=(const Self &I) {
|
2002-10-07 16:53:22 +00:00
|
|
|
assert(Term == I.Term &&"Cannot assign iterators to two different blocks!");
|
|
|
|
idx = I.idx;
|
2002-10-07 17:13:22 +00:00
|
|
|
return *this;
|
2002-10-07 16:53:22 +00:00
|
|
|
}
|
2003-11-10 04:16:50 +00:00
|
|
|
|
|
|
|
/// getSuccessorIndex - This is used to interface between code that wants to
|
|
|
|
/// operate on terminator instructions directly.
|
2003-11-10 04:23:52 +00:00
|
|
|
unsigned getSuccessorIndex() const { return idx; }
|
2005-04-21 20:48:15 +00:00
|
|
|
|
2010-04-14 15:41:50 +00:00
|
|
|
inline bool operator==(const Self& x) const { return idx == x.idx; }
|
|
|
|
inline bool operator!=(const Self& x) const { return !operator==(x); }
|
2005-04-21 20:48:15 +00:00
|
|
|
|
Seciton 24.2.2 of the C++ standard, [iterator.iterators], Table 106
requires that the return type of *r for all iterators r be reference,
where reference is defined in [iterator.requirements.general]/p11 as
iterator_traits<X>::reference, and X is the type of r.
But in CFG.h, the dereference operator of PredIterator and SuccIterator
return pointer, not reference.
Furthermore the nested type reference is value_type&, which is not the
type returned from operator*().
This patch simply makes the iterator::reference type value_type*, which
is what the operator*() returns, and then re-lables the return type as
reference.
From a functionality point of view, the only difference is that the
nested reference type is now value_type* instead of value_type&.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@178240 91177308-0d34-0410-b5e6-96231b3b80d8
2013-03-28 15:47:50 +00:00
|
|
|
inline reference operator*() const { return Term->getSuccessor(idx); }
|
2002-02-12 22:35:32 +00:00
|
|
|
inline pointer operator->() const { return operator*(); }
|
2005-04-21 20:48:15 +00:00
|
|
|
|
2010-04-14 15:41:50 +00:00
|
|
|
inline Self& operator++() { ++idx; return *this; } // Preincrement
|
2010-01-13 22:21:28 +00:00
|
|
|
|
2010-04-14 15:41:50 +00:00
|
|
|
inline Self operator++(int) { // Postincrement
|
|
|
|
Self tmp = *this; ++*this; return tmp;
|
2002-02-12 22:35:32 +00:00
|
|
|
}
|
2005-04-21 20:48:15 +00:00
|
|
|
|
2010-04-14 15:41:50 +00:00
|
|
|
inline Self& operator--() { --idx; return *this; } // Predecrement
|
|
|
|
inline Self operator--(int) { // Postdecrement
|
|
|
|
Self tmp = *this; --*this; return tmp;
|
2002-02-12 22:35:32 +00:00
|
|
|
}
|
2010-01-13 22:21:28 +00:00
|
|
|
|
2010-04-14 15:41:50 +00:00
|
|
|
inline bool operator<(const Self& x) const {
|
2010-01-13 22:21:28 +00:00
|
|
|
assert(Term == x.Term && "Cannot compare iterators of different blocks!");
|
|
|
|
return idx < x.idx;
|
|
|
|
}
|
|
|
|
|
2010-04-14 15:41:50 +00:00
|
|
|
inline bool operator<=(const Self& x) const {
|
2010-01-13 22:21:28 +00:00
|
|
|
assert(Term == x.Term && "Cannot compare iterators of different blocks!");
|
|
|
|
return idx <= x.idx;
|
|
|
|
}
|
2010-04-14 15:41:50 +00:00
|
|
|
inline bool operator>=(const Self& x) const {
|
2010-01-13 22:21:28 +00:00
|
|
|
assert(Term == x.Term && "Cannot compare iterators of different blocks!");
|
|
|
|
return idx >= x.idx;
|
|
|
|
}
|
|
|
|
|
2010-04-14 15:41:50 +00:00
|
|
|
inline bool operator>(const Self& x) const {
|
2010-01-13 22:21:28 +00:00
|
|
|
assert(Term == x.Term && "Cannot compare iterators of different blocks!");
|
2010-01-16 16:14:55 +00:00
|
|
|
return idx > x.idx;
|
2010-01-13 22:21:28 +00:00
|
|
|
}
|
|
|
|
|
2010-04-14 15:41:50 +00:00
|
|
|
inline Self& operator+=(int Right) {
|
2010-01-13 22:21:28 +00:00
|
|
|
unsigned new_idx = idx + Right;
|
|
|
|
assert(index_is_valid(new_idx) && "Iterator index out of bound");
|
|
|
|
idx = new_idx;
|
|
|
|
return *this;
|
|
|
|
}
|
|
|
|
|
2014-02-22 09:06:55 +00:00
|
|
|
inline Self operator+(int Right) const {
|
2010-04-14 15:41:50 +00:00
|
|
|
Self tmp = *this;
|
2010-01-13 22:21:28 +00:00
|
|
|
tmp += Right;
|
|
|
|
return tmp;
|
|
|
|
}
|
|
|
|
|
2010-04-14 15:41:50 +00:00
|
|
|
inline Self& operator-=(int Right) {
|
2010-01-13 22:21:28 +00:00
|
|
|
return operator+=(-Right);
|
|
|
|
}
|
|
|
|
|
2014-02-22 09:06:55 +00:00
|
|
|
inline Self operator-(int Right) const {
|
2010-01-13 22:21:28 +00:00
|
|
|
return operator+(-Right);
|
|
|
|
}
|
|
|
|
|
2014-02-22 09:06:55 +00:00
|
|
|
inline int operator-(const Self& x) const {
|
2010-01-13 22:21:28 +00:00
|
|
|
assert(Term == x.Term && "Cannot work on iterators of different blocks!");
|
|
|
|
int distance = idx - x.idx;
|
|
|
|
return distance;
|
|
|
|
}
|
|
|
|
|
2014-02-10 14:17:42 +00:00
|
|
|
inline SuccessorProxy operator[](int offset) {
|
|
|
|
Self tmp = *this;
|
|
|
|
tmp += offset;
|
|
|
|
return SuccessorProxy(tmp);
|
|
|
|
}
|
2010-01-13 22:21:43 +00:00
|
|
|
|
|
|
|
/// Get the source BB of this iterator.
|
|
|
|
inline BB_ *getSource() {
|
2011-07-04 23:09:02 +00:00
|
|
|
assert(Term && "Source not available, if basic block was malformed");
|
2010-04-14 15:59:02 +00:00
|
|
|
return Term->getParent();
|
2010-01-13 22:21:43 +00:00
|
|
|
}
|
2002-02-12 22:35:32 +00:00
|
|
|
};
|
|
|
|
|
|
|
|
typedef SuccIterator<TerminatorInst*, BasicBlock> succ_iterator;
|
|
|
|
typedef SuccIterator<const TerminatorInst*,
|
|
|
|
const BasicBlock> succ_const_iterator;
|
2015-02-04 19:14:57 +00:00
|
|
|
typedef llvm::iterator_range<succ_iterator> succ_range;
|
|
|
|
typedef llvm::iterator_range<succ_const_iterator> succ_const_range;
|
2002-02-12 22:35:32 +00:00
|
|
|
|
|
|
|
inline succ_iterator succ_begin(BasicBlock *BB) {
|
|
|
|
return succ_iterator(BB->getTerminator());
|
|
|
|
}
|
|
|
|
inline succ_const_iterator succ_begin(const BasicBlock *BB) {
|
|
|
|
return succ_const_iterator(BB->getTerminator());
|
|
|
|
}
|
|
|
|
inline succ_iterator succ_end(BasicBlock *BB) {
|
|
|
|
return succ_iterator(BB->getTerminator(), true);
|
|
|
|
}
|
|
|
|
inline succ_const_iterator succ_end(const BasicBlock *BB) {
|
|
|
|
return succ_const_iterator(BB->getTerminator(), true);
|
|
|
|
}
|
2015-01-13 03:46:47 +00:00
|
|
|
inline bool succ_empty(const BasicBlock *BB) {
|
|
|
|
return succ_begin(BB) == succ_end(BB);
|
|
|
|
}
|
2015-02-04 19:14:57 +00:00
|
|
|
inline succ_range successors(BasicBlock *BB) {
|
|
|
|
return succ_range(succ_begin(BB), succ_end(BB));
|
|
|
|
}
|
|
|
|
inline succ_const_range successors(const BasicBlock *BB) {
|
|
|
|
return succ_const_range(succ_begin(BB), succ_end(BB));
|
|
|
|
}
|
|
|
|
|
2002-02-12 22:35:32 +00:00
|
|
|
|
2013-05-20 13:12:58 +00:00
|
|
|
template <typename T, typename U> struct isPodLike<SuccIterator<T, U> > {
|
|
|
|
static const bool value = isPodLike<T>::value;
|
|
|
|
};
|
|
|
|
|
2002-02-12 22:35:32 +00:00
|
|
|
|
2002-02-12 21:02:53 +00:00
|
|
|
|
|
|
|
//===--------------------------------------------------------------------===//
|
|
|
|
// GraphTraits specializations for basic block graphs (CFGs)
|
|
|
|
//===--------------------------------------------------------------------===//
|
|
|
|
|
2005-04-21 20:48:15 +00:00
|
|
|
// Provide specializations of GraphTraits to be able to treat a function as a
|
2002-02-12 21:02:53 +00:00
|
|
|
// graph of basic blocks...
|
|
|
|
|
|
|
|
template <> struct GraphTraits<BasicBlock*> {
|
|
|
|
typedef BasicBlock NodeType;
|
2002-02-12 22:35:32 +00:00
|
|
|
typedef succ_iterator ChildIteratorType;
|
2002-02-12 21:02:53 +00:00
|
|
|
|
|
|
|
static NodeType *getEntryNode(BasicBlock *BB) { return BB; }
|
2005-04-21 20:48:15 +00:00
|
|
|
static inline ChildIteratorType child_begin(NodeType *N) {
|
2002-02-12 22:35:32 +00:00
|
|
|
return succ_begin(N);
|
2002-02-12 21:02:53 +00:00
|
|
|
}
|
2005-04-21 20:48:15 +00:00
|
|
|
static inline ChildIteratorType child_end(NodeType *N) {
|
2002-02-12 22:35:32 +00:00
|
|
|
return succ_end(N);
|
2002-02-12 21:02:53 +00:00
|
|
|
}
|
|
|
|
};
|
|
|
|
|
|
|
|
template <> struct GraphTraits<const BasicBlock*> {
|
|
|
|
typedef const BasicBlock NodeType;
|
2002-02-12 22:35:32 +00:00
|
|
|
typedef succ_const_iterator ChildIteratorType;
|
2002-02-12 21:02:53 +00:00
|
|
|
|
|
|
|
static NodeType *getEntryNode(const BasicBlock *BB) { return BB; }
|
|
|
|
|
2005-04-21 20:48:15 +00:00
|
|
|
static inline ChildIteratorType child_begin(NodeType *N) {
|
2002-02-12 22:35:32 +00:00
|
|
|
return succ_begin(N);
|
2002-02-12 21:02:53 +00:00
|
|
|
}
|
2005-04-21 20:48:15 +00:00
|
|
|
static inline ChildIteratorType child_end(NodeType *N) {
|
2002-02-12 22:35:32 +00:00
|
|
|
return succ_end(N);
|
2002-02-12 21:02:53 +00:00
|
|
|
}
|
|
|
|
};
|
|
|
|
|
2005-04-21 20:48:15 +00:00
|
|
|
// Provide specializations of GraphTraits to be able to treat a function as a
|
2002-02-12 21:02:53 +00:00
|
|
|
// graph of basic blocks... and to walk it in inverse order. Inverse order for
|
2002-04-07 20:49:59 +00:00
|
|
|
// a function is considered to be when traversing the predecessor edges of a BB
|
2002-02-12 21:02:53 +00:00
|
|
|
// instead of the successor edges.
|
|
|
|
//
|
|
|
|
template <> struct GraphTraits<Inverse<BasicBlock*> > {
|
|
|
|
typedef BasicBlock NodeType;
|
2002-02-12 22:35:32 +00:00
|
|
|
typedef pred_iterator ChildIteratorType;
|
2002-02-12 21:02:53 +00:00
|
|
|
static NodeType *getEntryNode(Inverse<BasicBlock *> G) { return G.Graph; }
|
2005-04-21 20:48:15 +00:00
|
|
|
static inline ChildIteratorType child_begin(NodeType *N) {
|
2002-02-12 22:35:32 +00:00
|
|
|
return pred_begin(N);
|
2002-02-12 21:02:53 +00:00
|
|
|
}
|
2005-04-21 20:48:15 +00:00
|
|
|
static inline ChildIteratorType child_end(NodeType *N) {
|
2002-02-12 22:35:32 +00:00
|
|
|
return pred_end(N);
|
2002-02-12 21:02:53 +00:00
|
|
|
}
|
|
|
|
};
|
|
|
|
|
|
|
|
template <> struct GraphTraits<Inverse<const BasicBlock*> > {
|
|
|
|
typedef const BasicBlock NodeType;
|
2010-03-25 23:25:28 +00:00
|
|
|
typedef const_pred_iterator ChildIteratorType;
|
2002-02-12 21:02:53 +00:00
|
|
|
static NodeType *getEntryNode(Inverse<const BasicBlock*> G) {
|
2005-04-21 20:48:15 +00:00
|
|
|
return G.Graph;
|
2002-02-12 21:02:53 +00:00
|
|
|
}
|
2005-04-21 20:48:15 +00:00
|
|
|
static inline ChildIteratorType child_begin(NodeType *N) {
|
2002-02-12 22:35:32 +00:00
|
|
|
return pred_begin(N);
|
2002-02-12 21:02:53 +00:00
|
|
|
}
|
2005-04-21 20:48:15 +00:00
|
|
|
static inline ChildIteratorType child_end(NodeType *N) {
|
2002-02-12 22:35:32 +00:00
|
|
|
return pred_end(N);
|
2002-02-12 21:02:53 +00:00
|
|
|
}
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
//===--------------------------------------------------------------------===//
|
2002-04-07 20:49:59 +00:00
|
|
|
// GraphTraits specializations for function basic block graphs (CFGs)
|
2002-02-12 21:02:53 +00:00
|
|
|
//===--------------------------------------------------------------------===//
|
|
|
|
|
2005-04-21 20:48:15 +00:00
|
|
|
// Provide specializations of GraphTraits to be able to treat a function as a
|
2002-02-12 21:02:53 +00:00
|
|
|
// graph of basic blocks... these are the same as the basic block iterators,
|
2002-04-07 20:49:59 +00:00
|
|
|
// except that the root node is implicitly the first node of the function.
|
2002-02-12 21:02:53 +00:00
|
|
|
//
|
2002-04-07 20:49:59 +00:00
|
|
|
template <> struct GraphTraits<Function*> : public GraphTraits<BasicBlock*> {
|
2003-09-20 14:39:18 +00:00
|
|
|
static NodeType *getEntryNode(Function *F) { return &F->getEntryBlock(); }
|
2002-10-10 22:31:31 +00:00
|
|
|
|
|
|
|
// nodes_iterator/begin/end - Allow iteration over all nodes in the graph
|
|
|
|
typedef Function::iterator nodes_iterator;
|
|
|
|
static nodes_iterator nodes_begin(Function *F) { return F->begin(); }
|
|
|
|
static nodes_iterator nodes_end (Function *F) { return F->end(); }
|
2013-07-20 00:20:10 +00:00
|
|
|
static size_t size (Function *F) { return F->size(); }
|
2002-02-12 21:02:53 +00:00
|
|
|
};
|
2002-04-07 20:49:59 +00:00
|
|
|
template <> struct GraphTraits<const Function*> :
|
2002-02-12 21:02:53 +00:00
|
|
|
public GraphTraits<const BasicBlock*> {
|
2003-09-20 14:39:18 +00:00
|
|
|
static NodeType *getEntryNode(const Function *F) {return &F->getEntryBlock();}
|
2002-10-10 22:31:31 +00:00
|
|
|
|
|
|
|
// nodes_iterator/begin/end - Allow iteration over all nodes in the graph
|
|
|
|
typedef Function::const_iterator nodes_iterator;
|
|
|
|
static nodes_iterator nodes_begin(const Function *F) { return F->begin(); }
|
|
|
|
static nodes_iterator nodes_end (const Function *F) { return F->end(); }
|
2013-07-20 00:20:10 +00:00
|
|
|
static size_t size (const Function *F) { return F->size(); }
|
2002-02-12 21:02:53 +00:00
|
|
|
};
|
|
|
|
|
|
|
|
|
2005-04-21 20:48:15 +00:00
|
|
|
// Provide specializations of GraphTraits to be able to treat a function as a
|
2002-02-12 21:02:53 +00:00
|
|
|
// graph of basic blocks... and to walk it in inverse order. Inverse order for
|
2002-04-07 20:49:59 +00:00
|
|
|
// a function is considered to be when traversing the predecessor edges of a BB
|
2002-02-12 21:02:53 +00:00
|
|
|
// instead of the successor edges.
|
|
|
|
//
|
2002-04-07 20:49:59 +00:00
|
|
|
template <> struct GraphTraits<Inverse<Function*> > :
|
2002-02-12 21:02:53 +00:00
|
|
|
public GraphTraits<Inverse<BasicBlock*> > {
|
2002-04-07 20:49:59 +00:00
|
|
|
static NodeType *getEntryNode(Inverse<Function*> G) {
|
2003-09-20 14:39:18 +00:00
|
|
|
return &G.Graph->getEntryBlock();
|
2002-04-07 20:49:59 +00:00
|
|
|
}
|
2002-02-12 21:02:53 +00:00
|
|
|
};
|
2002-04-07 20:49:59 +00:00
|
|
|
template <> struct GraphTraits<Inverse<const Function*> > :
|
2002-02-12 21:02:53 +00:00
|
|
|
public GraphTraits<Inverse<const BasicBlock*> > {
|
2002-04-07 20:49:59 +00:00
|
|
|
static NodeType *getEntryNode(Inverse<const Function *> G) {
|
2003-09-20 14:39:18 +00:00
|
|
|
return &G.Graph->getEntryBlock();
|
2002-02-12 21:02:53 +00:00
|
|
|
}
|
|
|
|
};
|
|
|
|
|
2003-11-11 22:41:34 +00:00
|
|
|
} // End llvm namespace
|
|
|
|
|
2002-02-12 21:02:53 +00:00
|
|
|
#endif
|