fix some VC compilation problems, thanks to Jeff C for pointing this out!
authorChris Lattner <sabre@nondot.org>
Sat, 2 Apr 2005 20:17:09 +0000 (20:17 +0000)
committerChris Lattner <sabre@nondot.org>
Sat, 2 Apr 2005 20:17:09 +0000 (20:17 +0000)
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@21044 91177308-0d34-0410-b5e6-96231b3b80d8

lib/Analysis/DataStructure/TopDownClosure.cpp

index 6d01fda2d607d224db66013d2d87a184772a85a3..9ce6cde7a4d8df8f736294862df36261c91a60dc 100644 (file)
@@ -172,11 +172,10 @@ void TDDataStructures::ComputePostOrder(Function &F,hash_set<DSGraph*> &Visited,
   Visited.insert(&G);
   
   // Recursively traverse all of the callee graphs.
-  for (DSGraph::fc_iterator CI = G.fc_begin(), E = G.fc_end(); CI != E; ++CI) {
+  for (DSGraph::fc_iterator CI = G.fc_begin(), CE = G.fc_end(); CI != CE; ++CI){
     Instruction *CallI = CI->getCallSite().getInstruction();
-    BUDataStructures::callee_iterator I = 
-      BUInfo->callee_begin(CallI), E = BUInfo->callee_end(CallI);
-    for (; I != E; ++I)
+    for (BUDataStructures::callee_iterator I = BUInfo->callee_begin(CallI),
+           E = BUInfo->callee_end(CallI); I != E; ++I)
       ComputePostOrder(*I->second, Visited, PostOrder);
   }