aboutsummaryrefslogtreecommitdiffstats
path: root/include
diff options
context:
space:
mode:
authorGabor Greif <ggreif@gmail.com>2010-03-25 23:25:28 +0000
committerGabor Greif <ggreif@gmail.com>2010-03-25 23:25:28 +0000
commit44424646ac9db5c4d3919462bd0831ec22783085 (patch)
tree5f1559f0211cd9481cfce08b0ab111d76ba5fb19 /include
parentda9283cd57843eb21fcd4117833e165017bb9123 (diff)
downloadexternal_llvm-44424646ac9db5c4d3919462bd0831ec22783085.zip
external_llvm-44424646ac9db5c4d3919462bd0831ec22783085.tar.gz
external_llvm-44424646ac9db5c4d3919462bd0831ec22783085.tar.bz2
rename pred_const_iterator to const_pred_iterator for consistency's sake
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@99567 91177308-0d34-0410-b5e6-96231b3b80d8
Diffstat (limited to 'include')
-rw-r--r--include/llvm/Support/CFG.h12
1 files changed, 6 insertions, 6 deletions
diff --git a/include/llvm/Support/CFG.h b/include/llvm/Support/CFG.h
index 621d50e..57699c7 100644
--- a/include/llvm/Support/CFG.h
+++ b/include/llvm/Support/CFG.h
@@ -67,15 +67,15 @@ public:
typedef PredIterator<BasicBlock, Value::use_iterator> pred_iterator;
typedef PredIterator<const BasicBlock,
- Value::const_use_iterator> pred_const_iterator;
+ Value::const_use_iterator> const_pred_iterator;
inline pred_iterator pred_begin(BasicBlock *BB) { return pred_iterator(BB); }
-inline pred_const_iterator pred_begin(const BasicBlock *BB) {
- return pred_const_iterator(BB);
+inline const_pred_iterator pred_begin(const BasicBlock *BB) {
+ return const_pred_iterator(BB);
}
inline pred_iterator pred_end(BasicBlock *BB) { return pred_iterator(BB, true);}
-inline pred_const_iterator pred_end(const BasicBlock *BB) {
- return pred_const_iterator(BB, true);
+inline const_pred_iterator pred_end(const BasicBlock *BB) {
+ return const_pred_iterator(BB, true);
}
@@ -268,7 +268,7 @@ template <> struct GraphTraits<Inverse<BasicBlock*> > {
template <> struct GraphTraits<Inverse<const BasicBlock*> > {
typedef const BasicBlock NodeType;
- typedef pred_const_iterator ChildIteratorType;
+ typedef const_pred_iterator ChildIteratorType;
static NodeType *getEntryNode(Inverse<const BasicBlock*> G) {
return G.Graph;
}