diff options
author | Chris Lattner <sabre@nondot.org> | 2005-03-15 16:55:04 +0000 |
---|---|---|
committer | Chris Lattner <sabre@nondot.org> | 2005-03-15 16:55:04 +0000 |
commit | a5f47ea23d274527bdbe461d69bc63c82416d685 (patch) | |
tree | 8e016795cc6bb8fbeeebae13f95dfbce435c2140 /lib/Analysis/DataStructure/TopDownClosure.cpp | |
parent | 60cc3e1c4ee03ae6ed6614a58a6001cbcd037963 (diff) |
Start using retnodes_* for iteration.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@20618 91177308-0d34-0410-b5e6-96231b3b80d8
Diffstat (limited to 'lib/Analysis/DataStructure/TopDownClosure.cpp')
-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 bbce45b568..580f22884f 100644 --- a/lib/Analysis/DataStructure/TopDownClosure.cpp +++ b/lib/Analysis/DataStructure/TopDownClosure.cpp @@ -179,9 +179,8 @@ void TDDataStructures::inlineGraphIntoCallees(DSGraph &Graph) { // If any of the functions has incomplete incoming arguments, don't mark any // of them as complete. bool HasIncompleteArgs = false; - const DSGraph::ReturnNodesTy &GraphReturnNodes = Graph.getReturnNodes(); - for (DSGraph::ReturnNodesTy::const_iterator I = GraphReturnNodes.begin(), - E = GraphReturnNodes.end(); I != E; ++I) + for (DSGraph::retnodes_iterator I = Graph.retnodes_begin(), + E = Graph.retnodes_end(); I != E; ++I) if (ArgsRemainIncomplete.count(I->first)) { HasIncompleteArgs = true; break; @@ -330,7 +329,7 @@ void TDDataStructures::copyValue(Value *From, Value *To) { assert(NG->getReturnNodes().size() == 1 && "Cannot copy SCC's yet!"); // Change the Function* is the returnnodes map to the ToF. - DSNodeHandle Ret = NG->getReturnNodes().begin()->second; + DSNodeHandle Ret = NG->retnodes_begin()->second; NG->getReturnNodes().clear(); NG->getReturnNodes()[ToF] = Ret; return; |