use a callee_iterator typedef.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@21038 91177308-0d34-0410-b5e6-96231b3b80d8
diff --git a/lib/Analysis/DataStructure/TopDownClosure.cpp b/lib/Analysis/DataStructure/TopDownClosure.cpp
index a169cef..6d01fda 100644
--- a/lib/Analysis/DataStructure/TopDownClosure.cpp
+++ b/lib/Analysis/DataStructure/TopDownClosure.cpp
@@ -174,9 +174,8 @@
// Recursively traverse all of the callee graphs.
for (DSGraph::fc_iterator CI = G.fc_begin(), E = G.fc_end(); CI != E; ++CI) {
Instruction *CallI = CI->getCallSite().getInstruction();
- BUDataStructures::ActualCalleesTy::const_iterator I =
+ BUDataStructures::callee_iterator I =
BUInfo->callee_begin(CallI), E = BUInfo->callee_end(CallI);
-
for (; I != E; ++I)
ComputePostOrder(*I->second, Visited, PostOrder);
}
@@ -326,7 +325,7 @@
Instruction *CallI = CI->getCallSite().getInstruction();
// For each function in the invoked function list at this call site...
- BUDataStructures::ActualCalleesTy::const_iterator IPI =
+ BUDataStructures::callee_iterator IPI =
BUInfo->callee_begin(CallI), IPE = BUInfo->callee_end(CallI);
// Skip over all calls to this graph (SCC calls).