From: Chris Lattner <sabre@nondot.org>
Date: Thu, 25 Jul 2002 19:59:41 +0000 (+0000)
Subject: *** empty log message ***
X-Git-Url: http://plrg.eecs.uci.edu/git/?a=commitdiff_plain;h=cdcfcf65d9c64141edbffc016e00db2a3aeb7fa0;p=oota-llvm.git

*** empty log message ***


git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@3097 91177308-0d34-0410-b5e6-96231b3b80d8
---

diff --git a/lib/Analysis/IPA/FindUsedTypes.cpp b/lib/Analysis/IPA/FindUsedTypes.cpp
index f03babc7e2a..f91b8ae226e 100644
--- a/lib/Analysis/IPA/FindUsedTypes.cpp
+++ b/lib/Analysis/IPA/FindUsedTypes.cpp
@@ -12,7 +12,6 @@
 #include "llvm/Support/InstIterator.h"
 
 AnalysisID FindUsedTypes::ID(AnalysisID::create<FindUsedTypes>());
-AnalysisID FindUsedTypes::IncludeSymbolTableID(AnalysisID::create<FindUsedTypes>());
 
 // IncorporateType - Incorporate one type and all of its subtypes into the
 // collection of used types.
@@ -31,29 +30,18 @@ void FindUsedTypes::IncorporateType(const Type *Ty) {
     IncorporateType(*I);
 }
 
-// IncorporateSymbolTable - Add all types referenced by the specified symtab
-// into the collection of used types.
-//
-void FindUsedTypes::IncorporateSymbolTable(const SymbolTable *ST) {
-  assert(0 && "Unimp");
-}
 
 // run - This incorporates all types used by the specified module
 //
 bool FindUsedTypes::run(Module &m) {
   UsedTypes.clear();  // reset if run multiple times...
 
-  if (IncludeSymbolTables && m.hasSymbolTable())
-    IncorporateSymbolTable(m.getSymbolTable()); // Add symtab first...
-
   // Loop over global variables, incorporating their types
   for (Module::const_giterator I = m.gbegin(), E = m.gend(); I != E; ++I)
     IncorporateType(I->getType());
 
   for (Module::iterator MI = m.begin(), ME = m.end(); MI != ME; ++MI) {
     const Function &F = *MI;
-    if (IncludeSymbolTables && F.hasSymbolTable())
-      IncorporateSymbolTable(F.getSymbolTable()); // Add symtab first...
   
     // Loop over all of the instructions in the function, adding their return
     // type as well as the types of their operands.