[llvm-commits] CVS: llvm/include/llvm/Analysis/DataStructure/DataStructure.h EquivClassGraphs.h

[Chris Lattner]

Changes in directory llvm/include/llvm/Analysis/DataStructure:

DataStructure.h updated: 1.90 -> 1.91
EquivClassGraphs.h updated: 1.20 -> 1.21
---
Log message:

add and use a callee_iterator typedef


---
Diffs of the changes:  (+7 -5)

 DataStructure.h    |    5 +++--
 EquivClassGraphs.h |    7 ++++---
 2 files changed, 7 insertions(+), 5 deletions(-)


Index: llvm/include/llvm/Analysis/DataStructure/DataStructure.h
diff -u llvm/include/llvm/Analysis/DataStructure/DataStructure.h:1.90 llvm/include/llvm/Analysis/DataStructure/DataStructure.h:1.91
--- llvm/include/llvm/Analysis/DataStructure/DataStructure.h:1.90	Sat Apr  2 13:15:15 2005
+++ llvm/include/llvm/Analysis/DataStructure/DataStructure.h	Sat Apr  2 14:02:32 2005
@@ -157,11 +157,12 @@
     return ActualCallees;
   }
 
-  ActualCalleesTy::iterator callee_begin(Instruction *I) const {
+  typedef ActualCalleesTy::const_iterator callee_iterator;
+  callee_iterator callee_begin(Instruction *I) const {
     return ActualCallees.lower_bound(std::pair<Instruction*,Function*>(I, 0));
   }
 
-  ActualCalleesTy::iterator callee_end(Instruction *I) const {
+  callee_iterator callee_end(Instruction *I) const {
     I = (Instruction*)((char*)I + 1);
     return ActualCallees.lower_bound(std::pair<Instruction*,Function*>(I, 0));
   }


Index: llvm/include/llvm/Analysis/DataStructure/EquivClassGraphs.h
diff -u llvm/include/llvm/Analysis/DataStructure/EquivClassGraphs.h:1.20 llvm/include/llvm/Analysis/DataStructure/EquivClassGraphs.h:1.21
--- llvm/include/llvm/Analysis/DataStructure/EquivClassGraphs.h:1.20	Sat Apr  2 13:15:15 2005
+++ llvm/include/llvm/Analysis/DataStructure/EquivClassGraphs.h	Sat Apr  2 14:02:32 2005
@@ -100,12 +100,13 @@
     const ActualCalleesTy &getActualCallees() const {
       return ActualCallees;
     }
-    
-    ActualCalleesTy::iterator callee_begin(Instruction *I) const {
+
+    typedef ActualCalleesTy::const_iterator callee_iterator;
+    callee_iterator callee_begin(Instruction *I) const {
       return ActualCallees.lower_bound(std::pair<Instruction*,Function*>(I, 0));
     }
     
-    ActualCalleesTy::iterator callee_end(Instruction *I) const {
+    callee_iterator callee_end(Instruction *I) const {
       I = (Instruction*)((char*)I + 1);
       return ActualCallees.lower_bound(std::pair<Instruction*,Function*>(I, 0));
     }