INCLUDE_PARENT_GRAPH is required

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

diff --git a/include/llvm/Analysis/DSNode.h b/include/llvm/Analysis/DSNode.h
index f4d71d403075327dc73d1743ad82e2ec606aa37e..ff1d7d614ea8c979e886cfe00e0d1554d518c658 100644 (file)
--- a/include/llvm/Analysis/DSNode.h
+++ b/include/llvm/Analysis/DSNode.h
@@ -9,10 +9,6 @@
 
 #include "llvm/Analysis/DSSupport.h"
 
-#ifndef NDEBUG
-#define INCLUDE_PARENT_GRAPH 1
-#endif
-
 template<typename BaseType>
 class DSNodeIterator;          // Data structure graph traversal iterator
 
@@ -41,11 +37,9 @@ class DSNode {
   ///
   unsigned Size;
 
-#ifdef INCLUDE_PARENT_GRAPH
   /// ParentGraph - The graph this node is currently embedded into.
   ///
   DSGraph *ParentGraph;
-#endif
 
   /// Ty - Keep track of the current outer most type of this object, in addition
   /// to whether or not it has been indexed like an array or not.  If the
@@ -130,10 +124,8 @@ public:
   /// return the number of nodes forwarding over the node!
   unsigned getNumReferrers() const { return NumReferrers; }
 
-#ifdef INCLUDE_PARENT_GRAPH
   DSGraph *getParentGraph() const { return ParentGraph; }
   void setParentGraph(DSGraph *G) { ParentGraph = G; }
-#endif
 
   /// getForwardNode - This method returns the node that this node is forwarded
   /// to, if any.

diff --git a/include/llvm/Analysis/DataStructure/DSNode.h b/include/llvm/Analysis/DataStructure/DSNode.h
index f4d71d403075327dc73d1743ad82e2ec606aa37e..ff1d7d614ea8c979e886cfe00e0d1554d518c658 100644 (file)
--- a/include/llvm/Analysis/DataStructure/DSNode.h
+++ b/include/llvm/Analysis/DataStructure/DSNode.h
@@ -9,10 +9,6 @@
 
 #include "llvm/Analysis/DSSupport.h"
 
-#ifndef NDEBUG
-#define INCLUDE_PARENT_GRAPH 1
-#endif
-
 template<typename BaseType>
 class DSNodeIterator;          // Data structure graph traversal iterator
 
@@ -41,11 +37,9 @@ class DSNode {
   ///
   unsigned Size;
 
-#ifdef INCLUDE_PARENT_GRAPH
   /// ParentGraph - The graph this node is currently embedded into.
   ///
   DSGraph *ParentGraph;
-#endif
 
   /// Ty - Keep track of the current outer most type of this object, in addition
   /// to whether or not it has been indexed like an array or not.  If the
@@ -130,10 +124,8 @@ public:
   /// return the number of nodes forwarding over the node!
   unsigned getNumReferrers() const { return NumReferrers; }
 
-#ifdef INCLUDE_PARENT_GRAPH
   DSGraph *getParentGraph() const { return ParentGraph; }
   void setParentGraph(DSGraph *G) { ParentGraph = G; }
-#endif
 
   /// getForwardNode - This method returns the node that this node is forwarded
   /// to, if any.