RPCS3/llvm
1
0
Fork 0
mirror of https://github.com/RPCS3/llvm.git synced 2025-03-06 17:47:37 +00:00
Code Issues Actions Packages Projects Releases Wiki Activity

Improve comment

Browse Source 
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@17375 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
Chris Lattner 2004-10-31 19:57:43 +00:00
parent 8676b7eed0
commit e84c23e0c1
1 changed files with 4 additions and 2 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

6
lib/Analysis/DataStructure/DataStructure.cpp
View File

@ -1988,8 +1988,10 @@ void DSGraph::AssertGraphOK() const {
} }
/// computeNodeMapping - Given roots in two different DSGraphs, traverse the /// computeNodeMapping - Given roots in two different DSGraphs, traverse the
/// nodes reachable from the two graphs, computing the mapping of nodes from /// nodes reachable from the two graphs, computing the mapping of nodes from the
/// the first to the second graph. /// first to the second graph. This mapping may be many-to-one (i.e. the first
/// graph may have multiple nodes representing one node in the second graph),
/// but it will not work if there is a one-to-many or many-to-many mapping.
/// ///
void DSGraph::computeNodeMapping(const DSNodeHandle &NH1, void DSGraph::computeNodeMapping(const DSNodeHandle &NH1,
const DSNodeHandle &NH2, NodeMapTy &NodeMap, const DSNodeHandle &NH2, NodeMapTy &NodeMap,