diff options
author | Chris Lattner <sabre@nondot.org> | 2005-04-02 20:17:09 +0000 |
---|---|---|
committer | Chris Lattner <sabre@nondot.org> | 2005-04-02 20:17:09 +0000 |
commit | 1231aa3fa66fa42feb45e81665a84e3289023a2a (patch) | |
tree | 05746b8b4238f47c09d4ba10583755cefa2233ce | |
parent | 0700123431bf7bbdbede6196ac1086940696a2e4 (diff) |
fix some VC compilation problems, thanks to Jeff C for pointing this out!
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@21044 91177308-0d34-0410-b5e6-96231b3b80d8
-rw-r--r-- | lib/Analysis/DataStructure/TopDownClosure.cpp | 7 |
1 files changed, 3 insertions, 4 deletions
diff --git a/lib/Analysis/DataStructure/TopDownClosure.cpp b/lib/Analysis/DataStructure/TopDownClosure.cpp index 6d01fda2d6..9ce6cde7a4 100644 --- a/lib/Analysis/DataStructure/TopDownClosure.cpp +++ b/lib/Analysis/DataStructure/TopDownClosure.cpp @@ -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); } |