From 24b3a880dfeeb019f5dd7ebbed66454e2e77a511 Mon Sep 17 00:00:00 2001 From: Chris Lattner Date: Sat, 9 Nov 2002 19:21:56 +0000 Subject: [PATCH] Remove GlobalDSGraph delcaration git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@4652 91177308-0d34-0410-b5e6-96231b3b80d8 --- include/llvm/Analysis/DataStructure.h | 33 ++----------------- .../Analysis/DataStructure/DataStructure.h | 33 ++----------------- 2 files changed, 4 insertions(+), 62 deletions(-) diff --git a/include/llvm/Analysis/DataStructure.h b/include/llvm/Analysis/DataStructure.h index b38431b355e..a87efb5c6fe 100644 --- a/include/llvm/Analysis/DataStructure.h +++ b/include/llvm/Analysis/DataStructure.h @@ -14,9 +14,6 @@ class Type; class DSGraph; class DSNode; -class LocalDataStructures; // A collection of local graphs for a program -class BUDataStructures; // A collection of bu graphs for a program -class TDDataStructures; // A collection of td graphs for a program // FIXME: move this stuff to a private header namespace DataStructureAnalysis { @@ -60,6 +57,7 @@ public: } }; + // BUDataStructures - The analysis that computes the interprocedurally closed // data structure graphs for all of the functions in the program. This pass // only performs a "Bottom Up" propagation (hence the name). @@ -93,6 +91,7 @@ private: DSGraph &calculateGraph(Function &F); }; + // TDDataStructures - Analysis that computes new data structure graphs // for each function using the closed graphs for the callers computed // by the bottom-up pass. @@ -131,32 +130,4 @@ private: void ResolveCallSite(DSGraph &Graph, const DSCallSite &CallSite); }; -#if 0 -// GlobalDSGraph - A common graph for all the globals and their outgoing links -// to externally visible nodes. This includes GlobalValues, New nodes, -// Cast nodes, and Calls. This graph can only be used by one of the -// individual function graphs, and it goes away when they all go away. -// -class GlobalDSGraph : public DSGraph { - hash_set Referrers; - void addReference(const DSGraph* referrer); - void removeReference(const DSGraph* referrer); - friend class DSGraph; // give access to Referrers - - GlobalDSGraph(const GlobalDSGraph &GlobalDSG); // Do not implement - - // Helper function for cloneGlobals and cloneCalls - DSNode* cloneNodeInto(DSNode *OldNode, - std::map &NodeCache, - bool GlobalsAreFinal = false); - -public: - GlobalDSGraph(); // Create an empty DSGraph - virtual ~GlobalDSGraph(); - - void cloneGlobals(DSGraph& Graph, bool CloneCalls = false); - void cloneCalls (DSGraph& Graph); -}; -#endif - #endif diff --git a/include/llvm/Analysis/DataStructure/DataStructure.h b/include/llvm/Analysis/DataStructure/DataStructure.h index b38431b355e..a87efb5c6fe 100644 --- a/include/llvm/Analysis/DataStructure/DataStructure.h +++ b/include/llvm/Analysis/DataStructure/DataStructure.h @@ -14,9 +14,6 @@ class Type; class DSGraph; class DSNode; -class LocalDataStructures; // A collection of local graphs for a program -class BUDataStructures; // A collection of bu graphs for a program -class TDDataStructures; // A collection of td graphs for a program // FIXME: move this stuff to a private header namespace DataStructureAnalysis { @@ -60,6 +57,7 @@ public: } }; + // BUDataStructures - The analysis that computes the interprocedurally closed // data structure graphs for all of the functions in the program. This pass // only performs a "Bottom Up" propagation (hence the name). @@ -93,6 +91,7 @@ private: DSGraph &calculateGraph(Function &F); }; + // TDDataStructures - Analysis that computes new data structure graphs // for each function using the closed graphs for the callers computed // by the bottom-up pass. @@ -131,32 +130,4 @@ private: void ResolveCallSite(DSGraph &Graph, const DSCallSite &CallSite); }; -#if 0 -// GlobalDSGraph - A common graph for all the globals and their outgoing links -// to externally visible nodes. This includes GlobalValues, New nodes, -// Cast nodes, and Calls. This graph can only be used by one of the -// individual function graphs, and it goes away when they all go away. -// -class GlobalDSGraph : public DSGraph { - hash_set Referrers; - void addReference(const DSGraph* referrer); - void removeReference(const DSGraph* referrer); - friend class DSGraph; // give access to Referrers - - GlobalDSGraph(const GlobalDSGraph &GlobalDSG); // Do not implement - - // Helper function for cloneGlobals and cloneCalls - DSNode* cloneNodeInto(DSNode *OldNode, - std::map &NodeCache, - bool GlobalsAreFinal = false); - -public: - GlobalDSGraph(); // Create an empty DSGraph - virtual ~GlobalDSGraph(); - - void cloneGlobals(DSGraph& Graph, bool CloneCalls = false); - void cloneCalls (DSGraph& Graph); -}; -#endif - #endif