From e84c23e0c12494a40c16cbe30b05a2e13c0d919d Mon Sep 17 00:00:00 2001 From: Chris Lattner Date: Sun, 31 Oct 2004 19:57:43 +0000 Subject: [PATCH] Improve comment git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@17375 91177308-0d34-0410-b5e6-96231b3b80d8 --- lib/Analysis/DataStructure/DataStructure.cpp | 6 ++++-- 1 file changed, 4 insertions(+), 2 deletions(-) diff --git a/lib/Analysis/DataStructure/DataStructure.cpp b/lib/Analysis/DataStructure/DataStructure.cpp index 60aa7666631..179f286378f 100644 --- a/lib/Analysis/DataStructure/DataStructure.cpp +++ b/lib/Analysis/DataStructure/DataStructure.cpp @@ -1988,8 +1988,10 @@ void DSGraph::AssertGraphOK() const { } /// computeNodeMapping - Given roots in two different DSGraphs, traverse the -/// nodes reachable from the two graphs, computing the mapping of nodes from -/// the first to the second graph. +/// nodes reachable from the two graphs, computing the mapping of nodes from the +/// 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, const DSNodeHandle &NH2, NodeMapTy &NodeMap,