Add new method
authorChris Lattner <sabre@nondot.org>
Tue, 11 Nov 2003 05:08:36 +0000 (05:08 +0000)
committerChris Lattner <sabre@nondot.org>
Tue, 11 Nov 2003 05:08:36 +0000 (05:08 +0000)
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@9879 91177308-0d34-0410-b5e6-96231b3b80d8

include/llvm/Analysis/DSGraph.h
include/llvm/Analysis/DataStructure/DSGraph.h

index 4226cf1e460b46864e66d08a587d32b84d8e1f33..399da007e240a7d21112c46629b906e2708717c7 100644 (file)
@@ -254,6 +254,15 @@ public:
                               NodeMapTy& CompletedNodeMap,
                               unsigned CloneFlags = 0);
 
+
+  /// 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.
+  ///
+  static void computeNodeMapping(const DSNodeHandle &NH1,
+                                 const DSNodeHandle &NH2, NodeMapTy &NodeMap);
+
+
   /// cloneInto - Clone the specified DSGraph into the current graph.  The
   /// translated ScalarMap for the old function is filled into the OldValMap
   /// member, and the translated ReturnNodes map is returned into ReturnNodes.
index 4226cf1e460b46864e66d08a587d32b84d8e1f33..399da007e240a7d21112c46629b906e2708717c7 100644 (file)
@@ -254,6 +254,15 @@ public:
                               NodeMapTy& CompletedNodeMap,
                               unsigned CloneFlags = 0);
 
+
+  /// 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.
+  ///
+  static void computeNodeMapping(const DSNodeHandle &NH1,
+                                 const DSNodeHandle &NH2, NodeMapTy &NodeMap);
+
+
   /// cloneInto - Clone the specified DSGraph into the current graph.  The
   /// translated ScalarMap for the old function is filled into the OldValMap
   /// member, and the translated ReturnNodes map is returned into ReturnNodes.