From ce2d1328fc542e662ab41c64642d2362776840e8 Mon Sep 17 00:00:00 2001
From: Chris Lattner <sabre@nondot.org>
Date: Fri, 8 Nov 2002 22:26:43 +0000
Subject: [PATCH] Reenable 'quick exit' case

git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@4638 91177308-0d34-0410-b5e6-96231b3b80d8
---
 lib/Analysis/DataStructure/TopDownClosure.cpp | 3 +--
 1 file changed, 1 insertion(+), 2 deletions(-)

diff --git a/lib/Analysis/DataStructure/TopDownClosure.cpp b/lib/Analysis/DataStructure/TopDownClosure.cpp
index 13ed8fd9514..36d8aca78ca 100644
--- a/lib/Analysis/DataStructure/TopDownClosure.cpp
+++ b/lib/Analysis/DataStructure/TopDownClosure.cpp
@@ -92,12 +92,11 @@ void TDDataStructures::calculateGraph(Function &F) {
   DSGraph &Graph = getOrCreateDSGraph(F);
 
   const std::vector<DSCallSite> &CallSites = Graph.getFunctionCalls();
-#if 0
   if (CallSites.empty()) {
     DEBUG(std::cerr << "  [TD] No callees for: " << F.getName() << "\n");
     return;  // If no call sites, the graph is the same as the BU graph!
   }
-#endif
+
   // Loop over all of the call sites, building a multi-map from Callees to
   // DSCallSite*'s.  With this map we can then loop over each callee, cloning
   // this graph once into it, then resolving arguments.