From 920190f83a23ac2b7cd971617e2f3b5144cad0bf Mon Sep 17 00:00:00 2001
From: Chris Lattner <sabre@nondot.org>
Date: Thu, 17 Oct 2002 04:58:10 +0000
Subject: [PATCH] Remove obsolete code

llvm-svn: 4218
---
 .../DataStructure/BottomUpClosure.cpp         | 26 -------------------
 lib/Analysis/DataStructure/DataStructure.cpp  |  9 -------
 2 files changed, 35 deletions(-)

diff --git a/lib/Analysis/DataStructure/BottomUpClosure.cpp b/lib/Analysis/DataStructure/BottomUpClosure.cpp
index 1f48b652022..7601524dd2d 100644
--- a/lib/Analysis/DataStructure/BottomUpClosure.cpp
+++ b/lib/Analysis/DataStructure/BottomUpClosure.cpp
@@ -113,9 +113,6 @@ DSGraph &BUDataStructures::calculateGraph(Function &F) {
 #if 0
   // Populate the GlobalsGraph with globals from this one.
   Graph->GlobalsGraph->cloneGlobals(*Graph, /*cloneCalls*/ false);
-
-  // Save a copy of the original call nodes for the top-down pass
-  Graph->saveOrigFunctionCalls();
 #endif
 
   // Start resolving calls...
@@ -123,16 +120,6 @@ DSGraph &BUDataStructures::calculateGraph(Function &F) {
 
   DEBUG(std::cerr << "  [BU] Inlining: " << F.getName() << "\n");
 
-#if 0
-  // Add F to the PendingCallers list of each direct callee for use in the
-  // top-down pass so we don't have to compute this again.  We don't want
-  // to do it for indirect callees inlined later, so remember which calls
-  // are in the original FCs set.
-  std::set<const DSNode*> directCallees;
-  for (unsigned i = 0; i < FCs.size(); ++i)
-    directCallees.insert(FCs[i][1]); // ptr to function node
-#endif
-
   bool Inlined;
   do {
     Inlined = false;
@@ -209,12 +196,6 @@ DSGraph &BUDataStructures::calculateGraph(Function &F) {
             //
             MergeGlobalNodes(*Graph, OldValMap);
 
-#if 0
-            // If this was an original call, add F to the PendingCallers list
-            if (directCallees.find(Call[1]) != directCallees.end())
-              GI.addCaller(F);
-#endif
-
             // Erase the entry in the Callees vector
             Callees.erase(Callees.begin()+c--);
 
@@ -250,13 +231,6 @@ DSGraph &BUDataStructures::calculateGraph(Function &F) {
     }
   } while (Inlined && !FCs.empty());
 
-#if 0
-  // Copy any unresolved call nodes into the Globals graph and
-  // filter out unresolved call nodes inlined from the callee.
-  if (!FCs.empty())
-    Graph->GlobalsGraph->cloneCalls(*Graph);
-#endif
-
   Graph->maskIncompleteMarkers();
   Graph->markIncompleteNodes();
   Graph->removeTriviallyDeadNodes(false);
diff --git a/lib/Analysis/DataStructure/DataStructure.cpp b/lib/Analysis/DataStructure/DataStructure.cpp
index 0c4362b3756..2418b0c6572 100644
--- a/lib/Analysis/DataStructure/DataStructure.cpp
+++ b/lib/Analysis/DataStructure/DataStructure.cpp
@@ -447,15 +447,6 @@ DSNodeHandle DSGraph::cloneInto(const DSGraph &G,
   // Copy the function calls list...
   CopyFunctionCallsList(G.FunctionCalls, FunctionCalls, OldNodeMap);
 
-#if 0
-  if (CopyOrigCalls) 
-    CopyFunctionCallsList(G.OrigFunctionCalls, OrigFunctionCalls, OldNodeMap);
-
-  // Copy the list of unresolved callers
-  if (CopyCallers)
-    PendingCallers.insert(G.PendingCallers.begin(), G.PendingCallers.end());
-#endif
-
   // Return the returned node pointer...
   return DSNodeHandle(OldNodeMap[G.RetNode.getNode()], G.RetNode.getOffset());
 }