Add hasGraph() methods to all of the passes for the printer

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

2 files changed, 26 insertions, 2 deletions

diff --git a/include/llvm/Analysis/DataStructure.h b/include/llvm/Analysis/DataStructure.h
index ea1c2ae192..75a715c5d4 100644
--- a/include/llvm/Analysis/DataStructure.h
+++ b/include/llvm/Analysis/DataStructure.h
@@ -39,6 +39,10 @@ public:
 
   virtual bool run(Module &M);
 
+  bool hasGraph(const Function &F) const {
+    return DSInfo.find(&F) != DSInfo.end();
+  }
+
   // getDSGraph - Return the data structure graph for the specified function.
   DSGraph &getDSGraph(const Function &F) const {
     std::map<const Function*, DSGraph*>::const_iterator I = DSInfo.find(&F);
@@ -74,6 +78,10 @@ public:
 
   virtual bool run(Module &M);
 
+  bool hasGraph(const Function &F) const {
+    return DSInfo.find(&F) != DSInfo.end();
+  }
+
   // getDSGraph - Return the data structure graph for the specified function.
   DSGraph &getDSGraph(const Function &F) const {
     std::map<const Function*, DSGraph*>::const_iterator I = DSInfo.find(&F);
@@ -94,7 +102,7 @@ public:
     AU.addRequired<LocalDataStructures>();
   }
 private:
-  DSGraph &calculateGraph(Function &F);
+  DSGraph &calculateGraph(Function &F, unsigned Indent);
 };
 
 
@@ -112,6 +120,10 @@ public:
 
   virtual bool run(Module &M);
 
+  bool hasGraph(const Function &F) const {
+    return DSInfo.find(&F) != DSInfo.end();
+  }
+
   // getDSGraph - Return the data structure graph for the specified function.
   DSGraph &getDSGraph(const Function &F) const {
     std::map<const Function*, DSGraph*>::const_iterator I = DSInfo.find(&F);
diff --git a/include/llvm/Analysis/DataStructure/DataStructure.h b/include/llvm/Analysis/DataStructure/DataStructure.h
index ea1c2ae192..75a715c5d4 100644
--- a/include/llvm/Analysis/DataStructure/DataStructure.h
+++ b/include/llvm/Analysis/DataStructure/DataStructure.h
@@ -39,6 +39,10 @@ public:
 
   virtual bool run(Module &M);
 
+  bool hasGraph(const Function &F) const {
+    return DSInfo.find(&F) != DSInfo.end();
+  }
+
   // getDSGraph - Return the data structure graph for the specified function.
   DSGraph &getDSGraph(const Function &F) const {
     std::map<const Function*, DSGraph*>::const_iterator I = DSInfo.find(&F);
@@ -74,6 +78,10 @@ public:
 
   virtual bool run(Module &M);
 
+  bool hasGraph(const Function &F) const {
+    return DSInfo.find(&F) != DSInfo.end();
+  }
+
   // getDSGraph - Return the data structure graph for the specified function.
   DSGraph &getDSGraph(const Function &F) const {
     std::map<const Function*, DSGraph*>::const_iterator I = DSInfo.find(&F);
@@ -94,7 +102,7 @@ public:
     AU.addRequired<LocalDataStructures>();
   }
 private:
-  DSGraph &calculateGraph(Function &F);
+  DSGraph &calculateGraph(Function &F, unsigned Indent);
 };
 
 
@@ -112,6 +120,10 @@ public:
 
   virtual bool run(Module &M);
 
+  bool hasGraph(const Function &F) const {
+    return DSInfo.find(&F) != DSInfo.end();
+  }
+
   // getDSGraph - Return the data structure graph for the specified function.
   DSGraph &getDSGraph(const Function &F) const {
     std::map<const Function*, DSGraph*>::const_iterator I = DSInfo.find(&F);